./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memcleanup.prp --file ../sv-benchmarks/c/uthash-2.0.2/uthash_FNV_test7-2.i --full-output --architecture 32bit
--------------------------------------------------------------------------------
Checking for memory safety (memcleanup)
Using default analysis
Version 4f9af400
extending candidate: java
['java']
extending candidate: /usr/bin/java
['java', '/usr/bin/java']
extending candidate: /opt/oracle-jdk-bin-*/bin/java
['java', '/usr/bin/java']
extending candidate: /opt/openjdk-*/bin/java
['java', '/usr/bin/java']
extending candidate: /usr/lib/jvm/java-*-openjdk-amd64/bin/java
['java', '/usr/bin/java', '/usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java', '/usr/lib/jvm/java-17-openjdk-amd64/bin/java', '/usr/lib/jvm/java-11-openjdk-amd64/bin/java', '/usr/lib/jvm/java-1.17.0-openjdk-amd64/bin/java']
['/root/.sdkman/candidates/java/21.0.5-tem/bin/java', '-Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config', '-Xmx15G', '-Xms4m', '-jar', '/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar', '-data', '@noDefault', '-ultimatedata', '/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data', '-tc', '/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml', '-i', '../sv-benchmarks/c/uthash-2.0.2/uthash_FNV_test7-2.i', '-s', '/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-MemCleanup-32bit-Automizer_Default.epf', '--cacsl2boogietranslator.entry.function', 'main', '--witnessprinter.witness.directory', '/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux', '--witnessprinter.witness.filename', 'witness', '--witnessprinter.write.witness.besides.input.file', 'false', '--witnessprinter.graph.data.specification', 'CHECK( init(main()), LTL(G valid-memcleanup) )\n\n', '--witnessprinter.graph.data.producer', 'Automizer', '--witnessprinter.graph.data.architecture', '32bit', '--witnessprinter.graph.data.programhash', 'ef232f94cb2adf03185aed5adfaef3f0eb9593ee06bfb5b3fbb6e4bc1dd6d041']
Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/uthash-2.0.2/uthash_FNV_test7-2.i -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-MemCleanup-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-memcleanup) )
--witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash ef232f94cb2adf03185aed5adfaef3f0eb9593ee06bfb5b3fbb6e4bc1dd6d041
--- Real Ultimate output ---
This is Ultimate 0.3.0-?-4f9af40
[2024-11-07 16:00:42,979 INFO L188 SettingsManager]: Resetting all preferences to default values...
[2024-11-07 16:00:43,043 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:00:43,047 WARN L101 SettingsManager]: Preference file contains the following unknown settings:
[2024-11-07 16:00:43,047 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class
[2024-11-07 16:00:43,059 INFO L130 SettingsManager]: Preferences different from defaults after loading the file:
[2024-11-07 16:00:43,060 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults:
[2024-11-07 16:00:43,060 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR;
[2024-11-07 16:00:43,060 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults:
[2024-11-07 16:00:43,060 INFO L153 SettingsManager]: * Use memory slicer=true
[2024-11-07 16:00:43,060 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults:
[2024-11-07 16:00:43,060 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS
[2024-11-07 16:00:43,060 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults:
[2024-11-07 16:00:43,060 INFO L153 SettingsManager]: * Create parallel compositions if possible=false
[2024-11-07 16:00:43,060 INFO L153 SettingsManager]: * Use SBE=true
[2024-11-07 16:00:43,061 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults:
[2024-11-07 16:00:43,061 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE
[2024-11-07 16:00:43,061 INFO L153 SettingsManager]: * sizeof long=4
[2024-11-07 16:00:43,061 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true
[2024-11-07 16:00:43,061 INFO L153 SettingsManager]: * sizeof POINTER=4
[2024-11-07 16:00:43,061 INFO L153 SettingsManager]: * Check division by zero=IGNORE
[2024-11-07 16:00:43,061 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE
[2024-11-07 16:00:43,061 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true
[2024-11-07 16:00:43,061 INFO L153 SettingsManager]: * Bitprecise bitfields=true
[2024-11-07 16:00:43,061 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE
[2024-11-07 16:00:43,061 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE
[2024-11-07 16:00:43,062 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true
[2024-11-07 16:00:43,062 INFO L153 SettingsManager]: * Allow undefined functions=false
[2024-11-07 16:00:43,062 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false
[2024-11-07 16:00:43,062 INFO L153 SettingsManager]: * sizeof long double=12
[2024-11-07 16:00:43,062 INFO L153 SettingsManager]: * Check if freed pointer was valid=false
[2024-11-07 16:00:43,062 INFO L153 SettingsManager]: * Use constant arrays=true
[2024-11-07 16:00:43,062 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults:
[2024-11-07 16:00:43,062 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements
[2024-11-07 16:00:43,062 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true
[2024-11-07 16:00:43,062 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode
[2024-11-07 16:00:43,062 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000
[2024-11-07 16:00:43,063 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults:
[2024-11-07 16:00:43,063 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP
[2024-11-07 16:00:43,063 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL
[2024-11-07 16:00:43,063 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in
[2024-11-07 16:00:43,063 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false
[2024-11-07 16:00:43,063 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET
[2024-11-07 16:00:43,063 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO
[2024-11-07 16:00:43,063 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode
[2024-11-07 16:00:43,063 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 -> ef232f94cb2adf03185aed5adfaef3f0eb9593ee06bfb5b3fbb6e4bc1dd6d041
[2024-11-07 16:00:43,245 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp
[2024-11-07 16:00:43,250 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized
[2024-11-07 16:00:43,251 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected.
[2024-11-07 16:00:43,252 INFO L270 PluginConnector]: Initializing CDTParser...
[2024-11-07 16:00:43,252 INFO L274 PluginConnector]: CDTParser initialized
[2024-11-07 16:00:43,252 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/uthash-2.0.2/uthash_FNV_test7-2.i
[2024-11-07 16:00:44,296 INFO L533 CDTParser]: Created temporary CDT project at NULL
[2024-11-07 16:00:44,600 INFO L384 CDTParser]: Found 1 translation units.
[2024-11-07 16:00:44,602 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_FNV_test7-2.i
[2024-11-07 16:00:44,617 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/9f8ca5241/1c69b906f9ce479c906232a7e854f599/FLAG94b742dd8
[2024-11-07 16:00:44,870 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/9f8ca5241/1c69b906f9ce479c906232a7e854f599
[2024-11-07 16:00:44,872 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] #######################
[2024-11-07 16:00:44,873 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements.
[2024-11-07 16:00:44,874 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator----------------------------
[2024-11-07 16:00:44,875 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator...
[2024-11-07 16:00:44,877 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized
[2024-11-07 16:00:44,878 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 04:00:44" (1/1) ...
[2024-11-07 16:00:44,878 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@47036ff5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:00:44, skipping insertion in model container
[2024-11-07 16:00:44,878 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 04:00:44" (1/1) ...
[2024-11-07 16:00:44,916 INFO L175 MainTranslator]: Built tables and reachable declarations
[2024-11-07 16:00:45,175 WARN L1070 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:00:45,195 WARN L1070 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:00:45,197 WARN L1070 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:00:45,199 WARN L1070 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:00:45,203 WARN L1070 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:00:45,224 WARN L1070 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:00:45,224 WARN L1070 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:00:45,226 WARN L1070 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:00:45,226 WARN L1070 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:00:45,228 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model
[2024-11-07 16:00:45,229 WARN L1070 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:00:45,229 WARN L1070 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:00:45,230 WARN L1070 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:00:45,233 WARN L1070 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:00:45,234 WARN L1070 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:00:45,235 WARN L1070 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:00:45,235 WARN L1070 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:00:45,236 WARN L1070 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:00:45,236 WARN L1070 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:00:45,239 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model
[2024-11-07 16:00:45,243 INFO L210 PostProcessor]: Analyzing one entry point: main
[2024-11-07 16:00:45,251 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:00:45,251 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver@768b1c66 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:00:45, skipping insertion in model container
[2024-11-07 16:00:45,251 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator----------------------------
[2024-11-07 16:00:45,252 INFO L186 ToolchainWalker]: Toolchain execution was canceled (user or tool) before executing de.uni_freiburg.informatik.ultimate.boogie.procedureinliner
[2024-11-07 16:00:45,253 INFO L158 Benchmark]: Toolchain (without parser) took 379.67ms. Allocated memory is still 142.6MB. Free memory was 114.9MB in the beginning and 95.2MB in the end (delta: 19.7MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB.
[2024-11-07 16:00:45,254 INFO L158 Benchmark]: CDTParser took 0.17ms. Allocated memory is still 117.4MB. Free memory is still 81.3MB. There was no memory consumed. Max. memory is 16.1GB.
[2024-11-07 16:00:45,254 INFO L158 Benchmark]: CACSL2BoogieTranslator took 377.06ms. Allocated memory is still 142.6MB. Free memory was 114.7MB in the beginning and 95.2MB in the end (delta: 19.6MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB.
[2024-11-07 16:00:45,255 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.17ms. Allocated memory is still 117.4MB. Free memory is still 81.3MB. There was no memory consumed. Max. memory is 16.1GB.
* CACSL2BoogieTranslator took 377.06ms. Allocated memory is still 142.6MB. Free memory was 114.7MB in the beginning and 95.2MB in the end (delta: 19.6MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB.
* Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator:
- UnsupportedSyntaxResult [Line: 727]: Unsupported Syntax
Found a cast between two array/pointer types of different sizes while using memory model HoenickeLindenmann_Original (while Not using bitvector translation)
RESULT: Ultimate could not prove your program: Toolchain returned no result.
Received shutdown request...
--- End real Ultimate output ---
Execution finished normally
Using bit-precise analysis
Retrying with bit-precise analysis
### Bit-precise run ###
Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/uthash-2.0.2/uthash_FNV_test7-2.i -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-MemCleanup-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-memcleanup) )
--witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash ef232f94cb2adf03185aed5adfaef3f0eb9593ee06bfb5b3fbb6e4bc1dd6d041
--- Real Ultimate output ---
This is Ultimate 0.3.0-?-4f9af40
[2024-11-07 16:00:47,174 INFO L188 SettingsManager]: Resetting all preferences to default values...
[2024-11-07 16:00:47,251 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:00:47,259 WARN L101 SettingsManager]: Preference file contains the following unknown settings:
[2024-11-07 16:00:47,259 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class
[2024-11-07 16:00:47,272 INFO L130 SettingsManager]: Preferences different from defaults after loading the file:
[2024-11-07 16:00:47,272 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults:
[2024-11-07 16:00:47,272 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR;
[2024-11-07 16:00:47,272 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults:
[2024-11-07 16:00:47,273 INFO L153 SettingsManager]: * Use memory slicer=true
[2024-11-07 16:00:47,273 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults:
[2024-11-07 16:00:47,273 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS
[2024-11-07 16:00:47,273 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults:
[2024-11-07 16:00:47,273 INFO L153 SettingsManager]: * Create parallel compositions if possible=false
[2024-11-07 16:00:47,273 INFO L153 SettingsManager]: * Use SBE=true
[2024-11-07 16:00:47,273 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults:
[2024-11-07 16:00:47,273 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE
[2024-11-07 16:00:47,273 INFO L153 SettingsManager]: * sizeof long=4
[2024-11-07 16:00:47,274 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true
[2024-11-07 16:00:47,274 INFO L153 SettingsManager]: * sizeof POINTER=4
[2024-11-07 16:00:47,274 INFO L153 SettingsManager]: * Check division by zero=IGNORE
[2024-11-07 16:00:47,274 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE
[2024-11-07 16:00:47,274 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true
[2024-11-07 16:00:47,274 INFO L153 SettingsManager]: * Bitprecise bitfields=true
[2024-11-07 16:00:47,274 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE
[2024-11-07 16:00:47,274 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE
[2024-11-07 16:00:47,274 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true
[2024-11-07 16:00:47,274 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true
[2024-11-07 16:00:47,274 INFO L153 SettingsManager]: * Allow undefined functions=false
[2024-11-07 16:00:47,274 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution
[2024-11-07 16:00:47,275 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false
[2024-11-07 16:00:47,275 INFO L153 SettingsManager]: * sizeof long double=12
[2024-11-07 16:00:47,275 INFO L153 SettingsManager]: * Check if freed pointer was valid=false
[2024-11-07 16:00:47,275 INFO L153 SettingsManager]: * Use constant arrays=true
[2024-11-07 16:00:47,275 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults:
[2024-11-07 16:00:47,275 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements
[2024-11-07 16:00:47,275 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true
[2024-11-07 16:00:47,275 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode
[2024-11-07 16:00:47,275 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000
[2024-11-07 16:00:47,275 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults:
[2024-11-07 16:00:47,276 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP
[2024-11-07 16:00:47,276 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF
[2024-11-07 16:00:47,276 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt
[2024-11-07 16:00:47,276 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false
[2024-11-07 16:00:47,276 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET
[2024-11-07 16:00:47,276 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO
[2024-11-07 16:00:47,276 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode
[2024-11-07 16:00:47,276 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 -> ef232f94cb2adf03185aed5adfaef3f0eb9593ee06bfb5b3fbb6e4bc1dd6d041
[2024-11-07 16:00:47,508 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp
[2024-11-07 16:00:47,513 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized
[2024-11-07 16:00:47,515 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected.
[2024-11-07 16:00:47,515 INFO L270 PluginConnector]: Initializing CDTParser...
[2024-11-07 16:00:47,515 INFO L274 PluginConnector]: CDTParser initialized
[2024-11-07 16:00:47,516 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/uthash-2.0.2/uthash_FNV_test7-2.i
[2024-11-07 16:00:48,691 INFO L533 CDTParser]: Created temporary CDT project at NULL
[2024-11-07 16:00:48,989 INFO L384 CDTParser]: Found 1 translation units.
[2024-11-07 16:00:48,990 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_FNV_test7-2.i
[2024-11-07 16:00:49,004 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/501b634f2/953ee303057640dd816587ef8d29c204/FLAG18047185d
[2024-11-07 16:00:49,018 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/501b634f2/953ee303057640dd816587ef8d29c204
[2024-11-07 16:00:49,020 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] #######################
[2024-11-07 16:00:49,021 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements.
[2024-11-07 16:00:49,023 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator----------------------------
[2024-11-07 16:00:49,023 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator...
[2024-11-07 16:00:49,026 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized
[2024-11-07 16:00:49,028 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 04:00:49" (1/1) ...
[2024-11-07 16:00:49,029 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@d6af6b4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:00:49, skipping insertion in model container
[2024-11-07 16:00:49,029 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 04:00:49" (1/1) ...
[2024-11-07 16:00:49,061 INFO L175 MainTranslator]: Built tables and reachable declarations
[2024-11-07 16:00:49,332 WARN L1070 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:00:49,356 WARN L1070 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:00:49,365 WARN L1070 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:00:49,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:00:49,382 WARN L1070 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:00:49,435 WARN L1070 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:00:49,436 WARN L1070 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:00:49,437 WARN L1070 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:00:49,437 WARN L1070 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:00:49,439 WARN L1070 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:00:49,443 WARN L1070 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:00:49,445 WARN L1070 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:00:49,446 WARN L1070 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:00:49,450 WARN L1070 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:00:49,453 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model
[2024-11-07 16:00:49,455 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model
[2024-11-07 16:00:49,455 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model
[2024-11-07 16:00:49,459 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model
[2024-11-07 16:00:49,460 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model
[2024-11-07 16:00:49,462 WARN L1070 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:00:49,467 INFO L210 PostProcessor]: Analyzing one entry point: main
[2024-11-07 16:00:49,483 INFO L197 MainTranslator]: Restarting translation with changed settings: SettingsChange [mNewPreferredMemoryModel=HoenickeLindenmann_1ByteResolution]
[2024-11-07 16:00:49,499 INFO L175 MainTranslator]: Built tables and reachable declarations
[2024-11-07 16:00:49,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:00:49,545 WARN L1070 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:00:49,546 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model
[2024-11-07 16:00:49,548 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model
[2024-11-07 16:00:49,550 WARN L1070 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:00:49,571 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model
[2024-11-07 16:00:49,573 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model
[2024-11-07 16:00:49,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:00:49,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:00:49,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:00:49,578 WARN L1070 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:00:49,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:00:49,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:00:49,581 WARN L1070 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:00:49,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:00:49,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:00:49,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:00:49,585 WARN L1070 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:00:49,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:00:49,598 WARN L1070 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:00:49,607 INFO L210 PostProcessor]: Analyzing one entry point: main
[2024-11-07 16:00:49,626 INFO L200 MainTranslator]: Completed pre-run
[2024-11-07 16:00:49,724 INFO L210 PostProcessor]: Analyzing one entry point: main
[2024-11-07 16:00:49,777 INFO L204 MainTranslator]: Completed translation
[2024-11-07 16:00:49,778 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:00:49 WrapperNode
[2024-11-07 16:00:49,785 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator----------------------------
[2024-11-07 16:00:49,786 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner----------------------------
[2024-11-07 16:00:49,786 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner...
[2024-11-07 16:00:49,786 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized
[2024-11-07 16:00:49,790 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:00:49" (1/1) ...
[2024-11-07 16:00:49,811 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:00:49" (1/1) ...
[2024-11-07 16:00:49,846 INFO L138 Inliner]: procedures = 179, calls = 323, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 1176
[2024-11-07 16:00:49,846 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner----------------------------
[2024-11-07 16:00:49,847 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor----------------------------
[2024-11-07 16:00:49,847 INFO L270 PluginConnector]: Initializing Boogie Preprocessor...
[2024-11-07 16:00:49,847 INFO L274 PluginConnector]: Boogie Preprocessor initialized
[2024-11-07 16:00:49,853 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:00:49" (1/1) ...
[2024-11-07 16:00:49,853 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:00:49" (1/1) ...
[2024-11-07 16:00:49,860 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:00:49" (1/1) ...
[2024-11-07 16:00:49,988 INFO L175 MemorySlicer]: Split 301 memory accesses to 3 slices as follows [2, 34, 265]. 88 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0, 0]. The 62 writes are split as follows [0, 4, 58].
[2024-11-07 16:00:49,988 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:00:49" (1/1) ...
[2024-11-07 16:00:49,988 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:00:49" (1/1) ...
[2024-11-07 16:00:50,066 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:00:49" (1/1) ...
[2024-11-07 16:00:50,079 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:00:49" (1/1) ...
[2024-11-07 16:00:50,091 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:00:49" (1/1) ...
[2024-11-07 16:00:50,097 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:00:49" (1/1) ...
[2024-11-07 16:00:50,121 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor----------------------------
[2024-11-07 16:00:50,126 INFO L112 PluginConnector]: ------------------------RCFGBuilder----------------------------
[2024-11-07 16:00:50,127 INFO L270 PluginConnector]: Initializing RCFGBuilder...
[2024-11-07 16:00:50,127 INFO L274 PluginConnector]: RCFGBuilder initialized
[2024-11-07 16:00:50,128 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:00:49" (1/1) ...
[2024-11-07 16:00:50,140 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000
[2024-11-07 16:00:50,166 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3
[2024-11-07 16:00:50,185 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:00:50,187 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:00:50,215 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error
[2024-11-07 16:00:50,216 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error
[2024-11-07 16:00:50,216 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#0
[2024-11-07 16:00:50,216 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#1
[2024-11-07 16:00:50,216 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#2
[2024-11-07 16:00:50,216 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#0
[2024-11-07 16:00:50,217 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#1
[2024-11-07 16:00:50,217 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#2
[2024-11-07 16:00:50,217 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#0
[2024-11-07 16:00:50,217 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#1
[2024-11-07 16:00:50,217 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#2
[2024-11-07 16:00:50,217 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#0
[2024-11-07 16:00:50,218 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#1
[2024-11-07 16:00:50,218 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#2
[2024-11-07 16:00:50,218 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap
[2024-11-07 16:00:50,218 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit
[2024-11-07 16:00:50,218 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0
[2024-11-07 16:00:50,218 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1
[2024-11-07 16:00:50,218 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2
[2024-11-07 16:00:50,218 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack
[2024-11-07 16:00:50,218 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0
[2024-11-07 16:00:50,218 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1
[2024-11-07 16:00:50,219 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2
[2024-11-07 16:00:50,219 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc
[2024-11-07 16:00:50,219 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#0
[2024-11-07 16:00:50,219 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#1
[2024-11-07 16:00:50,219 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#2
[2024-11-07 16:00:50,219 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0
[2024-11-07 16:00:50,219 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1
[2024-11-07 16:00:50,219 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#2
[2024-11-07 16:00:50,219 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start
[2024-11-07 16:00:50,220 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start
[2024-11-07 16:00:50,384 INFO L238 CfgBuilder]: Building ICFG
[2024-11-07 16:00:50,386 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation
[2024-11-07 16:00:59,089 INFO L? ?]: Removed 140 outVars from TransFormulas that were not future-live.
[2024-11-07 16:00:59,089 INFO L287 CfgBuilder]: Performing block encoding
[2024-11-07 16:00:59,103 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start)
[2024-11-07 16:00:59,103 INFO L316 CfgBuilder]: Removed 72 assume(true) statements.
[2024-11-07 16:00:59,105 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 04:00:59 BoogieIcfgContainer
[2024-11-07 16:00:59,105 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder----------------------------
[2024-11-07 16:00:59,107 INFO L112 PluginConnector]: ------------------------TraceAbstraction----------------------------
[2024-11-07 16:00:59,108 INFO L270 PluginConnector]: Initializing TraceAbstraction...
[2024-11-07 16:00:59,112 INFO L274 PluginConnector]: TraceAbstraction initialized
[2024-11-07 16:00:59,113 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.11 04:00:49" (1/3) ...
[2024-11-07 16:00:59,113 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@37149d8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 04:00:59, skipping insertion in model container
[2024-11-07 16:00:59,113 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:00:49" (2/3) ...
[2024-11-07 16:00:59,113 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@37149d8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 04:00:59, skipping insertion in model container
[2024-11-07 16:00:59,114 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 04:00:59" (3/3) ...
[2024-11-07 16:00:59,115 INFO L112 eAbstractionObserver]: Analyzing ICFG uthash_FNV_test7-2.i
[2024-11-07 16:00:59,126 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION
[2024-11-07 16:00:59,126 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations.
[2024-11-07 16:00:59,164 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ========
[2024-11-07 16:00:59,176 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;@2b53311b, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms]
[2024-11-07 16:00:59,176 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations.
[2024-11-07 16:00:59,181 INFO L276 IsEmpty]: Start isEmpty. Operand has 228 states, 218 states have (on average 1.665137614678899) internal successors, (363), 221 states have internal predecessors, (363), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5)
[2024-11-07 16:00:59,186 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11
[2024-11-07 16:00:59,187 INFO L207 NwaCegarLoop]: Found error trace
[2024-11-07 16:00:59,187 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-11-07 16:00:59,187 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] ===
[2024-11-07 16:00:59,192 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-11-07 16:00:59,192 INFO L85 PathProgramCache]: Analyzing trace with hash -718902403, now seen corresponding path program 1 times
[2024-11-07 16:00:59,201 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF
[2024-11-07 16:00:59,202 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1975786211]
[2024-11-07 16:00:59,202 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-07 16:00:59,203 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:00:59,203 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat
[2024-11-07 16:00:59,209 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:00:59,218 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:00:59,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 16:00:59,374 INFO L255 TraceCheckSpWp]: Trace formula consists of 68 conjuncts, 1 conjuncts are in the unsatisfiable core
[2024-11-07 16:00:59,377 INFO L278 TraceCheckSpWp]: Computing forward predicates...
[2024-11-07 16:00:59,384 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:00:59,384 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect
[2024-11-07 16:00:59,385 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace
[2024-11-07 16:00:59,385 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1975786211]
[2024-11-07 16:00:59,385 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1975786211] provided 1 perfect and 0 imperfect interpolant sequences
[2024-11-07 16:00:59,385 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-11-07 16:00:59,385 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2024-11-07 16:00:59,391 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1032569824]
[2024-11-07 16:00:59,391 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-11-07 16:00:59,394 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states
[2024-11-07 16:00:59,394 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF
[2024-11-07 16:00:59,422 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants.
[2024-11-07 16:00:59,423 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2
[2024-11-07 16:00:59,425 INFO L87 Difference]: Start difference. First operand has 228 states, 218 states have (on average 1.665137614678899) internal successors, (363), 221 states have internal predecessors, (363), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) Second operand has 2 states, 2 states have (on average 4.5) internal successors, (9), 2 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-11-07 16:00:59,450 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2024-11-07 16:00:59,451 INFO L93 Difference]: Finished difference Result 225 states and 291 transitions.
[2024-11-07 16:00:59,452 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states.
[2024-11-07 16:00:59,453 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:00:59,454 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2024-11-07 16:00:59,463 INFO L225 Difference]: With dead ends: 225
[2024-11-07 16:00:59,466 INFO L226 Difference]: Without dead ends: 223
[2024-11-07 16:00:59,468 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:00:59,470 INFO L432 NwaCegarLoop]: 291 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 291 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time
[2024-11-07 16:00:59,471 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 291 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time]
[2024-11-07 16:00:59,480 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 223 states.
[2024-11-07 16:00:59,501 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 223 to 223.
[2024-11-07 16:00:59,505 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 223 states, 215 states have (on average 1.3069767441860465) internal successors, (281), 217 states have internal predecessors, (281), 5 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3)
[2024-11-07 16:00:59,508 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 223 states to 223 states and 289 transitions.
[2024-11-07 16:00:59,510 INFO L78 Accepts]: Start accepts. Automaton has 223 states and 289 transitions. Word has length 10
[2024-11-07 16:00:59,510 INFO L84 Accepts]: Finished accepts. word is rejected.
[2024-11-07 16:00:59,511 INFO L471 AbstractCegarLoop]: Abstraction has 223 states and 289 transitions.
[2024-11-07 16:00:59,512 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:00:59,512 INFO L276 IsEmpty]: Start isEmpty. Operand 223 states and 289 transitions.
[2024-11-07 16:00:59,513 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13
[2024-11-07 16:00:59,513 INFO L207 NwaCegarLoop]: Found error trace
[2024-11-07 16:00:59,513 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-11-07 16:00:59,517 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0
[2024-11-07 16:00:59,713 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:00:59,714 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] ===
[2024-11-07 16:00:59,715 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-11-07 16:00:59,715 INFO L85 PathProgramCache]: Analyzing trace with hash 1957560088, now seen corresponding path program 1 times
[2024-11-07 16:00:59,716 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF
[2024-11-07 16:00:59,716 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1444514731]
[2024-11-07 16:00:59,716 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-07 16:00:59,716 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:00:59,716 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat
[2024-11-07 16:00:59,718 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:00:59,719 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:00:59,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 16:00:59,844 INFO L255 TraceCheckSpWp]: Trace formula consists of 70 conjuncts, 5 conjuncts are in the unsatisfiable core
[2024-11-07 16:00:59,845 INFO L278 TraceCheckSpWp]: Computing forward predicates...
[2024-11-07 16:00:59,906 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:00:59,906 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect
[2024-11-07 16:00:59,906 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace
[2024-11-07 16:00:59,906 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1444514731]
[2024-11-07 16:00:59,906 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1444514731] provided 1 perfect and 0 imperfect interpolant sequences
[2024-11-07 16:00:59,906 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-11-07 16:00:59,906 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2024-11-07 16:00:59,906 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [268639852]
[2024-11-07 16:00:59,906 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-11-07 16:00:59,907 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2024-11-07 16:00:59,907 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF
[2024-11-07 16:00:59,907 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2024-11-07 16:00:59,907 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2024-11-07 16:00:59,907 INFO L87 Difference]: Start difference. First operand 223 states and 289 transitions. Second operand has 4 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-11-07 16:01:04,229 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:01:05,601 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2024-11-07 16:01:05,602 INFO L93 Difference]: Finished difference Result 370 states and 480 transitions.
[2024-11-07 16:01:05,607 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states.
[2024-11-07 16:01:05,608 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:01:05,608 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2024-11-07 16:01:05,613 INFO L225 Difference]: With dead ends: 370
[2024-11-07 16:01:05,613 INFO L226 Difference]: Without dead ends: 370
[2024-11-07 16:01:05,614 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:01:05,614 INFO L432 NwaCegarLoop]: 295 mSDtfsCounter, 182 mSDsluCounter, 514 mSDsCounter, 0 mSdLazyCounter, 112 mSolverCounterSat, 10 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 182 SdHoareTripleChecker+Valid, 809 SdHoareTripleChecker+Invalid, 123 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 112 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.7s IncrementalHoareTripleChecker+Time
[2024-11-07 16:01:05,614 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [182 Valid, 809 Invalid, 123 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 112 Invalid, 1 Unknown, 0 Unchecked, 5.7s Time]
[2024-11-07 16:01:05,618 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 370 states.
[2024-11-07 16:01:05,637 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 370 to 337.
[2024-11-07 16:01:05,642 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 337 states, 329 states have (on average 1.3069908814589666) internal successors, (430), 331 states have internal predecessors, (430), 5 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3)
[2024-11-07 16:01:05,644 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 337 states to 337 states and 438 transitions.
[2024-11-07 16:01:05,644 INFO L78 Accepts]: Start accepts. Automaton has 337 states and 438 transitions. Word has length 12
[2024-11-07 16:01:05,644 INFO L84 Accepts]: Finished accepts. word is rejected.
[2024-11-07 16:01:05,644 INFO L471 AbstractCegarLoop]: Abstraction has 337 states and 438 transitions.
[2024-11-07 16:01:05,644 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:01:05,644 INFO L276 IsEmpty]: Start isEmpty. Operand 337 states and 438 transitions.
[2024-11-07 16:01:05,645 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16
[2024-11-07 16:01:05,645 INFO L207 NwaCegarLoop]: Found error trace
[2024-11-07 16:01:05,645 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-11-07 16:01:05,648 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Ended with exit code 0
[2024-11-07 16:01:05,845 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:01:05,846 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] ===
[2024-11-07 16:01:05,846 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-11-07 16:01:05,846 INFO L85 PathProgramCache]: Analyzing trace with hash -168573432, now seen corresponding path program 1 times
[2024-11-07 16:01:05,846 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF
[2024-11-07 16:01:05,846 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1104034371]
[2024-11-07 16:01:05,846 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-07 16:01:05,846 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:01:05,846 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat
[2024-11-07 16:01:05,849 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:01:05,850 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:01:05,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 16:01:06,000 INFO L255 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 5 conjuncts are in the unsatisfiable core
[2024-11-07 16:01:06,002 INFO L278 TraceCheckSpWp]: Computing forward predicates...
[2024-11-07 16:01:06,025 INFO L173 IndexEqualityManager]: detected equality via solver
[2024-11-07 16:01:06,026 INFO L173 IndexEqualityManager]: detected equality via solver
[2024-11-07 16:01:06,033 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 31
[2024-11-07 16:01:06,075 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2024-11-07 16:01:06,076 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 62 treesize of output 22
[2024-11-07 16:01:06,110 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:01:06,111 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect
[2024-11-07 16:01:06,111 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace
[2024-11-07 16:01:06,111 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1104034371]
[2024-11-07 16:01:06,111 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1104034371] provided 1 perfect and 0 imperfect interpolant sequences
[2024-11-07 16:01:06,111 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-11-07 16:01:06,111 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2024-11-07 16:01:06,111 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1437668610]
[2024-11-07 16:01:06,111 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-11-07 16:01:06,111 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2024-11-07 16:01:06,112 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF
[2024-11-07 16:01:06,112 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2024-11-07 16:01:06,112 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2024-11-07 16:01:06,112 INFO L87 Difference]: Start difference. First operand 337 states and 438 transitions. Second operand has 4 states, 4 states have (on average 3.75) internal successors, (15), 4 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-11-07 16:01:06,562 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2024-11-07 16:01:06,562 INFO L93 Difference]: Finished difference Result 531 states and 694 transitions.
[2024-11-07 16:01:06,563 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states.
[2024-11-07 16:01:06,563 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.75) internal successors, (15), 4 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15
[2024-11-07 16:01:06,563 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2024-11-07 16:01:06,565 INFO L225 Difference]: With dead ends: 531
[2024-11-07 16:01:06,565 INFO L226 Difference]: Without dead ends: 531
[2024-11-07 16:01:06,565 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20
[2024-11-07 16:01:06,566 INFO L432 NwaCegarLoop]: 269 mSDtfsCounter, 264 mSDsluCounter, 530 mSDsCounter, 0 mSdLazyCounter, 66 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 267 SdHoareTripleChecker+Valid, 799 SdHoareTripleChecker+Invalid, 67 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 66 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time
[2024-11-07 16:01:06,566 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [267 Valid, 799 Invalid, 67 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 66 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time]
[2024-11-07 16:01:06,567 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 531 states.
[2024-11-07 16:01:06,574 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 531 to 336.
[2024-11-07 16:01:06,575 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 336 states, 328 states have (on average 1.3048780487804879) internal successors, (428), 330 states have internal predecessors, (428), 5 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3)
[2024-11-07 16:01:06,576 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 336 states to 336 states and 436 transitions.
[2024-11-07 16:01:06,576 INFO L78 Accepts]: Start accepts. Automaton has 336 states and 436 transitions. Word has length 15
[2024-11-07 16:01:06,576 INFO L84 Accepts]: Finished accepts. word is rejected.
[2024-11-07 16:01:06,576 INFO L471 AbstractCegarLoop]: Abstraction has 336 states and 436 transitions.
[2024-11-07 16:01:06,576 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.75) internal successors, (15), 4 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-11-07 16:01:06,576 INFO L276 IsEmpty]: Start isEmpty. Operand 336 states and 436 transitions.
[2024-11-07 16:01:06,578 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84
[2024-11-07 16:01:06,578 INFO L207 NwaCegarLoop]: Found error trace
[2024-11-07 16:01:06,578 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:01:06,582 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:01:06,778 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:01:06,779 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] ===
[2024-11-07 16:01:06,779 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-11-07 16:01:06,779 INFO L85 PathProgramCache]: Analyzing trace with hash -747339991, now seen corresponding path program 1 times
[2024-11-07 16:01:06,780 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF
[2024-11-07 16:01:06,780 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1558360645]
[2024-11-07 16:01:06,780 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-07 16:01:06,780 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3
[2024-11-07 16:01:06,780 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat
[2024-11-07 16:01:06,783 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:01:06,785 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:01:07,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 16:01:07,135 INFO L255 TraceCheckSpWp]: Trace formula consists of 492 conjuncts, 3 conjuncts are in the unsatisfiable core
[2024-11-07 16:01:07,138 INFO L278 TraceCheckSpWp]: Computing forward predicates...
[2024-11-07 16:01:07,165 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked.
[2024-11-07 16:01:07,166 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect
[2024-11-07 16:01:07,166 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace
[2024-11-07 16:01:07,166 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1558360645]
[2024-11-07 16:01:07,166 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1558360645] provided 1 perfect and 0 imperfect interpolant sequences
[2024-11-07 16:01:07,166 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-11-07 16:01:07,166 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2024-11-07 16:01:07,166 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1215989840]
[2024-11-07 16:01:07,166 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-11-07 16:01:07,167 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2024-11-07 16:01:07,167 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF
[2024-11-07 16:01:07,167 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2024-11-07 16:01:07,167 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2024-11-07 16:01:07,168 INFO L87 Difference]: Start difference. First operand 336 states and 436 transitions. Second operand has 4 states, 4 states have (on average 18.75) internal successors, (75), 4 states have internal predecessors, (75), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2)
[2024-11-07 16:01:07,249 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2024-11-07 16:01:07,249 INFO L93 Difference]: Finished difference Result 342 states and 426 transitions.
[2024-11-07 16:01:07,249 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states.
[2024-11-07 16:01:07,250 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 18.75) internal successors, (75), 4 states have internal predecessors, (75), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 83
[2024-11-07 16:01:07,250 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2024-11-07 16:01:07,251 INFO L225 Difference]: With dead ends: 342
[2024-11-07 16:01:07,251 INFO L226 Difference]: Without dead ends: 342
[2024-11-07 16:01:07,251 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 80 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20
[2024-11-07 16:01:07,251 INFO L432 NwaCegarLoop]: 259 mSDtfsCounter, 30 mSDsluCounter, 499 mSDsCounter, 0 mSdLazyCounter, 43 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 758 SdHoareTripleChecker+Invalid, 65 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 43 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time
[2024-11-07 16:01:07,251 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 758 Invalid, 65 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 43 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time]
[2024-11-07 16:01:07,252 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 342 states.
[2024-11-07 16:01:07,256 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 342 to 342.
[2024-11-07 16:01:07,257 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 342 states, 334 states have (on average 1.251497005988024) internal successors, (418), 336 states have internal predecessors, (418), 5 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3)
[2024-11-07 16:01:07,258 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 342 states to 342 states and 426 transitions.
[2024-11-07 16:01:07,258 INFO L78 Accepts]: Start accepts. Automaton has 342 states and 426 transitions. Word has length 83
[2024-11-07 16:01:07,258 INFO L84 Accepts]: Finished accepts. word is rejected.
[2024-11-07 16:01:07,258 INFO L471 AbstractCegarLoop]: Abstraction has 342 states and 426 transitions.
[2024-11-07 16:01:07,258 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 18.75) internal successors, (75), 4 states have internal predecessors, (75), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2)
[2024-11-07 16:01:07,258 INFO L276 IsEmpty]: Start isEmpty. Operand 342 states and 426 transitions.
[2024-11-07 16:01:07,260 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84
[2024-11-07 16:01:07,260 INFO L207 NwaCegarLoop]: Found error trace
[2024-11-07 16:01:07,260 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-11-07 16:01:07,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 (5)] Ended with exit code 0
[2024-11-07 16:01:07,464 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:01:07,465 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] ===
[2024-11-07 16:01:07,465 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-11-07 16:01:07,466 INFO L85 PathProgramCache]: Analyzing trace with hash 1607422365, now seen corresponding path program 1 times
[2024-11-07 16:01:07,466 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF
[2024-11-07 16:01:07,467 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [394268989]
[2024-11-07 16:01:07,467 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-07 16:01:07,467 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:01:07,467 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat
[2024-11-07 16:01:07,469 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:01:07,471 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:01:07,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 16:01:07,821 INFO L255 TraceCheckSpWp]: Trace formula consists of 480 conjuncts, 3 conjuncts are in the unsatisfiable core
[2024-11-07 16:01:07,823 INFO L278 TraceCheckSpWp]: Computing forward predicates...
[2024-11-07 16:01:07,856 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-11-07 16:01:07,858 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect
[2024-11-07 16:01:07,858 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace
[2024-11-07 16:01:07,858 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [394268989]
[2024-11-07 16:01:07,858 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [394268989] provided 1 perfect and 0 imperfect interpolant sequences
[2024-11-07 16:01:07,858 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-11-07 16:01:07,858 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2024-11-07 16:01:07,859 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [490759215]
[2024-11-07 16:01:07,859 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-11-07 16:01:07,859 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2024-11-07 16:01:07,859 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF
[2024-11-07 16:01:07,859 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2024-11-07 16:01:07,859 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2024-11-07 16:01:07,860 INFO L87 Difference]: Start difference. First operand 342 states and 426 transitions. Second operand has 4 states, 4 states have (on average 19.5) internal successors, (78), 4 states have internal predecessors, (78), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2)
[2024-11-07 16:01:07,899 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2024-11-07 16:01:07,899 INFO L93 Difference]: Finished difference Result 345 states and 430 transitions.
[2024-11-07 16:01:07,900 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states.
[2024-11-07 16:01:07,900 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 19.5) internal successors, (78), 4 states have internal predecessors, (78), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) Word has length 83
[2024-11-07 16:01:07,900 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2024-11-07 16:01:07,902 INFO L225 Difference]: With dead ends: 345
[2024-11-07 16:01:07,902 INFO L226 Difference]: Without dead ends: 345
[2024-11-07 16:01:07,902 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 80 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2024-11-07 16:01:07,903 INFO L432 NwaCegarLoop]: 275 mSDtfsCounter, 0 mSDsluCounter, 546 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 821 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time
[2024-11-07 16:01:07,903 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 821 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time]
[2024-11-07 16:01:07,906 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 345 states.
[2024-11-07 16:01:07,911 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 345 to 345.
[2024-11-07 16:01:07,911 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 345 states, 336 states have (on average 1.2529761904761905) internal successors, (421), 339 states have internal predecessors, (421), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4)
[2024-11-07 16:01:07,912 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 345 states to 345 states and 430 transitions.
[2024-11-07 16:01:07,913 INFO L78 Accepts]: Start accepts. Automaton has 345 states and 430 transitions. Word has length 83
[2024-11-07 16:01:07,914 INFO L84 Accepts]: Finished accepts. word is rejected.
[2024-11-07 16:01:07,914 INFO L471 AbstractCegarLoop]: Abstraction has 345 states and 430 transitions.
[2024-11-07 16:01:07,914 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 19.5) internal successors, (78), 4 states have internal predecessors, (78), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2)
[2024-11-07 16:01:07,914 INFO L276 IsEmpty]: Start isEmpty. Operand 345 states and 430 transitions.
[2024-11-07 16:01:07,917 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86
[2024-11-07 16:01:07,919 INFO L207 NwaCegarLoop]: Found error trace
[2024-11-07 16:01:07,919 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-11-07 16:01:07,928 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:01:08,119 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:01:08,121 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] ===
[2024-11-07 16:01:08,121 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-11-07 16:01:08,121 INFO L85 PathProgramCache]: Analyzing trace with hash -317203361, now seen corresponding path program 1 times
[2024-11-07 16:01:08,122 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF
[2024-11-07 16:01:08,122 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1858936231]
[2024-11-07 16:01:08,122 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-07 16:01:08,122 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:01:08,123 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat
[2024-11-07 16:01:08,124 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:01:08,126 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:01:08,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 16:01:08,482 INFO L255 TraceCheckSpWp]: Trace formula consists of 502 conjuncts, 4 conjuncts are in the unsatisfiable core
[2024-11-07 16:01:08,485 INFO L278 TraceCheckSpWp]: Computing forward predicates...
[2024-11-07 16:01:08,515 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 9 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked.
[2024-11-07 16:01:08,518 INFO L311 TraceCheckSpWp]: Computing backward predicates...
[2024-11-07 16:01:08,603 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 2 proven. 7 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked.
[2024-11-07 16:01:08,605 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace
[2024-11-07 16:01:08,605 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1858936231]
[2024-11-07 16:01:08,605 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1858936231] provided 0 perfect and 2 imperfect interpolant sequences
[2024-11-07 16:01:08,605 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences.
[2024-11-07 16:01:08,605 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 8
[2024-11-07 16:01:08,605 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1094940108]
[2024-11-07 16:01:08,605 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton
[2024-11-07 16:01:08,606 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states
[2024-11-07 16:01:08,607 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF
[2024-11-07 16:01:08,607 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants.
[2024-11-07 16:01:08,607 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56
[2024-11-07 16:01:08,607 INFO L87 Difference]: Start difference. First operand 345 states and 430 transitions. Second operand has 8 states, 8 states have (on average 11.0) internal successors, (88), 8 states have internal predecessors, (88), 2 states have call successors, (4), 2 states have call predecessors, (4), 4 states have return successors, (4), 1 states have call predecessors, (4), 2 states have call successors, (4)
[2024-11-07 16:01:08,717 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2024-11-07 16:01:08,717 INFO L93 Difference]: Finished difference Result 356 states and 446 transitions.
[2024-11-07 16:01:08,718 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states.
[2024-11-07 16:01:08,718 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 11.0) internal successors, (88), 8 states have internal predecessors, (88), 2 states have call successors, (4), 2 states have call predecessors, (4), 4 states have return successors, (4), 1 states have call predecessors, (4), 2 states have call successors, (4) Word has length 85
[2024-11-07 16:01:08,718 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2024-11-07 16:01:08,719 INFO L225 Difference]: With dead ends: 356
[2024-11-07 16:01:08,719 INFO L226 Difference]: Without dead ends: 356
[2024-11-07 16:01:08,719 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 171 GetRequests, 162 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=44, Invalid=66, Unknown=0, NotChecked=0, Total=110
[2024-11-07 16:01:08,720 INFO L432 NwaCegarLoop]: 275 mSDtfsCounter, 5 mSDsluCounter, 1089 mSDsCounter, 0 mSdLazyCounter, 51 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 1364 SdHoareTripleChecker+Invalid, 60 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 51 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time
[2024-11-07 16:01:08,720 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 1364 Invalid, 60 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 51 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time]
[2024-11-07 16:01:08,721 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 356 states.
[2024-11-07 16:01:08,724 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 356 to 354.
[2024-11-07 16:01:08,725 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 354 states, 344 states have (on average 1.2645348837209303) internal successors, (435), 347 states have internal predecessors, (435), 5 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4)
[2024-11-07 16:01:08,726 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 354 states to 354 states and 444 transitions.
[2024-11-07 16:01:08,726 INFO L78 Accepts]: Start accepts. Automaton has 354 states and 444 transitions. Word has length 85
[2024-11-07 16:01:08,726 INFO L84 Accepts]: Finished accepts. word is rejected.
[2024-11-07 16:01:08,726 INFO L471 AbstractCegarLoop]: Abstraction has 354 states and 444 transitions.
[2024-11-07 16:01:08,726 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 11.0) internal successors, (88), 8 states have internal predecessors, (88), 2 states have call successors, (4), 2 states have call predecessors, (4), 4 states have return successors, (4), 1 states have call predecessors, (4), 2 states have call successors, (4)
[2024-11-07 16:01:08,726 INFO L276 IsEmpty]: Start isEmpty. Operand 354 states and 444 transitions.
[2024-11-07 16:01:08,727 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90
[2024-11-07 16:01:08,727 INFO L207 NwaCegarLoop]: Found error trace
[2024-11-07 16:01:08,727 INFO L215 NwaCegarLoop]: trace histogram [6, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-11-07 16:01:08,736 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Ended with exit code 0
[2024-11-07 16:01:08,927 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:01:08,928 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] ===
[2024-11-07 16:01:08,928 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-11-07 16:01:08,928 INFO L85 PathProgramCache]: Analyzing trace with hash -1449743939, now seen corresponding path program 2 times
[2024-11-07 16:01:08,929 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF
[2024-11-07 16:01:08,929 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [906201332]
[2024-11-07 16:01:08,929 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1
[2024-11-07 16:01:08,929 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:01:08,929 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat
[2024-11-07 16:01:08,931 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:01:08,933 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:01:09,163 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s)
[2024-11-07 16:01:09,163 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat
[2024-11-07 16:01:09,167 INFO L255 TraceCheckSpWp]: Trace formula consists of 70 conjuncts, 4 conjuncts are in the unsatisfiable core
[2024-11-07 16:01:09,170 INFO L278 TraceCheckSpWp]: Computing forward predicates...
[2024-11-07 16:01:09,180 INFO L173 IndexEqualityManager]: detected equality via solver
[2024-11-07 16:01:09,181 INFO L173 IndexEqualityManager]: detected equality via solver
[2024-11-07 16:01:09,181 INFO L173 IndexEqualityManager]: detected equality via solver
[2024-11-07 16:01:09,183 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:01:09,215 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2024-11-07 16:01:09,216 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:01:09,225 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked.
[2024-11-07 16:01:09,225 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect
[2024-11-07 16:01:09,225 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace
[2024-11-07 16:01:09,225 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [906201332]
[2024-11-07 16:01:09,225 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [906201332] provided 1 perfect and 0 imperfect interpolant sequences
[2024-11-07 16:01:09,226 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-11-07 16:01:09,226 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2024-11-07 16:01:09,226 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [945169904]
[2024-11-07 16:01:09,226 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-11-07 16:01:09,226 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2024-11-07 16:01:09,226 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF
[2024-11-07 16:01:09,227 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2024-11-07 16:01:09,227 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2024-11-07 16:01:09,227 INFO L87 Difference]: Start difference. First operand 354 states and 444 transitions. Second operand has 4 states, 4 states have (on average 18.75) internal successors, (75), 4 states have internal predecessors, (75), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2)
[2024-11-07 16:01:09,527 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2024-11-07 16:01:09,527 INFO L93 Difference]: Finished difference Result 514 states and 655 transitions.
[2024-11-07 16:01:09,527 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states.
[2024-11-07 16:01:09,527 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 18.75) internal successors, (75), 4 states have internal predecessors, (75), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 89
[2024-11-07 16:01:09,528 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2024-11-07 16:01:09,529 INFO L225 Difference]: With dead ends: 514
[2024-11-07 16:01:09,529 INFO L226 Difference]: Without dead ends: 514
[2024-11-07 16:01:09,530 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 89 GetRequests, 86 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:01:09,530 INFO L432 NwaCegarLoop]: 259 mSDtfsCounter, 207 mSDsluCounter, 510 mSDsCounter, 0 mSdLazyCounter, 63 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 210 SdHoareTripleChecker+Valid, 769 SdHoareTripleChecker+Invalid, 64 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 63 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time
[2024-11-07 16:01:09,530 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [210 Valid, 769 Invalid, 64 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 63 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time]
[2024-11-07 16:01:09,531 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 514 states.
[2024-11-07 16:01:09,535 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 514 to 356.
[2024-11-07 16:01:09,536 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 356 states, 346 states have (on average 1.2630057803468209) internal successors, (437), 349 states have internal predecessors, (437), 5 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4)
[2024-11-07 16:01:09,537 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 356 states to 356 states and 446 transitions.
[2024-11-07 16:01:09,537 INFO L78 Accepts]: Start accepts. Automaton has 356 states and 446 transitions. Word has length 89
[2024-11-07 16:01:09,537 INFO L84 Accepts]: Finished accepts. word is rejected.
[2024-11-07 16:01:09,538 INFO L471 AbstractCegarLoop]: Abstraction has 356 states and 446 transitions.
[2024-11-07 16:01:09,538 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 18.75) internal successors, (75), 4 states have internal predecessors, (75), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2)
[2024-11-07 16:01:09,538 INFO L276 IsEmpty]: Start isEmpty. Operand 356 states and 446 transitions.
[2024-11-07 16:01:09,539 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126
[2024-11-07 16:01:09,539 INFO L207 NwaCegarLoop]: Found error trace
[2024-11-07 16:01:09,539 INFO L215 NwaCegarLoop]: trace histogram [6, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-11-07 16:01:09,544 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:01:09,740 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:01:09,741 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] ===
[2024-11-07 16:01:09,741 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-11-07 16:01:09,741 INFO L85 PathProgramCache]: Analyzing trace with hash 1509441323, now seen corresponding path program 1 times
[2024-11-07 16:01:09,742 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF
[2024-11-07 16:01:09,742 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1742443006]
[2024-11-07 16:01:09,742 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-07 16:01:09,742 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:01:09,742 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat
[2024-11-07 16:01:09,744 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:01:09,746 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:01:10,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 16:01:10,166 INFO L255 TraceCheckSpWp]: Trace formula consists of 610 conjuncts, 7 conjuncts are in the unsatisfiable core
[2024-11-07 16:01:10,169 INFO L278 TraceCheckSpWp]: Computing forward predicates...
[2024-11-07 16:01:10,226 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 20 proven. 10 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked.
[2024-11-07 16:01:10,226 INFO L311 TraceCheckSpWp]: Computing backward predicates...
[2024-11-07 16:01:10,372 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 2 proven. 27 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked.
[2024-11-07 16:01:10,372 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace
[2024-11-07 16:01:10,372 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1742443006]
[2024-11-07 16:01:10,372 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1742443006] provided 0 perfect and 2 imperfect interpolant sequences
[2024-11-07 16:01:10,372 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences.
[2024-11-07 16:01:10,373 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 14
[2024-11-07 16:01:10,373 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [253829234]
[2024-11-07 16:01:10,373 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton
[2024-11-07 16:01:10,373 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states
[2024-11-07 16:01:10,373 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF
[2024-11-07 16:01:10,374 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants.
[2024-11-07 16:01:10,374 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=121, Unknown=0, NotChecked=0, Total=182
[2024-11-07 16:01:10,374 INFO L87 Difference]: Start difference. First operand 356 states and 446 transitions. Second operand has 14 states, 14 states have (on average 9.285714285714286) internal successors, (130), 14 states have internal predecessors, (130), 2 states have call successors, (4), 2 states have call predecessors, (4), 4 states have return successors, (4), 1 states have call predecessors, (4), 2 states have call successors, (4)
[2024-11-07 16:01:10,730 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2024-11-07 16:01:10,730 INFO L93 Difference]: Finished difference Result 371 states and 468 transitions.
[2024-11-07 16:01:10,731 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states.
[2024-11-07 16:01:10,731 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 9.285714285714286) internal successors, (130), 14 states have internal predecessors, (130), 2 states have call successors, (4), 2 states have call predecessors, (4), 4 states have return successors, (4), 1 states have call predecessors, (4), 2 states have call successors, (4) Word has length 125
[2024-11-07 16:01:10,731 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2024-11-07 16:01:10,733 INFO L225 Difference]: With dead ends: 371
[2024-11-07 16:01:10,733 INFO L226 Difference]: Without dead ends: 367
[2024-11-07 16:01:10,733 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 257 GetRequests, 236 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=182, Invalid=324, Unknown=0, NotChecked=0, Total=506
[2024-11-07 16:01:10,733 INFO L432 NwaCegarLoop]: 275 mSDtfsCounter, 7 mSDsluCounter, 2178 mSDsCounter, 0 mSdLazyCounter, 169 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 2453 SdHoareTripleChecker+Invalid, 177 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 169 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time
[2024-11-07 16:01:10,734 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 2453 Invalid, 177 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 169 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time]
[2024-11-07 16:01:10,734 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 367 states.
[2024-11-07 16:01:10,738 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 367 to 365.
[2024-11-07 16:01:10,738 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 365 states, 355 states have (on average 1.2647887323943663) internal successors, (449), 358 states have internal predecessors, (449), 5 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4)
[2024-11-07 16:01:10,739 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 365 states to 365 states and 458 transitions.
[2024-11-07 16:01:10,739 INFO L78 Accepts]: Start accepts. Automaton has 365 states and 458 transitions. Word has length 125
[2024-11-07 16:01:10,740 INFO L84 Accepts]: Finished accepts. word is rejected.
[2024-11-07 16:01:10,740 INFO L471 AbstractCegarLoop]: Abstraction has 365 states and 458 transitions.
[2024-11-07 16:01:10,740 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 9.285714285714286) internal successors, (130), 14 states have internal predecessors, (130), 2 states have call successors, (4), 2 states have call predecessors, (4), 4 states have return successors, (4), 1 states have call predecessors, (4), 2 states have call successors, (4)
[2024-11-07 16:01:10,740 INFO L276 IsEmpty]: Start isEmpty. Operand 365 states and 458 transitions.
[2024-11-07 16:01:10,741 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135
[2024-11-07 16:01:10,741 INFO L207 NwaCegarLoop]: Found error trace
[2024-11-07 16:01:10,741 INFO L215 NwaCegarLoop]: trace histogram [15, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-11-07 16:01:10,751 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:01:10,945 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:01:10,946 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] ===
[2024-11-07 16:01:10,946 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-11-07 16:01:10,946 INFO L85 PathProgramCache]: Analyzing trace with hash 1111264322, now seen corresponding path program 2 times
[2024-11-07 16:01:10,947 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF
[2024-11-07 16:01:10,947 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [597496587]
[2024-11-07 16:01:10,948 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1
[2024-11-07 16:01:10,949 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:01:10,949 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat
[2024-11-07 16:01:10,950 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:01:10,952 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:01:11,252 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s)
[2024-11-07 16:01:11,253 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat
[2024-11-07 16:01:11,257 INFO L255 TraceCheckSpWp]: Trace formula consists of 134 conjuncts, 3 conjuncts are in the unsatisfiable core
[2024-11-07 16:01:11,286 INFO L278 TraceCheckSpWp]: Computing forward predicates...
[2024-11-07 16:01:11,312 INFO L134 CoverageAnalysis]: Checked inductivity of 141 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 141 trivial. 0 not checked.
[2024-11-07 16:01:11,312 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect
[2024-11-07 16:01:11,312 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace
[2024-11-07 16:01:11,312 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [597496587]
[2024-11-07 16:01:11,312 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [597496587] provided 1 perfect and 0 imperfect interpolant sequences
[2024-11-07 16:01:11,312 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-11-07 16:01:11,312 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2024-11-07 16:01:11,313 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [895869628]
[2024-11-07 16:01:11,313 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-11-07 16:01:11,313 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2024-11-07 16:01:11,313 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF
[2024-11-07 16:01:11,313 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2024-11-07 16:01:11,313 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2024-11-07 16:01:11,314 INFO L87 Difference]: Start difference. First operand 365 states and 458 transitions. Second operand has 4 states, 4 states have (on average 27.75) internal successors, (111), 4 states have internal predecessors, (111), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2)
[2024-11-07 16:01:11,446 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2024-11-07 16:01:11,447 INFO L93 Difference]: Finished difference Result 371 states and 448 transitions.
[2024-11-07 16:01:11,447 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states.
[2024-11-07 16:01:11,447 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 27.75) internal successors, (111), 4 states have internal predecessors, (111), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 134
[2024-11-07 16:01:11,448 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2024-11-07 16:01:11,449 INFO L225 Difference]: With dead ends: 371
[2024-11-07 16:01:11,449 INFO L226 Difference]: Without dead ends: 371
[2024-11-07 16:01:11,449 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 134 GetRequests, 131 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20
[2024-11-07 16:01:11,450 INFO L432 NwaCegarLoop]: 248 mSDtfsCounter, 30 mSDsluCounter, 477 mSDsCounter, 0 mSdLazyCounter, 43 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 725 SdHoareTripleChecker+Invalid, 65 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 43 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time
[2024-11-07 16:01:11,450 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 725 Invalid, 65 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 43 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time]
[2024-11-07 16:01:11,450 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 371 states.
[2024-11-07 16:01:11,455 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 371 to 371.
[2024-11-07 16:01:11,456 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 371 states, 361 states have (on average 1.2160664819944598) internal successors, (439), 364 states have internal predecessors, (439), 5 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4)
[2024-11-07 16:01:11,458 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 371 states to 371 states and 448 transitions.
[2024-11-07 16:01:11,458 INFO L78 Accepts]: Start accepts. Automaton has 371 states and 448 transitions. Word has length 134
[2024-11-07 16:01:11,459 INFO L84 Accepts]: Finished accepts. word is rejected.
[2024-11-07 16:01:11,459 INFO L471 AbstractCegarLoop]: Abstraction has 371 states and 448 transitions.
[2024-11-07 16:01:11,459 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 27.75) internal successors, (111), 4 states have internal predecessors, (111), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2)
[2024-11-07 16:01:11,459 INFO L276 IsEmpty]: Start isEmpty. Operand 371 states and 448 transitions.
[2024-11-07 16:01:11,460 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135
[2024-11-07 16:01:11,460 INFO L207 NwaCegarLoop]: Found error trace
[2024-11-07 16:01:11,460 INFO L215 NwaCegarLoop]: trace histogram [15, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-11-07 16:01:11,464 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:01:11,660 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:01:11,661 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] ===
[2024-11-07 16:01:11,661 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-11-07 16:01:11,664 INFO L85 PathProgramCache]: Analyzing trace with hash -1833773130, now seen corresponding path program 1 times
[2024-11-07 16:01:11,665 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF
[2024-11-07 16:01:11,665 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2141852906]
[2024-11-07 16:01:11,665 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-07 16:01:11,665 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:01:11,665 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat
[2024-11-07 16:01:11,667 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:01:11,671 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:01:12,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 16:01:12,175 INFO L255 TraceCheckSpWp]: Trace formula consists of 697 conjuncts, 13 conjuncts are in the unsatisfiable core
[2024-11-07 16:01:12,179 INFO L278 TraceCheckSpWp]: Computing forward predicates...
[2024-11-07 16:01:12,327 INFO L134 CoverageAnalysis]: Checked inductivity of 141 backedges. 71 proven. 55 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked.
[2024-11-07 16:01:12,327 INFO L311 TraceCheckSpWp]: Computing backward predicates...
[2024-11-07 16:01:12,785 INFO L134 CoverageAnalysis]: Checked inductivity of 141 backedges. 2 proven. 123 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked.
[2024-11-07 16:01:12,785 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace
[2024-11-07 16:01:12,785 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2141852906]
[2024-11-07 16:01:12,785 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2141852906] provided 0 perfect and 2 imperfect interpolant sequences
[2024-11-07 16:01:12,785 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences.
[2024-11-07 16:01:12,785 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 26
[2024-11-07 16:01:12,785 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1197014475]
[2024-11-07 16:01:12,785 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton
[2024-11-07 16:01:12,786 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 26 states
[2024-11-07 16:01:12,786 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF
[2024-11-07 16:01:12,786 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants.
[2024-11-07 16:01:12,786 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=193, Invalid=457, Unknown=0, NotChecked=0, Total=650
[2024-11-07 16:01:12,787 INFO L87 Difference]: Start difference. First operand 371 states and 448 transitions. Second operand has 26 states, 26 states have (on average 5.461538461538462) internal successors, (142), 26 states have internal predecessors, (142), 2 states have call successors, (4), 2 states have call predecessors, (4), 4 states have return successors, (4), 1 states have call predecessors, (4), 2 states have call successors, (4)
[2024-11-07 16:01:14,584 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2024-11-07 16:01:14,584 INFO L93 Difference]: Finished difference Result 395 states and 488 transitions.
[2024-11-07 16:01:14,585 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states.
[2024-11-07 16:01:14,585 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 26 states have (on average 5.461538461538462) internal successors, (142), 26 states have internal predecessors, (142), 2 states have call successors, (4), 2 states have call predecessors, (4), 4 states have return successors, (4), 1 states have call predecessors, (4), 2 states have call successors, (4) Word has length 134
[2024-11-07 16:01:14,585 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2024-11-07 16:01:14,587 INFO L225 Difference]: With dead ends: 395
[2024-11-07 16:01:14,587 INFO L226 Difference]: Without dead ends: 391
[2024-11-07 16:01:14,588 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 287 GetRequests, 242 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 100 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=728, Invalid=1434, Unknown=0, NotChecked=0, Total=2162
[2024-11-07 16:01:14,588 INFO L432 NwaCegarLoop]: 264 mSDtfsCounter, 14 mSDsluCounter, 3662 mSDsCounter, 0 mSdLazyCounter, 545 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 3926 SdHoareTripleChecker+Invalid, 567 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 545 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time
[2024-11-07 16:01:14,589 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 3926 Invalid, 567 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 545 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time]
[2024-11-07 16:01:14,589 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 391 states.
[2024-11-07 16:01:14,593 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 391 to 389.
[2024-11-07 16:01:14,594 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 389 states, 379 states have (on average 1.2216358839050132) internal successors, (463), 382 states have internal predecessors, (463), 5 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4)
[2024-11-07 16:01:14,595 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 389 states to 389 states and 472 transitions.
[2024-11-07 16:01:14,595 INFO L78 Accepts]: Start accepts. Automaton has 389 states and 472 transitions. Word has length 134
[2024-11-07 16:01:14,595 INFO L84 Accepts]: Finished accepts. word is rejected.
[2024-11-07 16:01:14,595 INFO L471 AbstractCegarLoop]: Abstraction has 389 states and 472 transitions.
[2024-11-07 16:01:14,595 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 26 states have (on average 5.461538461538462) internal successors, (142), 26 states have internal predecessors, (142), 2 states have call successors, (4), 2 states have call predecessors, (4), 4 states have return successors, (4), 1 states have call predecessors, (4), 2 states have call successors, (4)
[2024-11-07 16:01:14,595 INFO L276 IsEmpty]: Start isEmpty. Operand 389 states and 472 transitions.
[2024-11-07 16:01:14,596 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153
[2024-11-07 16:01:14,596 INFO L207 NwaCegarLoop]: Found error trace
[2024-11-07 16:01:14,597 INFO L215 NwaCegarLoop]: trace histogram [33, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-11-07 16:01:14,608 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 (11)] Forceful destruction successful, exit code 0
[2024-11-07 16:01:14,800 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:01:14,801 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] ===
[2024-11-07 16:01:14,801 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-11-07 16:01:14,802 INFO L85 PathProgramCache]: Analyzing trace with hash 944057174, now seen corresponding path program 2 times
[2024-11-07 16:01:14,802 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF
[2024-11-07 16:01:14,802 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1639840070]
[2024-11-07 16:01:14,802 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1
[2024-11-07 16:01:14,804 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:01:14,804 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat
[2024-11-07 16:01:14,806 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:01:14,807 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:01:15,126 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s)
[2024-11-07 16:01:15,126 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat
[2024-11-07 16:01:15,129 INFO L255 TraceCheckSpWp]: Trace formula consists of 122 conjuncts, 5 conjuncts are in the unsatisfiable core
[2024-11-07 16:01:15,132 INFO L278 TraceCheckSpWp]: Computing forward predicates...
[2024-11-07 16:01:15,156 INFO L134 CoverageAnalysis]: Checked inductivity of 600 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 600 trivial. 0 not checked.
[2024-11-07 16:01:15,156 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect
[2024-11-07 16:01:15,156 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace
[2024-11-07 16:01:15,156 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1639840070]
[2024-11-07 16:01:15,156 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1639840070] provided 1 perfect and 0 imperfect interpolant sequences
[2024-11-07 16:01:15,156 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-11-07 16:01:15,156 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2024-11-07 16:01:15,156 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1952624799]
[2024-11-07 16:01:15,157 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-11-07 16:01:15,157 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2024-11-07 16:01:15,157 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF
[2024-11-07 16:01:15,157 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2024-11-07 16:01:15,157 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2024-11-07 16:01:15,157 INFO L87 Difference]: Start difference. First operand 389 states and 472 transitions. Second operand has 3 states, 3 states have (on average 37.0) internal successors, (111), 3 states have internal predecessors, (111), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2)
[2024-11-07 16:01:15,212 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2024-11-07 16:01:15,212 INFO L93 Difference]: Finished difference Result 389 states and 466 transitions.
[2024-11-07 16:01:15,213 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states.
[2024-11-07 16:01:15,213 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 37.0) internal successors, (111), 3 states have internal predecessors, (111), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 152
[2024-11-07 16:01:15,213 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2024-11-07 16:01:15,215 INFO L225 Difference]: With dead ends: 389
[2024-11-07 16:01:15,215 INFO L226 Difference]: Without dead ends: 389
[2024-11-07 16:01:15,215 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 151 GetRequests, 150 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2024-11-07 16:01:15,215 INFO L432 NwaCegarLoop]: 261 mSDtfsCounter, 0 mSDsluCounter, 239 mSDsCounter, 0 mSdLazyCounter, 31 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 500 SdHoareTripleChecker+Invalid, 33 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 31 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time
[2024-11-07 16:01:15,216 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 500 Invalid, 33 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 31 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time]
[2024-11-07 16:01:15,216 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 389 states.
[2024-11-07 16:01:15,220 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 389 to 389.
[2024-11-07 16:01:15,221 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 389 states, 379 states have (on average 1.2058047493403694) internal successors, (457), 382 states have internal predecessors, (457), 5 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4)
[2024-11-07 16:01:15,222 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 389 states to 389 states and 466 transitions.
[2024-11-07 16:01:15,222 INFO L78 Accepts]: Start accepts. Automaton has 389 states and 466 transitions. Word has length 152
[2024-11-07 16:01:15,223 INFO L84 Accepts]: Finished accepts. word is rejected.
[2024-11-07 16:01:15,223 INFO L471 AbstractCegarLoop]: Abstraction has 389 states and 466 transitions.
[2024-11-07 16:01:15,223 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 37.0) internal successors, (111), 3 states have internal predecessors, (111), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2)
[2024-11-07 16:01:15,223 INFO L276 IsEmpty]: Start isEmpty. Operand 389 states and 466 transitions.
[2024-11-07 16:01:15,224 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153
[2024-11-07 16:01:15,224 INFO L207 NwaCegarLoop]: Found error trace
[2024-11-07 16:01:15,224 INFO L215 NwaCegarLoop]: trace histogram [33, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-11-07 16:01:15,228 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:01:15,424 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:01:15,425 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] ===
[2024-11-07 16:01:15,425 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-11-07 16:01:15,426 INFO L85 PathProgramCache]: Analyzing trace with hash 1965125528, now seen corresponding path program 1 times
[2024-11-07 16:01:15,426 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF
[2024-11-07 16:01:15,426 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1492012714]
[2024-11-07 16:01:15,426 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-07 16:01:15,426 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:01:15,426 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat
[2024-11-07 16:01:15,429 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:01:15,430 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:01:15,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 16:01:15,980 INFO L255 TraceCheckSpWp]: Trace formula consists of 897 conjuncts, 25 conjuncts are in the unsatisfiable core
[2024-11-07 16:01:15,984 INFO L278 TraceCheckSpWp]: Computing forward predicates...
[2024-11-07 16:01:16,460 INFO L134 CoverageAnalysis]: Checked inductivity of 600 backedges. 281 proven. 253 refuted. 0 times theorem prover too weak. 66 trivial. 0 not checked.
[2024-11-07 16:01:16,461 INFO L311 TraceCheckSpWp]: Computing backward predicates...
[2024-11-07 16:01:18,129 INFO L134 CoverageAnalysis]: Checked inductivity of 600 backedges. 2 proven. 531 refuted. 0 times theorem prover too weak. 67 trivial. 0 not checked.
[2024-11-07 16:01:18,129 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace
[2024-11-07 16:01:18,129 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1492012714]
[2024-11-07 16:01:18,129 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1492012714] provided 0 perfect and 2 imperfect interpolant sequences
[2024-11-07 16:01:18,129 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences.
[2024-11-07 16:01:18,129 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 26] total 50
[2024-11-07 16:01:18,130 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1787187326]
[2024-11-07 16:01:18,130 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton
[2024-11-07 16:01:18,130 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 50 states
[2024-11-07 16:01:18,130 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF
[2024-11-07 16:01:18,132 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants.
[2024-11-07 16:01:18,132 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=672, Invalid=1778, Unknown=0, NotChecked=0, Total=2450
[2024-11-07 16:01:18,133 INFO L87 Difference]: Start difference. First operand 389 states and 466 transitions. Second operand has 50 states, 50 states have (on average 3.32) internal successors, (166), 50 states have internal predecessors, (166), 2 states have call successors, (4), 2 states have call predecessors, (4), 4 states have return successors, (4), 1 states have call predecessors, (4), 2 states have call successors, (4)
[2024-11-07 16:01:23,936 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2024-11-07 16:01:23,936 INFO L93 Difference]: Finished difference Result 429 states and 538 transitions.
[2024-11-07 16:01:23,937 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 71 states.
[2024-11-07 16:01:23,937 INFO L78 Accepts]: Start accepts. Automaton has has 50 states, 50 states have (on average 3.32) internal successors, (166), 50 states have internal predecessors, (166), 2 states have call successors, (4), 2 states have call predecessors, (4), 4 states have return successors, (4), 1 states have call predecessors, (4), 2 states have call successors, (4) Word has length 152
[2024-11-07 16:01:23,938 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2024-11-07 16:01:23,941 INFO L225 Difference]: With dead ends: 429
[2024-11-07 16:01:23,941 INFO L226 Difference]: Without dead ends: 425
[2024-11-07 16:01:23,942 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 345 GetRequests, 254 SyntacticMatches, 0 SemanticMatches, 91 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 465 ImplicationChecksByTransitivity, 5.0s TimeCoverageRelationStatistics Valid=2713, Invalid=5843, Unknown=0, NotChecked=0, Total=8556
[2024-11-07 16:01:23,943 INFO L432 NwaCegarLoop]: 264 mSDtfsCounter, 26 mSDsluCounter, 6288 mSDsCounter, 0 mSdLazyCounter, 1916 mSolverCounterSat, 67 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 6552 SdHoareTripleChecker+Invalid, 1983 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 67 IncrementalHoareTripleChecker+Valid, 1916 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time
[2024-11-07 16:01:23,943 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 6552 Invalid, 1983 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [67 Valid, 1916 Invalid, 0 Unknown, 0 Unchecked, 2.4s Time]
[2024-11-07 16:01:23,944 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 425 states.
[2024-11-07 16:01:23,948 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 425 to 423.
[2024-11-07 16:01:23,949 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 423 states, 413 states have (on average 1.2179176755447942) internal successors, (503), 416 states have internal predecessors, (503), 5 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4)
[2024-11-07 16:01:23,950 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 423 states to 423 states and 512 transitions.
[2024-11-07 16:01:23,950 INFO L78 Accepts]: Start accepts. Automaton has 423 states and 512 transitions. Word has length 152
[2024-11-07 16:01:23,950 INFO L84 Accepts]: Finished accepts. word is rejected.
[2024-11-07 16:01:23,950 INFO L471 AbstractCegarLoop]: Abstraction has 423 states and 512 transitions.
[2024-11-07 16:01:23,950 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 50 states, 50 states have (on average 3.32) internal successors, (166), 50 states have internal predecessors, (166), 2 states have call successors, (4), 2 states have call predecessors, (4), 4 states have return successors, (4), 1 states have call predecessors, (4), 2 states have call successors, (4)
[2024-11-07 16:01:23,950 INFO L276 IsEmpty]: Start isEmpty. Operand 423 states and 512 transitions.
[2024-11-07 16:01:23,952 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 187
[2024-11-07 16:01:23,953 INFO L207 NwaCegarLoop]: Found error trace
[2024-11-07 16:01:23,953 INFO L215 NwaCegarLoop]: trace histogram [67, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-11-07 16:01:23,967 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:01:24,156 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:01:24,157 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] ===
[2024-11-07 16:01:24,157 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-11-07 16:01:24,157 INFO L85 PathProgramCache]: Analyzing trace with hash 2028495224, now seen corresponding path program 2 times
[2024-11-07 16:01:24,158 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF
[2024-11-07 16:01:24,158 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1694558079]
[2024-11-07 16:01:24,158 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1
[2024-11-07 16:01:24,158 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:01:24,158 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat
[2024-11-07 16:01:24,162 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:01:24,163 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (14)] Waiting until timeout for monitored process
[2024-11-07 16:01:25,263 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s)
[2024-11-07 16:01:25,264 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat
[2024-11-07 16:01:25,298 INFO L255 TraceCheckSpWp]: Trace formula consists of 1271 conjuncts, 26 conjuncts are in the unsatisfiable core
[2024-11-07 16:01:25,301 INFO L278 TraceCheckSpWp]: Computing forward predicates...
[2024-11-07 16:01:25,751 INFO L134 CoverageAnalysis]: Checked inductivity of 2351 backedges. 1084 proven. 276 refuted. 0 times theorem prover too weak. 991 trivial. 0 not checked.
[2024-11-07 16:01:25,752 INFO L311 TraceCheckSpWp]: Computing backward predicates...
[2024-11-07 16:01:27,296 INFO L134 CoverageAnalysis]: Checked inductivity of 2351 backedges. 1084 proven. 276 refuted. 0 times theorem prover too weak. 991 trivial. 0 not checked.
[2024-11-07 16:01:27,296 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace
[2024-11-07 16:01:27,296 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1694558079]
[2024-11-07 16:01:27,296 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1694558079] provided 0 perfect and 2 imperfect interpolant sequences
[2024-11-07 16:01:27,296 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences.
[2024-11-07 16:01:27,296 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 27] total 52
[2024-11-07 16:01:27,297 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [769202759]
[2024-11-07 16:01:27,297 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton
[2024-11-07 16:01:27,297 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 52 states
[2024-11-07 16:01:27,297 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF
[2024-11-07 16:01:27,297 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants.
[2024-11-07 16:01:27,298 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=726, Invalid=1926, Unknown=0, NotChecked=0, Total=2652
[2024-11-07 16:01:27,298 INFO L87 Difference]: Start difference. First operand 423 states and 512 transitions. Second operand has 52 states, 52 states have (on average 3.1538461538461537) internal successors, (164), 52 states have internal predecessors, (164), 2 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3)
[2024-11-07 16:01:32,212 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2024-11-07 16:01:32,213 INFO L93 Difference]: Finished difference Result 452 states and 566 transitions.
[2024-11-07 16:01:32,213 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 76 states.
[2024-11-07 16:01:32,214 INFO L78 Accepts]: Start accepts. Automaton has has 52 states, 52 states have (on average 3.1538461538461537) internal successors, (164), 52 states have internal predecessors, (164), 2 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) Word has length 186
[2024-11-07 16:01:32,214 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2024-11-07 16:01:32,215 INFO L225 Difference]: With dead ends: 452
[2024-11-07 16:01:32,215 INFO L226 Difference]: Without dead ends: 452
[2024-11-07 16:01:32,217 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 417 GetRequests, 320 SyntacticMatches, 0 SemanticMatches, 97 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1633 ImplicationChecksByTransitivity, 5.2s TimeCoverageRelationStatistics Valid=3146, Invalid=6556, Unknown=0, NotChecked=0, Total=9702
[2024-11-07 16:01:32,217 INFO L432 NwaCegarLoop]: 263 mSDtfsCounter, 26 mSDsluCounter, 6787 mSDsCounter, 0 mSdLazyCounter, 1400 mSolverCounterSat, 37 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 7050 SdHoareTripleChecker+Invalid, 1437 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 37 IncrementalHoareTripleChecker+Valid, 1400 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time
[2024-11-07 16:01:32,217 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 7050 Invalid, 1437 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [37 Valid, 1400 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time]
[2024-11-07 16:01:32,218 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 452 states.
[2024-11-07 16:01:32,221 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 452 to 448.
[2024-11-07 16:01:32,222 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 448 states, 438 states have (on average 1.2625570776255708) internal successors, (553), 441 states have internal predecessors, (553), 5 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4)
[2024-11-07 16:01:32,223 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 448 states to 448 states and 562 transitions.
[2024-11-07 16:01:32,223 INFO L78 Accepts]: Start accepts. Automaton has 448 states and 562 transitions. Word has length 186
[2024-11-07 16:01:32,223 INFO L84 Accepts]: Finished accepts. word is rejected.
[2024-11-07 16:01:32,223 INFO L471 AbstractCegarLoop]: Abstraction has 448 states and 562 transitions.
[2024-11-07 16:01:32,223 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 52 states, 52 states have (on average 3.1538461538461537) internal successors, (164), 52 states have internal predecessors, (164), 2 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3)
[2024-11-07 16:01:32,223 INFO L276 IsEmpty]: Start isEmpty. Operand 448 states and 562 transitions.
[2024-11-07 16:01:32,225 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 212
[2024-11-07 16:01:32,225 INFO L207 NwaCegarLoop]: Found error trace
[2024-11-07 16:01:32,225 INFO L215 NwaCegarLoop]: trace histogram [92, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-11-07 16:01:32,247 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:01:32,430 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:01:32,433 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] ===
[2024-11-07 16:01:32,433 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-11-07 16:01:32,434 INFO L85 PathProgramCache]: Analyzing trace with hash -316738175, now seen corresponding path program 3 times
[2024-11-07 16:01:32,434 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF
[2024-11-07 16:01:32,434 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [948344183]
[2024-11-07 16:01:32,434 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2
[2024-11-07 16:01:32,434 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:01:32,434 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat
[2024-11-07 16:01:32,437 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:01:32,439 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:01:32,946 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s)
[2024-11-07 16:01:32,947 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat
[2024-11-07 16:01:32,959 INFO L255 TraceCheckSpWp]: Trace formula consists of 420 conjuncts, 3 conjuncts are in the unsatisfiable core
[2024-11-07 16:01:32,962 INFO L278 TraceCheckSpWp]: Computing forward predicates...
[2024-11-07 16:01:33,147 INFO L134 CoverageAnalysis]: Checked inductivity of 4376 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 4374 trivial. 0 not checked.
[2024-11-07 16:01:33,150 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect
[2024-11-07 16:01:33,150 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace
[2024-11-07 16:01:33,150 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [948344183]
[2024-11-07 16:01:33,150 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [948344183] provided 1 perfect and 0 imperfect interpolant sequences
[2024-11-07 16:01:33,150 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-11-07 16:01:33,150 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2024-11-07 16:01:33,150 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1593533744]
[2024-11-07 16:01:33,150 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-11-07 16:01:33,151 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2024-11-07 16:01:33,151 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF
[2024-11-07 16:01:33,151 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2024-11-07 16:01:33,151 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2024-11-07 16:01:33,151 INFO L87 Difference]: Start difference. First operand 448 states and 562 transitions. Second operand has 4 states, 4 states have (on average 28.0) internal successors, (112), 4 states have internal predecessors, (112), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2)
[2024-11-07 16:01:37,575 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers []
[2024-11-07 16:01:41,583 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:01:43,271 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.00s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers []
[2024-11-07 16:01:44,127 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2024-11-07 16:01:44,127 INFO L93 Difference]: Finished difference Result 539 states and 669 transitions.
[2024-11-07 16:01:44,129 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states.
[2024-11-07 16:01:44,130 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 28.0) internal successors, (112), 4 states have internal predecessors, (112), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 211
[2024-11-07 16:01:44,130 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2024-11-07 16:01:44,131 INFO L225 Difference]: With dead ends: 539
[2024-11-07 16:01:44,131 INFO L226 Difference]: Without dead ends: 539
[2024-11-07 16:01:44,131 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 212 GetRequests, 209 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20
[2024-11-07 16:01:44,132 INFO L432 NwaCegarLoop]: 265 mSDtfsCounter, 398 mSDsluCounter, 226 mSDsCounter, 0 mSdLazyCounter, 95 mSolverCounterSat, 5 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 10.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 398 SdHoareTripleChecker+Valid, 491 SdHoareTripleChecker+Invalid, 102 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 95 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 11.0s IncrementalHoareTripleChecker+Time
[2024-11-07 16:01:44,132 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [398 Valid, 491 Invalid, 102 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 95 Invalid, 2 Unknown, 0 Unchecked, 11.0s Time]
[2024-11-07 16:01:44,132 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 539 states.
[2024-11-07 16:01:44,137 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 539 to 536.
[2024-11-07 16:01:44,138 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 536 states, 526 states have (on average 1.2490494296577948) internal successors, (657), 529 states have internal predecessors, (657), 5 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4)
[2024-11-07 16:01:44,139 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 536 states to 536 states and 666 transitions.
[2024-11-07 16:01:44,139 INFO L78 Accepts]: Start accepts. Automaton has 536 states and 666 transitions. Word has length 211
[2024-11-07 16:01:44,139 INFO L84 Accepts]: Finished accepts. word is rejected.
[2024-11-07 16:01:44,140 INFO L471 AbstractCegarLoop]: Abstraction has 536 states and 666 transitions.
[2024-11-07 16:01:44,140 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 28.0) internal successors, (112), 4 states have internal predecessors, (112), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2)
[2024-11-07 16:01:44,140 INFO L276 IsEmpty]: Start isEmpty. Operand 536 states and 666 transitions.
[2024-11-07 16:01:44,141 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 220
[2024-11-07 16:01:44,141 INFO L207 NwaCegarLoop]: Found error trace
[2024-11-07 16:01:44,141 INFO L215 NwaCegarLoop]: trace histogram [92, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-11-07 16:01:44,152 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (15)] Ended with exit code 0
[2024-11-07 16:01:44,345 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:01:44,345 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] ===
[2024-11-07 16:01:44,346 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-11-07 16:01:44,346 INFO L85 PathProgramCache]: Analyzing trace with hash 1751102027, now seen corresponding path program 1 times
[2024-11-07 16:01:44,346 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF
[2024-11-07 16:01:44,346 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1559022718]
[2024-11-07 16:01:44,346 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-07 16:01:44,347 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:01:44,347 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat
[2024-11-07 16:01:44,349 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:01:44,349 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:01:45,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 16:01:45,971 INFO L255 TraceCheckSpWp]: Trace formula consists of 1562 conjuncts, 51 conjuncts are in the unsatisfiable core
[2024-11-07 16:01:45,975 INFO L278 TraceCheckSpWp]: Computing forward predicates...
[2024-11-07 16:01:47,903 INFO L134 CoverageAnalysis]: Checked inductivity of 4376 backedges. 2209 proven. 1176 refuted. 0 times theorem prover too weak. 991 trivial. 0 not checked.
[2024-11-07 16:01:47,904 INFO L311 TraceCheckSpWp]: Computing backward predicates...
[2024-11-07 16:01:55,074 INFO L134 CoverageAnalysis]: Checked inductivity of 4376 backedges. 2209 proven. 1176 refuted. 0 times theorem prover too weak. 991 trivial. 0 not checked.
[2024-11-07 16:01:55,075 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace
[2024-11-07 16:01:55,075 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1559022718]
[2024-11-07 16:01:55,075 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1559022718] provided 0 perfect and 2 imperfect interpolant sequences
[2024-11-07 16:01:55,075 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences.
[2024-11-07 16:01:55,075 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [52, 52] total 102
[2024-11-07 16:01:55,075 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1602521941]
[2024-11-07 16:01:55,075 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton
[2024-11-07 16:01:55,076 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 102 states
[2024-11-07 16:01:55,076 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF
[2024-11-07 16:01:55,077 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 102 interpolants.
[2024-11-07 16:01:55,078 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=2701, Invalid=7601, Unknown=0, NotChecked=0, Total=10302
[2024-11-07 16:01:55,079 INFO L87 Difference]: Start difference. First operand 536 states and 666 transitions. Second operand has 102 states, 102 states have (on average 2.176470588235294) internal successors, (222), 102 states have internal predecessors, (222), 2 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3)