./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/memsafety/test-0137.i --full-output --architecture 32bit
--------------------------------------------------------------------------------
Checking for memory safety (deref-memtrack)
Using default analysis
Version 4f9af400
extending candidate: java
['java']
extending candidate: /usr/bin/java
['java', '/usr/bin/java']
extending candidate: /opt/oracle-jdk-bin-*/bin/java
['java', '/usr/bin/java']
extending candidate: /opt/openjdk-*/bin/java
['java', '/usr/bin/java']
extending candidate: /usr/lib/jvm/java-*-openjdk-amd64/bin/java
['java', '/usr/bin/java', '/usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java', '/usr/lib/jvm/java-17-openjdk-amd64/bin/java', '/usr/lib/jvm/java-11-openjdk-amd64/bin/java', '/usr/lib/jvm/java-1.17.0-openjdk-amd64/bin/java']
['/root/.sdkman/candidates/java/21.0.5-tem/bin/java', '-Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config', '-Xmx15G', '-Xms4m', '-jar', '/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar', '-data', '@noDefault', '-ultimatedata', '/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data', '-tc', '/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml', '-i', '../sv-benchmarks/c/memsafety/test-0137.i', '-s', '/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf', '--cacsl2boogietranslator.entry.function', 'main', '--witnessprinter.witness.directory', '/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux', '--witnessprinter.witness.filename', 'witness', '--witnessprinter.write.witness.besides.input.file', 'false', '--witnessprinter.graph.data.specification', 'CHECK( init(main()), LTL(G valid-free) )\nCHECK( init(main()), LTL(G valid-deref) )\nCHECK( init(main()), LTL(G valid-memtrack) )\n\n', '--witnessprinter.graph.data.producer', 'Automizer', '--witnessprinter.graph.data.architecture', '32bit', '--witnessprinter.graph.data.programhash', '1c2d362b3c58f37a9b1e964b448eb3d54c85d26676417295a73853b3a7cc716a']
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/memsafety/test-0137.i -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) )
CHECK( init(main()), LTL(G valid-deref) )
CHECK( init(main()), LTL(G valid-memtrack) )
--witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 1c2d362b3c58f37a9b1e964b448eb3d54c85d26676417295a73853b3a7cc716a
--- Real Ultimate output ---
This is Ultimate 0.3.0-?-4f9af40
[2024-11-07 16:26:22,776 INFO L188 SettingsManager]: Resetting all preferences to default values...
[2024-11-07 16:26:22,854 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf
[2024-11-07 16:26:22,859 WARN L101 SettingsManager]: Preference file contains the following unknown settings:
[2024-11-07 16:26:22,860 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class
[2024-11-07 16:26:22,878 INFO L130 SettingsManager]: Preferences different from defaults after loading the file:
[2024-11-07 16:26:22,879 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults:
[2024-11-07 16:26:22,879 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR;
[2024-11-07 16:26:22,879 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults:
[2024-11-07 16:26:22,879 INFO L153 SettingsManager]: * Use memory slicer=true
[2024-11-07 16:26:22,879 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults:
[2024-11-07 16:26:22,879 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS
[2024-11-07 16:26:22,880 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults:
[2024-11-07 16:26:22,880 INFO L153 SettingsManager]: * Create parallel compositions if possible=false
[2024-11-07 16:26:22,880 INFO L153 SettingsManager]: * Use SBE=true
[2024-11-07 16:26:22,880 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults:
[2024-11-07 16:26:22,880 INFO L153 SettingsManager]: * sizeof long=4
[2024-11-07 16:26:22,881 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true
[2024-11-07 16:26:22,882 INFO L153 SettingsManager]: * sizeof POINTER=4
[2024-11-07 16:26:22,882 INFO L153 SettingsManager]: * Check division by zero=IGNORE
[2024-11-07 16:26:22,882 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true
[2024-11-07 16:26:22,882 INFO L153 SettingsManager]: * Bitprecise bitfields=true
[2024-11-07 16:26:22,883 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true
[2024-11-07 16:26:22,883 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE
[2024-11-07 16:26:22,883 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true
[2024-11-07 16:26:22,883 INFO L153 SettingsManager]: * Allow undefined functions=false
[2024-11-07 16:26:22,883 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false
[2024-11-07 16:26:22,884 INFO L153 SettingsManager]: * sizeof long double=12
[2024-11-07 16:26:22,884 INFO L153 SettingsManager]: * Use constant arrays=true
[2024-11-07 16:26:22,884 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults:
[2024-11-07 16:26:22,884 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements
[2024-11-07 16:26:22,884 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true
[2024-11-07 16:26:22,885 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode
[2024-11-07 16:26:22,885 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000
[2024-11-07 16:26:22,885 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults:
[2024-11-07 16:26:22,885 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP
[2024-11-07 16:26:22,885 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL
[2024-11-07 16:26:22,885 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in
[2024-11-07 16:26:22,885 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false
[2024-11-07 16:26:22,885 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET
[2024-11-07 16:26:22,886 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO
[2024-11-07 16:26:22,886 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode
[2024-11-07 16:26:22,886 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC
Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main
Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux
Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness
Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false
Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G valid-free) )
CHECK( init(main()), LTL(G valid-deref) )
CHECK( init(main()), LTL(G valid-memtrack) )
Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer
Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit
Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 1c2d362b3c58f37a9b1e964b448eb3d54c85d26676417295a73853b3a7cc716a
[2024-11-07 16:26:23,156 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp
[2024-11-07 16:26:23,163 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized
[2024-11-07 16:26:23,166 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected.
[2024-11-07 16:26:23,167 INFO L270 PluginConnector]: Initializing CDTParser...
[2024-11-07 16:26:23,167 INFO L274 PluginConnector]: CDTParser initialized
[2024-11-07 16:26:23,168 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/memsafety/test-0137.i
[2024-11-07 16:26:24,462 INFO L533 CDTParser]: Created temporary CDT project at NULL
[2024-11-07 16:26:24,703 INFO L384 CDTParser]: Found 1 translation units.
[2024-11-07 16:26:24,704 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/memsafety/test-0137.i
[2024-11-07 16:26:24,716 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/8f269d437/5c077b8ff91d49a9833313f211ae6c2f/FLAG8bc4b6a9f
[2024-11-07 16:26:24,733 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/8f269d437/5c077b8ff91d49a9833313f211ae6c2f
[2024-11-07 16:26:24,736 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] #######################
[2024-11-07 16:26:24,738 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements.
[2024-11-07 16:26:24,740 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator----------------------------
[2024-11-07 16:26:24,740 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator...
[2024-11-07 16:26:24,744 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized
[2024-11-07 16:26:24,745 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 04:26:24" (1/1) ...
[2024-11-07 16:26:24,746 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@67147c88 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:26:24, skipping insertion in model container
[2024-11-07 16:26:24,746 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 04:26:24" (1/1) ...
[2024-11-07 16:26:24,781 INFO L175 MainTranslator]: Built tables and reachable declarations
[2024-11-07 16:26:25,011 INFO L210 PostProcessor]: Analyzing one entry point: main
[2024-11-07 16:26:25,020 ERROR L321 MainTranslator]: Unsupported Syntax: Found a cast between two array/pointer types of different sizes while using memory model HoenickeLindenmann_Original (while Not using bitvector translation)
[2024-11-07 16:26:25,020 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver@7885c72e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:26:25, skipping insertion in model container
[2024-11-07 16:26:25,020 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator----------------------------
[2024-11-07 16:26:25,021 INFO L186 ToolchainWalker]: Toolchain execution was canceled (user or tool) before executing de.uni_freiburg.informatik.ultimate.boogie.procedureinliner
[2024-11-07 16:26:25,023 INFO L158 Benchmark]: Toolchain (without parser) took 284.84ms. Allocated memory is still 117.4MB. Free memory was 90.7MB in the beginning and 78.2MB in the end (delta: 12.5MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB.
[2024-11-07 16:26:25,023 INFO L158 Benchmark]: CDTParser took 0.16ms. Allocated memory is still 117.4MB. Free memory is still 81.6MB. There was no memory consumed. Max. memory is 16.1GB.
[2024-11-07 16:26:25,024 INFO L158 Benchmark]: CACSL2BoogieTranslator took 281.67ms. Allocated memory is still 117.4MB. Free memory was 90.6MB in the beginning and 78.2MB in the end (delta: 12.4MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB.
[2024-11-07 16:26:25,025 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.6MB. There was no memory consumed. Max. memory is 16.1GB.
* CACSL2BoogieTranslator took 281.67ms. Allocated memory is still 117.4MB. Free memory was 90.6MB in the beginning and 78.2MB in the end (delta: 12.4MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB.
* Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator:
- UnsupportedSyntaxResult [Line: 585]: 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/memsafety/test-0137.i -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) )
CHECK( init(main()), LTL(G valid-deref) )
CHECK( init(main()), LTL(G valid-memtrack) )
--witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 1c2d362b3c58f37a9b1e964b448eb3d54c85d26676417295a73853b3a7cc716a
--- Real Ultimate output ---
This is Ultimate 0.3.0-?-4f9af40
[2024-11-07 16:26:27,003 INFO L188 SettingsManager]: Resetting all preferences to default values...
[2024-11-07 16:26:27,094 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf
[2024-11-07 16:26:27,100 WARN L101 SettingsManager]: Preference file contains the following unknown settings:
[2024-11-07 16:26:27,102 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class
[2024-11-07 16:26:27,132 INFO L130 SettingsManager]: Preferences different from defaults after loading the file:
[2024-11-07 16:26:27,132 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults:
[2024-11-07 16:26:27,133 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR;
[2024-11-07 16:26:27,133 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults:
[2024-11-07 16:26:27,133 INFO L153 SettingsManager]: * Use memory slicer=true
[2024-11-07 16:26:27,133 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults:
[2024-11-07 16:26:27,133 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS
[2024-11-07 16:26:27,135 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults:
[2024-11-07 16:26:27,135 INFO L153 SettingsManager]: * Create parallel compositions if possible=false
[2024-11-07 16:26:27,135 INFO L153 SettingsManager]: * Use SBE=true
[2024-11-07 16:26:27,135 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults:
[2024-11-07 16:26:27,136 INFO L153 SettingsManager]: * sizeof long=4
[2024-11-07 16:26:27,137 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true
[2024-11-07 16:26:27,137 INFO L153 SettingsManager]: * sizeof POINTER=4
[2024-11-07 16:26:27,137 INFO L153 SettingsManager]: * Check division by zero=IGNORE
[2024-11-07 16:26:27,137 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true
[2024-11-07 16:26:27,137 INFO L153 SettingsManager]: * Bitprecise bitfields=true
[2024-11-07 16:26:27,137 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true
[2024-11-07 16:26:27,137 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE
[2024-11-07 16:26:27,137 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true
[2024-11-07 16:26:27,137 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true
[2024-11-07 16:26:27,137 INFO L153 SettingsManager]: * Allow undefined functions=false
[2024-11-07 16:26:27,138 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution
[2024-11-07 16:26:27,138 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false
[2024-11-07 16:26:27,138 INFO L153 SettingsManager]: * sizeof long double=12
[2024-11-07 16:26:27,138 INFO L153 SettingsManager]: * Use constant arrays=true
[2024-11-07 16:26:27,138 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults:
[2024-11-07 16:26:27,138 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements
[2024-11-07 16:26:27,139 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true
[2024-11-07 16:26:27,139 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode
[2024-11-07 16:26:27,139 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000
[2024-11-07 16:26:27,140 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults:
[2024-11-07 16:26:27,140 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP
[2024-11-07 16:26:27,140 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF
[2024-11-07 16:26:27,140 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt
[2024-11-07 16:26:27,140 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false
[2024-11-07 16:26:27,140 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET
[2024-11-07 16:26:27,140 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO
[2024-11-07 16:26:27,140 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode
[2024-11-07 16:26:27,140 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC
Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main
Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux
Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness
Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false
Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G valid-free) )
CHECK( init(main()), LTL(G valid-deref) )
CHECK( init(main()), LTL(G valid-memtrack) )
Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer
Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit
Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 1c2d362b3c58f37a9b1e964b448eb3d54c85d26676417295a73853b3a7cc716a
[2024-11-07 16:26:27,409 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp
[2024-11-07 16:26:27,415 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized
[2024-11-07 16:26:27,417 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected.
[2024-11-07 16:26:27,418 INFO L270 PluginConnector]: Initializing CDTParser...
[2024-11-07 16:26:27,418 INFO L274 PluginConnector]: CDTParser initialized
[2024-11-07 16:26:27,419 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/memsafety/test-0137.i
[2024-11-07 16:26:28,628 INFO L533 CDTParser]: Created temporary CDT project at NULL
[2024-11-07 16:26:28,940 INFO L384 CDTParser]: Found 1 translation units.
[2024-11-07 16:26:28,941 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/memsafety/test-0137.i
[2024-11-07 16:26:28,959 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/4ca94c974/f503bfe0c86549d494b75c86c2ad86b5/FLAG87d14c5e8
[2024-11-07 16:26:28,976 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/4ca94c974/f503bfe0c86549d494b75c86c2ad86b5
[2024-11-07 16:26:28,980 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] #######################
[2024-11-07 16:26:28,982 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements.
[2024-11-07 16:26:28,984 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator----------------------------
[2024-11-07 16:26:28,984 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator...
[2024-11-07 16:26:28,987 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized
[2024-11-07 16:26:28,988 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 04:26:28" (1/1) ...
[2024-11-07 16:26:28,990 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@66f44717 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:26:28, skipping insertion in model container
[2024-11-07 16:26:28,990 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 04:26:28" (1/1) ...
[2024-11-07 16:26:29,021 INFO L175 MainTranslator]: Built tables and reachable declarations
[2024-11-07 16:26:29,305 INFO L210 PostProcessor]: Analyzing one entry point: main
[2024-11-07 16:26:29,316 INFO L197 MainTranslator]: Restarting translation with changed settings: SettingsChange [mNewPreferredMemoryModel=HoenickeLindenmann_1ByteResolution]
[2024-11-07 16:26:29,327 INFO L175 MainTranslator]: Built tables and reachable declarations
[2024-11-07 16:26:29,368 INFO L210 PostProcessor]: Analyzing one entry point: main
[2024-11-07 16:26:29,372 INFO L200 MainTranslator]: Completed pre-run
[2024-11-07 16:26:29,414 INFO L210 PostProcessor]: Analyzing one entry point: main
[2024-11-07 16:26:29,443 INFO L204 MainTranslator]: Completed translation
[2024-11-07 16:26:29,444 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:26:29 WrapperNode
[2024-11-07 16:26:29,444 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator----------------------------
[2024-11-07 16:26:29,445 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner----------------------------
[2024-11-07 16:26:29,445 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner...
[2024-11-07 16:26:29,445 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized
[2024-11-07 16:26:29,451 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:26:29" (1/1) ...
[2024-11-07 16:26:29,468 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:26:29" (1/1) ...
[2024-11-07 16:26:29,487 INFO L138 Inliner]: procedures = 140, calls = 60, calls flagged for inlining = 9, calls inlined = 9, statements flattened = 139
[2024-11-07 16:26:29,487 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner----------------------------
[2024-11-07 16:26:29,488 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor----------------------------
[2024-11-07 16:26:29,488 INFO L270 PluginConnector]: Initializing Boogie Preprocessor...
[2024-11-07 16:26:29,488 INFO L274 PluginConnector]: Boogie Preprocessor initialized
[2024-11-07 16:26:29,495 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:26:29" (1/1) ...
[2024-11-07 16:26:29,495 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:26:29" (1/1) ...
[2024-11-07 16:26:29,503 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:26:29" (1/1) ...
[2024-11-07 16:26:29,541 INFO L175 MemorySlicer]: Split 32 memory accesses to 2 slices as follows [2, 30]. 94 percent of accesses are in the largest equivalence class. The 6 initializations are split as follows [2, 4]. The 12 writes are split as follows [0, 12].
[2024-11-07 16:26:29,541 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:26:29" (1/1) ...
[2024-11-07 16:26:29,541 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:26:29" (1/1) ...
[2024-11-07 16:26:29,559 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:26:29" (1/1) ...
[2024-11-07 16:26:29,567 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:26:29" (1/1) ...
[2024-11-07 16:26:29,569 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:26:29" (1/1) ...
[2024-11-07 16:26:29,573 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:26:29" (1/1) ...
[2024-11-07 16:26:29,576 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor----------------------------
[2024-11-07 16:26:29,577 INFO L112 PluginConnector]: ------------------------RCFGBuilder----------------------------
[2024-11-07 16:26:29,577 INFO L270 PluginConnector]: Initializing RCFGBuilder...
[2024-11-07 16:26:29,577 INFO L274 PluginConnector]: RCFGBuilder initialized
[2024-11-07 16:26:29,578 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:26:29" (1/1) ...
[2024-11-07 16:26:29,583 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000
[2024-11-07 16:26:29,594 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3
[2024-11-07 16:26:29,604 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null)
[2024-11-07 16:26:29,605 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process
[2024-11-07 16:26:29,625 INFO L130 BoogieDeclarations]: Found specification of procedure list_empty
[2024-11-07 16:26:29,625 INFO L138 BoogieDeclarations]: Found implementation of procedure list_empty
[2024-11-07 16:26:29,625 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#0
[2024-11-07 16:26:29,625 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#1
[2024-11-07 16:26:29,625 INFO L130 BoogieDeclarations]: Found specification of procedure __list_del
[2024-11-07 16:26:29,625 INFO L138 BoogieDeclarations]: Found implementation of procedure __list_del
[2024-11-07 16:26:29,625 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap
[2024-11-07 16:26:29,625 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit
[2024-11-07 16:26:29,625 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack
[2024-11-07 16:26:29,625 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0
[2024-11-07 16:26:29,626 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1
[2024-11-07 16:26:29,626 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0
[2024-11-07 16:26:29,626 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1
[2024-11-07 16:26:29,626 INFO L130 BoogieDeclarations]: Found specification of procedure list_add
[2024-11-07 16:26:29,626 INFO L138 BoogieDeclarations]: Found implementation of procedure list_add
[2024-11-07 16:26:29,626 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc
[2024-11-07 16:26:29,626 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#0
[2024-11-07 16:26:29,626 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#1
[2024-11-07 16:26:29,626 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#0
[2024-11-07 16:26:29,629 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#1
[2024-11-07 16:26:29,629 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0
[2024-11-07 16:26:29,629 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1
[2024-11-07 16:26:29,629 INFO L130 BoogieDeclarations]: Found specification of procedure val_from_node
[2024-11-07 16:26:29,629 INFO L138 BoogieDeclarations]: Found implementation of procedure val_from_node
[2024-11-07 16:26:29,629 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start
[2024-11-07 16:26:29,629 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start
[2024-11-07 16:26:29,751 INFO L238 CfgBuilder]: Building ICFG
[2024-11-07 16:26:29,753 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation
[2024-11-07 16:26:30,349 INFO L? ?]: Removed 139 outVars from TransFormulas that were not future-live.
[2024-11-07 16:26:30,350 INFO L287 CfgBuilder]: Performing block encoding
[2024-11-07 16:26:30,362 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start)
[2024-11-07 16:26:30,363 INFO L316 CfgBuilder]: Removed 4 assume(true) statements.
[2024-11-07 16:26:30,364 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 04:26:30 BoogieIcfgContainer
[2024-11-07 16:26:30,364 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder----------------------------
[2024-11-07 16:26:30,366 INFO L112 PluginConnector]: ------------------------TraceAbstraction----------------------------
[2024-11-07 16:26:30,366 INFO L270 PluginConnector]: Initializing TraceAbstraction...
[2024-11-07 16:26:30,370 INFO L274 PluginConnector]: TraceAbstraction initialized
[2024-11-07 16:26:30,371 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.11 04:26:28" (1/3) ...
[2024-11-07 16:26:30,371 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6c66bd44 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 04:26:30, skipping insertion in model container
[2024-11-07 16:26:30,371 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:26:29" (2/3) ...
[2024-11-07 16:26:30,372 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6c66bd44 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 04:26:30, skipping insertion in model container
[2024-11-07 16:26:30,372 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 04:26:30" (3/3) ...
[2024-11-07 16:26:30,374 INFO L112 eAbstractionObserver]: Analyzing ICFG test-0137.i
[2024-11-07 16:26:30,386 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION
[2024-11-07 16:26:30,388 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 56 error locations.
[2024-11-07 16:26:30,431 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ========
[2024-11-07 16:26:30,443 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;@667de6b4, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms]
[2024-11-07 16:26:30,447 INFO L334 AbstractCegarLoop]: Starting to check reachability of 56 error locations.
[2024-11-07 16:26:30,451 INFO L276 IsEmpty]: Start isEmpty. Operand has 142 states, 74 states have (on average 1.9189189189189189) internal successors, (142), 130 states have internal predecessors, (142), 7 states have call successors, (7), 4 states have call predecessors, (7), 4 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7)
[2024-11-07 16:26:30,457 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6
[2024-11-07 16:26:30,457 INFO L207 NwaCegarLoop]: Found error trace
[2024-11-07 16:26:30,457 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1]
[2024-11-07 16:26:30,458 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [val_from_nodeErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, val_from_nodeErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, list_emptyErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 53 more)] ===
[2024-11-07 16:26:30,462 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-11-07 16:26:30,463 INFO L85 PathProgramCache]: Analyzing trace with hash 66866992, now seen corresponding path program 1 times
[2024-11-07 16:26:30,469 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF
[2024-11-07 16:26:30,470 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [335114095]
[2024-11-07 16:26:30,470 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-07 16:26:30,470 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3
[2024-11-07 16:26:30,470 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat
[2024-11-07 16:26:30,472 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null)
[2024-11-07 16:26:30,473 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process
[2024-11-07 16:26:30,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 16:26:30,572 INFO L255 TraceCheckSpWp]: Trace formula consists of 32 conjuncts, 1 conjuncts are in the unsatisfiable core
[2024-11-07 16:26:30,575 INFO L278 TraceCheckSpWp]: Computing forward predicates...
[2024-11-07 16:26:30,589 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-11-07 16:26:30,589 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect
[2024-11-07 16:26:30,589 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace
[2024-11-07 16:26:30,591 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [335114095]
[2024-11-07 16:26:30,591 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [335114095] provided 1 perfect and 0 imperfect interpolant sequences
[2024-11-07 16:26:30,592 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-11-07 16:26:30,592 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2024-11-07 16:26:30,594 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [122838980]
[2024-11-07 16:26:30,594 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-11-07 16:26:30,597 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states
[2024-11-07 16:26:30,598 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF
[2024-11-07 16:26:30,617 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants.
[2024-11-07 16:26:30,617 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2
[2024-11-07 16:26:30,620 INFO L87 Difference]: Start difference. First operand has 142 states, 74 states have (on average 1.9189189189189189) internal successors, (142), 130 states have internal predecessors, (142), 7 states have call successors, (7), 4 states have call predecessors, (7), 4 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) Second operand has 2 states, 2 states have (on average 2.5) internal successors, (5), 2 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-11-07 16:26:30,639 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2024-11-07 16:26:30,640 INFO L93 Difference]: Finished difference Result 142 states and 151 transitions.
[2024-11-07 16:26:30,640 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states.
[2024-11-07 16:26:30,641 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 2.5) internal successors, (5), 2 states have internal predecessors, (5), 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 5
[2024-11-07 16:26:30,642 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2024-11-07 16:26:30,646 INFO L225 Difference]: With dead ends: 142
[2024-11-07 16:26:30,646 INFO L226 Difference]: Without dead ends: 140
[2024-11-07 16:26:30,648 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2
[2024-11-07 16:26:30,650 INFO L432 NwaCegarLoop]: 151 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, 151 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time
[2024-11-07 16:26:30,650 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 151 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time]
[2024-11-07 16:26:30,660 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 140 states.
[2024-11-07 16:26:30,677 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 140 to 140.
[2024-11-07 16:26:30,678 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 140 states, 73 states have (on average 1.8493150684931507) internal successors, (135), 128 states have internal predecessors, (135), 7 states have call successors, (7), 4 states have call predecessors, (7), 4 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7)
[2024-11-07 16:26:30,683 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 140 states to 140 states and 149 transitions.
[2024-11-07 16:26:30,684 INFO L78 Accepts]: Start accepts. Automaton has 140 states and 149 transitions. Word has length 5
[2024-11-07 16:26:30,684 INFO L84 Accepts]: Finished accepts. word is rejected.
[2024-11-07 16:26:30,684 INFO L471 AbstractCegarLoop]: Abstraction has 140 states and 149 transitions.
[2024-11-07 16:26:30,684 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 2.5) internal successors, (5), 2 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-11-07 16:26:30,684 INFO L276 IsEmpty]: Start isEmpty. Operand 140 states and 149 transitions.
[2024-11-07 16:26:30,684 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6
[2024-11-07 16:26:30,684 INFO L207 NwaCegarLoop]: Found error trace
[2024-11-07 16:26:30,684 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1]
[2024-11-07 16:26:30,689 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0
[2024-11-07 16:26:30,885 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3
[2024-11-07 16:26:30,885 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [val_from_nodeErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, val_from_nodeErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, list_emptyErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 53 more)] ===
[2024-11-07 16:26:30,886 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-11-07 16:26:30,886 INFO L85 PathProgramCache]: Analyzing trace with hash 66867054, now seen corresponding path program 1 times
[2024-11-07 16:26:30,886 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF
[2024-11-07 16:26:30,886 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [455338355]
[2024-11-07 16:26:30,886 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-07 16:26:30,887 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3
[2024-11-07 16:26:30,887 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat
[2024-11-07 16:26:30,892 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null)
[2024-11-07 16:26:30,893 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process
[2024-11-07 16:26:30,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 16:26:30,953 INFO L255 TraceCheckSpWp]: Trace formula consists of 32 conjuncts, 3 conjuncts are in the unsatisfiable core
[2024-11-07 16:26:30,958 INFO L278 TraceCheckSpWp]: Computing forward predicates...
[2024-11-07 16:26:30,996 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7
[2024-11-07 16:26:31,012 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-11-07 16:26:31,012 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect
[2024-11-07 16:26:31,012 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace
[2024-11-07 16:26:31,013 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [455338355]
[2024-11-07 16:26:31,013 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [455338355] provided 1 perfect and 0 imperfect interpolant sequences
[2024-11-07 16:26:31,013 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-11-07 16:26:31,013 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2024-11-07 16:26:31,013 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1704757395]
[2024-11-07 16:26:31,013 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-11-07 16:26:31,014 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2024-11-07 16:26:31,014 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF
[2024-11-07 16:26:31,015 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2024-11-07 16:26:31,015 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2024-11-07 16:26:31,015 INFO L87 Difference]: Start difference. First operand 140 states and 149 transitions. Second operand has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-11-07 16:26:31,203 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2024-11-07 16:26:31,203 INFO L93 Difference]: Finished difference Result 139 states and 148 transitions.
[2024-11-07 16:26:31,204 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states.
[2024-11-07 16:26:31,204 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 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 5
[2024-11-07 16:26:31,204 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2024-11-07 16:26:31,205 INFO L225 Difference]: With dead ends: 139
[2024-11-07 16:26:31,205 INFO L226 Difference]: Without dead ends: 139
[2024-11-07 16:26:31,205 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2024-11-07 16:26:31,206 INFO L432 NwaCegarLoop]: 145 mSDtfsCounter, 1 mSDsluCounter, 84 mSDsCounter, 0 mSdLazyCounter, 63 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 229 SdHoareTripleChecker+Invalid, 63 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 63 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time
[2024-11-07 16:26:31,206 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 229 Invalid, 63 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 63 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time]
[2024-11-07 16:26:31,207 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 139 states.
[2024-11-07 16:26:31,212 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 139 to 139.
[2024-11-07 16:26:31,212 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 139 states, 73 states have (on average 1.8356164383561644) internal successors, (134), 127 states have internal predecessors, (134), 7 states have call successors, (7), 4 states have call predecessors, (7), 4 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7)
[2024-11-07 16:26:31,214 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 139 states to 139 states and 148 transitions.
[2024-11-07 16:26:31,214 INFO L78 Accepts]: Start accepts. Automaton has 139 states and 148 transitions. Word has length 5
[2024-11-07 16:26:31,214 INFO L84 Accepts]: Finished accepts. word is rejected.
[2024-11-07 16:26:31,215 INFO L471 AbstractCegarLoop]: Abstraction has 139 states and 148 transitions.
[2024-11-07 16:26:31,215 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-11-07 16:26:31,215 INFO L276 IsEmpty]: Start isEmpty. Operand 139 states and 148 transitions.
[2024-11-07 16:26:31,215 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6
[2024-11-07 16:26:31,215 INFO L207 NwaCegarLoop]: Found error trace
[2024-11-07 16:26:31,215 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1]
[2024-11-07 16:26:31,218 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Ended with exit code 0
[2024-11-07 16:26:31,417 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3
[2024-11-07 16:26:31,417 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [val_from_nodeErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, val_from_nodeErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, list_emptyErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 53 more)] ===
[2024-11-07 16:26:31,418 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-11-07 16:26:31,418 INFO L85 PathProgramCache]: Analyzing trace with hash 66867055, now seen corresponding path program 1 times
[2024-11-07 16:26:31,418 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF
[2024-11-07 16:26:31,418 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1636250287]
[2024-11-07 16:26:31,418 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-07 16:26:31,418 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3
[2024-11-07 16:26:31,418 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat
[2024-11-07 16:26:31,421 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null)
[2024-11-07 16:26:31,423 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process
[2024-11-07 16:26:31,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 16:26:31,477 INFO L255 TraceCheckSpWp]: Trace formula consists of 32 conjuncts, 4 conjuncts are in the unsatisfiable core
[2024-11-07 16:26:31,478 INFO L278 TraceCheckSpWp]: Computing forward predicates...
[2024-11-07 16:26:31,486 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5
[2024-11-07 16:26:31,503 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-11-07 16:26:31,503 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect
[2024-11-07 16:26:31,503 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace
[2024-11-07 16:26:31,503 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1636250287]
[2024-11-07 16:26:31,503 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1636250287] provided 1 perfect and 0 imperfect interpolant sequences
[2024-11-07 16:26:31,503 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-11-07 16:26:31,503 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2024-11-07 16:26:31,503 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [958406613]
[2024-11-07 16:26:31,503 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-11-07 16:26:31,503 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2024-11-07 16:26:31,503 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF
[2024-11-07 16:26:31,504 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2024-11-07 16:26:31,504 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2024-11-07 16:26:31,504 INFO L87 Difference]: Start difference. First operand 139 states and 148 transitions. Second operand has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-11-07 16:26:31,701 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2024-11-07 16:26:31,701 INFO L93 Difference]: Finished difference Result 138 states and 147 transitions.
[2024-11-07 16:26:31,702 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states.
[2024-11-07 16:26:31,702 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 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 5
[2024-11-07 16:26:31,702 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2024-11-07 16:26:31,703 INFO L225 Difference]: With dead ends: 138
[2024-11-07 16:26:31,703 INFO L226 Difference]: Without dead ends: 138
[2024-11-07 16:26:31,703 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2024-11-07 16:26:31,704 INFO L432 NwaCegarLoop]: 145 mSDtfsCounter, 1 mSDsluCounter, 89 mSDsCounter, 0 mSdLazyCounter, 56 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 234 SdHoareTripleChecker+Invalid, 56 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 56 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time
[2024-11-07 16:26:31,704 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 234 Invalid, 56 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 56 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time]
[2024-11-07 16:26:31,705 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 138 states.
[2024-11-07 16:26:31,715 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 138 to 138.
[2024-11-07 16:26:31,718 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 138 states, 73 states have (on average 1.821917808219178) internal successors, (133), 126 states have internal predecessors, (133), 7 states have call successors, (7), 4 states have call predecessors, (7), 4 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7)
[2024-11-07 16:26:31,720 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 138 states to 138 states and 147 transitions.
[2024-11-07 16:26:31,720 INFO L78 Accepts]: Start accepts. Automaton has 138 states and 147 transitions. Word has length 5
[2024-11-07 16:26:31,720 INFO L84 Accepts]: Finished accepts. word is rejected.
[2024-11-07 16:26:31,720 INFO L471 AbstractCegarLoop]: Abstraction has 138 states and 147 transitions.
[2024-11-07 16:26:31,720 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-11-07 16:26:31,720 INFO L276 IsEmpty]: Start isEmpty. Operand 138 states and 147 transitions.
[2024-11-07 16:26:31,720 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9
[2024-11-07 16:26:31,720 INFO L207 NwaCegarLoop]: Found error trace
[2024-11-07 16:26:31,720 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1]
[2024-11-07 16:26:31,725 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Ended with exit code 0
[2024-11-07 16:26:31,924 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3
[2024-11-07 16:26:31,925 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting list_addErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [val_from_nodeErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, val_from_nodeErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, list_emptyErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 53 more)] ===
[2024-11-07 16:26:31,925 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-11-07 16:26:31,925 INFO L85 PathProgramCache]: Analyzing trace with hash -828251774, now seen corresponding path program 1 times
[2024-11-07 16:26:31,925 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF
[2024-11-07 16:26:31,925 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1932391043]
[2024-11-07 16:26:31,925 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-07 16:26:31,926 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3
[2024-11-07 16:26:31,926 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat
[2024-11-07 16:26:31,929 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null)
[2024-11-07 16:26:31,930 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process
[2024-11-07 16:26:32,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 16:26:32,024 INFO L255 TraceCheckSpWp]: Trace formula consists of 68 conjuncts, 7 conjuncts are in the unsatisfiable core
[2024-11-07 16:26:32,026 INFO L278 TraceCheckSpWp]: Computing forward predicates...
[2024-11-07 16:26:32,080 INFO L349 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size
[2024-11-07 16:26:32,081 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 20
[2024-11-07 16:26:32,160 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-11-07 16:26:32,160 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect
[2024-11-07 16:26:32,160 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace
[2024-11-07 16:26:32,160 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1932391043]
[2024-11-07 16:26:32,160 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1932391043] provided 1 perfect and 0 imperfect interpolant sequences
[2024-11-07 16:26:32,160 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-11-07 16:26:32,160 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2024-11-07 16:26:32,161 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [377417217]
[2024-11-07 16:26:32,161 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-11-07 16:26:32,161 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states
[2024-11-07 16:26:32,161 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF
[2024-11-07 16:26:32,161 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2024-11-07 16:26:32,162 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20
[2024-11-07 16:26:32,162 INFO L87 Difference]: Start difference. First operand 138 states and 147 transitions. Second operand has 5 states, 4 states have (on average 1.75) internal successors, (7), 3 states have internal predecessors, (7), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-11-07 16:26:32,594 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2024-11-07 16:26:32,594 INFO L93 Difference]: Finished difference Result 174 states and 182 transitions.
[2024-11-07 16:26:32,594 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states.
[2024-11-07 16:26:32,595 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 1.75) internal successors, (7), 3 states have internal predecessors, (7), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 8
[2024-11-07 16:26:32,595 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2024-11-07 16:26:32,596 INFO L225 Difference]: With dead ends: 174
[2024-11-07 16:26:32,596 INFO L226 Difference]: Without dead ends: 174
[2024-11-07 16:26:32,596 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42
[2024-11-07 16:26:32,597 INFO L432 NwaCegarLoop]: 78 mSDtfsCounter, 170 mSDsluCounter, 139 mSDsCounter, 0 mSdLazyCounter, 237 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 171 SdHoareTripleChecker+Valid, 217 SdHoareTripleChecker+Invalid, 243 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 237 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time
[2024-11-07 16:26:32,597 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [171 Valid, 217 Invalid, 243 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 237 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time]
[2024-11-07 16:26:32,598 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 174 states.
[2024-11-07 16:26:32,610 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 174 to 151.
[2024-11-07 16:26:32,611 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 151 states, 88 states have (on average 1.8068181818181819) internal successors, (159), 138 states have internal predecessors, (159), 7 states have call successors, (7), 5 states have call predecessors, (7), 5 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7)
[2024-11-07 16:26:32,612 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 151 states to 151 states and 173 transitions.
[2024-11-07 16:26:32,612 INFO L78 Accepts]: Start accepts. Automaton has 151 states and 173 transitions. Word has length 8
[2024-11-07 16:26:32,612 INFO L84 Accepts]: Finished accepts. word is rejected.
[2024-11-07 16:26:32,612 INFO L471 AbstractCegarLoop]: Abstraction has 151 states and 173 transitions.
[2024-11-07 16:26:32,612 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 1.75) internal successors, (7), 3 states have internal predecessors, (7), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-11-07 16:26:32,612 INFO L276 IsEmpty]: Start isEmpty. Operand 151 states and 173 transitions.
[2024-11-07 16:26:32,613 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9
[2024-11-07 16:26:32,613 INFO L207 NwaCegarLoop]: Found error trace
[2024-11-07 16:26:32,613 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1]
[2024-11-07 16:26:32,619 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Ended with exit code 0
[2024-11-07 16:26:32,813 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3
[2024-11-07 16:26:32,814 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting list_addErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [val_from_nodeErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, val_from_nodeErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, list_emptyErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 53 more)] ===
[2024-11-07 16:26:32,814 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-11-07 16:26:32,814 INFO L85 PathProgramCache]: Analyzing trace with hash -828251773, now seen corresponding path program 1 times
[2024-11-07 16:26:32,814 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF
[2024-11-07 16:26:32,814 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [650933041]
[2024-11-07 16:26:32,814 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-07 16:26:32,815 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3
[2024-11-07 16:26:32,815 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat
[2024-11-07 16:26:32,817 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null)
[2024-11-07 16:26:32,818 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Waiting until timeout for monitored process
[2024-11-07 16:26:32,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 16:26:32,903 INFO L255 TraceCheckSpWp]: Trace formula consists of 68 conjuncts, 11 conjuncts are in the unsatisfiable core
[2024-11-07 16:26:32,906 INFO L278 TraceCheckSpWp]: Computing forward predicates...
[2024-11-07 16:26:32,991 INFO L190 IndexEqualityManager]: detected not equals via solver
[2024-11-07 16:26:32,993 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 9
[2024-11-07 16:26:33,077 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-11-07 16:26:33,077 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect
[2024-11-07 16:26:33,077 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace
[2024-11-07 16:26:33,077 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [650933041]
[2024-11-07 16:26:33,077 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [650933041] provided 1 perfect and 0 imperfect interpolant sequences
[2024-11-07 16:26:33,077 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-11-07 16:26:33,077 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2024-11-07 16:26:33,077 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [245517334]
[2024-11-07 16:26:33,078 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-11-07 16:26:33,078 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states
[2024-11-07 16:26:33,078 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF
[2024-11-07 16:26:33,078 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2024-11-07 16:26:33,078 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30
[2024-11-07 16:26:33,078 INFO L87 Difference]: Start difference. First operand 151 states and 173 transitions. Second operand has 6 states, 5 states have (on average 1.4) internal successors, (7), 4 states have internal predecessors, (7), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-11-07 16:26:33,571 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2024-11-07 16:26:33,571 INFO L93 Difference]: Finished difference Result 153 states and 164 transitions.
[2024-11-07 16:26:33,571 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states.
[2024-11-07 16:26:33,572 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 1.4) internal successors, (7), 4 states have internal predecessors, (7), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 8
[2024-11-07 16:26:33,572 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2024-11-07 16:26:33,572 INFO L225 Difference]: With dead ends: 153
[2024-11-07 16:26:33,572 INFO L226 Difference]: Without dead ends: 153
[2024-11-07 16:26:33,573 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56
[2024-11-07 16:26:33,573 INFO L432 NwaCegarLoop]: 57 mSDtfsCounter, 302 mSDsluCounter, 92 mSDsCounter, 0 mSdLazyCounter, 268 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 303 SdHoareTripleChecker+Valid, 149 SdHoareTripleChecker+Invalid, 293 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 268 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time
[2024-11-07 16:26:33,573 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [303 Valid, 149 Invalid, 293 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 268 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time]
[2024-11-07 16:26:33,575 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 153 states.
[2024-11-07 16:26:33,579 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 153 to 141.
[2024-11-07 16:26:33,579 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 141 states, 84 states have (on average 1.7023809523809523) internal successors, (143), 128 states have internal predecessors, (143), 7 states have call successors, (7), 5 states have call predecessors, (7), 5 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7)
[2024-11-07 16:26:33,580 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 141 states to 141 states and 157 transitions.
[2024-11-07 16:26:33,580 INFO L78 Accepts]: Start accepts. Automaton has 141 states and 157 transitions. Word has length 8
[2024-11-07 16:26:33,580 INFO L84 Accepts]: Finished accepts. word is rejected.
[2024-11-07 16:26:33,580 INFO L471 AbstractCegarLoop]: Abstraction has 141 states and 157 transitions.
[2024-11-07 16:26:33,581 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 1.4) internal successors, (7), 4 states have internal predecessors, (7), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-11-07 16:26:33,581 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 157 transitions.
[2024-11-07 16:26:33,581 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11
[2024-11-07 16:26:33,581 INFO L207 NwaCegarLoop]: Found error trace
[2024-11-07 16:26:33,581 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-11-07 16:26:33,585 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Ended with exit code 0
[2024-11-07 16:26:33,781 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3
[2024-11-07 16:26:33,782 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting list_addErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [val_from_nodeErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, val_from_nodeErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, list_emptyErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 53 more)] ===
[2024-11-07 16:26:33,782 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-11-07 16:26:33,782 INFO L85 PathProgramCache]: Analyzing trace with hash -1381005245, now seen corresponding path program 1 times
[2024-11-07 16:26:33,782 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF
[2024-11-07 16:26:33,782 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2144782630]
[2024-11-07 16:26:33,782 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-07 16:26:33,782 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3
[2024-11-07 16:26:33,783 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat
[2024-11-07 16:26:33,784 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null)
[2024-11-07 16:26:33,785 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Waiting until timeout for monitored process
[2024-11-07 16:26:33,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 16:26:33,867 INFO L255 TraceCheckSpWp]: Trace formula consists of 86 conjuncts, 17 conjuncts are in the unsatisfiable core
[2024-11-07 16:26:33,869 INFO L278 TraceCheckSpWp]: Computing forward predicates...
[2024-11-07 16:26:33,957 INFO L349 Elim1Store]: treesize reduction 17, result has 19.0 percent of original size
[2024-11-07 16:26:33,958 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 18 treesize of output 16
[2024-11-07 16:26:34,000 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11
[2024-11-07 16:26:34,101 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-11-07 16:26:34,101 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect
[2024-11-07 16:26:34,101 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace
[2024-11-07 16:26:34,101 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2144782630]
[2024-11-07 16:26:34,102 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2144782630] provided 1 perfect and 0 imperfect interpolant sequences
[2024-11-07 16:26:34,102 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-11-07 16:26:34,102 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2024-11-07 16:26:34,102 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1330189578]
[2024-11-07 16:26:34,102 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-11-07 16:26:34,102 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states
[2024-11-07 16:26:34,102 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF
[2024-11-07 16:26:34,102 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2024-11-07 16:26:34,102 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72
[2024-11-07 16:26:34,103 INFO L87 Difference]: Start difference. First operand 141 states and 157 transitions. Second operand has 9 states, 7 states have (on average 1.2857142857142858) internal successors, (9), 7 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-11-07 16:26:34,578 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2024-11-07 16:26:34,579 INFO L93 Difference]: Finished difference Result 153 states and 170 transitions.
[2024-11-07 16:26:34,579 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states.
[2024-11-07 16:26:34,579 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 7 states have (on average 1.2857142857142858) internal successors, (9), 7 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10
[2024-11-07 16:26:34,579 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2024-11-07 16:26:34,580 INFO L225 Difference]: With dead ends: 153
[2024-11-07 16:26:34,580 INFO L226 Difference]: Without dead ends: 153
[2024-11-07 16:26:34,581 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=50, Invalid=132, Unknown=0, NotChecked=0, Total=182
[2024-11-07 16:26:34,581 INFO L432 NwaCegarLoop]: 127 mSDtfsCounter, 17 mSDsluCounter, 459 mSDsCounter, 0 mSdLazyCounter, 247 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 586 SdHoareTripleChecker+Invalid, 252 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 247 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time
[2024-11-07 16:26:34,581 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 586 Invalid, 252 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 247 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time]
[2024-11-07 16:26:34,582 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 153 states.
[2024-11-07 16:26:34,588 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 153 to 149.
[2024-11-07 16:26:34,589 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 149 states, 91 states have (on average 1.6593406593406594) internal successors, (151), 135 states have internal predecessors, (151), 8 states have call successors, (8), 6 states have call predecessors, (8), 5 states have return successors, (8), 7 states have call predecessors, (8), 8 states have call successors, (8)
[2024-11-07 16:26:34,590 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 149 states to 149 states and 167 transitions.
[2024-11-07 16:26:34,590 INFO L78 Accepts]: Start accepts. Automaton has 149 states and 167 transitions. Word has length 10
[2024-11-07 16:26:34,590 INFO L84 Accepts]: Finished accepts. word is rejected.
[2024-11-07 16:26:34,590 INFO L471 AbstractCegarLoop]: Abstraction has 149 states and 167 transitions.
[2024-11-07 16:26:34,590 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 7 states have (on average 1.2857142857142858) internal successors, (9), 7 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-11-07 16:26:34,591 INFO L276 IsEmpty]: Start isEmpty. Operand 149 states and 167 transitions.
[2024-11-07 16:26:34,591 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11
[2024-11-07 16:26:34,591 INFO L207 NwaCegarLoop]: Found error trace
[2024-11-07 16:26:34,591 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-11-07 16:26:34,596 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Forceful destruction successful, exit code 0
[2024-11-07 16:26:34,791 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3
[2024-11-07 16:26:34,792 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting list_addErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [val_from_nodeErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, val_from_nodeErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, list_emptyErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 53 more)] ===
[2024-11-07 16:26:34,792 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-11-07 16:26:34,792 INFO L85 PathProgramCache]: Analyzing trace with hash -1381005244, now seen corresponding path program 1 times
[2024-11-07 16:26:34,792 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF
[2024-11-07 16:26:34,793 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1987271287]
[2024-11-07 16:26:34,793 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-07 16:26:34,793 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3
[2024-11-07 16:26:34,793 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat
[2024-11-07 16:26:34,795 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null)
[2024-11-07 16:26:34,796 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Waiting until timeout for monitored process
[2024-11-07 16:26:34,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 16:26:34,891 INFO L255 TraceCheckSpWp]: Trace formula consists of 86 conjuncts, 25 conjuncts are in the unsatisfiable core
[2024-11-07 16:26:34,893 INFO L278 TraceCheckSpWp]: Computing forward predicates...
[2024-11-07 16:26:35,004 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size
[2024-11-07 16:26:35,004 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 13
[2024-11-07 16:26:35,026 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size
[2024-11-07 16:26:35,026 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 13
[2024-11-07 16:26:35,082 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11
[2024-11-07 16:26:35,087 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11
[2024-11-07 16:26:35,249 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-11-07 16:26:35,249 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect
[2024-11-07 16:26:35,249 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace
[2024-11-07 16:26:35,249 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1987271287]
[2024-11-07 16:26:35,250 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1987271287] provided 1 perfect and 0 imperfect interpolant sequences
[2024-11-07 16:26:35,250 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-11-07 16:26:35,250 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2024-11-07 16:26:35,250 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [268430388]
[2024-11-07 16:26:35,250 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-11-07 16:26:35,250 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states
[2024-11-07 16:26:35,250 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF
[2024-11-07 16:26:35,250 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2024-11-07 16:26:35,251 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72
[2024-11-07 16:26:35,251 INFO L87 Difference]: Start difference. First operand 149 states and 167 transitions. Second operand has 9 states, 7 states have (on average 1.2857142857142858) internal successors, (9), 7 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-11-07 16:26:36,038 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2024-11-07 16:26:36,038 INFO L93 Difference]: Finished difference Result 155 states and 172 transitions.
[2024-11-07 16:26:36,039 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states.
[2024-11-07 16:26:36,039 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 7 states have (on average 1.2857142857142858) internal successors, (9), 7 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10
[2024-11-07 16:26:36,039 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2024-11-07 16:26:36,040 INFO L225 Difference]: With dead ends: 155
[2024-11-07 16:26:36,040 INFO L226 Difference]: Without dead ends: 155
[2024-11-07 16:26:36,040 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=50, Invalid=132, Unknown=0, NotChecked=0, Total=182
[2024-11-07 16:26:36,041 INFO L432 NwaCegarLoop]: 124 mSDtfsCounter, 19 mSDsluCounter, 536 mSDsCounter, 0 mSdLazyCounter, 440 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 660 SdHoareTripleChecker+Invalid, 448 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 440 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time
[2024-11-07 16:26:36,041 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [19 Valid, 660 Invalid, 448 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 440 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time]
[2024-11-07 16:26:36,042 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 155 states.
[2024-11-07 16:26:36,045 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 155 to 149.
[2024-11-07 16:26:36,046 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 149 states, 91 states have (on average 1.6483516483516483) internal successors, (150), 135 states have internal predecessors, (150), 8 states have call successors, (8), 6 states have call predecessors, (8), 5 states have return successors, (8), 7 states have call predecessors, (8), 8 states have call successors, (8)
[2024-11-07 16:26:36,047 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 149 states to 149 states and 166 transitions.
[2024-11-07 16:26:36,047 INFO L78 Accepts]: Start accepts. Automaton has 149 states and 166 transitions. Word has length 10
[2024-11-07 16:26:36,047 INFO L84 Accepts]: Finished accepts. word is rejected.
[2024-11-07 16:26:36,047 INFO L471 AbstractCegarLoop]: Abstraction has 149 states and 166 transitions.
[2024-11-07 16:26:36,047 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 7 states have (on average 1.2857142857142858) internal successors, (9), 7 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-11-07 16:26:36,047 INFO L276 IsEmpty]: Start isEmpty. Operand 149 states and 166 transitions.
[2024-11-07 16:26:36,047 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12
[2024-11-07 16:26:36,047 INFO L207 NwaCegarLoop]: Found error trace
[2024-11-07 16:26:36,048 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-11-07 16:26:36,052 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Ended with exit code 0
[2024-11-07 16:26:36,251 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3
[2024-11-07 16:26:36,251 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting list_addErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [val_from_nodeErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, val_from_nodeErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, list_emptyErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 53 more)] ===
[2024-11-07 16:26:36,252 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-11-07 16:26:36,252 INFO L85 PathProgramCache]: Analyzing trace with hash 138510363, now seen corresponding path program 1 times
[2024-11-07 16:26:36,252 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF
[2024-11-07 16:26:36,252 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [154113573]
[2024-11-07 16:26:36,252 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-07 16:26:36,252 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3
[2024-11-07 16:26:36,252 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat
[2024-11-07 16:26:36,257 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null)
[2024-11-07 16:26:36,258 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Waiting until timeout for monitored process
[2024-11-07 16:26:36,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 16:26:36,336 INFO L255 TraceCheckSpWp]: Trace formula consists of 99 conjuncts, 7 conjuncts are in the unsatisfiable core
[2024-11-07 16:26:36,337 INFO L278 TraceCheckSpWp]: Computing forward predicates...
[2024-11-07 16:26:36,342 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7
[2024-11-07 16:26:36,380 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-11-07 16:26:36,381 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect
[2024-11-07 16:26:36,381 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace
[2024-11-07 16:26:36,381 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [154113573]
[2024-11-07 16:26:36,381 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [154113573] provided 1 perfect and 0 imperfect interpolant sequences
[2024-11-07 16:26:36,381 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-11-07 16:26:36,381 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2024-11-07 16:26:36,381 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [154279985]
[2024-11-07 16:26:36,382 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-11-07 16:26:36,382 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states
[2024-11-07 16:26:36,382 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF
[2024-11-07 16:26:36,382 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2024-11-07 16:26:36,382 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30
[2024-11-07 16:26:36,383 INFO L87 Difference]: Start difference. First operand 149 states and 166 transitions. Second operand has 6 states, 5 states have (on average 2.0) internal successors, (10), 5 states have internal predecessors, (10), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-11-07 16:26:36,708 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2024-11-07 16:26:36,708 INFO L93 Difference]: Finished difference Result 154 states and 163 transitions.
[2024-11-07 16:26:36,709 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states.
[2024-11-07 16:26:36,709 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 2.0) internal successors, (10), 5 states have internal predecessors, (10), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11
[2024-11-07 16:26:36,709 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2024-11-07 16:26:36,710 INFO L225 Difference]: With dead ends: 154
[2024-11-07 16:26:36,710 INFO L226 Difference]: Without dead ends: 154
[2024-11-07 16:26:36,710 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56
[2024-11-07 16:26:36,710 INFO L432 NwaCegarLoop]: 123 mSDtfsCounter, 24 mSDsluCounter, 302 mSDsCounter, 0 mSdLazyCounter, 251 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 425 SdHoareTripleChecker+Invalid, 254 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 251 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time
[2024-11-07 16:26:36,710 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [25 Valid, 425 Invalid, 254 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 251 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time]
[2024-11-07 16:26:36,711 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 154 states.
[2024-11-07 16:26:36,714 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 154 to 148.
[2024-11-07 16:26:36,714 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 148 states, 91 states have (on average 1.6153846153846154) internal successors, (147), 134 states have internal predecessors, (147), 8 states have call successors, (8), 6 states have call predecessors, (8), 5 states have return successors, (8), 7 states have call predecessors, (8), 8 states have call successors, (8)
[2024-11-07 16:26:36,715 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 148 states to 148 states and 163 transitions.
[2024-11-07 16:26:36,715 INFO L78 Accepts]: Start accepts. Automaton has 148 states and 163 transitions. Word has length 11
[2024-11-07 16:26:36,715 INFO L84 Accepts]: Finished accepts. word is rejected.
[2024-11-07 16:26:36,715 INFO L471 AbstractCegarLoop]: Abstraction has 148 states and 163 transitions.
[2024-11-07 16:26:36,715 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.0) internal successors, (10), 5 states have internal predecessors, (10), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-11-07 16:26:36,715 INFO L276 IsEmpty]: Start isEmpty. Operand 148 states and 163 transitions.
[2024-11-07 16:26:36,715 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12
[2024-11-07 16:26:36,715 INFO L207 NwaCegarLoop]: Found error trace
[2024-11-07 16:26:36,715 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-11-07 16:26:36,720 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Ended with exit code 0
[2024-11-07 16:26:36,916 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3
[2024-11-07 16:26:36,916 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting list_addErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [val_from_nodeErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, val_from_nodeErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, list_emptyErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 53 more)] ===
[2024-11-07 16:26:36,916 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-11-07 16:26:36,916 INFO L85 PathProgramCache]: Analyzing trace with hash 138510364, now seen corresponding path program 1 times
[2024-11-07 16:26:36,917 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF
[2024-11-07 16:26:36,917 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [672082588]
[2024-11-07 16:26:36,917 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-07 16:26:36,917 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3
[2024-11-07 16:26:36,917 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat
[2024-11-07 16:26:36,920 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null)
[2024-11-07 16:26:36,921 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Waiting until timeout for monitored process
[2024-11-07 16:26:36,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 16:26:36,992 INFO L255 TraceCheckSpWp]: Trace formula consists of 99 conjuncts, 12 conjuncts are in the unsatisfiable core
[2024-11-07 16:26:36,993 INFO L278 TraceCheckSpWp]: Computing forward predicates...
[2024-11-07 16:26:37,002 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5
[2024-11-07 16:26:37,066 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-11-07 16:26:37,067 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect
[2024-11-07 16:26:37,067 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace
[2024-11-07 16:26:37,067 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [672082588]
[2024-11-07 16:26:37,067 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [672082588] provided 1 perfect and 0 imperfect interpolant sequences
[2024-11-07 16:26:37,067 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-11-07 16:26:37,067 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2024-11-07 16:26:37,067 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1120006962]
[2024-11-07 16:26:37,067 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-11-07 16:26:37,067 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states
[2024-11-07 16:26:37,067 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF
[2024-11-07 16:26:37,067 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2024-11-07 16:26:37,068 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30
[2024-11-07 16:26:37,068 INFO L87 Difference]: Start difference. First operand 148 states and 163 transitions. Second operand has 6 states, 5 states have (on average 2.0) internal successors, (10), 5 states have internal predecessors, (10), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-11-07 16:26:37,427 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2024-11-07 16:26:37,427 INFO L93 Difference]: Finished difference Result 152 states and 161 transitions.
[2024-11-07 16:26:37,427 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states.
[2024-11-07 16:26:37,428 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 2.0) internal successors, (10), 5 states have internal predecessors, (10), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11
[2024-11-07 16:26:37,428 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2024-11-07 16:26:37,429 INFO L225 Difference]: With dead ends: 152
[2024-11-07 16:26:37,429 INFO L226 Difference]: Without dead ends: 152
[2024-11-07 16:26:37,429 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56
[2024-11-07 16:26:37,429 INFO L432 NwaCegarLoop]: 125 mSDtfsCounter, 19 mSDsluCounter, 329 mSDsCounter, 0 mSdLazyCounter, 226 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 454 SdHoareTripleChecker+Invalid, 227 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 226 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time
[2024-11-07 16:26:37,429 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 454 Invalid, 227 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 226 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time]
[2024-11-07 16:26:37,430 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 152 states.
[2024-11-07 16:26:37,432 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 152 to 148.
[2024-11-07 16:26:37,433 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 148 states, 91 states have (on average 1.5934065934065933) internal successors, (145), 134 states have internal predecessors, (145), 8 states have call successors, (8), 6 states have call predecessors, (8), 5 states have return successors, (8), 7 states have call predecessors, (8), 8 states have call successors, (8)
[2024-11-07 16:26:37,434 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 148 states to 148 states and 161 transitions.
[2024-11-07 16:26:37,434 INFO L78 Accepts]: Start accepts. Automaton has 148 states and 161 transitions. Word has length 11
[2024-11-07 16:26:37,434 INFO L84 Accepts]: Finished accepts. word is rejected.
[2024-11-07 16:26:37,434 INFO L471 AbstractCegarLoop]: Abstraction has 148 states and 161 transitions.
[2024-11-07 16:26:37,434 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.0) internal successors, (10), 5 states have internal predecessors, (10), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-11-07 16:26:37,434 INFO L276 IsEmpty]: Start isEmpty. Operand 148 states and 161 transitions.
[2024-11-07 16:26:37,435 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14
[2024-11-07 16:26:37,435 INFO L207 NwaCegarLoop]: Found error trace
[2024-11-07 16:26:37,435 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-11-07 16:26:37,439 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Ended with exit code 0
[2024-11-07 16:26:37,635 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3
[2024-11-07 16:26:37,636 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting list_addErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [val_from_nodeErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, val_from_nodeErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, list_emptyErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 53 more)] ===
[2024-11-07 16:26:37,636 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-11-07 16:26:37,636 INFO L85 PathProgramCache]: Analyzing trace with hash -35527298, now seen corresponding path program 1 times
[2024-11-07 16:26:37,636 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF
[2024-11-07 16:26:37,636 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1951241596]
[2024-11-07 16:26:37,636 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-07 16:26:37,637 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3
[2024-11-07 16:26:37,637 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat
[2024-11-07 16:26:37,638 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null)
[2024-11-07 16:26:37,640 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Waiting until timeout for monitored process
[2024-11-07 16:26:37,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 16:26:37,734 INFO L255 TraceCheckSpWp]: Trace formula consists of 125 conjuncts, 4 conjuncts are in the unsatisfiable core
[2024-11-07 16:26:37,737 INFO L278 TraceCheckSpWp]: Computing forward predicates...
[2024-11-07 16:26:37,756 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-11-07 16:26:37,757 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect
[2024-11-07 16:26:37,757 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace
[2024-11-07 16:26:37,757 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1951241596]
[2024-11-07 16:26:37,757 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1951241596] provided 1 perfect and 0 imperfect interpolant sequences
[2024-11-07 16:26:37,757 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-11-07 16:26:37,757 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2024-11-07 16:26:37,757 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1362554628]
[2024-11-07 16:26:37,757 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-11-07 16:26:37,758 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2024-11-07 16:26:37,758 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF
[2024-11-07 16:26:37,758 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2024-11-07 16:26:37,758 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2024-11-07 16:26:37,758 INFO L87 Difference]: Start difference. First operand 148 states and 161 transitions. Second operand has 4 states, 3 states have (on average 4.0) internal successors, (12), 4 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-11-07 16:26:37,909 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2024-11-07 16:26:37,910 INFO L93 Difference]: Finished difference Result 147 states and 159 transitions.
[2024-11-07 16:26:37,910 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states.
[2024-11-07 16:26:37,910 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 4.0) internal successors, (12), 4 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13
[2024-11-07 16:26:37,910 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2024-11-07 16:26:37,911 INFO L225 Difference]: With dead ends: 147
[2024-11-07 16:26:37,911 INFO L226 Difference]: Without dead ends: 147
[2024-11-07 16:26:37,911 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2024-11-07 16:26:37,911 INFO L432 NwaCegarLoop]: 128 mSDtfsCounter, 5 mSDsluCounter, 156 mSDsCounter, 0 mSdLazyCounter, 114 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 284 SdHoareTripleChecker+Invalid, 114 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 114 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time
[2024-11-07 16:26:37,911 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 284 Invalid, 114 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 114 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time]
[2024-11-07 16:26:37,912 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 147 states.
[2024-11-07 16:26:37,915 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 147 to 147.
[2024-11-07 16:26:37,915 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 147 states, 91 states have (on average 1.5714285714285714) internal successors, (143), 133 states have internal predecessors, (143), 8 states have call successors, (8), 6 states have call predecessors, (8), 5 states have return successors, (8), 7 states have call predecessors, (8), 8 states have call successors, (8)
[2024-11-07 16:26:37,916 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 147 states to 147 states and 159 transitions.
[2024-11-07 16:26:37,916 INFO L78 Accepts]: Start accepts. Automaton has 147 states and 159 transitions. Word has length 13
[2024-11-07 16:26:37,916 INFO L84 Accepts]: Finished accepts. word is rejected.
[2024-11-07 16:26:37,916 INFO L471 AbstractCegarLoop]: Abstraction has 147 states and 159 transitions.
[2024-11-07 16:26:37,916 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 4.0) internal successors, (12), 4 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-11-07 16:26:37,916 INFO L276 IsEmpty]: Start isEmpty. Operand 147 states and 159 transitions.
[2024-11-07 16:26:37,917 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14
[2024-11-07 16:26:37,917 INFO L207 NwaCegarLoop]: Found error trace
[2024-11-07 16:26:37,917 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-11-07 16:26:37,921 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Ended with exit code 0
[2024-11-07 16:26:38,120 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3
[2024-11-07 16:26:38,120 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting list_addErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [val_from_nodeErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, val_from_nodeErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, list_emptyErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 53 more)] ===
[2024-11-07 16:26:38,121 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-11-07 16:26:38,121 INFO L85 PathProgramCache]: Analyzing trace with hash -35527297, now seen corresponding path program 1 times
[2024-11-07 16:26:38,121 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF
[2024-11-07 16:26:38,121 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [456130200]
[2024-11-07 16:26:38,121 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-07 16:26:38,121 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3
[2024-11-07 16:26:38,121 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat
[2024-11-07 16:26:38,123 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null)
[2024-11-07 16:26:38,125 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (12)] Waiting until timeout for monitored process
[2024-11-07 16:26:38,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 16:26:38,213 INFO L255 TraceCheckSpWp]: Trace formula consists of 125 conjuncts, 9 conjuncts are in the unsatisfiable core
[2024-11-07 16:26:38,214 INFO L278 TraceCheckSpWp]: Computing forward predicates...
[2024-11-07 16:26:38,275 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-11-07 16:26:38,275 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect
[2024-11-07 16:26:38,275 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace
[2024-11-07 16:26:38,275 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [456130200]
[2024-11-07 16:26:38,275 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [456130200] provided 1 perfect and 0 imperfect interpolant sequences
[2024-11-07 16:26:38,275 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-11-07 16:26:38,275 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2024-11-07 16:26:38,275 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [586026885]
[2024-11-07 16:26:38,275 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-11-07 16:26:38,275 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states
[2024-11-07 16:26:38,275 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF
[2024-11-07 16:26:38,276 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants.
[2024-11-07 16:26:38,276 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42
[2024-11-07 16:26:38,276 INFO L87 Difference]: Start difference. First operand 147 states and 159 transitions. Second operand has 7 states, 6 states have (on average 2.0) internal successors, (12), 5 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-11-07 16:26:38,628 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2024-11-07 16:26:38,628 INFO L93 Difference]: Finished difference Result 149 states and 158 transitions.
[2024-11-07 16:26:38,629 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states.
[2024-11-07 16:26:38,629 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 2.0) internal successors, (12), 5 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13
[2024-11-07 16:26:38,629 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2024-11-07 16:26:38,630 INFO L225 Difference]: With dead ends: 149
[2024-11-07 16:26:38,630 INFO L226 Difference]: Without dead ends: 149
[2024-11-07 16:26:38,630 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110
[2024-11-07 16:26:38,631 INFO L432 NwaCegarLoop]: 116 mSDtfsCounter, 154 mSDsluCounter, 383 mSDsCounter, 0 mSdLazyCounter, 180 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 155 SdHoareTripleChecker+Valid, 499 SdHoareTripleChecker+Invalid, 180 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 180 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time
[2024-11-07 16:26:38,631 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [155 Valid, 499 Invalid, 180 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 180 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time]
[2024-11-07 16:26:38,631 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 149 states.
[2024-11-07 16:26:38,634 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 149 to 147.
[2024-11-07 16:26:38,634 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 147 states, 91 states have (on average 1.5604395604395604) internal successors, (142), 133 states have internal predecessors, (142), 8 states have call successors, (8), 6 states have call predecessors, (8), 5 states have return successors, (8), 7 states have call predecessors, (8), 8 states have call successors, (8)
[2024-11-07 16:26:38,635 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 147 states to 147 states and 158 transitions.
[2024-11-07 16:26:38,635 INFO L78 Accepts]: Start accepts. Automaton has 147 states and 158 transitions. Word has length 13
[2024-11-07 16:26:38,635 INFO L84 Accepts]: Finished accepts. word is rejected.
[2024-11-07 16:26:38,635 INFO L471 AbstractCegarLoop]: Abstraction has 147 states and 158 transitions.
[2024-11-07 16:26:38,635 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 2.0) internal successors, (12), 5 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-11-07 16:26:38,635 INFO L276 IsEmpty]: Start isEmpty. Operand 147 states and 158 transitions.
[2024-11-07 16:26:38,636 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24
[2024-11-07 16:26:38,636 INFO L207 NwaCegarLoop]: Found error trace
[2024-11-07 16:26:38,636 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]
[2024-11-07 16:26:38,640 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (12)] Ended with exit code 0
[2024-11-07 16:26:38,836 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3
[2024-11-07 16:26:38,837 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting list_emptyErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [val_from_nodeErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, val_from_nodeErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, list_emptyErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 53 more)] ===
[2024-11-07 16:26:38,838 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-11-07 16:26:38,839 INFO L85 PathProgramCache]: Analyzing trace with hash -153149799, now seen corresponding path program 1 times
[2024-11-07 16:26:38,839 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF
[2024-11-07 16:26:38,839 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1367643758]
[2024-11-07 16:26:38,839 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-07 16:26:38,839 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3
[2024-11-07 16:26:38,839 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat
[2024-11-07 16:26:38,841 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null)
[2024-11-07 16:26:38,842 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (13)] Waiting until timeout for monitored process
[2024-11-07 16:26:38,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 16:26:38,935 INFO L255 TraceCheckSpWp]: Trace formula consists of 151 conjuncts, 6 conjuncts are in the unsatisfiable core
[2024-11-07 16:26:38,936 INFO L278 TraceCheckSpWp]: Computing forward predicates...
[2024-11-07 16:26:38,995 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-11-07 16:26:38,995 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect
[2024-11-07 16:26:38,995 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace
[2024-11-07 16:26:38,996 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1367643758]
[2024-11-07 16:26:38,996 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1367643758] provided 1 perfect and 0 imperfect interpolant sequences
[2024-11-07 16:26:38,996 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-11-07 16:26:38,996 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2024-11-07 16:26:38,996 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [15038812]
[2024-11-07 16:26:38,996 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-11-07 16:26:38,996 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states
[2024-11-07 16:26:38,996 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF
[2024-11-07 16:26:38,997 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants.
[2024-11-07 16:26:38,997 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42
[2024-11-07 16:26:38,997 INFO L87 Difference]: Start difference. First operand 147 states and 158 transitions. Second operand has 7 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 6 states have internal predecessors, (20), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)
[2024-11-07 16:26:39,387 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2024-11-07 16:26:39,387 INFO L93 Difference]: Finished difference Result 146 states and 157 transitions.
[2024-11-07 16:26:39,388 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states.
[2024-11-07 16:26:39,388 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 6 states have internal predecessors, (20), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 23
[2024-11-07 16:26:39,388 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2024-11-07 16:26:39,389 INFO L225 Difference]: With dead ends: 146
[2024-11-07 16:26:39,389 INFO L226 Difference]: Without dead ends: 146
[2024-11-07 16:26:39,389 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=96, Unknown=0, NotChecked=0, Total=132
[2024-11-07 16:26:39,390 INFO L432 NwaCegarLoop]: 73 mSDtfsCounter, 138 mSDsluCounter, 246 mSDsCounter, 0 mSdLazyCounter, 334 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 141 SdHoareTripleChecker+Valid, 319 SdHoareTripleChecker+Invalid, 340 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 334 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time
[2024-11-07 16:26:39,390 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [141 Valid, 319 Invalid, 340 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 334 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time]
[2024-11-07 16:26:39,391 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 146 states.
[2024-11-07 16:26:39,393 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 146 to 146.
[2024-11-07 16:26:39,393 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 146 states, 91 states have (on average 1.5494505494505495) internal successors, (141), 132 states have internal predecessors, (141), 8 states have call successors, (8), 6 states have call predecessors, (8), 5 states have return successors, (8), 7 states have call predecessors, (8), 8 states have call successors, (8)
[2024-11-07 16:26:39,394 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146 states to 146 states and 157 transitions.
[2024-11-07 16:26:39,394 INFO L78 Accepts]: Start accepts. Automaton has 146 states and 157 transitions. Word has length 23
[2024-11-07 16:26:39,394 INFO L84 Accepts]: Finished accepts. word is rejected.
[2024-11-07 16:26:39,394 INFO L471 AbstractCegarLoop]: Abstraction has 146 states and 157 transitions.
[2024-11-07 16:26:39,395 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 6 states have internal predecessors, (20), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)
[2024-11-07 16:26:39,395 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 157 transitions.
[2024-11-07 16:26:39,395 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24
[2024-11-07 16:26:39,395 INFO L207 NwaCegarLoop]: Found error trace
[2024-11-07 16:26:39,395 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]
[2024-11-07 16:26:39,400 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 16:26:39,596 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3
[2024-11-07 16:26:39,596 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting list_emptyErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [val_from_nodeErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, val_from_nodeErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, list_emptyErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 53 more)] ===
[2024-11-07 16:26:39,596 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-11-07 16:26:39,596 INFO L85 PathProgramCache]: Analyzing trace with hash -153149798, now seen corresponding path program 1 times
[2024-11-07 16:26:39,597 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF
[2024-11-07 16:26:39,597 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1355107517]
[2024-11-07 16:26:39,597 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-07 16:26:39,597 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3
[2024-11-07 16:26:39,597 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat
[2024-11-07 16:26:39,599 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null)
[2024-11-07 16:26:39,600 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (14)] Waiting until timeout for monitored process
[2024-11-07 16:26:39,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 16:26:39,702 INFO L255 TraceCheckSpWp]: Trace formula consists of 151 conjuncts, 11 conjuncts are in the unsatisfiable core
[2024-11-07 16:26:39,704 INFO L278 TraceCheckSpWp]: Computing forward predicates...
[2024-11-07 16:26:39,873 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-11-07 16:26:39,873 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect
[2024-11-07 16:26:39,873 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace
[2024-11-07 16:26:39,873 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1355107517]
[2024-11-07 16:26:39,873 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1355107517] provided 1 perfect and 0 imperfect interpolant sequences
[2024-11-07 16:26:39,873 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-11-07 16:26:39,873 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2024-11-07 16:26:39,874 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1778241351]
[2024-11-07 16:26:39,874 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-11-07 16:26:39,874 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states
[2024-11-07 16:26:39,874 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF
[2024-11-07 16:26:39,874 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants.
[2024-11-07 16:26:39,874 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56
[2024-11-07 16:26:39,874 INFO L87 Difference]: Start difference. First operand 146 states and 157 transitions. Second operand has 8 states, 7 states have (on average 2.857142857142857) internal successors, (20), 6 states have internal predecessors, (20), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)
[2024-11-07 16:26:40,347 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2024-11-07 16:26:40,348 INFO L93 Difference]: Finished difference Result 145 states and 156 transitions.
[2024-11-07 16:26:40,348 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states.
[2024-11-07 16:26:40,349 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 2.857142857142857) internal successors, (20), 6 states have internal predecessors, (20), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 23
[2024-11-07 16:26:40,349 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2024-11-07 16:26:40,352 INFO L225 Difference]: With dead ends: 145
[2024-11-07 16:26:40,352 INFO L226 Difference]: Without dead ends: 145
[2024-11-07 16:26:40,352 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=46, Invalid=110, Unknown=0, NotChecked=0, Total=156
[2024-11-07 16:26:40,353 INFO L432 NwaCegarLoop]: 75 mSDtfsCounter, 241 mSDsluCounter, 251 mSDsCounter, 0 mSdLazyCounter, 319 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 244 SdHoareTripleChecker+Valid, 326 SdHoareTripleChecker+Invalid, 336 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 319 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time
[2024-11-07 16:26:40,353 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [244 Valid, 326 Invalid, 336 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 319 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time]
[2024-11-07 16:26:40,353 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 145 states.
[2024-11-07 16:26:40,356 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 145 to 145.
[2024-11-07 16:26:40,357 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 145 states, 91 states have (on average 1.5384615384615385) internal successors, (140), 131 states have internal predecessors, (140), 8 states have call successors, (8), 6 states have call predecessors, (8), 5 states have return successors, (8), 7 states have call predecessors, (8), 8 states have call successors, (8)
[2024-11-07 16:26:40,358 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 145 states to 145 states and 156 transitions.
[2024-11-07 16:26:40,358 INFO L78 Accepts]: Start accepts. Automaton has 145 states and 156 transitions. Word has length 23
[2024-11-07 16:26:40,359 INFO L84 Accepts]: Finished accepts. word is rejected.
[2024-11-07 16:26:40,359 INFO L471 AbstractCegarLoop]: Abstraction has 145 states and 156 transitions.
[2024-11-07 16:26:40,359 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 2.857142857142857) internal successors, (20), 6 states have internal predecessors, (20), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)
[2024-11-07 16:26:40,359 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 156 transitions.
[2024-11-07 16:26:40,360 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28
[2024-11-07 16:26:40,361 INFO L207 NwaCegarLoop]: Found error trace
[2024-11-07 16:26:40,361 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-11-07 16:26:40,365 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (14)] Ended with exit code 0
[2024-11-07 16:26:40,561 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3
[2024-11-07 16:26:40,562 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting list_addErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [val_from_nodeErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, val_from_nodeErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, list_emptyErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 53 more)] ===
[2024-11-07 16:26:40,562 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-11-07 16:26:40,562 INFO L85 PathProgramCache]: Analyzing trace with hash 279128367, now seen corresponding path program 1 times
[2024-11-07 16:26:40,562 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF
[2024-11-07 16:26:40,562 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1258948925]
[2024-11-07 16:26:40,562 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-07 16:26:40,562 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3
[2024-11-07 16:26:40,563 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat
[2024-11-07 16:26:40,565 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null)
[2024-11-07 16:26:40,567 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (15)] Waiting until timeout for monitored process
[2024-11-07 16:26:40,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 16:26:40,745 INFO L255 TraceCheckSpWp]: Trace formula consists of 209 conjuncts, 32 conjuncts are in the unsatisfiable core
[2024-11-07 16:26:40,747 INFO L278 TraceCheckSpWp]: Computing forward predicates...
[2024-11-07 16:26:40,751 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7
[2024-11-07 16:26:40,935 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 11 treesize of output 7
[2024-11-07 16:26:41,116 INFO L349 Elim1Store]: treesize reduction 116, result has 26.6 percent of original size
[2024-11-07 16:26:41,116 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 9 case distinctions, treesize of input 37 treesize of output 67
[2024-11-07 16:26:41,254 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 21
[2024-11-07 16:26:41,525 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 15
[2024-11-07 16:26:41,683 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 4 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-11-07 16:26:41,683 INFO L311 TraceCheckSpWp]: Computing backward predicates...
[2024-11-07 16:26:42,233 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2024-11-07 16:26:42,233 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 26
[2024-11-07 16:26:42,236 INFO L173 IndexEqualityManager]: detected equality via solver
[2024-11-07 16:26:42,238 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 15
[2024-11-07 16:26:42,276 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace
[2024-11-07 16:26:42,277 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1258948925]
[2024-11-07 16:26:42,277 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1258948925] provided 0 perfect and 1 imperfect interpolant sequences
[2024-11-07 16:26:42,277 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1902485160]
[2024-11-07 16:26:42,277 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-07 16:26:42,277 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt
[2024-11-07 16:26:42,277 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/cvc4
[2024-11-07 16:26:42,295 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null)
[2024-11-07 16:26:42,298 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (16)] Waiting until timeout for monitored process
[2024-11-07 16:26:42,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 16:26:42,581 INFO L255 TraceCheckSpWp]: Trace formula consists of 209 conjuncts, 34 conjuncts are in the unsatisfiable core
[2024-11-07 16:26:42,583 INFO L278 TraceCheckSpWp]: Computing forward predicates...
[2024-11-07 16:26:42,632 INFO L349 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size
[2024-11-07 16:26:42,633 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 20
[2024-11-07 16:26:42,965 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 11 treesize of output 7
[2024-11-07 16:26:43,181 INFO L349 Elim1Store]: treesize reduction 112, result has 27.3 percent of original size
[2024-11-07 16:26:43,182 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 8 case distinctions, treesize of input 39 treesize of output 60
[2024-11-07 16:26:43,319 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 21
[2024-11-07 16:26:43,449 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11
[2024-11-07 16:26:43,519 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 1 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-11-07 16:26:43,519 INFO L311 TraceCheckSpWp]: Computing backward predicates...
[2024-11-07 16:26:43,533 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_410 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 1) (bvadd (_ bv1 1) (select |c_#valid| (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_gl_insert_~node~0#1.base| v_ArrVal_410) |c_~#gl_list~0.base|) |c_~#gl_list~0.offset|))))) is different from false
[2024-11-07 16:26:43,709 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2024-11-07 16:26:43,710 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 26
[2024-11-07 16:26:43,712 INFO L173 IndexEqualityManager]: detected equality via solver
[2024-11-07 16:26:43,713 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 15
[2024-11-07 16:26:47,757 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1902485160] provided 0 perfect and 1 imperfect interpolant sequences
[2024-11-07 16:26:47,757 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences.
[2024-11-07 16:26:47,758 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 12] total 26
[2024-11-07 16:26:47,758 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [145302987]
[2024-11-07 16:26:47,758 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton
[2024-11-07 16:26:47,758 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 27 states
[2024-11-07 16:26:47,758 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF
[2024-11-07 16:26:47,759 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants.
[2024-11-07 16:26:47,760 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=160, Invalid=1139, Unknown=37, NotChecked=70, Total=1406
[2024-11-07 16:26:47,760 INFO L87 Difference]: Start difference. First operand 145 states and 156 transitions. Second operand has 27 states, 25 states have (on average 1.92) internal successors, (48), 24 states have internal predecessors, (48), 4 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2)
[2024-11-07 16:26:50,089 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2024-11-07 16:26:50,089 INFO L93 Difference]: Finished difference Result 228 states and 243 transitions.
[2024-11-07 16:26:50,089 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states.
[2024-11-07 16:26:50,090 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 25 states have (on average 1.92) internal successors, (48), 24 states have internal predecessors, (48), 4 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 27
[2024-11-07 16:26:50,090 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2024-11-07 16:26:50,091 INFO L225 Difference]: With dead ends: 228
[2024-11-07 16:26:50,091 INFO L226 Difference]: Without dead ends: 228
[2024-11-07 16:26:50,091 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 40 SyntacticMatches, 1 SemanticMatches, 45 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 509 ImplicationChecksByTransitivity, 6.1s TimeCoverageRelationStatistics Valid=314, Invalid=1723, Unknown=37, NotChecked=88, Total=2162
[2024-11-07 16:26:50,092 INFO L432 NwaCegarLoop]: 69 mSDtfsCounter, 440 mSDsluCounter, 915 mSDsCounter, 0 mSdLazyCounter, 1232 mSolverCounterSat, 60 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 441 SdHoareTripleChecker+Valid, 984 SdHoareTripleChecker+Invalid, 1292 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 60 IncrementalHoareTripleChecker+Valid, 1232 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time
[2024-11-07 16:26:50,092 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [441 Valid, 984 Invalid, 1292 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [60 Valid, 1232 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time]
[2024-11-07 16:26:50,092 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 228 states.
[2024-11-07 16:26:50,096 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 228 to 152.
[2024-11-07 16:26:50,096 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 152 states, 96 states have (on average 1.5) internal successors, (144), 137 states have internal predecessors, (144), 9 states have call successors, (9), 7 states have call predecessors, (9), 6 states have return successors, (9), 7 states have call predecessors, (9), 9 states have call successors, (9)
[2024-11-07 16:26:50,098 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 152 states to 152 states and 162 transitions.
[2024-11-07 16:26:50,098 INFO L78 Accepts]: Start accepts. Automaton has 152 states and 162 transitions. Word has length 27
[2024-11-07 16:26:50,099 INFO L84 Accepts]: Finished accepts. word is rejected.
[2024-11-07 16:26:50,099 INFO L471 AbstractCegarLoop]: Abstraction has 152 states and 162 transitions.
[2024-11-07 16:26:50,099 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 25 states have (on average 1.92) internal successors, (48), 24 states have internal predecessors, (48), 4 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2)
[2024-11-07 16:26:50,099 INFO L276 IsEmpty]: Start isEmpty. Operand 152 states and 162 transitions.
[2024-11-07 16:26:50,099 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28
[2024-11-07 16:26:50,099 INFO L207 NwaCegarLoop]: Found error trace
[2024-11-07 16:26:50,099 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-11-07 16:26:50,106 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (15)] Ended with exit code 0
[2024-11-07 16:26:50,305 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (16)] Ended with exit code 0
[2024-11-07 16:26:50,500 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3,16 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt
[2024-11-07 16:26:50,500 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting list_addErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [val_from_nodeErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, val_from_nodeErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, list_emptyErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 53 more)] ===
[2024-11-07 16:26:50,500 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-11-07 16:26:50,500 INFO L85 PathProgramCache]: Analyzing trace with hash 279128368, now seen corresponding path program 1 times
[2024-11-07 16:26:50,501 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF
[2024-11-07 16:26:50,501 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1650824128]
[2024-11-07 16:26:50,501 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-07 16:26:50,501 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3
[2024-11-07 16:26:50,501 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat
[2024-11-07 16:26:50,503 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null)
[2024-11-07 16:26:50,504 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (17)] Waiting until timeout for monitored process
[2024-11-07 16:26:50,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 16:26:50,681 INFO L255 TraceCheckSpWp]: Trace formula consists of 209 conjuncts, 47 conjuncts are in the unsatisfiable core
[2024-11-07 16:26:50,684 INFO L278 TraceCheckSpWp]: Computing forward predicates...
[2024-11-07 16:26:50,689 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5
[2024-11-07 16:26:50,694 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7
[2024-11-07 16:26:50,930 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 11 treesize of output 7
[2024-11-07 16:26:50,935 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 11 treesize of output 7
[2024-11-07 16:26:51,154 INFO L349 Elim1Store]: treesize reduction 56, result has 23.3 percent of original size
[2024-11-07 16:26:51,155 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 31 treesize of output 35
[2024-11-07 16:26:51,166 INFO L349 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size
[2024-11-07 16:26:51,167 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 21
[2024-11-07 16:26:51,247 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 19
[2024-11-07 16:26:51,252 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11
[2024-11-07 16:26:51,343 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9
[2024-11-07 16:26:51,403 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 1 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-11-07 16:26:51,404 INFO L311 TraceCheckSpWp]: Computing backward predicates...
[2024-11-07 16:26:51,639 WARN L851 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_478 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_479 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (_ bv8 32) (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_gl_insert_~node~0#1.base| v_ArrVal_479) |c_~#gl_list~0.base|) |c_~#gl_list~0.offset|)) (select |c_#length| (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_gl_insert_~node~0#1.base| v_ArrVal_478) |c_~#gl_list~0.base|) |c_~#gl_list~0.offset|)))) (forall ((v_ArrVal_479 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_gl_insert_~node~0#1.base| v_ArrVal_479) |c_~#gl_list~0.base|) |c_~#gl_list~0.offset|))) (bvule (bvadd (_ bv4 32) .cse0) (bvadd (_ bv8 32) .cse0))))) is different from false
[2024-11-07 16:26:52,095 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2024-11-07 16:26:52,096 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 41 treesize of output 32
[2024-11-07 16:26:52,099 INFO L173 IndexEqualityManager]: detected equality via solver
[2024-11-07 16:26:52,101 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 14
[2024-11-07 16:26:52,116 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2024-11-07 16:26:52,116 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 42 treesize of output 43
[2024-11-07 16:26:52,119 INFO L173 IndexEqualityManager]: detected equality via solver
[2024-11-07 16:26:52,120 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 32
[2024-11-07 16:26:52,130 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2024-11-07 16:26:52,130 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 28
[2024-11-07 16:26:52,133 INFO L173 IndexEqualityManager]: detected equality via solver
[2024-11-07 16:26:52,135 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 17
[2024-11-07 16:26:52,268 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace
[2024-11-07 16:26:52,268 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1650824128]
[2024-11-07 16:26:52,268 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1650824128] provided 0 perfect and 1 imperfect interpolant sequences
[2024-11-07 16:26:52,268 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [67469823]
[2024-11-07 16:26:52,268 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-07 16:26:52,268 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt
[2024-11-07 16:26:52,268 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/cvc4
[2024-11-07 16:26:52,270 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null)
[2024-11-07 16:26:52,271 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (18)] Waiting until timeout for monitored process
[2024-11-07 16:26:52,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 16:26:52,617 INFO L255 TraceCheckSpWp]: Trace formula consists of 209 conjuncts, 51 conjuncts are in the unsatisfiable core
[2024-11-07 16:26:52,620 INFO L278 TraceCheckSpWp]: Computing forward predicates...
[2024-11-07 16:26:52,660 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7
[2024-11-07 16:26:52,665 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5
[2024-11-07 16:26:53,159 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 11 treesize of output 7
[2024-11-07 16:26:53,170 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 11 treesize of output 7
[2024-11-07 16:26:53,442 INFO L190 IndexEqualityManager]: detected not equals via solver
[2024-11-07 16:26:53,443 INFO L190 IndexEqualityManager]: detected not equals via solver
[2024-11-07 16:26:53,446 INFO L349 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size
[2024-11-07 16:26:53,446 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 21
[2024-11-07 16:26:53,470 INFO L349 Elim1Store]: treesize reduction 56, result has 23.3 percent of original size
[2024-11-07 16:26:53,470 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 31 treesize of output 35
[2024-11-07 16:26:53,600 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 19
[2024-11-07 16:26:53,610 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11
[2024-11-07 16:26:53,837 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9
[2024-11-07 16:26:53,865 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 1 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-11-07 16:26:53,865 INFO L311 TraceCheckSpWp]: Computing backward predicates...
[2024-11-07 16:26:53,906 WARN L851 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_552 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_551 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_gl_insert_~node~0#1.base| v_ArrVal_552) |c_~#gl_list~0.base|) |c_~#gl_list~0.offset|) (_ bv8 32)) (select |c_#length| (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_gl_insert_~node~0#1.base| v_ArrVal_551) |c_~#gl_list~0.base|) |c_~#gl_list~0.offset|)))) (forall ((v_ArrVal_552 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_gl_insert_~node~0#1.base| v_ArrVal_552) |c_~#gl_list~0.base|) |c_~#gl_list~0.offset|))) (bvule (bvadd .cse0 (_ bv4 32)) (bvadd .cse0 (_ bv8 32)))))) is different from false
[2024-11-07 16:26:54,350 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2024-11-07 16:26:54,351 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 41 treesize of output 32
[2024-11-07 16:26:54,353 INFO L173 IndexEqualityManager]: detected equality via solver
[2024-11-07 16:26:54,354 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 14
[2024-11-07 16:26:54,365 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2024-11-07 16:26:54,365 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 42 treesize of output 43
[2024-11-07 16:26:54,367 INFO L173 IndexEqualityManager]: detected equality via solver
[2024-11-07 16:26:54,368 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 32
[2024-11-07 16:26:54,374 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2024-11-07 16:26:54,374 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 28
[2024-11-07 16:26:54,376 INFO L173 IndexEqualityManager]: detected equality via solver
[2024-11-07 16:26:54,377 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 17
[2024-11-07 16:26:54,487 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [67469823] provided 0 perfect and 1 imperfect interpolant sequences
[2024-11-07 16:26:54,487 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences.
[2024-11-07 16:26:54,487 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 26
[2024-11-07 16:26:54,487 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1910112570]
[2024-11-07 16:26:54,487 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton
[2024-11-07 16:26:54,488 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 27 states
[2024-11-07 16:26:54,488 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF
[2024-11-07 16:26:54,488 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants.
[2024-11-07 16:26:54,488 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=137, Invalid=1059, Unknown=2, NotChecked=134, Total=1332
[2024-11-07 16:26:54,489 INFO L87 Difference]: Start difference. First operand 152 states and 162 transitions. Second operand has 27 states, 24 states have (on average 1.9166666666666667) internal successors, (46), 23 states have internal predecessors, (46), 4 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2)
[2024-11-07 16:26:57,555 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2024-11-07 16:26:57,555 INFO L93 Difference]: Finished difference Result 214 states and 229 transitions.
[2024-11-07 16:26:57,556 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states.
[2024-11-07 16:26:57,556 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 24 states have (on average 1.9166666666666667) internal successors, (46), 23 states have internal predecessors, (46), 4 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 27
[2024-11-07 16:26:57,556 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2024-11-07 16:26:57,557 INFO L225 Difference]: With dead ends: 214
[2024-11-07 16:26:57,557 INFO L226 Difference]: Without dead ends: 214
[2024-11-07 16:26:57,558 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 39 SyntacticMatches, 2 SemanticMatches, 42 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 463 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=264, Invalid=1464, Unknown=2, NotChecked=162, Total=1892
[2024-11-07 16:26:57,558 INFO L432 NwaCegarLoop]: 56 mSDtfsCounter, 533 mSDsluCounter, 705 mSDsCounter, 0 mSdLazyCounter, 1620 mSolverCounterSat, 70 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 535 SdHoareTripleChecker+Valid, 761 SdHoareTripleChecker+Invalid, 1690 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 70 IncrementalHoareTripleChecker+Valid, 1620 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.6s IncrementalHoareTripleChecker+Time
[2024-11-07 16:26:57,558 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [535 Valid, 761 Invalid, 1690 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [70 Valid, 1620 Invalid, 0 Unknown, 0 Unchecked, 2.6s Time]
[2024-11-07 16:26:57,559 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 214 states.
[2024-11-07 16:26:57,562 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 214 to 144.
[2024-11-07 16:26:57,562 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 144 states, 89 states have (on average 1.5280898876404494) internal successors, (136), 130 states have internal predecessors, (136), 8 states have call successors, (8), 6 states have call predecessors, (8), 6 states have return successors, (8), 7 states have call predecessors, (8), 8 states have call successors, (8)
[2024-11-07 16:26:57,563 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 144 states to 144 states and 152 transitions.
[2024-11-07 16:26:57,563 INFO L78 Accepts]: Start accepts. Automaton has 144 states and 152 transitions. Word has length 27
[2024-11-07 16:26:57,563 INFO L84 Accepts]: Finished accepts. word is rejected.
[2024-11-07 16:26:57,563 INFO L471 AbstractCegarLoop]: Abstraction has 144 states and 152 transitions.
[2024-11-07 16:26:57,563 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 24 states have (on average 1.9166666666666667) internal successors, (46), 23 states have internal predecessors, (46), 4 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2)
[2024-11-07 16:26:57,563 INFO L276 IsEmpty]: Start isEmpty. Operand 144 states and 152 transitions.
[2024-11-07 16:26:57,564 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33
[2024-11-07 16:26:57,564 INFO L207 NwaCegarLoop]: Found error trace
[2024-11-07 16:26:57,564 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]
[2024-11-07 16:26:57,570 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (18)] Ended with exit code 0
[2024-11-07 16:26:57,770 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (17)] Ended with exit code 0
[2024-11-07 16:26:57,965 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt,17 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3
[2024-11-07 16:26:57,965 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr30REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [val_from_nodeErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, val_from_nodeErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, list_emptyErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 53 more)] ===
[2024-11-07 16:26:57,965 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-11-07 16:26:57,965 INFO L85 PathProgramCache]: Analyzing trace with hash -1115236899, now seen corresponding path program 1 times
[2024-11-07 16:26:57,966 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF
[2024-11-07 16:26:57,966 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1682694543]
[2024-11-07 16:26:57,966 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-07 16:26:57,966 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3
[2024-11-07 16:26:57,966 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat
[2024-11-07 16:26:57,967 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null)
[2024-11-07 16:26:57,968 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (19)] Waiting until timeout for monitored process
[2024-11-07 16:26:58,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 16:26:58,076 INFO L255 TraceCheckSpWp]: Trace formula consists of 171 conjuncts, 25 conjuncts are in the unsatisfiable core
[2024-11-07 16:26:58,078 INFO L278 TraceCheckSpWp]: Computing forward predicates...
[2024-11-07 16:26:58,163 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 11 treesize of output 7
[2024-11-07 16:26:58,335 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-11-07 16:26:58,335 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect
[2024-11-07 16:26:58,335 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace
[2024-11-07 16:26:58,335 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1682694543]
[2024-11-07 16:26:58,336 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1682694543] provided 1 perfect and 0 imperfect interpolant sequences
[2024-11-07 16:26:58,336 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-11-07 16:26:58,336 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11
[2024-11-07 16:26:58,336 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1539651543]
[2024-11-07 16:26:58,336 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-11-07 16:26:58,336 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states
[2024-11-07 16:26:58,336 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF
[2024-11-07 16:26:58,337 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants.
[2024-11-07 16:26:58,337 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=99, Unknown=0, NotChecked=0, Total=132
[2024-11-07 16:26:58,337 INFO L87 Difference]: Start difference. First operand 144 states and 152 transitions. Second operand has 12 states, 12 states have (on average 2.3333333333333335) internal successors, (28), 10 states have internal predecessors, (28), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2)
[2024-11-07 16:26:58,747 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2024-11-07 16:26:58,747 INFO L93 Difference]: Finished difference Result 189 states and 202 transitions.
[2024-11-07 16:26:58,748 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states.
[2024-11-07 16:26:58,748 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 2.3333333333333335) internal successors, (28), 10 states have internal predecessors, (28), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 32
[2024-11-07 16:26:58,748 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2024-11-07 16:26:58,749 INFO L225 Difference]: With dead ends: 189
[2024-11-07 16:26:58,749 INFO L226 Difference]: Without dead ends: 189
[2024-11-07 16:26:58,749 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=43, Invalid=139, Unknown=0, NotChecked=0, Total=182
[2024-11-07 16:26:58,749 INFO L432 NwaCegarLoop]: 98 mSDtfsCounter, 212 mSDsluCounter, 592 mSDsCounter, 0 mSdLazyCounter, 358 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 216 SdHoareTripleChecker+Valid, 690 SdHoareTripleChecker+Invalid, 366 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 358 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time
[2024-11-07 16:26:58,749 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [216 Valid, 690 Invalid, 366 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 358 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time]
[2024-11-07 16:26:58,750 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 189 states.
[2024-11-07 16:26:58,752 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 189 to 142.
[2024-11-07 16:26:58,753 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 142 states, 87 states have (on average 1.528735632183908) internal successors, (133), 128 states have internal predecessors, (133), 8 states have call successors, (8), 6 states have call predecessors, (8), 6 states have return successors, (8), 7 states have call predecessors, (8), 8 states have call successors, (8)
[2024-11-07 16:26:58,753 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 142 states to 142 states and 149 transitions.
[2024-11-07 16:26:58,753 INFO L78 Accepts]: Start accepts. Automaton has 142 states and 149 transitions. Word has length 32
[2024-11-07 16:26:58,754 INFO L84 Accepts]: Finished accepts. word is rejected.
[2024-11-07 16:26:58,754 INFO L471 AbstractCegarLoop]: Abstraction has 142 states and 149 transitions.
[2024-11-07 16:26:58,754 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 2.3333333333333335) internal successors, (28), 10 states have internal predecessors, (28), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2)
[2024-11-07 16:26:58,754 INFO L276 IsEmpty]: Start isEmpty. Operand 142 states and 149 transitions.
[2024-11-07 16:26:58,754 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39
[2024-11-07 16:26:58,754 INFO L207 NwaCegarLoop]: Found error trace
[2024-11-07 16:26:58,754 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]
[2024-11-07 16:26:58,759 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (19)] Ended with exit code 0
[2024-11-07 16:26:58,955 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3
[2024-11-07 16:26:58,955 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [val_from_nodeErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, val_from_nodeErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, list_emptyErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 53 more)] ===
[2024-11-07 16:26:58,955 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-11-07 16:26:58,955 INFO L85 PathProgramCache]: Analyzing trace with hash 1344431412, now seen corresponding path program 1 times
[2024-11-07 16:26:58,956 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF
[2024-11-07 16:26:58,956 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [273091529]
[2024-11-07 16:26:58,956 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-07 16:26:58,956 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3
[2024-11-07 16:26:58,956 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat
[2024-11-07 16:26:58,958 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null)
[2024-11-07 16:26:58,959 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (20)] Waiting until timeout for monitored process
[2024-11-07 16:26:59,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 16:26:59,083 INFO L255 TraceCheckSpWp]: Trace formula consists of 199 conjuncts, 29 conjuncts are in the unsatisfiable core
[2024-11-07 16:26:59,085 INFO L278 TraceCheckSpWp]: Computing forward predicates...
[2024-11-07 16:26:59,174 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 11 treesize of output 7
[2024-11-07 16:26:59,406 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked.
[2024-11-07 16:26:59,406 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect
[2024-11-07 16:26:59,406 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace
[2024-11-07 16:26:59,406 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [273091529]
[2024-11-07 16:26:59,407 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [273091529] provided 1 perfect and 0 imperfect interpolant sequences
[2024-11-07 16:26:59,407 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-11-07 16:26:59,407 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11
[2024-11-07 16:26:59,407 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1699400918]
[2024-11-07 16:26:59,407 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-11-07 16:26:59,408 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states
[2024-11-07 16:26:59,408 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF
[2024-11-07 16:26:59,408 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants.
[2024-11-07 16:26:59,408 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=99, Unknown=0, NotChecked=0, Total=132
[2024-11-07 16:26:59,409 INFO L87 Difference]: Start difference. First operand 142 states and 149 transitions. Second operand has 12 states, 12 states have (on average 2.6666666666666665) internal successors, (32), 10 states have internal predecessors, (32), 2 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3)
[2024-11-07 16:26:59,874 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2024-11-07 16:26:59,874 INFO L93 Difference]: Finished difference Result 189 states and 201 transitions.
[2024-11-07 16:26:59,874 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states.
[2024-11-07 16:26:59,874 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 2.6666666666666665) internal successors, (32), 10 states have internal predecessors, (32), 2 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 38
[2024-11-07 16:26:59,875 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2024-11-07 16:26:59,876 INFO L225 Difference]: With dead ends: 189
[2024-11-07 16:26:59,876 INFO L226 Difference]: Without dead ends: 189
[2024-11-07 16:26:59,876 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=43, Invalid=139, Unknown=0, NotChecked=0, Total=182
[2024-11-07 16:26:59,876 INFO L432 NwaCegarLoop]: 97 mSDtfsCounter, 160 mSDsluCounter, 621 mSDsCounter, 0 mSdLazyCounter, 403 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 163 SdHoareTripleChecker+Valid, 718 SdHoareTripleChecker+Invalid, 403 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 403 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time
[2024-11-07 16:26:59,876 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [163 Valid, 718 Invalid, 403 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 403 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time]
[2024-11-07 16:26:59,877 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 189 states.
[2024-11-07 16:26:59,880 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 189 to 143.
[2024-11-07 16:26:59,881 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 143 states, 88 states have (on average 1.5227272727272727) internal successors, (134), 128 states have internal predecessors, (134), 8 states have call successors, (8), 6 states have call predecessors, (8), 6 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8)
[2024-11-07 16:26:59,881 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 143 states to 143 states and 150 transitions.
[2024-11-07 16:26:59,882 INFO L78 Accepts]: Start accepts. Automaton has 143 states and 150 transitions. Word has length 38
[2024-11-07 16:26:59,882 INFO L84 Accepts]: Finished accepts. word is rejected.
[2024-11-07 16:26:59,882 INFO L471 AbstractCegarLoop]: Abstraction has 143 states and 150 transitions.
[2024-11-07 16:26:59,882 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 2.6666666666666665) internal successors, (32), 10 states have internal predecessors, (32), 2 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3)
[2024-11-07 16:26:59,882 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states and 150 transitions.
[2024-11-07 16:26:59,884 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41
[2024-11-07 16:26:59,884 INFO L207 NwaCegarLoop]: Found error trace
[2024-11-07 16:26:59,884 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]
[2024-11-07 16:26:59,890 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (20)] Ended with exit code 0
[2024-11-07 16:27:00,084 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 20 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3
[2024-11-07 16:27:00,084 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting val_from_nodeErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [val_from_nodeErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, val_from_nodeErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, list_emptyErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 53 more)] ===
[2024-11-07 16:27:00,085 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-11-07 16:27:00,085 INFO L85 PathProgramCache]: Analyzing trace with hash -762612393, now seen corresponding path program 1 times
[2024-11-07 16:27:00,085 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF
[2024-11-07 16:27:00,085 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1006471361]
[2024-11-07 16:27:00,085 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-07 16:27:00,085 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3
[2024-11-07 16:27:00,085 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat
[2024-11-07 16:27:00,087 INFO L229 MonitoredProcess]: Starting monitored process 21 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null)
[2024-11-07 16:27:00,088 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (21)] Waiting until timeout for monitored process
[2024-11-07 16:27:00,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 16:27:00,240 INFO L255 TraceCheckSpWp]: Trace formula consists of 207 conjuncts, 25 conjuncts are in the unsatisfiable core
[2024-11-07 16:27:00,243 INFO L278 TraceCheckSpWp]: Computing forward predicates...
[2024-11-07 16:27:00,245 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7
[2024-11-07 16:27:00,329 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 11 treesize of output 7
[2024-11-07 16:27:00,416 INFO L349 Elim1Store]: treesize reduction 58, result has 24.7 percent of original size
[2024-11-07 16:27:00,416 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 25 treesize of output 36
[2024-11-07 16:27:00,461 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11
[2024-11-07 16:27:00,538 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked.
[2024-11-07 16:27:00,539 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect
[2024-11-07 16:27:00,539 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace
[2024-11-07 16:27:00,539 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1006471361]
[2024-11-07 16:27:00,539 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1006471361] provided 1 perfect and 0 imperfect interpolant sequences
[2024-11-07 16:27:00,539 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-11-07 16:27:00,539 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11
[2024-11-07 16:27:00,539 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [785025376]
[2024-11-07 16:27:00,539 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-11-07 16:27:00,539 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states
[2024-11-07 16:27:00,539 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF
[2024-11-07 16:27:00,540 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants.
[2024-11-07 16:27:00,540 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132
[2024-11-07 16:27:00,540 INFO L87 Difference]: Start difference. First operand 143 states and 150 transitions. Second operand has 12 states, 10 states have (on average 2.9) internal successors, (29), 10 states have internal predecessors, (29), 3 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3)
[2024-11-07 16:27:01,688 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2024-11-07 16:27:01,688 INFO L93 Difference]: Finished difference Result 224 states and 241 transitions.
[2024-11-07 16:27:01,688 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states.
[2024-11-07 16:27:01,688 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 10 states have (on average 2.9) internal successors, (29), 10 states have internal predecessors, (29), 3 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) Word has length 40
[2024-11-07 16:27:01,689 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2024-11-07 16:27:01,690 INFO L225 Difference]: With dead ends: 224
[2024-11-07 16:27:01,690 INFO L226 Difference]: Without dead ends: 224
[2024-11-07 16:27:01,690 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 28 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=57, Invalid=215, Unknown=0, NotChecked=0, Total=272
[2024-11-07 16:27:01,690 INFO L432 NwaCegarLoop]: 64 mSDtfsCounter, 216 mSDsluCounter, 467 mSDsCounter, 0 mSdLazyCounter, 753 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 219 SdHoareTripleChecker+Valid, 531 SdHoareTripleChecker+Invalid, 766 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 753 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time
[2024-11-07 16:27:01,690 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [219 Valid, 531 Invalid, 766 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 753 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time]
[2024-11-07 16:27:01,691 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 224 states.
[2024-11-07 16:27:01,694 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 224 to 165.
[2024-11-07 16:27:01,694 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 165 states, 106 states have (on average 1.509433962264151) internal successors, (160), 146 states have internal predecessors, (160), 10 states have call successors, (10), 8 states have call predecessors, (10), 8 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10)
[2024-11-07 16:27:01,696 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 165 states to 165 states and 180 transitions.
[2024-11-07 16:27:01,696 INFO L78 Accepts]: Start accepts. Automaton has 165 states and 180 transitions. Word has length 40
[2024-11-07 16:27:01,696 INFO L84 Accepts]: Finished accepts. word is rejected.
[2024-11-07 16:27:01,696 INFO L471 AbstractCegarLoop]: Abstraction has 165 states and 180 transitions.
[2024-11-07 16:27:01,696 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 10 states have (on average 2.9) internal successors, (29), 10 states have internal predecessors, (29), 3 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3)
[2024-11-07 16:27:01,697 INFO L276 IsEmpty]: Start isEmpty. Operand 165 states and 180 transitions.
[2024-11-07 16:27:01,698 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41
[2024-11-07 16:27:01,698 INFO L207 NwaCegarLoop]: Found error trace
[2024-11-07 16:27:01,698 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]
[2024-11-07 16:27:01,707 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 (21)] Forceful destruction successful, exit code 0
[2024-11-07 16:27:01,898 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3
[2024-11-07 16:27:01,899 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting val_from_nodeErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [val_from_nodeErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, val_from_nodeErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, list_emptyErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 53 more)] ===
[2024-11-07 16:27:01,899 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-11-07 16:27:01,899 INFO L85 PathProgramCache]: Analyzing trace with hash -762612392, now seen corresponding path program 1 times
[2024-11-07 16:27:01,900 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF
[2024-11-07 16:27:01,900 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [596100615]
[2024-11-07 16:27:01,900 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-07 16:27:01,900 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3
[2024-11-07 16:27:01,900 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat
[2024-11-07 16:27:01,902 INFO L229 MonitoredProcess]: Starting monitored process 22 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null)
[2024-11-07 16:27:01,905 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (22)] Waiting until timeout for monitored process
[2024-11-07 16:27:02,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 16:27:02,088 INFO L255 TraceCheckSpWp]: Trace formula consists of 207 conjuncts, 40 conjuncts are in the unsatisfiable core
[2024-11-07 16:27:02,091 INFO L278 TraceCheckSpWp]: Computing forward predicates...
[2024-11-07 16:27:02,094 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5
[2024-11-07 16:27:02,099 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7
[2024-11-07 16:27:02,259 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 11 treesize of output 7
[2024-11-07 16:27:02,264 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 11 treesize of output 7
[2024-11-07 16:27:02,548 INFO L190 IndexEqualityManager]: detected not equals via solver
[2024-11-07 16:27:02,549 INFO L190 IndexEqualityManager]: detected not equals via solver
[2024-11-07 16:27:02,551 INFO L349 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size
[2024-11-07 16:27:02,551 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 21
[2024-11-07 16:27:02,568 INFO L349 Elim1Store]: treesize reduction 26, result has 33.3 percent of original size
[2024-11-07 16:27:02,569 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 24 treesize of output 26
[2024-11-07 16:27:02,645 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9
[2024-11-07 16:27:02,735 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-11-07 16:27:02,735 INFO L311 TraceCheckSpWp]: Computing backward predicates...
[2024-11-07 16:27:07,125 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace
[2024-11-07 16:27:07,126 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [596100615]
[2024-11-07 16:27:07,126 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [596100615] provided 0 perfect and 1 imperfect interpolant sequences
[2024-11-07 16:27:07,126 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [617069182]
[2024-11-07 16:27:07,126 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-07 16:27:07,126 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt
[2024-11-07 16:27:07,126 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/cvc4
[2024-11-07 16:27:07,128 INFO L229 MonitoredProcess]: Starting monitored process 23 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null)
[2024-11-07 16:27:07,129 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (23)] Waiting until timeout for monitored process
[2024-11-07 16:27:07,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 16:27:07,428 INFO L255 TraceCheckSpWp]: Trace formula consists of 207 conjuncts, 45 conjuncts are in the unsatisfiable core
[2024-11-07 16:27:07,431 INFO L278 TraceCheckSpWp]: Computing forward predicates...
[2024-11-07 16:27:07,468 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5
[2024-11-07 16:27:07,841 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 11 treesize of output 7
[2024-11-07 16:27:07,847 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 11 treesize of output 7
[2024-11-07 16:27:08,275 INFO L190 IndexEqualityManager]: detected not equals via solver
[2024-11-07 16:27:08,281 INFO L190 IndexEqualityManager]: detected not equals via solver
[2024-11-07 16:27:08,285 INFO L349 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size
[2024-11-07 16:27:08,285 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 21
[2024-11-07 16:27:08,658 INFO L349 Elim1Store]: treesize reduction 3, result has 75.0 percent of original size
[2024-11-07 16:27:08,659 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 31 treesize of output 24
[2024-11-07 16:27:09,033 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-11-07 16:27:09,033 INFO L311 TraceCheckSpWp]: Computing backward predicates...
[2024-11-07 16:27:09,355 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [617069182] provided 0 perfect and 1 imperfect interpolant sequences
[2024-11-07 16:27:09,355 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences.
[2024-11-07 16:27:09,355 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 24
[2024-11-07 16:27:09,355 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [676588011]
[2024-11-07 16:27:09,356 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton
[2024-11-07 16:27:09,356 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 25 states
[2024-11-07 16:27:09,356 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF
[2024-11-07 16:27:09,356 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants.
[2024-11-07 16:27:09,357 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=99, Invalid=892, Unknown=1, NotChecked=0, Total=992
[2024-11-07 16:27:09,357 INFO L87 Difference]: Start difference. First operand 165 states and 180 transitions. Second operand has 25 states, 22 states have (on average 3.0) internal successors, (66), 21 states have internal predecessors, (66), 8 states have call successors, (8), 8 states have call predecessors, (8), 6 states have return successors, (6), 4 states have call predecessors, (6), 6 states have call successors, (6)
[2024-11-07 16:27:16,267 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2024-11-07 16:27:16,267 INFO L93 Difference]: Finished difference Result 206 states and 219 transitions.
[2024-11-07 16:27:16,268 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states.
[2024-11-07 16:27:16,268 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 22 states have (on average 3.0) internal successors, (66), 21 states have internal predecessors, (66), 8 states have call successors, (8), 8 states have call predecessors, (8), 6 states have return successors, (6), 4 states have call predecessors, (6), 6 states have call successors, (6) Word has length 40
[2024-11-07 16:27:16,268 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2024-11-07 16:27:16,269 INFO L225 Difference]: With dead ends: 206
[2024-11-07 16:27:16,269 INFO L226 Difference]: Without dead ends: 206
[2024-11-07 16:27:16,269 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 121 GetRequests, 78 SyntacticMatches, 0 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 407 ImplicationChecksByTransitivity, 7.2s TimeCoverageRelationStatistics Valid=270, Invalid=1709, Unknown=1, NotChecked=0, Total=1980
[2024-11-07 16:27:16,270 INFO L432 NwaCegarLoop]: 52 mSDtfsCounter, 532 mSDsluCounter, 653 mSDsCounter, 0 mSdLazyCounter, 1569 mSolverCounterSat, 80 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 532 SdHoareTripleChecker+Valid, 705 SdHoareTripleChecker+Invalid, 1649 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 80 IncrementalHoareTripleChecker+Valid, 1569 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.0s IncrementalHoareTripleChecker+Time
[2024-11-07 16:27:16,270 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [532 Valid, 705 Invalid, 1649 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [80 Valid, 1569 Invalid, 0 Unknown, 0 Unchecked, 5.0s Time]
[2024-11-07 16:27:16,270 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 206 states.
[2024-11-07 16:27:16,273 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 206 to 170.
[2024-11-07 16:27:16,274 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 170 states, 110 states have (on average 1.4727272727272727) internal successors, (162), 150 states have internal predecessors, (162), 10 states have call successors, (10), 9 states have call predecessors, (10), 9 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10)
[2024-11-07 16:27:16,274 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 170 states to 170 states and 182 transitions.
[2024-11-07 16:27:16,274 INFO L78 Accepts]: Start accepts. Automaton has 170 states and 182 transitions. Word has length 40
[2024-11-07 16:27:16,275 INFO L84 Accepts]: Finished accepts. word is rejected.
[2024-11-07 16:27:16,275 INFO L471 AbstractCegarLoop]: Abstraction has 170 states and 182 transitions.
[2024-11-07 16:27:16,275 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 22 states have (on average 3.0) internal successors, (66), 21 states have internal predecessors, (66), 8 states have call successors, (8), 8 states have call predecessors, (8), 6 states have return successors, (6), 4 states have call predecessors, (6), 6 states have call successors, (6)
[2024-11-07 16:27:16,275 INFO L276 IsEmpty]: Start isEmpty. Operand 170 states and 182 transitions.
[2024-11-07 16:27:16,278 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51
[2024-11-07 16:27:16,278 INFO L207 NwaCegarLoop]: Found error trace
[2024-11-07 16:27:16,278 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-11-07 16:27:16,284 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (22)] Ended with exit code 0
[2024-11-07 16:27:16,483 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (23)] Ended with exit code 0
[2024-11-07 16:27:16,679 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 22 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3,23 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt
[2024-11-07 16:27:16,679 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting val_from_nodeErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [val_from_nodeErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, val_from_nodeErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, list_emptyErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 53 more)] ===
[2024-11-07 16:27:16,679 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-11-07 16:27:16,679 INFO L85 PathProgramCache]: Analyzing trace with hash 1328647601, now seen corresponding path program 1 times
[2024-11-07 16:27:16,680 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF
[2024-11-07 16:27:16,680 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [560663046]
[2024-11-07 16:27:16,680 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-07 16:27:16,680 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3
[2024-11-07 16:27:16,680 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat
[2024-11-07 16:27:16,682 INFO L229 MonitoredProcess]: Starting monitored process 24 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null)
[2024-11-07 16:27:16,682 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (24)] Waiting until timeout for monitored process
[2024-11-07 16:27:16,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 16:27:16,939 INFO L255 TraceCheckSpWp]: Trace formula consists of 233 conjuncts, 54 conjuncts are in the unsatisfiable core
[2024-11-07 16:27:16,942 INFO L278 TraceCheckSpWp]: Computing forward predicates...
[2024-11-07 16:27:16,968 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size
[2024-11-07 16:27:16,969 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 13
[2024-11-07 16:27:16,988 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11
[2024-11-07 16:27:16,995 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3
[2024-11-07 16:27:17,128 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 15 treesize of output 11
[2024-11-07 16:27:17,188 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 24
[2024-11-07 16:27:17,317 INFO L349 Elim1Store]: treesize reduction 46, result has 35.2 percent of original size
[2024-11-07 16:27:17,318 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 67 treesize of output 56
[2024-11-07 16:27:17,325 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 23 treesize of output 13
[2024-11-07 16:27:17,502 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3
[2024-11-07 16:27:17,853 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 28
[2024-11-07 16:27:18,269 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked.
[2024-11-07 16:27:18,269 INFO L311 TraceCheckSpWp]: Computing backward predicates...
[2024-11-07 16:27:18,551 INFO L349 Elim1Store]: treesize reduction 7, result has 68.2 percent of original size
[2024-11-07 16:27:18,551 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 27
[2024-11-07 16:27:18,683 INFO L349 Elim1Store]: treesize reduction 7, result has 68.2 percent of original size
[2024-11-07 16:27:18,683 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 27
[2024-11-07 16:27:19,388 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 76 treesize of output 72
[2024-11-07 16:27:22,996 INFO L349 Elim1Store]: treesize reduction 431, result has 31.9 percent of original size
[2024-11-07 16:27:22,997 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 8 select indices, 8 select index equivalence classes, 0 disjoint index pairs (out of 28 index pairs), introduced 10 new quantified variables, introduced 38 case distinctions, treesize of input 26755 treesize of output 23880
[2024-11-07 16:27:23,804 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2024-11-07 16:27:23,804 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 1213 treesize of output 1273
[2024-11-07 16:27:27,308 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 4