./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memcleanup.prp --file ../sv-benchmarks/c/uthash-2.0.2/uthash_BER_test8-1.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_BER_test8-1.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', '58fb5e591c63ebc056bfb6417ddf45efba9827c2f78526eb3c8a68d018ffd43a']
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_BER_test8-1.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 58fb5e591c63ebc056bfb6417ddf45efba9827c2f78526eb3c8a68d018ffd43a
--- Real Ultimate output ---
This is Ultimate 0.3.0-?-4f9af40
[2024-11-07 15:57:32,285 INFO L188 SettingsManager]: Resetting all preferences to default values...
[2024-11-07 15:57:32,353 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-MemCleanup-32bit-Automizer_Default.epf
[2024-11-07 15:57:32,358 WARN L101 SettingsManager]: Preference file contains the following unknown settings:
[2024-11-07 15:57:32,359 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class
[2024-11-07 15:57:32,377 INFO L130 SettingsManager]: Preferences different from defaults after loading the file:
[2024-11-07 15:57:32,377 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults:
[2024-11-07 15:57:32,378 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR;
[2024-11-07 15:57:32,378 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults:
[2024-11-07 15:57:32,378 INFO L153 SettingsManager]: * Use memory slicer=true
[2024-11-07 15:57:32,378 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults:
[2024-11-07 15:57:32,378 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS
[2024-11-07 15:57:32,378 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults:
[2024-11-07 15:57:32,378 INFO L153 SettingsManager]: * Create parallel compositions if possible=false
[2024-11-07 15:57:32,379 INFO L153 SettingsManager]: * Use SBE=true
[2024-11-07 15:57:32,379 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults:
[2024-11-07 15:57:32,379 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE
[2024-11-07 15:57:32,379 INFO L153 SettingsManager]: * sizeof long=4
[2024-11-07 15:57:32,379 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true
[2024-11-07 15:57:32,379 INFO L153 SettingsManager]: * sizeof POINTER=4
[2024-11-07 15:57:32,379 INFO L153 SettingsManager]: * Check division by zero=IGNORE
[2024-11-07 15:57:32,379 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE
[2024-11-07 15:57:32,379 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true
[2024-11-07 15:57:32,379 INFO L153 SettingsManager]: * Bitprecise bitfields=true
[2024-11-07 15:57:32,379 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE
[2024-11-07 15:57:32,380 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE
[2024-11-07 15:57:32,380 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true
[2024-11-07 15:57:32,380 INFO L153 SettingsManager]: * Allow undefined functions=false
[2024-11-07 15:57:32,380 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false
[2024-11-07 15:57:32,380 INFO L153 SettingsManager]: * sizeof long double=12
[2024-11-07 15:57:32,380 INFO L153 SettingsManager]: * Check if freed pointer was valid=false
[2024-11-07 15:57:32,380 INFO L153 SettingsManager]: * Use constant arrays=true
[2024-11-07 15:57:32,380 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults:
[2024-11-07 15:57:32,380 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements
[2024-11-07 15:57:32,380 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true
[2024-11-07 15:57:32,381 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode
[2024-11-07 15:57:32,381 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000
[2024-11-07 15:57:32,381 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults:
[2024-11-07 15:57:32,381 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP
[2024-11-07 15:57:32,382 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL
[2024-11-07 15:57:32,382 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in
[2024-11-07 15:57:32,382 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false
[2024-11-07 15:57:32,382 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET
[2024-11-07 15:57:32,382 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO
[2024-11-07 15:57:32,382 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode
[2024-11-07 15:57:32,382 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 -> 58fb5e591c63ebc056bfb6417ddf45efba9827c2f78526eb3c8a68d018ffd43a
[2024-11-07 15:57:32,636 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp
[2024-11-07 15:57:32,643 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized
[2024-11-07 15:57:32,645 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected.
[2024-11-07 15:57:32,646 INFO L270 PluginConnector]: Initializing CDTParser...
[2024-11-07 15:57:32,646 INFO L274 PluginConnector]: CDTParser initialized
[2024-11-07 15:57:32,647 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_BER_test8-1.i
[2024-11-07 15:57:33,841 INFO L533 CDTParser]: Created temporary CDT project at NULL
[2024-11-07 15:57:34,080 INFO L384 CDTParser]: Found 1 translation units.
[2024-11-07 15:57:34,081 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_BER_test8-1.i
[2024-11-07 15:57:34,099 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/f23b70157/bc7fac69b8f34700888e1972f382c822/FLAG104cdcb93
[2024-11-07 15:57:34,112 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/f23b70157/bc7fac69b8f34700888e1972f382c822
[2024-11-07 15:57:34,115 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] #######################
[2024-11-07 15:57:34,116 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements.
[2024-11-07 15:57:34,117 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator----------------------------
[2024-11-07 15:57:34,117 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator...
[2024-11-07 15:57:34,120 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized
[2024-11-07 15:57:34,121 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 03:57:34" (1/1) ...
[2024-11-07 15:57:34,123 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@36cdd300 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 03:57:34, skipping insertion in model container
[2024-11-07 15:57:34,123 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 03:57:34" (1/1) ...
[2024-11-07 15:57:34,157 INFO L175 MainTranslator]: Built tables and reachable declarations
[2024-11-07 15:57:34,400 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model
[2024-11-07 15:57:34,420 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model
[2024-11-07 15:57:34,423 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model
[2024-11-07 15:57:34,424 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model
[2024-11-07 15:57:34,428 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model
[2024-11-07 15:57:34,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 15:57:34,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 15:57:34,451 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model
[2024-11-07 15:57:34,452 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model
[2024-11-07 15:57:34,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 15:57:34,454 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model
[2024-11-07 15:57:34,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 15:57:34,456 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model
[2024-11-07 15:57:34,463 INFO L210 PostProcessor]: Analyzing one entry point: main
[2024-11-07 15:57:34,477 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 15:57:34,477 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver@ffa4459 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 03:57:34, skipping insertion in model container
[2024-11-07 15:57:34,477 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator----------------------------
[2024-11-07 15:57:34,478 INFO L186 ToolchainWalker]: Toolchain execution was canceled (user or tool) before executing de.uni_freiburg.informatik.ultimate.boogie.procedureinliner
[2024-11-07 15:57:34,479 INFO L158 Benchmark]: Toolchain (without parser) took 362.35ms. Allocated memory is still 117.4MB. Free memory was 90.2MB in the beginning and 71.0MB in the end (delta: 19.2MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB.
[2024-11-07 15:57:34,481 INFO L158 Benchmark]: CDTParser took 0.16ms. Allocated memory is still 117.4MB. Free memory is still 81.1MB. There was no memory consumed. Max. memory is 16.1GB.
[2024-11-07 15:57:34,481 INFO L158 Benchmark]: CACSL2BoogieTranslator took 360.40ms. Allocated memory is still 117.4MB. Free memory was 90.0MB in the beginning and 71.0MB in the end (delta: 19.0MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB.
[2024-11-07 15:57:34,484 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.16ms. Allocated memory is still 117.4MB. Free memory is still 81.1MB. There was no memory consumed. Max. memory is 16.1GB.
* CACSL2BoogieTranslator took 360.40ms. Allocated memory is still 117.4MB. Free memory was 90.0MB in the beginning and 71.0MB in the end (delta: 19.0MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB.
* Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator:
- UnsupportedSyntaxResult [Line: 778]: 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_BER_test8-1.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 58fb5e591c63ebc056bfb6417ddf45efba9827c2f78526eb3c8a68d018ffd43a
--- Real Ultimate output ---
This is Ultimate 0.3.0-?-4f9af40
[2024-11-07 15:57:36,058 INFO L188 SettingsManager]: Resetting all preferences to default values...
[2024-11-07 15:57:36,132 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-MemCleanup-32bit-Automizer_Bitvector.epf
[2024-11-07 15:57:36,139 WARN L101 SettingsManager]: Preference file contains the following unknown settings:
[2024-11-07 15:57:36,140 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class
[2024-11-07 15:57:36,166 INFO L130 SettingsManager]: Preferences different from defaults after loading the file:
[2024-11-07 15:57:36,167 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults:
[2024-11-07 15:57:36,167 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR;
[2024-11-07 15:57:36,167 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults:
[2024-11-07 15:57:36,167 INFO L153 SettingsManager]: * Use memory slicer=true
[2024-11-07 15:57:36,167 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults:
[2024-11-07 15:57:36,168 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS
[2024-11-07 15:57:36,168 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults:
[2024-11-07 15:57:36,168 INFO L153 SettingsManager]: * Create parallel compositions if possible=false
[2024-11-07 15:57:36,168 INFO L153 SettingsManager]: * Use SBE=true
[2024-11-07 15:57:36,168 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults:
[2024-11-07 15:57:36,169 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE
[2024-11-07 15:57:36,169 INFO L153 SettingsManager]: * sizeof long=4
[2024-11-07 15:57:36,169 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true
[2024-11-07 15:57:36,169 INFO L153 SettingsManager]: * sizeof POINTER=4
[2024-11-07 15:57:36,169 INFO L153 SettingsManager]: * Check division by zero=IGNORE
[2024-11-07 15:57:36,169 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE
[2024-11-07 15:57:36,170 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true
[2024-11-07 15:57:36,170 INFO L153 SettingsManager]: * Bitprecise bitfields=true
[2024-11-07 15:57:36,170 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE
[2024-11-07 15:57:36,170 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE
[2024-11-07 15:57:36,170 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true
[2024-11-07 15:57:36,170 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true
[2024-11-07 15:57:36,170 INFO L153 SettingsManager]: * Allow undefined functions=false
[2024-11-07 15:57:36,170 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution
[2024-11-07 15:57:36,170 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false
[2024-11-07 15:57:36,170 INFO L153 SettingsManager]: * sizeof long double=12
[2024-11-07 15:57:36,170 INFO L153 SettingsManager]: * Check if freed pointer was valid=false
[2024-11-07 15:57:36,170 INFO L153 SettingsManager]: * Use constant arrays=true
[2024-11-07 15:57:36,170 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults:
[2024-11-07 15:57:36,170 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements
[2024-11-07 15:57:36,170 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true
[2024-11-07 15:57:36,170 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode
[2024-11-07 15:57:36,170 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000
[2024-11-07 15:57:36,170 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults:
[2024-11-07 15:57:36,170 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP
[2024-11-07 15:57:36,170 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF
[2024-11-07 15:57:36,171 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt
[2024-11-07 15:57:36,171 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false
[2024-11-07 15:57:36,171 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET
[2024-11-07 15:57:36,171 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO
[2024-11-07 15:57:36,171 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode
[2024-11-07 15:57:36,171 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 -> 58fb5e591c63ebc056bfb6417ddf45efba9827c2f78526eb3c8a68d018ffd43a
[2024-11-07 15:57:36,422 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp
[2024-11-07 15:57:36,430 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized
[2024-11-07 15:57:36,432 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected.
[2024-11-07 15:57:36,435 INFO L270 PluginConnector]: Initializing CDTParser...
[2024-11-07 15:57:36,435 INFO L274 PluginConnector]: CDTParser initialized
[2024-11-07 15:57:36,438 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_BER_test8-1.i
[2024-11-07 15:57:37,592 INFO L533 CDTParser]: Created temporary CDT project at NULL
[2024-11-07 15:57:37,916 INFO L384 CDTParser]: Found 1 translation units.
[2024-11-07 15:57:37,916 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_BER_test8-1.i
[2024-11-07 15:57:37,934 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/50d726298/58d153ab5d3c41b7aea01a396d4dab3c/FLAG12039eac1
[2024-11-07 15:57:38,168 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/50d726298/58d153ab5d3c41b7aea01a396d4dab3c
[2024-11-07 15:57:38,172 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] #######################
[2024-11-07 15:57:38,173 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements.
[2024-11-07 15:57:38,174 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator----------------------------
[2024-11-07 15:57:38,175 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator...
[2024-11-07 15:57:38,178 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized
[2024-11-07 15:57:38,179 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 03:57:38" (1/1) ...
[2024-11-07 15:57:38,180 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@78bb9a5e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 03:57:38, skipping insertion in model container
[2024-11-07 15:57:38,180 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 03:57:38" (1/1) ...
[2024-11-07 15:57:38,216 INFO L175 MainTranslator]: Built tables and reachable declarations
[2024-11-07 15:57:38,501 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model
[2024-11-07 15:57:38,518 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model
[2024-11-07 15:57:38,522 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model
[2024-11-07 15:57:38,524 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model
[2024-11-07 15:57:38,529 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model
[2024-11-07 15:57:38,552 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model
[2024-11-07 15:57:38,552 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model
[2024-11-07 15:57:38,554 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model
[2024-11-07 15:57:38,554 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model
[2024-11-07 15:57:38,556 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model
[2024-11-07 15:57:38,557 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model
[2024-11-07 15:57:38,558 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model
[2024-11-07 15:57:38,559 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model
[2024-11-07 15:57:38,566 INFO L210 PostProcessor]: Analyzing one entry point: main
[2024-11-07 15:57:38,576 INFO L197 MainTranslator]: Restarting translation with changed settings: SettingsChange [mNewPreferredMemoryModel=HoenickeLindenmann_1ByteResolution]
[2024-11-07 15:57:38,588 INFO L175 MainTranslator]: Built tables and reachable declarations
[2024-11-07 15:57:38,613 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model
[2024-11-07 15:57:38,628 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model
[2024-11-07 15:57:38,634 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model
[2024-11-07 15:57:38,636 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model
[2024-11-07 15:57:38,643 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model
[2024-11-07 15:57:38,663 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model
[2024-11-07 15:57:38,664 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model
[2024-11-07 15:57:38,665 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model
[2024-11-07 15:57:38,665 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model
[2024-11-07 15:57:38,666 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model
[2024-11-07 15:57:38,667 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model
[2024-11-07 15:57:38,669 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model
[2024-11-07 15:57:38,670 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model
[2024-11-07 15:57:38,674 INFO L210 PostProcessor]: Analyzing one entry point: main
[2024-11-07 15:57:38,680 INFO L200 MainTranslator]: Completed pre-run
[2024-11-07 15:57:38,744 INFO L210 PostProcessor]: Analyzing one entry point: main
[2024-11-07 15:57:38,770 INFO L204 MainTranslator]: Completed translation
[2024-11-07 15:57:38,770 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 03:57:38 WrapperNode
[2024-11-07 15:57:38,770 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator----------------------------
[2024-11-07 15:57:38,771 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner----------------------------
[2024-11-07 15:57:38,771 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner...
[2024-11-07 15:57:38,771 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized
[2024-11-07 15:57:38,775 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 03:57:38" (1/1) ...
[2024-11-07 15:57:38,798 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 03:57:38" (1/1) ...
[2024-11-07 15:57:38,841 INFO L138 Inliner]: procedures = 180, calls = 291, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 1018
[2024-11-07 15:57:38,841 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner----------------------------
[2024-11-07 15:57:38,842 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor----------------------------
[2024-11-07 15:57:38,842 INFO L270 PluginConnector]: Initializing Boogie Preprocessor...
[2024-11-07 15:57:38,842 INFO L274 PluginConnector]: Boogie Preprocessor initialized
[2024-11-07 15:57:38,848 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 03:57:38" (1/1) ...
[2024-11-07 15:57:38,848 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 03:57:38" (1/1) ...
[2024-11-07 15:57:38,858 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 03:57:38" (1/1) ...
[2024-11-07 15:57:38,920 INFO L175 MemorySlicer]: Split 256 memory accesses to 3 slices as follows [2, 34, 220]. 86 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0, 0]. The 54 writes are split as follows [0, 4, 50].
[2024-11-07 15:57:38,920 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 03:57:38" (1/1) ...
[2024-11-07 15:57:38,921 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 03:57:38" (1/1) ...
[2024-11-07 15:57:38,954 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 03:57:38" (1/1) ...
[2024-11-07 15:57:38,963 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 03:57:38" (1/1) ...
[2024-11-07 15:57:38,974 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 03:57:38" (1/1) ...
[2024-11-07 15:57:38,978 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 03:57:38" (1/1) ...
[2024-11-07 15:57:38,989 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor----------------------------
[2024-11-07 15:57:38,990 INFO L112 PluginConnector]: ------------------------RCFGBuilder----------------------------
[2024-11-07 15:57:38,991 INFO L270 PluginConnector]: Initializing RCFGBuilder...
[2024-11-07 15:57:38,991 INFO L274 PluginConnector]: RCFGBuilder initialized
[2024-11-07 15:57:38,992 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 03:57:38" (1/1) ...
[2024-11-07 15:57:38,997 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000
[2024-11-07 15:57:39,007 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3
[2024-11-07 15:57:39,018 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 15:57:39,021 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 15:57:39,039 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error
[2024-11-07 15:57:39,039 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error
[2024-11-07 15:57:39,039 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#0
[2024-11-07 15:57:39,039 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#1
[2024-11-07 15:57:39,039 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#2
[2024-11-07 15:57:39,040 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#0
[2024-11-07 15:57:39,040 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#1
[2024-11-07 15:57:39,040 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#2
[2024-11-07 15:57:39,040 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert
[2024-11-07 15:57:39,040 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert
[2024-11-07 15:57:39,040 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#0
[2024-11-07 15:57:39,040 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#1
[2024-11-07 15:57:39,040 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#2
[2024-11-07 15:57:39,040 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#0
[2024-11-07 15:57:39,041 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#1
[2024-11-07 15:57:39,041 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#2
[2024-11-07 15:57:39,042 INFO L130 BoogieDeclarations]: Found specification of procedure test_int
[2024-11-07 15:57:39,042 INFO L138 BoogieDeclarations]: Found implementation of procedure test_int
[2024-11-07 15:57:39,042 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap
[2024-11-07 15:57:39,042 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit
[2024-11-07 15:57:39,042 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0
[2024-11-07 15:57:39,042 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1
[2024-11-07 15:57:39,042 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2
[2024-11-07 15:57:39,042 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack
[2024-11-07 15:57:39,042 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0
[2024-11-07 15:57:39,042 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1
[2024-11-07 15:57:39,042 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2
[2024-11-07 15:57:39,042 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc
[2024-11-07 15:57:39,042 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#0
[2024-11-07 15:57:39,042 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#1
[2024-11-07 15:57:39,042 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#2
[2024-11-07 15:57:39,042 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0
[2024-11-07 15:57:39,042 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1
[2024-11-07 15:57:39,042 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#2
[2024-11-07 15:57:39,043 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start
[2024-11-07 15:57:39,043 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start
[2024-11-07 15:57:39,212 INFO L238 CfgBuilder]: Building ICFG
[2024-11-07 15:57:39,213 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation
[2024-11-07 15:57:45,902 INFO L? ?]: Removed 142 outVars from TransFormulas that were not future-live.
[2024-11-07 15:57:45,903 INFO L287 CfgBuilder]: Performing block encoding
[2024-11-07 15:57:45,919 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start)
[2024-11-07 15:57:45,919 INFO L316 CfgBuilder]: Removed 62 assume(true) statements.
[2024-11-07 15:57:45,919 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 03:57:45 BoogieIcfgContainer
[2024-11-07 15:57:45,919 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder----------------------------
[2024-11-07 15:57:45,921 INFO L112 PluginConnector]: ------------------------TraceAbstraction----------------------------
[2024-11-07 15:57:45,921 INFO L270 PluginConnector]: Initializing TraceAbstraction...
[2024-11-07 15:57:45,924 INFO L274 PluginConnector]: TraceAbstraction initialized
[2024-11-07 15:57:45,925 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.11 03:57:38" (1/3) ...
[2024-11-07 15:57:45,925 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@56c9c9e8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 03:57:45, skipping insertion in model container
[2024-11-07 15:57:45,925 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 03:57:38" (2/3) ...
[2024-11-07 15:57:45,926 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@56c9c9e8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 03:57:45, skipping insertion in model container
[2024-11-07 15:57:45,926 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 03:57:45" (3/3) ...
[2024-11-07 15:57:45,926 INFO L112 eAbstractionObserver]: Analyzing ICFG uthash_BER_test8-1.i
[2024-11-07 15:57:45,937 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION
[2024-11-07 15:57:45,937 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations.
[2024-11-07 15:57:45,968 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ========
[2024-11-07 15:57:45,980 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;@1fd59f59, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms]
[2024-11-07 15:57:45,980 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations.
[2024-11-07 15:57:45,984 INFO L276 IsEmpty]: Start isEmpty. Operand has 237 states, 208 states have (on average 1.6682692307692308) internal successors, (347), 227 states have internal predecessors, (347), 22 states have call successors, (22), 4 states have call predecessors, (22), 4 states have return successors, (22), 8 states have call predecessors, (22), 22 states have call successors, (22)
[2024-11-07 15:57:45,988 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8
[2024-11-07 15:57:45,988 INFO L207 NwaCegarLoop]: Found error trace
[2024-11-07 15:57:45,988 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1]
[2024-11-07 15:57:45,989 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] ===
[2024-11-07 15:57:45,991 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-11-07 15:57:45,992 INFO L85 PathProgramCache]: Analyzing trace with hash -1628734314, now seen corresponding path program 1 times
[2024-11-07 15:57:45,998 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF
[2024-11-07 15:57:45,998 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [939025230]
[2024-11-07 15:57:45,999 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-07 15:57:45,999 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 15:57:45,999 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat
[2024-11-07 15:57:46,001 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 15:57:46,002 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 15:57:46,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 15:57:46,124 INFO L255 TraceCheckSpWp]: Trace formula consists of 65 conjuncts, 1 conjuncts are in the unsatisfiable core
[2024-11-07 15:57:46,127 INFO L278 TraceCheckSpWp]: Computing forward predicates...
[2024-11-07 15:57:46,133 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 15:57:46,133 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect
[2024-11-07 15:57:46,134 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace
[2024-11-07 15:57:46,134 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [939025230]
[2024-11-07 15:57:46,134 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [939025230] provided 1 perfect and 0 imperfect interpolant sequences
[2024-11-07 15:57:46,134 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-11-07 15:57:46,134 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2024-11-07 15:57:46,137 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1428127218]
[2024-11-07 15:57:46,138 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-11-07 15:57:46,140 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states
[2024-11-07 15:57:46,140 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF
[2024-11-07 15:57:46,159 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants.
[2024-11-07 15:57:46,160 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2
[2024-11-07 15:57:46,162 INFO L87 Difference]: Start difference. First operand has 237 states, 208 states have (on average 1.6682692307692308) internal successors, (347), 227 states have internal predecessors, (347), 22 states have call successors, (22), 4 states have call predecessors, (22), 4 states have return successors, (22), 8 states have call predecessors, (22), 22 states have call successors, (22) Second operand has 2 states, 2 states have (on average 3.5) internal successors, (7), 2 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-11-07 15:57:46,189 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2024-11-07 15:57:46,189 INFO L93 Difference]: Finished difference Result 235 states and 320 transitions.
[2024-11-07 15:57:46,190 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states.
[2024-11-07 15:57:46,192 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 3.5) internal successors, (7), 2 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7
[2024-11-07 15:57:46,192 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2024-11-07 15:57:46,200 INFO L225 Difference]: With dead ends: 235
[2024-11-07 15:57:46,200 INFO L226 Difference]: Without dead ends: 233
[2024-11-07 15:57:46,202 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 6 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 15:57:46,205 INFO L432 NwaCegarLoop]: 320 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, 320 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 15:57:46,206 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 320 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time]
[2024-11-07 15:57:46,217 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 233 states.
[2024-11-07 15:57:46,243 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 233 to 233.
[2024-11-07 15:57:46,245 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 233 states, 206 states have (on average 1.3398058252427185) internal successors, (276), 223 states have internal predecessors, (276), 22 states have call successors, (22), 4 states have call predecessors, (22), 3 states have return successors, (20), 6 states have call predecessors, (20), 20 states have call successors, (20)
[2024-11-07 15:57:46,250 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 233 states to 233 states and 318 transitions.
[2024-11-07 15:57:46,252 INFO L78 Accepts]: Start accepts. Automaton has 233 states and 318 transitions. Word has length 7
[2024-11-07 15:57:46,252 INFO L84 Accepts]: Finished accepts. word is rejected.
[2024-11-07 15:57:46,252 INFO L471 AbstractCegarLoop]: Abstraction has 233 states and 318 transitions.
[2024-11-07 15:57:46,252 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 3.5) internal successors, (7), 2 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-11-07 15:57:46,252 INFO L276 IsEmpty]: Start isEmpty. Operand 233 states and 318 transitions.
[2024-11-07 15:57:46,253 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10
[2024-11-07 15:57:46,253 INFO L207 NwaCegarLoop]: Found error trace
[2024-11-07 15:57:46,253 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-11-07 15:57:46,256 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 15:57:46,456 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 15:57:46,456 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] ===
[2024-11-07 15:57:46,456 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-11-07 15:57:46,457 INFO L85 PathProgramCache]: Analyzing trace with hash 1529756569, now seen corresponding path program 1 times
[2024-11-07 15:57:46,457 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF
[2024-11-07 15:57:46,457 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1482123356]
[2024-11-07 15:57:46,457 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-07 15:57:46,457 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 15:57:46,457 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat
[2024-11-07 15:57:46,459 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 15:57:46,460 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 15:57:46,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 15:57:46,595 INFO L255 TraceCheckSpWp]: Trace formula consists of 67 conjuncts, 7 conjuncts are in the unsatisfiable core
[2024-11-07 15:57:46,600 INFO L278 TraceCheckSpWp]: Computing forward predicates...
[2024-11-07 15:57:46,624 INFO L173 IndexEqualityManager]: detected equality via solver
[2024-11-07 15:57:46,624 INFO L173 IndexEqualityManager]: detected equality via solver
[2024-11-07 15:57:46,625 INFO L173 IndexEqualityManager]: detected equality via solver
[2024-11-07 15:57:46,635 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 15:57:46,720 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2024-11-07 15:57:46,721 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 15:57:46,741 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 15:57:46,743 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect
[2024-11-07 15:57:46,743 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace
[2024-11-07 15:57:46,743 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1482123356]
[2024-11-07 15:57:46,743 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1482123356] provided 1 perfect and 0 imperfect interpolant sequences
[2024-11-07 15:57:46,743 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-11-07 15:57:46,743 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2024-11-07 15:57:46,743 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [830790174]
[2024-11-07 15:57:46,744 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-11-07 15:57:46,744 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2024-11-07 15:57:46,744 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF
[2024-11-07 15:57:46,745 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2024-11-07 15:57:46,745 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2024-11-07 15:57:46,745 INFO L87 Difference]: Start difference. First operand 233 states and 318 transitions. Second operand has 4 states, 4 states have (on average 2.25) internal successors, (9), 4 states have internal predecessors, (9), 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 15:57:47,318 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2024-11-07 15:57:47,318 INFO L93 Difference]: Finished difference Result 415 states and 557 transitions.
[2024-11-07 15:57:47,319 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states.
[2024-11-07 15:57:47,320 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.25) internal successors, (9), 4 states have internal predecessors, (9), 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 9
[2024-11-07 15:57:47,320 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2024-11-07 15:57:47,322 INFO L225 Difference]: With dead ends: 415
[2024-11-07 15:57:47,322 INFO L226 Difference]: Without dead ends: 415
[2024-11-07 15:57:47,322 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 6 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 15:57:47,323 INFO L432 NwaCegarLoop]: 325 mSDtfsCounter, 225 mSDsluCounter, 614 mSDsCounter, 0 mSdLazyCounter, 67 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 230 SdHoareTripleChecker+Valid, 939 SdHoareTripleChecker+Invalid, 68 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 67 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time
[2024-11-07 15:57:47,323 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [230 Valid, 939 Invalid, 68 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 67 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time]
[2024-11-07 15:57:47,324 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 415 states.
[2024-11-07 15:57:47,334 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 415 to 235.
[2024-11-07 15:57:47,334 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 235 states, 208 states have (on average 1.3365384615384615) internal successors, (278), 225 states have internal predecessors, (278), 22 states have call successors, (22), 4 states have call predecessors, (22), 3 states have return successors, (20), 6 states have call predecessors, (20), 20 states have call successors, (20)
[2024-11-07 15:57:47,338 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 235 states to 235 states and 320 transitions.
[2024-11-07 15:57:47,339 INFO L78 Accepts]: Start accepts. Automaton has 235 states and 320 transitions. Word has length 9
[2024-11-07 15:57:47,339 INFO L84 Accepts]: Finished accepts. word is rejected.
[2024-11-07 15:57:47,339 INFO L471 AbstractCegarLoop]: Abstraction has 235 states and 320 transitions.
[2024-11-07 15:57:47,339 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.25) internal successors, (9), 4 states have internal predecessors, (9), 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 15:57:47,339 INFO L276 IsEmpty]: Start isEmpty. Operand 235 states and 320 transitions.
[2024-11-07 15:57:47,340 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68
[2024-11-07 15:57:47,340 INFO L207 NwaCegarLoop]: Found error trace
[2024-11-07 15:57:47,340 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-11-07 15:57:47,345 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 15:57:47,540 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 15:57:47,541 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] ===
[2024-11-07 15:57:47,541 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-11-07 15:57:47,541 INFO L85 PathProgramCache]: Analyzing trace with hash -1164520091, now seen corresponding path program 1 times
[2024-11-07 15:57:47,542 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF
[2024-11-07 15:57:47,542 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2123237285]
[2024-11-07 15:57:47,542 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-07 15:57:47,542 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 15:57:47,542 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat
[2024-11-07 15:57:47,544 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 15:57:47,546 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 15:57:47,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 15:57:47,841 INFO L255 TraceCheckSpWp]: Trace formula consists of 335 conjuncts, 3 conjuncts are in the unsatisfiable core
[2024-11-07 15:57:47,845 INFO L278 TraceCheckSpWp]: Computing forward predicates...
[2024-11-07 15:57:47,881 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 15:57:47,882 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect
[2024-11-07 15:57:47,882 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace
[2024-11-07 15:57:47,882 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2123237285]
[2024-11-07 15:57:47,882 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2123237285] provided 1 perfect and 0 imperfect interpolant sequences
[2024-11-07 15:57:47,882 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-11-07 15:57:47,883 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2024-11-07 15:57:47,883 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1055015523]
[2024-11-07 15:57:47,883 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-11-07 15:57:47,883 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2024-11-07 15:57:47,884 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF
[2024-11-07 15:57:47,884 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2024-11-07 15:57:47,884 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2024-11-07 15:57:47,884 INFO L87 Difference]: Start difference. First operand 235 states and 320 transitions. Second operand has 4 states, 4 states have (on average 16.0) internal successors, (64), 4 states have internal predecessors, (64), 1 states have call successors, (3), 1 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-11-07 15:57:48,003 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2024-11-07 15:57:48,004 INFO L93 Difference]: Finished difference Result 238 states and 315 transitions.
[2024-11-07 15:57:48,004 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states.
[2024-11-07 15:57:48,004 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 16.0) internal successors, (64), 4 states have internal predecessors, (64), 1 states have call successors, (3), 1 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 67
[2024-11-07 15:57:48,004 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2024-11-07 15:57:48,005 INFO L225 Difference]: With dead ends: 238
[2024-11-07 15:57:48,005 INFO L226 Difference]: Without dead ends: 238
[2024-11-07 15:57:48,006 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 64 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 15:57:48,006 INFO L432 NwaCegarLoop]: 288 mSDtfsCounter, 30 mSDsluCounter, 557 mSDsCounter, 0 mSdLazyCounter, 43 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 845 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 15:57:48,006 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 845 Invalid, 65 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 43 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time]
[2024-11-07 15:57:48,007 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 238 states.
[2024-11-07 15:57:48,017 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 238 to 238.
[2024-11-07 15:57:48,019 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 238 states, 211 states have (on average 1.2938388625592416) internal successors, (273), 228 states have internal predecessors, (273), 22 states have call successors, (22), 4 states have call predecessors, (22), 3 states have return successors, (20), 6 states have call predecessors, (20), 20 states have call successors, (20)
[2024-11-07 15:57:48,020 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 238 states to 238 states and 315 transitions.
[2024-11-07 15:57:48,020 INFO L78 Accepts]: Start accepts. Automaton has 238 states and 315 transitions. Word has length 67
[2024-11-07 15:57:48,020 INFO L84 Accepts]: Finished accepts. word is rejected.
[2024-11-07 15:57:48,020 INFO L471 AbstractCegarLoop]: Abstraction has 238 states and 315 transitions.
[2024-11-07 15:57:48,021 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 16.0) internal successors, (64), 4 states have internal predecessors, (64), 1 states have call successors, (3), 1 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-11-07 15:57:48,021 INFO L276 IsEmpty]: Start isEmpty. Operand 238 states and 315 transitions.
[2024-11-07 15:57:48,022 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68
[2024-11-07 15:57:48,022 INFO L207 NwaCegarLoop]: Found error trace
[2024-11-07 15:57:48,022 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-11-07 15:57:48,034 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Forceful destruction successful, exit code 0
[2024-11-07 15:57:48,226 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 15:57:48,227 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] ===
[2024-11-07 15:57:48,227 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-11-07 15:57:48,227 INFO L85 PathProgramCache]: Analyzing trace with hash -1186406695, now seen corresponding path program 1 times
[2024-11-07 15:57:48,227 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF
[2024-11-07 15:57:48,227 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1057197715]
[2024-11-07 15:57:48,227 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-07 15:57:48,228 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 15:57:48,228 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat
[2024-11-07 15:57:48,230 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 15:57:48,231 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 15:57:48,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 15:57:48,506 INFO L255 TraceCheckSpWp]: Trace formula consists of 323 conjuncts, 6 conjuncts are in the unsatisfiable core
[2024-11-07 15:57:48,509 INFO L278 TraceCheckSpWp]: Computing forward predicates...
[2024-11-07 15:57:48,681 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 15:57:48,681 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect
[2024-11-07 15:57:48,681 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace
[2024-11-07 15:57:48,681 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1057197715]
[2024-11-07 15:57:48,681 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1057197715] provided 1 perfect and 0 imperfect interpolant sequences
[2024-11-07 15:57:48,681 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-11-07 15:57:48,681 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2024-11-07 15:57:48,681 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1006991375]
[2024-11-07 15:57:48,682 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-11-07 15:57:48,682 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states
[2024-11-07 15:57:48,682 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF
[2024-11-07 15:57:48,682 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2024-11-07 15:57:48,682 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20
[2024-11-07 15:57:48,683 INFO L87 Difference]: Start difference. First operand 238 states and 315 transitions. Second operand has 5 states, 5 states have (on average 12.8) internal successors, (64), 5 states have internal predecessors, (64), 1 states have call successors, (3), 1 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-11-07 15:57:48,775 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2024-11-07 15:57:48,776 INFO L93 Difference]: Finished difference Result 232 states and 305 transitions.
[2024-11-07 15:57:48,776 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states.
[2024-11-07 15:57:48,777 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.8) internal successors, (64), 5 states have internal predecessors, (64), 1 states have call successors, (3), 1 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 67
[2024-11-07 15:57:48,777 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2024-11-07 15:57:48,778 INFO L225 Difference]: With dead ends: 232
[2024-11-07 15:57:48,780 INFO L226 Difference]: Without dead ends: 232
[2024-11-07 15:57:48,781 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 63 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20
[2024-11-07 15:57:48,782 INFO L432 NwaCegarLoop]: 287 mSDtfsCounter, 0 mSDsluCounter, 831 mSDsCounter, 0 mSdLazyCounter, 59 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1118 SdHoareTripleChecker+Invalid, 62 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 59 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time
[2024-11-07 15:57:48,782 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1118 Invalid, 62 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 59 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time]
[2024-11-07 15:57:48,783 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 232 states.
[2024-11-07 15:57:48,793 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 232 to 232.
[2024-11-07 15:57:48,794 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 232 states, 205 states have (on average 1.2829268292682927) internal successors, (263), 222 states have internal predecessors, (263), 22 states have call successors, (22), 4 states have call predecessors, (22), 3 states have return successors, (20), 6 states have call predecessors, (20), 20 states have call successors, (20)
[2024-11-07 15:57:48,795 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 232 states to 232 states and 305 transitions.
[2024-11-07 15:57:48,795 INFO L78 Accepts]: Start accepts. Automaton has 232 states and 305 transitions. Word has length 67
[2024-11-07 15:57:48,795 INFO L84 Accepts]: Finished accepts. word is rejected.
[2024-11-07 15:57:48,795 INFO L471 AbstractCegarLoop]: Abstraction has 232 states and 305 transitions.
[2024-11-07 15:57:48,795 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.8) internal successors, (64), 5 states have internal predecessors, (64), 1 states have call successors, (3), 1 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-11-07 15:57:48,795 INFO L276 IsEmpty]: Start isEmpty. Operand 232 states and 305 transitions.
[2024-11-07 15:57:48,796 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68
[2024-11-07 15:57:48,796 INFO L207 NwaCegarLoop]: Found error trace
[2024-11-07 15:57:48,796 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-11-07 15:57:48,803 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Forceful destruction successful, exit code 0
[2024-11-07 15:57:48,997 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 15:57:48,997 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] ===
[2024-11-07 15:57:48,997 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-11-07 15:57:48,997 INFO L85 PathProgramCache]: Analyzing trace with hash -792039909, now seen corresponding path program 1 times
[2024-11-07 15:57:48,998 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF
[2024-11-07 15:57:48,998 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1492089820]
[2024-11-07 15:57:48,998 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-07 15:57:48,998 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 15:57:48,998 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat
[2024-11-07 15:57:49,001 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 15:57:49,002 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 15:57:49,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 15:57:49,260 INFO L255 TraceCheckSpWp]: Trace formula consists of 325 conjuncts, 3 conjuncts are in the unsatisfiable core
[2024-11-07 15:57:49,262 INFO L278 TraceCheckSpWp]: Computing forward predicates...
[2024-11-07 15:57:49,557 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 15:57:49,558 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect
[2024-11-07 15:57:49,558 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace
[2024-11-07 15:57:49,558 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1492089820]
[2024-11-07 15:57:49,558 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1492089820] provided 1 perfect and 0 imperfect interpolant sequences
[2024-11-07 15:57:49,558 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-11-07 15:57:49,558 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2024-11-07 15:57:49,558 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1476355173]
[2024-11-07 15:57:49,558 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-11-07 15:57:49,558 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2024-11-07 15:57:49,559 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF
[2024-11-07 15:57:49,559 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2024-11-07 15:57:49,559 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2024-11-07 15:57:49,559 INFO L87 Difference]: Start difference. First operand 232 states and 305 transitions. Second operand has 3 states, 3 states have (on average 21.333333333333332) internal successors, (64), 3 states have internal predecessors, (64), 1 states have call successors, (3), 1 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-11-07 15:57:50,451 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2024-11-07 15:57:50,451 INFO L93 Difference]: Finished difference Result 341 states and 436 transitions.
[2024-11-07 15:57:50,452 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states.
[2024-11-07 15:57:50,452 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 21.333333333333332) internal successors, (64), 3 states have internal predecessors, (64), 1 states have call successors, (3), 1 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 67
[2024-11-07 15:57:50,452 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2024-11-07 15:57:50,454 INFO L225 Difference]: With dead ends: 341
[2024-11-07 15:57:50,454 INFO L226 Difference]: Without dead ends: 341
[2024-11-07 15:57:50,454 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 65 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 15:57:50,455 INFO L432 NwaCegarLoop]: 347 mSDtfsCounter, 89 mSDsluCounter, 280 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 90 SdHoareTripleChecker+Valid, 627 SdHoareTripleChecker+Invalid, 34 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 30 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time
[2024-11-07 15:57:50,455 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [90 Valid, 627 Invalid, 34 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time]
[2024-11-07 15:57:50,456 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 341 states.
[2024-11-07 15:57:50,463 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 341 to 336.
[2024-11-07 15:57:50,464 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 336 states, 308 states have (on average 1.2597402597402598) internal successors, (388), 325 states have internal predecessors, (388), 23 states have call successors, (23), 4 states have call predecessors, (23), 3 states have return successors, (21), 7 states have call predecessors, (21), 21 states have call successors, (21)
[2024-11-07 15:57:50,465 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 336 states to 336 states and 432 transitions.
[2024-11-07 15:57:50,465 INFO L78 Accepts]: Start accepts. Automaton has 336 states and 432 transitions. Word has length 67
[2024-11-07 15:57:50,465 INFO L84 Accepts]: Finished accepts. word is rejected.
[2024-11-07 15:57:50,465 INFO L471 AbstractCegarLoop]: Abstraction has 336 states and 432 transitions.
[2024-11-07 15:57:50,465 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 21.333333333333332) internal successors, (64), 3 states have internal predecessors, (64), 1 states have call successors, (3), 1 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-11-07 15:57:50,466 INFO L276 IsEmpty]: Start isEmpty. Operand 336 states and 432 transitions.
[2024-11-07 15:57:50,467 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83
[2024-11-07 15:57:50,467 INFO L207 NwaCegarLoop]: Found error trace
[2024-11-07 15:57:50,467 INFO L215 NwaCegarLoop]: trace histogram [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]
[2024-11-07 15:57:50,474 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Forceful destruction successful, exit code 0
[2024-11-07 15:57:50,667 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 15:57:50,668 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] ===
[2024-11-07 15:57:50,668 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-11-07 15:57:50,668 INFO L85 PathProgramCache]: Analyzing trace with hash -175733518, now seen corresponding path program 1 times
[2024-11-07 15:57:50,669 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF
[2024-11-07 15:57:50,669 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1194429746]
[2024-11-07 15:57:50,669 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-07 15:57:50,669 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 15:57:50,669 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat
[2024-11-07 15:57:50,671 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 15:57:50,672 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 15:57:50,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 15:57:51,002 INFO L255 TraceCheckSpWp]: Trace formula consists of 454 conjuncts, 3 conjuncts are in the unsatisfiable core
[2024-11-07 15:57:51,004 INFO L278 TraceCheckSpWp]: Computing forward predicates...
[2024-11-07 15:57:51,027 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-11-07 15:57:51,028 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect
[2024-11-07 15:57:51,028 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace
[2024-11-07 15:57:51,028 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1194429746]
[2024-11-07 15:57:51,028 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1194429746] provided 1 perfect and 0 imperfect interpolant sequences
[2024-11-07 15:57:51,028 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-11-07 15:57:51,028 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2024-11-07 15:57:51,028 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1567258934]
[2024-11-07 15:57:51,028 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-11-07 15:57:51,028 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2024-11-07 15:57:51,028 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF
[2024-11-07 15:57:51,029 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2024-11-07 15:57:51,029 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2024-11-07 15:57:51,029 INFO L87 Difference]: Start difference. First operand 336 states and 432 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, (5), 2 states have call predecessors, (5), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2)
[2024-11-07 15:57:51,064 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2024-11-07 15:57:51,064 INFO L93 Difference]: Finished difference Result 339 states and 436 transitions.
[2024-11-07 15:57:51,065 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states.
[2024-11-07 15:57:51,065 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, (5), 2 states have call predecessors, (5), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) Word has length 82
[2024-11-07 15:57:51,065 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2024-11-07 15:57:51,066 INFO L225 Difference]: With dead ends: 339
[2024-11-07 15:57:51,067 INFO L226 Difference]: Without dead ends: 339
[2024-11-07 15:57:51,067 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 79 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 15:57:51,067 INFO L432 NwaCegarLoop]: 300 mSDtfsCounter, 0 mSDsluCounter, 596 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 896 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 15:57:51,067 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 896 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time]
[2024-11-07 15:57:51,068 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 339 states.
[2024-11-07 15:57:51,072 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 339 to 339.
[2024-11-07 15:57:51,073 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 339 states, 310 states have (on average 1.261290322580645) internal successors, (391), 328 states have internal predecessors, (391), 23 states have call successors, (23), 4 states have call predecessors, (23), 4 states have return successors, (22), 7 states have call predecessors, (22), 21 states have call successors, (22)
[2024-11-07 15:57:51,075 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 339 states to 339 states and 436 transitions.
[2024-11-07 15:57:51,075 INFO L78 Accepts]: Start accepts. Automaton has 339 states and 436 transitions. Word has length 82
[2024-11-07 15:57:51,075 INFO L84 Accepts]: Finished accepts. word is rejected.
[2024-11-07 15:57:51,075 INFO L471 AbstractCegarLoop]: Abstraction has 339 states and 436 transitions.
[2024-11-07 15:57:51,075 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, (5), 2 states have call predecessors, (5), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2)
[2024-11-07 15:57:51,075 INFO L276 IsEmpty]: Start isEmpty. Operand 339 states and 436 transitions.
[2024-11-07 15:57:51,076 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85
[2024-11-07 15:57:51,076 INFO L207 NwaCegarLoop]: Found error trace
[2024-11-07 15:57:51,076 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, 1]
[2024-11-07 15:57:51,085 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 15:57:51,277 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 15:57:51,277 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] ===
[2024-11-07 15:57:51,277 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-11-07 15:57:51,279 INFO L85 PathProgramCache]: Analyzing trace with hash 796595184, now seen corresponding path program 1 times
[2024-11-07 15:57:51,279 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF
[2024-11-07 15:57:51,279 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [40434660]
[2024-11-07 15:57:51,280 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-07 15:57:51,280 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3
[2024-11-07 15:57:51,280 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat
[2024-11-07 15:57:51,282 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 15:57:51,283 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Waiting until timeout for monitored process
[2024-11-07 15:57:51,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 15:57:51,628 INFO L255 TraceCheckSpWp]: Trace formula consists of 476 conjuncts, 4 conjuncts are in the unsatisfiable core
[2024-11-07 15:57:51,631 INFO L278 TraceCheckSpWp]: Computing forward predicates...
[2024-11-07 15:57:51,680 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 7 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked.
[2024-11-07 15:57:51,680 INFO L311 TraceCheckSpWp]: Computing backward predicates...
[2024-11-07 15:57:51,776 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked.
[2024-11-07 15:57:51,776 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace
[2024-11-07 15:57:51,776 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [40434660]
[2024-11-07 15:57:51,776 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [40434660] provided 0 perfect and 2 imperfect interpolant sequences
[2024-11-07 15:57:51,776 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences.
[2024-11-07 15:57:51,776 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 8
[2024-11-07 15:57:51,776 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [457733694]
[2024-11-07 15:57:51,776 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton
[2024-11-07 15:57:51,777 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states
[2024-11-07 15:57:51,777 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF
[2024-11-07 15:57:51,777 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants.
[2024-11-07 15:57:51,778 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56
[2024-11-07 15:57:51,778 INFO L87 Difference]: Start difference. First operand 339 states and 436 transitions. Second operand has 8 states, 8 states have (on average 10.625) internal successors, (85), 8 states have internal predecessors, (85), 2 states have call successors, (6), 2 states have call predecessors, (6), 4 states have return successors, (4), 1 states have call predecessors, (4), 2 states have call successors, (4)
[2024-11-07 15:57:51,945 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2024-11-07 15:57:51,945 INFO L93 Difference]: Finished difference Result 350 states and 452 transitions.
[2024-11-07 15:57:51,949 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states.
[2024-11-07 15:57:51,949 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 10.625) internal successors, (85), 8 states have internal predecessors, (85), 2 states have call successors, (6), 2 states have call predecessors, (6), 4 states have return successors, (4), 1 states have call predecessors, (4), 2 states have call successors, (4) Word has length 84
[2024-11-07 15:57:51,949 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2024-11-07 15:57:51,951 INFO L225 Difference]: With dead ends: 350
[2024-11-07 15:57:51,951 INFO L226 Difference]: Without dead ends: 350
[2024-11-07 15:57:51,951 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 169 GetRequests, 160 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 15:57:51,951 INFO L432 NwaCegarLoop]: 300 mSDtfsCounter, 4 mSDsluCounter, 894 mSDsCounter, 0 mSdLazyCounter, 46 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 1194 SdHoareTripleChecker+Invalid, 53 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 46 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time
[2024-11-07 15:57:51,951 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 1194 Invalid, 53 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 46 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time]
[2024-11-07 15:57:51,952 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 350 states.
[2024-11-07 15:57:51,957 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 350 to 348.
[2024-11-07 15:57:51,958 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 348 states, 318 states have (on average 1.2735849056603774) internal successors, (405), 336 states have internal predecessors, (405), 23 states have call successors, (23), 5 states have call predecessors, (23), 5 states have return successors, (22), 7 states have call predecessors, (22), 21 states have call successors, (22)
[2024-11-07 15:57:51,959 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 348 states to 348 states and 450 transitions.
[2024-11-07 15:57:51,960 INFO L78 Accepts]: Start accepts. Automaton has 348 states and 450 transitions. Word has length 84
[2024-11-07 15:57:51,960 INFO L84 Accepts]: Finished accepts. word is rejected.
[2024-11-07 15:57:51,960 INFO L471 AbstractCegarLoop]: Abstraction has 348 states and 450 transitions.
[2024-11-07 15:57:51,960 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 10.625) internal successors, (85), 8 states have internal predecessors, (85), 2 states have call successors, (6), 2 states have call predecessors, (6), 4 states have return successors, (4), 1 states have call predecessors, (4), 2 states have call successors, (4)
[2024-11-07 15:57:51,960 INFO L276 IsEmpty]: Start isEmpty. Operand 348 states and 450 transitions.
[2024-11-07 15:57:51,961 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89
[2024-11-07 15:57:51,961 INFO L207 NwaCegarLoop]: Found error trace
[2024-11-07 15:57:51,961 INFO L215 NwaCegarLoop]: trace histogram [6, 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]
[2024-11-07 15:57:51,969 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 15:57:52,165 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 15:57:52,166 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] ===
[2024-11-07 15:57:52,166 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-11-07 15:57:52,166 INFO L85 PathProgramCache]: Analyzing trace with hash 1063743762, now seen corresponding path program 2 times
[2024-11-07 15:57:52,166 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF
[2024-11-07 15:57:52,167 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1132228989]
[2024-11-07 15:57:52,167 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1
[2024-11-07 15:57:52,167 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 15:57:52,167 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat
[2024-11-07 15:57:52,168 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 15:57:52,169 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 15:57:53,099 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s)
[2024-11-07 15:57:53,099 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat
[2024-11-07 15:57:53,123 INFO L255 TraceCheckSpWp]: Trace formula consists of 520 conjuncts, 7 conjuncts are in the unsatisfiable core
[2024-11-07 15:57:53,125 INFO L278 TraceCheckSpWp]: Computing forward predicates...
[2024-11-07 15:57:53,196 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 18 proven. 10 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked.
[2024-11-07 15:57:53,196 INFO L311 TraceCheckSpWp]: Computing backward predicates...
[2024-11-07 15:57:53,403 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 0 proven. 27 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked.
[2024-11-07 15:57:53,404 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace
[2024-11-07 15:57:53,404 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1132228989]
[2024-11-07 15:57:53,404 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1132228989] provided 0 perfect and 2 imperfect interpolant sequences
[2024-11-07 15:57:53,404 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences.
[2024-11-07 15:57:53,404 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 14
[2024-11-07 15:57:53,404 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [293611073]
[2024-11-07 15:57:53,404 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton
[2024-11-07 15:57:53,404 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states
[2024-11-07 15:57:53,404 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF
[2024-11-07 15:57:53,405 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants.
[2024-11-07 15:57:53,405 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=121, Unknown=0, NotChecked=0, Total=182
[2024-11-07 15:57:53,405 INFO L87 Difference]: Start difference. First operand 348 states and 450 transitions. Second operand has 14 states, 14 states have (on average 6.5) internal successors, (91), 14 states have internal predecessors, (91), 2 states have call successors, (6), 2 states have call predecessors, (6), 4 states have return successors, (4), 1 states have call predecessors, (4), 2 states have call successors, (4)
[2024-11-07 15:57:54,026 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2024-11-07 15:57:54,027 INFO L93 Difference]: Finished difference Result 363 states and 472 transitions.
[2024-11-07 15:57:54,030 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states.
[2024-11-07 15:57:54,030 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 6.5) internal successors, (91), 14 states have internal predecessors, (91), 2 states have call successors, (6), 2 states have call predecessors, (6), 4 states have return successors, (4), 1 states have call predecessors, (4), 2 states have call successors, (4) Word has length 88
[2024-11-07 15:57:54,030 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2024-11-07 15:57:54,032 INFO L225 Difference]: With dead ends: 363
[2024-11-07 15:57:54,033 INFO L226 Difference]: Without dead ends: 359
[2024-11-07 15:57:54,033 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 183 GetRequests, 162 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=182, Invalid=324, Unknown=0, NotChecked=0, Total=506
[2024-11-07 15:57:54,034 INFO L432 NwaCegarLoop]: 300 mSDtfsCounter, 8 mSDsluCounter, 1493 mSDsCounter, 0 mSdLazyCounter, 161 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 1793 SdHoareTripleChecker+Invalid, 175 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 161 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time
[2024-11-07 15:57:54,034 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 1793 Invalid, 175 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 161 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time]
[2024-11-07 15:57:54,035 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 359 states.
[2024-11-07 15:57:54,043 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 359 to 357.
[2024-11-07 15:57:54,044 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 357 states, 327 states have (on average 1.275229357798165) internal successors, (417), 345 states have internal predecessors, (417), 23 states have call successors, (23), 5 states have call predecessors, (23), 5 states have return successors, (22), 7 states have call predecessors, (22), 21 states have call successors, (22)
[2024-11-07 15:57:54,046 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 357 states to 357 states and 462 transitions.
[2024-11-07 15:57:54,046 INFO L78 Accepts]: Start accepts. Automaton has 357 states and 462 transitions. Word has length 88
[2024-11-07 15:57:54,046 INFO L84 Accepts]: Finished accepts. word is rejected.
[2024-11-07 15:57:54,046 INFO L471 AbstractCegarLoop]: Abstraction has 357 states and 462 transitions.
[2024-11-07 15:57:54,046 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 6.5) internal successors, (91), 14 states have internal predecessors, (91), 2 states have call successors, (6), 2 states have call predecessors, (6), 4 states have return successors, (4), 1 states have call predecessors, (4), 2 states have call successors, (4)
[2024-11-07 15:57:54,046 INFO L276 IsEmpty]: Start isEmpty. Operand 357 states and 462 transitions.
[2024-11-07 15:57:54,048 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98
[2024-11-07 15:57:54,048 INFO L207 NwaCegarLoop]: Found error trace
[2024-11-07 15:57:54,048 INFO L215 NwaCegarLoop]: trace histogram [15, 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]
[2024-11-07 15:57:54,061 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 (9)] Forceful destruction successful, exit code 0
[2024-11-07 15:57:54,249 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 15:57:54,249 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] ===
[2024-11-07 15:57:54,249 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-11-07 15:57:54,249 INFO L85 PathProgramCache]: Analyzing trace with hash 194273585, now seen corresponding path program 3 times
[2024-11-07 15:57:54,250 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF
[2024-11-07 15:57:54,250 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1399243879]
[2024-11-07 15:57:54,250 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2
[2024-11-07 15:57:54,250 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 15:57:54,250 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat
[2024-11-07 15:57:54,251 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 15:57:54,252 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 15:57:56,369 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s)
[2024-11-07 15:57:56,369 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat
[2024-11-07 15:57:56,403 INFO L255 TraceCheckSpWp]: Trace formula consists of 553 conjuncts, 9 conjuncts are in the unsatisfiable core
[2024-11-07 15:57:56,406 INFO L278 TraceCheckSpWp]: Computing forward predicates...
[2024-11-07 15:57:56,548 INFO L134 CoverageAnalysis]: Checked inductivity of 139 backedges. 68 proven. 15 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked.
[2024-11-07 15:57:56,548 INFO L311 TraceCheckSpWp]: Computing backward predicates...
[2024-11-07 15:57:56,889 INFO L134 CoverageAnalysis]: Checked inductivity of 139 backedges. 68 proven. 15 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked.
[2024-11-07 15:57:56,889 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace
[2024-11-07 15:57:56,890 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1399243879]
[2024-11-07 15:57:56,890 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1399243879] provided 0 perfect and 2 imperfect interpolant sequences
[2024-11-07 15:57:56,890 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences.
[2024-11-07 15:57:56,890 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 16
[2024-11-07 15:57:56,890 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [937714885]
[2024-11-07 15:57:56,890 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton
[2024-11-07 15:57:56,890 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states
[2024-11-07 15:57:56,890 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF
[2024-11-07 15:57:56,891 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants.
[2024-11-07 15:57:56,891 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=162, Unknown=0, NotChecked=0, Total=240
[2024-11-07 15:57:56,891 INFO L87 Difference]: Start difference. First operand 357 states and 462 transitions. Second operand has 16 states, 16 states have (on average 5.5625) internal successors, (89), 16 states have internal predecessors, (89), 2 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3)
[2024-11-07 15:57:57,498 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2024-11-07 15:57:57,498 INFO L93 Difference]: Finished difference Result 368 states and 479 transitions.
[2024-11-07 15:57:57,498 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states.
[2024-11-07 15:57:57,499 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 5.5625) internal successors, (89), 16 states have internal predecessors, (89), 2 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) Word has length 97
[2024-11-07 15:57:57,499 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2024-11-07 15:57:57,500 INFO L225 Difference]: With dead ends: 368
[2024-11-07 15:57:57,500 INFO L226 Difference]: Without dead ends: 366
[2024-11-07 15:57:57,501 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 203 GetRequests, 178 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 85 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=248, Invalid=454, Unknown=0, NotChecked=0, Total=702
[2024-11-07 15:57:57,501 INFO L432 NwaCegarLoop]: 300 mSDtfsCounter, 8 mSDsluCounter, 2086 mSDsCounter, 0 mSdLazyCounter, 143 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 2386 SdHoareTripleChecker+Invalid, 147 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 143 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time
[2024-11-07 15:57:57,501 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 2386 Invalid, 147 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 143 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time]
[2024-11-07 15:57:57,502 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 366 states.
[2024-11-07 15:57:57,507 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 366 to 364.
[2024-11-07 15:57:57,508 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 364 states, 334 states have (on average 1.2874251497005988) internal successors, (430), 352 states have internal predecessors, (430), 23 states have call successors, (23), 5 states have call predecessors, (23), 5 states have return successors, (22), 7 states have call predecessors, (22), 21 states have call successors, (22)
[2024-11-07 15:57:57,509 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 364 states to 364 states and 475 transitions.
[2024-11-07 15:57:57,509 INFO L78 Accepts]: Start accepts. Automaton has 364 states and 475 transitions. Word has length 97
[2024-11-07 15:57:57,509 INFO L84 Accepts]: Finished accepts. word is rejected.
[2024-11-07 15:57:57,509 INFO L471 AbstractCegarLoop]: Abstraction has 364 states and 475 transitions.
[2024-11-07 15:57:57,510 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 5.5625) internal successors, (89), 16 states have internal predecessors, (89), 2 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3)
[2024-11-07 15:57:57,510 INFO L276 IsEmpty]: Start isEmpty. Operand 364 states and 475 transitions.
[2024-11-07 15:57:57,510 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105
[2024-11-07 15:57:57,510 INFO L207 NwaCegarLoop]: Found error trace
[2024-11-07 15:57:57,510 INFO L215 NwaCegarLoop]: trace histogram [22, 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]
[2024-11-07 15:57:57,529 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 15:57:57,711 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 15:57:57,711 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] ===
[2024-11-07 15:57:57,711 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-11-07 15:57:57,711 INFO L85 PathProgramCache]: Analyzing trace with hash 1136708818, now seen corresponding path program 4 times
[2024-11-07 15:57:57,712 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF
[2024-11-07 15:57:57,712 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1869744742]
[2024-11-07 15:57:57,712 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST
[2024-11-07 15:57:57,712 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 15:57:57,712 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat
[2024-11-07 15:57:57,714 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 15:57:57,715 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 15:57:58,283 INFO L227 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s)
[2024-11-07 15:57:58,283 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat
[2024-11-07 15:57:58,305 INFO L255 TraceCheckSpWp]: Trace formula consists of 696 conjuncts, 13 conjuncts are in the unsatisfiable core
[2024-11-07 15:57:58,307 INFO L278 TraceCheckSpWp]: Computing forward predicates...
[2024-11-07 15:57:58,524 INFO L134 CoverageAnalysis]: Checked inductivity of 279 backedges. 146 proven. 55 refuted. 0 times theorem prover too weak. 78 trivial. 0 not checked.
[2024-11-07 15:57:58,526 INFO L311 TraceCheckSpWp]: Computing backward predicates...
[2024-11-07 15:57:59,065 INFO L134 CoverageAnalysis]: Checked inductivity of 279 backedges. 0 proven. 200 refuted. 0 times theorem prover too weak. 79 trivial. 0 not checked.
[2024-11-07 15:57:59,065 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace
[2024-11-07 15:57:59,065 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1869744742]
[2024-11-07 15:57:59,065 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1869744742] provided 0 perfect and 2 imperfect interpolant sequences
[2024-11-07 15:57:59,066 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences.
[2024-11-07 15:57:59,066 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 26
[2024-11-07 15:57:59,066 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1012346087]
[2024-11-07 15:57:59,066 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton
[2024-11-07 15:57:59,066 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 26 states
[2024-11-07 15:57:59,066 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF
[2024-11-07 15:57:59,067 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants.
[2024-11-07 15:57:59,067 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=193, Invalid=457, Unknown=0, NotChecked=0, Total=650
[2024-11-07 15:57:59,067 INFO L87 Difference]: Start difference. First operand 364 states and 475 transitions. Second operand has 26 states, 26 states have (on average 3.9615384615384617) internal successors, (103), 26 states have internal predecessors, (103), 2 states have call successors, (6), 2 states have call predecessors, (6), 4 states have return successors, (4), 1 states have call predecessors, (4), 2 states have call successors, (4)
[2024-11-07 15:58:00,880 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2024-11-07 15:58:00,880 INFO L93 Difference]: Finished difference Result 382 states and 503 transitions.
[2024-11-07 15:58:00,881 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states.
[2024-11-07 15:58:00,881 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 26 states have (on average 3.9615384615384617) internal successors, (103), 26 states have internal predecessors, (103), 2 states have call successors, (6), 2 states have call predecessors, (6), 4 states have return successors, (4), 1 states have call predecessors, (4), 2 states have call successors, (4) Word has length 104
[2024-11-07 15:58:00,881 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2024-11-07 15:58:00,882 INFO L225 Difference]: With dead ends: 382
[2024-11-07 15:58:00,882 INFO L226 Difference]: Without dead ends: 378
[2024-11-07 15:58:00,883 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 227 GetRequests, 182 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 100 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=728, Invalid=1434, Unknown=0, NotChecked=0, Total=2162
[2024-11-07 15:58:00,883 INFO L432 NwaCegarLoop]: 300 mSDtfsCounter, 13 mSDsluCounter, 3281 mSDsCounter, 0 mSdLazyCounter, 527 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 3581 SdHoareTripleChecker+Invalid, 543 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 527 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time
[2024-11-07 15:58:00,883 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 3581 Invalid, 543 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 527 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time]
[2024-11-07 15:58:00,884 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 378 states.
[2024-11-07 15:58:00,890 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 378 to 376.
[2024-11-07 15:58:00,891 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 376 states, 346 states have (on average 1.277456647398844) internal successors, (442), 364 states have internal predecessors, (442), 23 states have call successors, (23), 5 states have call predecessors, (23), 5 states have return successors, (22), 7 states have call predecessors, (22), 21 states have call successors, (22)
[2024-11-07 15:58:00,893 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 376 states to 376 states and 487 transitions.
[2024-11-07 15:58:00,893 INFO L78 Accepts]: Start accepts. Automaton has 376 states and 487 transitions. Word has length 104
[2024-11-07 15:58:00,893 INFO L84 Accepts]: Finished accepts. word is rejected.
[2024-11-07 15:58:00,893 INFO L471 AbstractCegarLoop]: Abstraction has 376 states and 487 transitions.
[2024-11-07 15:58:00,893 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 26 states have (on average 3.9615384615384617) internal successors, (103), 26 states have internal predecessors, (103), 2 states have call successors, (6), 2 states have call predecessors, (6), 4 states have return successors, (4), 1 states have call predecessors, (4), 2 states have call successors, (4)
[2024-11-07 15:58:00,893 INFO L276 IsEmpty]: Start isEmpty. Operand 376 states and 487 transitions.
[2024-11-07 15:58:00,894 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117
[2024-11-07 15:58:00,894 INFO L207 NwaCegarLoop]: Found error trace
[2024-11-07 15:58:00,894 INFO L215 NwaCegarLoop]: trace histogram [34, 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]
[2024-11-07 15:58:00,910 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Ended with exit code 0
[2024-11-07 15:58:01,095 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 15:58:01,096 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] ===
[2024-11-07 15:58:01,096 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-11-07 15:58:01,096 INFO L85 PathProgramCache]: Analyzing trace with hash 240653714, now seen corresponding path program 5 times
[2024-11-07 15:58:01,097 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF
[2024-11-07 15:58:01,097 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [939249840]
[2024-11-07 15:58:01,097 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1
[2024-11-07 15:58:01,097 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 15:58:01,097 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat
[2024-11-07 15:58:01,099 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 15:58:01,099 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 15:58:02,310 INFO L227 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 13 check-sat command(s)
[2024-11-07 15:58:02,310 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat
[2024-11-07 15:58:02,340 INFO L255 TraceCheckSpWp]: Trace formula consists of 828 conjuncts, 25 conjuncts are in the unsatisfiable core
[2024-11-07 15:58:02,342 INFO L278 TraceCheckSpWp]: Computing forward predicates...
[2024-11-07 15:58:02,736 INFO L134 CoverageAnalysis]: Checked inductivity of 633 backedges. 302 proven. 253 refuted. 0 times theorem prover too weak. 78 trivial. 0 not checked.
[2024-11-07 15:58:02,736 INFO L311 TraceCheckSpWp]: Computing backward predicates...
[2024-11-07 15:58:03,988 INFO L134 CoverageAnalysis]: Checked inductivity of 633 backedges. 0 proven. 554 refuted. 0 times theorem prover too weak. 79 trivial. 0 not checked.
[2024-11-07 15:58:03,988 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace
[2024-11-07 15:58:03,988 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [939249840]
[2024-11-07 15:58:03,988 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [939249840] provided 0 perfect and 2 imperfect interpolant sequences
[2024-11-07 15:58:03,988 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences.
[2024-11-07 15:58:03,988 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 26] total 50
[2024-11-07 15:58:03,988 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [335738891]
[2024-11-07 15:58:03,989 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton
[2024-11-07 15:58:03,989 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 50 states
[2024-11-07 15:58:03,989 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF
[2024-11-07 15:58:03,990 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants.
[2024-11-07 15:58:03,991 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=672, Invalid=1778, Unknown=0, NotChecked=0, Total=2450
[2024-11-07 15:58:03,991 INFO L87 Difference]: Start difference. First operand 376 states and 487 transitions. Second operand has 50 states, 50 states have (on average 2.54) internal successors, (127), 50 states have internal predecessors, (127), 2 states have call successors, (6), 2 states have call predecessors, (6), 4 states have return successors, (4), 1 states have call predecessors, (4), 2 states have call successors, (4)
[2024-11-07 15:58:09,270 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2024-11-07 15:58:09,270 INFO L93 Difference]: Finished difference Result 415 states and 557 transitions.
[2024-11-07 15:58:09,271 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 71 states.
[2024-11-07 15:58:09,271 INFO L78 Accepts]: Start accepts. Automaton has has 50 states, 50 states have (on average 2.54) internal successors, (127), 50 states have internal predecessors, (127), 2 states have call successors, (6), 2 states have call predecessors, (6), 4 states have return successors, (4), 1 states have call predecessors, (4), 2 states have call successors, (4) Word has length 116
[2024-11-07 15:58:09,272 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2024-11-07 15:58:09,273 INFO L225 Difference]: With dead ends: 415
[2024-11-07 15:58:09,273 INFO L226 Difference]: Without dead ends: 411
[2024-11-07 15:58:09,275 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 273 GetRequests, 182 SyntacticMatches, 0 SemanticMatches, 91 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 465 ImplicationChecksByTransitivity, 4.3s TimeCoverageRelationStatistics Valid=2713, Invalid=5843, Unknown=0, NotChecked=0, Total=8556
[2024-11-07 15:58:09,277 INFO L432 NwaCegarLoop]: 300 mSDtfsCounter, 26 mSDsluCounter, 7447 mSDsCounter, 0 mSdLazyCounter, 1890 mSolverCounterSat, 44 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 7747 SdHoareTripleChecker+Invalid, 1934 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 44 IncrementalHoareTripleChecker+Valid, 1890 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time
[2024-11-07 15:58:09,277 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 7747 Invalid, 1934 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [44 Valid, 1890 Invalid, 0 Unknown, 0 Unchecked, 2.2s Time]
[2024-11-07 15:58:09,278 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 411 states.
[2024-11-07 15:58:09,284 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 411 to 409.
[2024-11-07 15:58:09,285 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 409 states, 379 states have (on average 1.2823218997361479) internal successors, (486), 397 states have internal predecessors, (486), 23 states have call successors, (23), 5 states have call predecessors, (23), 5 states have return successors, (22), 7 states have call predecessors, (22), 21 states have call successors, (22)
[2024-11-07 15:58:09,287 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 409 states to 409 states and 531 transitions.
[2024-11-07 15:58:09,288 INFO L78 Accepts]: Start accepts. Automaton has 409 states and 531 transitions. Word has length 116
[2024-11-07 15:58:09,288 INFO L84 Accepts]: Finished accepts. word is rejected.
[2024-11-07 15:58:09,288 INFO L471 AbstractCegarLoop]: Abstraction has 409 states and 531 transitions.
[2024-11-07 15:58:09,289 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 50 states, 50 states have (on average 2.54) internal successors, (127), 50 states have internal predecessors, (127), 2 states have call successors, (6), 2 states have call predecessors, (6), 4 states have return successors, (4), 1 states have call predecessors, (4), 2 states have call successors, (4)
[2024-11-07 15:58:09,289 INFO L276 IsEmpty]: Start isEmpty. Operand 409 states and 531 transitions.
[2024-11-07 15:58:09,290 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150
[2024-11-07 15:58:09,291 INFO L207 NwaCegarLoop]: Found error trace
[2024-11-07 15:58:09,291 INFO L215 NwaCegarLoop]: trace histogram [67, 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]
[2024-11-07 15:58:09,307 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 15:58:09,491 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 15:58:09,492 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] ===
[2024-11-07 15:58:09,492 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-11-07 15:58:09,492 INFO L85 PathProgramCache]: Analyzing trace with hash -620327887, now seen corresponding path program 6 times
[2024-11-07 15:58:09,493 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF
[2024-11-07 15:58:09,493 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1654763465]
[2024-11-07 15:58:09,493 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE
[2024-11-07 15:58:09,493 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 15:58:09,493 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat
[2024-11-07 15:58:09,496 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 15:58:09,498 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 15:58:18,801 INFO L227 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 24 check-sat command(s)
[2024-11-07 15:58:18,801 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat
[2024-11-07 15:58:18,860 INFO L255 TraceCheckSpWp]: Trace formula consists of 1191 conjuncts, 27 conjuncts are in the unsatisfiable core
[2024-11-07 15:58:18,863 INFO L278 TraceCheckSpWp]: Computing forward predicates...
[2024-11-07 15:58:19,295 INFO L134 CoverageAnalysis]: Checked inductivity of 2349 backedges. 1082 proven. 276 refuted. 0 times theorem prover too weak. 991 trivial. 0 not checked.
[2024-11-07 15:58:19,295 INFO L311 TraceCheckSpWp]: Computing backward predicates...
[2024-11-07 15:58:21,056 INFO L134 CoverageAnalysis]: Checked inductivity of 2349 backedges. 1082 proven. 276 refuted. 0 times theorem prover too weak. 991 trivial. 0 not checked.
[2024-11-07 15:58:21,057 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace
[2024-11-07 15:58:21,057 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1654763465]
[2024-11-07 15:58:21,057 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1654763465] provided 0 perfect and 2 imperfect interpolant sequences
[2024-11-07 15:58:21,057 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences.
[2024-11-07 15:58:21,057 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 27] total 52
[2024-11-07 15:58:21,057 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [914932004]
[2024-11-07 15:58:21,057 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton
[2024-11-07 15:58:21,057 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 52 states
[2024-11-07 15:58:21,057 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF
[2024-11-07 15:58:21,058 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants.
[2024-11-07 15:58:21,059 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=726, Invalid=1926, Unknown=0, NotChecked=0, Total=2652
[2024-11-07 15:58:21,059 INFO L87 Difference]: Start difference. First operand 409 states and 531 transitions. Second operand has 52 states, 52 states have (on average 2.4038461538461537) internal successors, (125), 52 states have internal predecessors, (125), 2 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3)
[2024-11-07 15:58:28,726 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2024-11-07 15:58:28,726 INFO L93 Difference]: Finished difference Result 438 states and 584 transitions.
[2024-11-07 15:58:28,727 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 76 states.
[2024-11-07 15:58:28,727 INFO L78 Accepts]: Start accepts. Automaton has has 52 states, 52 states have (on average 2.4038461538461537) internal successors, (125), 52 states have internal predecessors, (125), 2 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) Word has length 149
[2024-11-07 15:58:28,727 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2024-11-07 15:58:28,730 INFO L225 Difference]: With dead ends: 438
[2024-11-07 15:58:28,730 INFO L226 Difference]: Without dead ends: 436
[2024-11-07 15:58:28,732 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 343 GetRequests, 246 SyntacticMatches, 0 SemanticMatches, 97 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1633 ImplicationChecksByTransitivity, 7.3s TimeCoverageRelationStatistics Valid=3146, Invalid=6556, Unknown=0, NotChecked=0, Total=9702
[2024-11-07 15:58:28,733 INFO L432 NwaCegarLoop]: 300 mSDtfsCounter, 27 mSDsluCounter, 7746 mSDsCounter, 0 mSdLazyCounter, 1397 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 8046 SdHoareTripleChecker+Invalid, 1405 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 1397 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time
[2024-11-07 15:58:28,733 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [27 Valid, 8046 Invalid, 1405 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 1397 Invalid, 0 Unknown, 0 Unchecked, 2.0s Time]
[2024-11-07 15:58:28,734 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 436 states.
[2024-11-07 15:58:28,740 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 436 to 434.
[2024-11-07 15:58:28,741 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 434 states, 404 states have (on average 1.3242574257425743) internal successors, (535), 422 states have internal predecessors, (535), 23 states have call successors, (23), 5 states have call predecessors, (23), 5 states have return successors, (22), 7 states have call predecessors, (22), 21 states have call successors, (22)
[2024-11-07 15:58:28,743 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 434 states to 434 states and 580 transitions.
[2024-11-07 15:58:28,743 INFO L78 Accepts]: Start accepts. Automaton has 434 states and 580 transitions. Word has length 149
[2024-11-07 15:58:28,743 INFO L84 Accepts]: Finished accepts. word is rejected.
[2024-11-07 15:58:28,743 INFO L471 AbstractCegarLoop]: Abstraction has 434 states and 580 transitions.
[2024-11-07 15:58:28,744 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 52 states, 52 states have (on average 2.4038461538461537) internal successors, (125), 52 states have internal predecessors, (125), 2 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3)
[2024-11-07 15:58:28,744 INFO L276 IsEmpty]: Start isEmpty. Operand 434 states and 580 transitions.
[2024-11-07 15:58:28,745 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 175
[2024-11-07 15:58:28,745 INFO L207 NwaCegarLoop]: Found error trace
[2024-11-07 15:58:28,745 INFO L215 NwaCegarLoop]: trace histogram [92, 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]
[2024-11-07 15:58:28,776 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (13)] Forceful destruction successful, exit code 0
[2024-11-07 15:58:28,945 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 15:58:28,945 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] ===
[2024-11-07 15:58:28,946 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-11-07 15:58:28,946 INFO L85 PathProgramCache]: Analyzing trace with hash -926835534, now seen corresponding path program 7 times
[2024-11-07 15:58:28,946 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF
[2024-11-07 15:58:28,946 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2119849670]
[2024-11-07 15:58:28,946 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY
[2024-11-07 15:58:28,946 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 15:58:28,946 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat
[2024-11-07 15:58:28,950 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 15:58:28,951 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 15:58:30,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 15:58:30,419 INFO L255 TraceCheckSpWp]: Trace formula consists of 1466 conjuncts, 51 conjuncts are in the unsatisfiable core
[2024-11-07 15:58:30,427 INFO L278 TraceCheckSpWp]: Computing forward predicates...
[2024-11-07 15:58:31,876 INFO L134 CoverageAnalysis]: Checked inductivity of 4374 backedges. 2207 proven. 1176 refuted. 0 times theorem prover too weak. 991 trivial. 0 not checked.
[2024-11-07 15:58:31,876 INFO L311 TraceCheckSpWp]: Computing backward predicates...
[2024-11-07 15:58:37,412 INFO L134 CoverageAnalysis]: Checked inductivity of 4374 backedges. 2207 proven. 1176 refuted. 0 times theorem prover too weak. 991 trivial. 0 not checked.
[2024-11-07 15:58:37,412 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace
[2024-11-07 15:58:37,412 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2119849670]
[2024-11-07 15:58:37,412 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2119849670] provided 0 perfect and 2 imperfect interpolant sequences
[2024-11-07 15:58:37,412 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences.
[2024-11-07 15:58:37,412 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [52, 52] total 102
[2024-11-07 15:58:37,412 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1028021935]
[2024-11-07 15:58:37,413 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton
[2024-11-07 15:58:37,413 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 102 states
[2024-11-07 15:58:37,413 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF
[2024-11-07 15:58:37,417 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 102 interpolants.
[2024-11-07 15:58:37,419 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=2701, Invalid=7601, Unknown=0, NotChecked=0, Total=10302
[2024-11-07 15:58:37,420 INFO L87 Difference]: Start difference. First operand 434 states and 580 transitions. Second operand has 102 states, 102 states have (on average 1.7156862745098038) internal successors, (175), 102 states have internal predecessors, (175), 2 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3)
[2024-11-07 15:59:08,903 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2024-11-07 15:59:08,904 INFO L93 Difference]: Finished difference Result 492 states and 691 transitions.
[2024-11-07 15:59:08,905 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 151 states.
[2024-11-07 15:59:08,905 INFO L78 Accepts]: Start accepts. Automaton has has 102 states, 102 states have (on average 1.7156862745098038) internal successors, (175), 102 states have internal predecessors, (175), 2 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) Word has length 174
[2024-11-07 15:59:08,905 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2024-11-07 15:59:08,907 INFO L225 Difference]: With dead ends: 492
[2024-11-07 15:59:08,907 INFO L226 Difference]: Without dead ends: 492
[2024-11-07 15:59:08,914 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 443 GetRequests, 246 SyntacticMatches, 0 SemanticMatches, 197 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7008 ImplicationChecksByTransitivity, 31.5s TimeCoverageRelationStatistics Valid=12595, Invalid=26807, Unknown=0, NotChecked=0, Total=39402
[2024-11-07 15:59:08,915 INFO L432 NwaCegarLoop]: 299 mSDtfsCounter, 57 mSDsluCounter, 14556 mSDsCounter, 0 mSdLazyCounter, 5195 mSolverCounterSat, 68 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 57 SdHoareTripleChecker+Valid, 14855 SdHoareTripleChecker+Invalid, 5263 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 68 IncrementalHoareTripleChecker+Valid, 5195 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.6s IncrementalHoareTripleChecker+Time
[2024-11-07 15:59:08,916 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [57 Valid, 14855 Invalid, 5263 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [68 Valid, 5195 Invalid, 0 Unknown, 0 Unchecked, 5.6s Time]
[2024-11-07 15:59:08,916 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 492 states.
[2024-11-07 15:59:08,924 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 492 to 488.
[2024-11-07 15:59:08,924 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 488 states, 458 states have (on average 1.4017467248908297) internal successors, (642), 476 states have internal predecessors, (642), 23 states have call successors, (23), 5 states have call predecessors, (23), 5 states have return successors, (22), 7 states have call predecessors, (22), 21 states have call successors, (22)
[2024-11-07 15:59:08,926 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 488 states to 488 states and 687 transitions.
[2024-11-07 15:59:08,926 INFO L78 Accepts]: Start accepts. Automaton has 488 states and 687 transitions. Word has length 174
[2024-11-07 15:59:08,926 INFO L84 Accepts]: Finished accepts. word is rejected.
[2024-11-07 15:59:08,926 INFO L471 AbstractCegarLoop]: Abstraction has 488 states and 687 transitions.
[2024-11-07 15:59:08,926 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 102 states, 102 states have (on average 1.7156862745098038) internal successors, (175), 102 states have internal predecessors, (175), 2 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3)
[2024-11-07 15:59:08,926 INFO L276 IsEmpty]: Start isEmpty. Operand 488 states and 687 transitions.
[2024-11-07 15:59:08,928 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 225
[2024-11-07 15:59:08,928 INFO L207 NwaCegarLoop]: Found error trace
[2024-11-07 15:59:08,928 INFO L215 NwaCegarLoop]: trace histogram [142, 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]
[2024-11-07 15:59:08,949 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (14)] Forceful destruction successful, exit code 0
[2024-11-07 15:59:09,130 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 15:59:09,130 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] ===
[2024-11-07 15:59:09,131 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-11-07 15:59:09,131 INFO L85 PathProgramCache]: Analyzing trace with hash -619938414, now seen corresponding path program 8 times
[2024-11-07 15:59:09,131 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF
[2024-11-07 15:59:09,132 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1413725745]
[2024-11-07 15:59:09,132 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1
[2024-11-07 15:59:09,132 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 15:59:09,132 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat
[2024-11-07 15:59:09,134 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 15:59:09,136 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 15:59:11,402 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s)
[2024-11-07 15:59:11,402 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat
[2024-11-07 15:59:11,458 INFO L255 TraceCheckSpWp]: Trace formula consists of 2016 conjuncts, 101 conjuncts are in the unsatisfiable core
[2024-11-07 15:59:11,464 INFO L278 TraceCheckSpWp]: Computing forward predicates...