./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/ldv-memsafety/memleaks_test18_3.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/ldv-memsafety/memleaks_test18_3.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', '1df58a12292e53aa25870e709e17978d63a0e61d4dd56fb439981d66ecb6b925'] 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/ldv-memsafety/memleaks_test18_3.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 1df58a12292e53aa25870e709e17978d63a0e61d4dd56fb439981d66ecb6b925 --- Real Ultimate output --- This is Ultimate 0.3.0-?-4f9af40 [2024-11-07 16:33:59,003 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-07 16:33:59,061 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:33:59,066 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-07 16:33:59,066 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-07 16:33:59,086 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-07 16:33:59,086 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-07 16:33:59,086 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-07 16:33:59,087 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-07 16:33:59,087 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-07 16:33:59,087 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-07 16:33:59,087 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-07 16:33:59,087 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-07 16:33:59,087 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-07 16:33:59,088 INFO L153 SettingsManager]: * Use SBE=true [2024-11-07 16:33:59,088 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-07 16:33:59,088 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-07 16:33:59,088 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-07 16:33:59,088 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-07 16:33:59,088 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-07 16:33:59,088 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-11-07 16:33:59,088 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-11-07 16:33:59,088 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-11-07 16:33:59,088 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-07 16:33:59,088 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-07 16:33:59,088 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-07 16:33:59,088 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-07 16:33:59,088 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-07 16:33:59,088 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-07 16:33:59,088 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-07 16:33:59,088 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-07 16:33:59,088 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-07 16:33:59,088 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-07 16:33:59,089 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-07 16:33:59,089 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-07 16:33:59,089 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-07 16:33:59,089 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-07 16:33:59,089 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-07 16:33:59,089 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-07 16:33:59,089 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-07 16:33:59,089 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-07 16:33:59,089 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-07 16:33:59,089 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 -> 1df58a12292e53aa25870e709e17978d63a0e61d4dd56fb439981d66ecb6b925 [2024-11-07 16:33:59,311 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-07 16:33:59,317 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-07 16:33:59,320 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-07 16:33:59,321 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-07 16:33:59,321 INFO L274 PluginConnector]: CDTParser initialized [2024-11-07 16:33:59,322 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/ldv-memsafety/memleaks_test18_3.i [2024-11-07 16:34:00,436 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-07 16:34:00,696 INFO L384 CDTParser]: Found 1 translation units. [2024-11-07 16:34:00,697 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/ldv-memsafety/memleaks_test18_3.i [2024-11-07 16:34:00,714 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/752572a6e/01d401a1c1b54fe296f930c178690f57/FLAG55a919d40 [2024-11-07 16:34:01,002 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/752572a6e/01d401a1c1b54fe296f930c178690f57 [2024-11-07 16:34:01,003 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-07 16:34:01,004 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-07 16:34:01,005 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-07 16:34:01,005 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-07 16:34:01,007 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-07 16:34:01,008 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 04:34:01" (1/1) ... [2024-11-07 16:34:01,008 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@58f6e976 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:34:01, skipping insertion in model container [2024-11-07 16:34:01,008 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 04:34:01" (1/1) ... [2024-11-07 16:34:01,028 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-07 16:34:01,201 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-07 16:34:01,224 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-07 16:34:01,225 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-07 16:34:01,226 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-07 16:34:01,237 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:34:01,237 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver@3acfbcae and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:34:01, skipping insertion in model container [2024-11-07 16:34:01,237 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-07 16:34:01,237 INFO L186 ToolchainWalker]: Toolchain execution was canceled (user or tool) before executing de.uni_freiburg.informatik.ultimate.boogie.procedureinliner [2024-11-07 16:34:01,239 INFO L158 Benchmark]: Toolchain (without parser) took 234.15ms. Allocated memory is still 109.1MB. Free memory was 84.0MB in the beginning and 70.1MB in the end (delta: 13.9MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-11-07 16:34:01,239 INFO L158 Benchmark]: CDTParser took 0.18ms. Allocated memory is still 83.9MB. Free memory is still 47.5MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-07 16:34:01,239 INFO L158 Benchmark]: CACSL2BoogieTranslator took 232.65ms. Allocated memory is still 109.1MB. Free memory was 83.8MB in the beginning and 70.1MB in the end (delta: 13.7MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-11-07 16:34:01,240 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.18ms. Allocated memory is still 83.9MB. Free memory is still 47.5MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 232.65ms. Allocated memory is still 109.1MB. Free memory was 83.8MB in the beginning and 70.1MB in the end (delta: 13.7MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - UnsupportedSyntaxResult [Line: 607]: 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/ldv-memsafety/memleaks_test18_3.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 1df58a12292e53aa25870e709e17978d63a0e61d4dd56fb439981d66ecb6b925 --- Real Ultimate output --- This is Ultimate 0.3.0-?-4f9af40 [2024-11-07 16:34:02,762 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-07 16:34:02,851 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:34:02,856 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-07 16:34:02,856 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-07 16:34:02,873 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-07 16:34:02,875 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-07 16:34:02,875 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-07 16:34:02,875 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-07 16:34:02,875 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-07 16:34:02,876 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-07 16:34:02,876 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-07 16:34:02,876 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-07 16:34:02,876 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-07 16:34:02,877 INFO L153 SettingsManager]: * Use SBE=true [2024-11-07 16:34:02,877 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-07 16:34:02,877 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-07 16:34:02,877 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-07 16:34:02,877 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-07 16:34:02,877 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-07 16:34:02,877 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-11-07 16:34:02,877 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-11-07 16:34:02,878 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-11-07 16:34:02,878 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-07 16:34:02,878 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-07 16:34:02,878 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-07 16:34:02,878 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-07 16:34:02,878 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-07 16:34:02,878 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-07 16:34:02,878 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-07 16:34:02,878 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-07 16:34:02,878 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-07 16:34:02,878 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-07 16:34:02,879 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-07 16:34:02,879 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-07 16:34:02,879 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-07 16:34:02,879 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-07 16:34:02,879 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-07 16:34:02,879 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-07 16:34:02,879 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-07 16:34:02,879 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-07 16:34:02,879 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-07 16:34:02,879 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-07 16:34:02,879 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-07 16:34:02,879 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 -> 1df58a12292e53aa25870e709e17978d63a0e61d4dd56fb439981d66ecb6b925 [2024-11-07 16:34:03,199 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-07 16:34:03,206 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-07 16:34:03,207 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-07 16:34:03,208 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-07 16:34:03,208 INFO L274 PluginConnector]: CDTParser initialized [2024-11-07 16:34:03,208 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/ldv-memsafety/memleaks_test18_3.i [2024-11-07 16:34:04,305 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-07 16:34:04,520 INFO L384 CDTParser]: Found 1 translation units. [2024-11-07 16:34:04,520 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/ldv-memsafety/memleaks_test18_3.i [2024-11-07 16:34:04,532 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/c13b4d1a0/c53a6fb6e6e245299b0461603996b3cc/FLAG413190da4 [2024-11-07 16:34:04,862 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/c13b4d1a0/c53a6fb6e6e245299b0461603996b3cc [2024-11-07 16:34:04,863 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-07 16:34:04,864 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-07 16:34:04,865 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-07 16:34:04,865 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-07 16:34:04,867 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-07 16:34:04,868 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 04:34:04" (1/1) ... [2024-11-07 16:34:04,868 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@59a56093 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:34:04, skipping insertion in model container [2024-11-07 16:34:04,868 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 04:34:04" (1/1) ... [2024-11-07 16:34:04,894 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-07 16:34:05,081 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-07 16:34:05,112 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-07 16:34:05,112 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-07 16:34:05,114 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-07 16:34:05,126 INFO L197 MainTranslator]: Restarting translation with changed settings: SettingsChange [mNewPreferredMemoryModel=HoenickeLindenmann_1ByteResolution] [2024-11-07 16:34:05,137 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-07 16:34:05,157 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-07 16:34:05,168 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-07 16:34:05,169 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-07 16:34:05,170 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-07 16:34:05,174 INFO L200 MainTranslator]: Completed pre-run [2024-11-07 16:34:05,207 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-07 16:34:05,232 INFO L204 MainTranslator]: Completed translation [2024-11-07 16:34:05,232 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:34:05 WrapperNode [2024-11-07 16:34:05,232 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-07 16:34:05,233 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-07 16:34:05,233 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-07 16:34:05,233 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-07 16:34:05,236 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:34:05" (1/1) ... [2024-11-07 16:34:05,252 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:34:05" (1/1) ... [2024-11-07 16:34:05,261 INFO L138 Inliner]: procedures = 165, calls = 70, calls flagged for inlining = 21, calls inlined = 3, statements flattened = 30 [2024-11-07 16:34:05,262 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-07 16:34:05,262 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-07 16:34:05,262 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-07 16:34:05,262 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-07 16:34:05,268 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:34:05" (1/1) ... [2024-11-07 16:34:05,268 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:34:05" (1/1) ... [2024-11-07 16:34:05,269 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:34:05" (1/1) ... [2024-11-07 16:34:05,276 INFO L175 MemorySlicer]: Split 3 memory accesses to 2 slices as follows [2, 1]. 67 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0]. The 1 writes are split as follows [0, 1]. [2024-11-07 16:34:05,277 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:34:05" (1/1) ... [2024-11-07 16:34:05,277 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:34:05" (1/1) ... [2024-11-07 16:34:05,280 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:34:05" (1/1) ... [2024-11-07 16:34:05,282 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:34:05" (1/1) ... [2024-11-07 16:34:05,283 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:34:05" (1/1) ... [2024-11-07 16:34:05,283 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:34:05" (1/1) ... [2024-11-07 16:34:05,285 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-07 16:34:05,286 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-07 16:34:05,286 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-07 16:34:05,286 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-07 16:34:05,287 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:34:05" (1/1) ... [2024-11-07 16:34:05,291 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-07 16:34:05,299 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 16:34:05,307 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:34:05,309 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:34:05,324 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_malloc [2024-11-07 16:34:05,324 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_malloc [2024-11-07 16:34:05,325 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-11-07 16:34:05,325 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-07 16:34:05,325 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2024-11-07 16:34:05,325 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2024-11-07 16:34:05,325 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#0 [2024-11-07 16:34:05,325 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#1 [2024-11-07 16:34:05,325 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-07 16:34:05,325 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-07 16:34:05,420 INFO L238 CfgBuilder]: Building ICFG [2024-11-07 16:34:05,421 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-07 16:34:05,507 INFO L? ?]: Removed 13 outVars from TransFormulas that were not future-live. [2024-11-07 16:34:05,507 INFO L287 CfgBuilder]: Performing block encoding [2024-11-07 16:34:05,512 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-07 16:34:05,513 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-07 16:34:05,514 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 04:34:05 BoogieIcfgContainer [2024-11-07 16:34:05,514 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-07 16:34:05,515 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-07 16:34:05,515 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-07 16:34:05,520 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-07 16:34:05,520 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.11 04:34:04" (1/3) ... [2024-11-07 16:34:05,521 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@261d16cd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 04:34:05, skipping insertion in model container [2024-11-07 16:34:05,521 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:34:05" (2/3) ... [2024-11-07 16:34:05,522 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@261d16cd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 04:34:05, skipping insertion in model container [2024-11-07 16:34:05,522 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 04:34:05" (3/3) ... [2024-11-07 16:34:05,522 INFO L112 eAbstractionObserver]: Analyzing ICFG memleaks_test18_3.i [2024-11-07 16:34:05,533 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-07 16:34:05,533 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 3 error locations. [2024-11-07 16:34:05,556 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-07 16:34:05,563 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;@61667458, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-07 16:34:05,563 INFO L334 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2024-11-07 16:34:05,565 INFO L276 IsEmpty]: Start isEmpty. Operand has 21 states, 14 states have (on average 1.5) internal successors, (21), 17 states have internal predecessors, (21), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-07 16:34:05,569 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2024-11-07 16:34:05,569 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 16:34:05,569 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 16:34:05,569 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-07 16:34:05,572 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 16:34:05,572 INFO L85 PathProgramCache]: Analyzing trace with hash -74700687, now seen corresponding path program 1 times [2024-11-07 16:34:05,577 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-07 16:34:05,578 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1620372906] [2024-11-07 16:34:05,578 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 16:34:05,578 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:34:05,578 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-07 16:34:05,581 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:34:05,581 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:34:05,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 16:34:05,644 INFO L255 TraceCheckSpWp]: Trace formula consists of 40 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-07 16:34:05,646 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 16:34:05,704 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:34:05,704 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-07 16:34:05,705 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-07 16:34:05,705 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1620372906] [2024-11-07 16:34:05,705 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1620372906] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 16:34:05,705 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 16:34:05,706 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-07 16:34:05,706 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [759335749] [2024-11-07 16:34:05,710 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 16:34:05,712 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-07 16:34:05,712 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-07 16:34:05,725 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-07 16:34:05,726 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-07 16:34:05,727 INFO L87 Difference]: Start difference. First operand has 21 states, 14 states have (on average 1.5) internal successors, (21), 17 states have internal predecessors, (21), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand has 5 states, 5 states have (on average 1.8) internal successors, (9), 4 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-07 16:34:05,774 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 16:34:05,775 INFO L93 Difference]: Finished difference Result 31 states and 40 transitions. [2024-11-07 16:34:05,776 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-07 16:34:05,777 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 1.8) internal successors, (9), 4 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 11 [2024-11-07 16:34:05,777 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 16:34:05,780 INFO L225 Difference]: With dead ends: 31 [2024-11-07 16:34:05,781 INFO L226 Difference]: Without dead ends: 29 [2024-11-07 16:34:05,782 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-07 16:34:05,785 INFO L432 NwaCegarLoop]: 20 mSDtfsCounter, 6 mSDsluCounter, 51 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 71 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 28 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-07 16:34:05,786 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 71 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 16:34:05,793 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2024-11-07 16:34:05,802 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 23. [2024-11-07 16:34:05,803 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23 states, 16 states have (on average 1.3125) internal successors, (21), 18 states have internal predecessors, (21), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2024-11-07 16:34:05,804 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 27 transitions. [2024-11-07 16:34:05,805 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 27 transitions. Word has length 11 [2024-11-07 16:34:05,805 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 16:34:05,805 INFO L471 AbstractCegarLoop]: Abstraction has 23 states and 27 transitions. [2024-11-07 16:34:05,805 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 1.8) internal successors, (9), 4 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-07 16:34:05,805 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 27 transitions. [2024-11-07 16:34:05,806 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2024-11-07 16:34:05,806 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 16:34:05,806 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 16:34:05,809 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:34:06,006 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:34:06,007 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-07 16:34:06,007 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 16:34:06,007 INFO L85 PathProgramCache]: Analyzing trace with hash 812802994, now seen corresponding path program 1 times [2024-11-07 16:34:06,008 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-07 16:34:06,008 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [672412778] [2024-11-07 16:34:06,008 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 16:34:06,008 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:34:06,008 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-07 16:34:06,010 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:34:06,011 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:34:06,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 16:34:06,045 INFO L255 TraceCheckSpWp]: Trace formula consists of 34 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-07 16:34:06,046 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 16:34:06,071 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:34:06,071 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-07 16:34:06,072 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-07 16:34:06,072 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [672412778] [2024-11-07 16:34:06,072 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [672412778] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 16:34:06,072 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 16:34:06,072 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-07 16:34:06,072 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [986129334] [2024-11-07 16:34:06,072 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 16:34:06,072 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-07 16:34:06,072 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-07 16:34:06,073 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-07 16:34:06,073 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-07 16:34:06,073 INFO L87 Difference]: Start difference. First operand 23 states and 27 transitions. Second operand has 4 states, 3 states have (on average 3.0) internal successors, (9), 4 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-07 16:34:06,110 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 16:34:06,110 INFO L93 Difference]: Finished difference Result 32 states and 38 transitions. [2024-11-07 16:34:06,110 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-07 16:34:06,110 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 3.0) internal successors, (9), 4 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 11 [2024-11-07 16:34:06,110 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 16:34:06,111 INFO L225 Difference]: With dead ends: 32 [2024-11-07 16:34:06,111 INFO L226 Difference]: Without dead ends: 30 [2024-11-07 16:34:06,111 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 8 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:34:06,111 INFO L432 NwaCegarLoop]: 32 mSDtfsCounter, 8 mSDsluCounter, 34 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 66 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-07 16:34:06,112 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 66 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 16:34:06,112 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2024-11-07 16:34:06,114 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 28. [2024-11-07 16:34:06,114 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 20 states have (on average 1.3) internal successors, (26), 22 states have internal predecessors, (26), 3 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (6), 4 states have call predecessors, (6), 3 states have call successors, (6) [2024-11-07 16:34:06,114 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 35 transitions. [2024-11-07 16:34:06,114 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 35 transitions. Word has length 11 [2024-11-07 16:34:06,115 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 16:34:06,115 INFO L471 AbstractCegarLoop]: Abstraction has 28 states and 35 transitions. [2024-11-07 16:34:06,115 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 3.0) internal successors, (9), 4 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-07 16:34:06,115 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 35 transitions. [2024-11-07 16:34:06,115 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2024-11-07 16:34:06,115 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 16:34:06,115 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 16:34:06,118 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:34:06,315 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:34:06,316 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-07 16:34:06,316 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 16:34:06,316 INFO L85 PathProgramCache]: Analyzing trace with hash 1979292102, now seen corresponding path program 1 times [2024-11-07 16:34:06,316 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-07 16:34:06,316 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [840181007] [2024-11-07 16:34:06,316 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 16:34:06,316 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:34:06,317 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-07 16:34:06,319 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:34:06,320 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:34:06,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 16:34:06,359 INFO L255 TraceCheckSpWp]: Trace formula consists of 40 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-07 16:34:06,360 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 16:34:06,388 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:34:06,388 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-07 16:34:06,388 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-07 16:34:06,388 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [840181007] [2024-11-07 16:34:06,388 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [840181007] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 16:34:06,388 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 16:34:06,388 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-07 16:34:06,388 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [762071678] [2024-11-07 16:34:06,388 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 16:34:06,388 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-07 16:34:06,388 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-07 16:34:06,388 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-07 16:34:06,389 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-07 16:34:06,389 INFO L87 Difference]: Start difference. First operand 28 states and 35 transitions. Second operand has 4 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-07 16:34:06,416 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 16:34:06,417 INFO L93 Difference]: Finished difference Result 39 states and 53 transitions. [2024-11-07 16:34:06,417 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-07 16:34:06,418 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 12 [2024-11-07 16:34:06,418 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 16:34:06,419 INFO L225 Difference]: With dead ends: 39 [2024-11-07 16:34:06,419 INFO L226 Difference]: Without dead ends: 39 [2024-11-07 16:34:06,420 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-07 16:34:06,420 INFO L432 NwaCegarLoop]: 16 mSDtfsCounter, 12 mSDsluCounter, 18 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 34 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-07 16:34:06,420 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 34 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 16:34:06,421 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2024-11-07 16:34:06,424 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 29. [2024-11-07 16:34:06,424 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29 states, 21 states have (on average 1.2857142857142858) internal successors, (27), 23 states have internal predecessors, (27), 3 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (6), 4 states have call predecessors, (6), 3 states have call successors, (6) [2024-11-07 16:34:06,425 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 36 transitions. [2024-11-07 16:34:06,425 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 36 transitions. Word has length 12 [2024-11-07 16:34:06,425 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 16:34:06,425 INFO L471 AbstractCegarLoop]: Abstraction has 29 states and 36 transitions. [2024-11-07 16:34:06,425 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-07 16:34:06,425 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 36 transitions. [2024-11-07 16:34:06,427 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2024-11-07 16:34:06,427 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 16:34:06,427 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 16:34:06,429 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:34:06,627 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:34:06,628 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-07 16:34:06,628 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 16:34:06,628 INFO L85 PathProgramCache]: Analyzing trace with hash -938120081, now seen corresponding path program 1 times [2024-11-07 16:34:06,628 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-07 16:34:06,629 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [846958561] [2024-11-07 16:34:06,629 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 16:34:06,629 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:34:06,629 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-07 16:34:06,631 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:34:06,631 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:34:06,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 16:34:06,678 INFO L255 TraceCheckSpWp]: Trace formula consists of 59 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-11-07 16:34:06,680 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 16:34:06,697 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:34:06,796 INFO L349 Elim1Store]: treesize reduction 24, result has 33.3 percent of original size [2024-11-07 16:34:06,796 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 2 case distinctions, treesize of input 21 treesize of output 20 [2024-11-07 16:34:06,803 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 16:34:06,803 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-07 16:34:16,579 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 16:34:16,580 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-07 16:34:16,580 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [846958561] [2024-11-07 16:34:16,580 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [846958561] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-07 16:34:16,580 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-07 16:34:16,580 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5] total 7 [2024-11-07 16:34:16,580 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1856408420] [2024-11-07 16:34:16,580 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-07 16:34:16,580 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-07 16:34:16,580 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-07 16:34:16,581 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-07 16:34:16,581 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2024-11-07 16:34:16,581 INFO L87 Difference]: Start difference. First operand 29 states and 36 transitions. Second operand has 8 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 7 states have internal predecessors, (16), 2 states have call successors, (3), 3 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:34:16,737 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 16:34:16,737 INFO L93 Difference]: Finished difference Result 35 states and 46 transitions. [2024-11-07 16:34:16,739 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-07 16:34:16,739 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 7 states have internal predecessors, (16), 2 states have call successors, (3), 3 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 17 [2024-11-07 16:34:16,740 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 16:34:16,740 INFO L225 Difference]: With dead ends: 35 [2024-11-07 16:34:16,740 INFO L226 Difference]: Without dead ends: 35 [2024-11-07 16:34:16,740 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 24 SyntacticMatches, 2 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 9.7s TimeCoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2024-11-07 16:34:16,741 INFO L432 NwaCegarLoop]: 17 mSDtfsCounter, 5 mSDsluCounter, 43 mSDsCounter, 0 mSdLazyCounter, 88 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 60 SdHoareTripleChecker+Invalid, 91 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 88 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-07 16:34:16,741 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 60 Invalid, 91 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 88 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-07 16:34:16,741 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2024-11-07 16:34:16,743 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 35. [2024-11-07 16:34:16,743 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35 states, 26 states have (on average 1.3076923076923077) internal successors, (34), 27 states have internal predecessors, (34), 4 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (8), 6 states have call predecessors, (8), 4 states have call successors, (8) [2024-11-07 16:34:16,743 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 46 transitions. [2024-11-07 16:34:16,743 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 46 transitions. Word has length 17 [2024-11-07 16:34:16,744 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 16:34:16,744 INFO L471 AbstractCegarLoop]: Abstraction has 35 states and 46 transitions. [2024-11-07 16:34:16,744 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 7 states have internal predecessors, (16), 2 states have call successors, (3), 3 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:34:16,744 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 46 transitions. [2024-11-07 16:34:16,744 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2024-11-07 16:34:16,744 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 16:34:16,744 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 16:34:16,747 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Ended with exit code 0 [2024-11-07 16:34:16,945 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:34:16,945 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-07 16:34:16,945 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 16:34:16,945 INFO L85 PathProgramCache]: Analyzing trace with hash -938120080, now seen corresponding path program 1 times [2024-11-07 16:34:16,946 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-07 16:34:16,946 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1981244794] [2024-11-07 16:34:16,946 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 16:34:16,946 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-07 16:34:16,946 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-07 16:34:16,949 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:34:16,950 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:34:16,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 16:34:16,987 INFO L255 TraceCheckSpWp]: Trace formula consists of 59 conjuncts, 20 conjuncts are in the unsatisfiable core [2024-11-07 16:34:16,989 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 16:34:17,017 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:34:17,022 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:34:17,172 WARN L873 $PredicateComparison]: unable to prove that (exists ((|ldv_malloc_#res.base| (_ BitVec 32))) (and (= (store |c_old(#length)| |ldv_malloc_#res.base| (select |c_#length| |ldv_malloc_#res.base|)) |c_#length|) (= (_ bv0 1) (select |c_old(#valid)| |ldv_malloc_#res.base|)))) is different from true [2024-11-07 16:34:17,200 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-07 16:34:17,201 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:34:17,216 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2024-11-07 16:34:17,217 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:34:17,240 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2024-11-07 16:34:17,240 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-07 16:34:17,444 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-07 16:34:17,446 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1981244794] [2024-11-07 16:34:17,446 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1981244794] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-07 16:34:17,446 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [290143060] [2024-11-07 16:34:17,446 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 16:34:17,447 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-11-07 16:34:17,447 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/cvc4 [2024-11-07 16:34:17,449 INFO L229 MonitoredProcess]: Starting monitored process 7 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:34:17,453 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (7)] Waiting until timeout for monitored process [2024-11-07 16:34:17,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 16:34:17,523 INFO L255 TraceCheckSpWp]: Trace formula consists of 59 conjuncts, 20 conjuncts are in the unsatisfiable core [2024-11-07 16:34:17,527 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 16:34:17,542 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:34:17,550 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:34:17,642 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-07 16:34:17,643 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:34:17,654 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2024-11-07 16:34:17,654 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:34:17,666 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2024-11-07 16:34:17,666 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-07 16:34:21,803 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [290143060] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-07 16:34:21,804 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-07 16:34:21,804 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 9 [2024-11-07 16:34:21,804 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [438642053] [2024-11-07 16:34:21,804 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-07 16:34:21,804 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-07 16:34:21,804 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-07 16:34:21,804 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-07 16:34:21,804 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=88, Unknown=1, NotChecked=18, Total=132 [2024-11-07 16:34:21,805 INFO L87 Difference]: Start difference. First operand 35 states and 46 transitions. Second operand has 10 states, 8 states have (on average 1.625) internal successors, (13), 9 states have internal predecessors, (13), 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:34:22,029 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 16:34:22,030 INFO L93 Difference]: Finished difference Result 41 states and 54 transitions. [2024-11-07 16:34:22,031 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-07 16:34:22,031 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 8 states have (on average 1.625) internal successors, (13), 9 states have internal predecessors, (13), 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 17 [2024-11-07 16:34:22,031 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 16:34:22,031 INFO L225 Difference]: With dead ends: 41 [2024-11-07 16:34:22,031 INFO L226 Difference]: Without dead ends: 41 [2024-11-07 16:34:22,032 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 27 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 4.4s TimeCoverageRelationStatistics Valid=49, Invalid=194, Unknown=1, NotChecked=28, Total=272 [2024-11-07 16:34:22,032 INFO L432 NwaCegarLoop]: 14 mSDtfsCounter, 19 mSDsluCounter, 45 mSDsCounter, 0 mSdLazyCounter, 119 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 59 SdHoareTripleChecker+Invalid, 158 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 119 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 33 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-07 16:34:22,032 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [23 Valid, 59 Invalid, 158 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 119 Invalid, 0 Unknown, 33 Unchecked, 0.1s Time] [2024-11-07 16:34:22,033 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2024-11-07 16:34:22,037 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 38. [2024-11-07 16:34:22,037 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38 states, 28 states have (on average 1.2857142857142858) internal successors, (36), 29 states have internal predecessors, (36), 5 states have call successors, (5), 1 states have call predecessors, (5), 2 states have return successors, (10), 7 states have call predecessors, (10), 5 states have call successors, (10) [2024-11-07 16:34:22,037 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 51 transitions. [2024-11-07 16:34:22,038 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 51 transitions. Word has length 17 [2024-11-07 16:34:22,038 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 16:34:22,038 INFO L471 AbstractCegarLoop]: Abstraction has 38 states and 51 transitions. [2024-11-07 16:34:22,038 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 8 states have (on average 1.625) internal successors, (13), 9 states have internal predecessors, (13), 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:34:22,038 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 51 transitions. [2024-11-07 16:34:22,039 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2024-11-07 16:34:22,039 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 16:34:22,039 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 16:34:22,042 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (7)] Forceful destruction successful, exit code 0 [2024-11-07 16:34:22,241 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Forceful destruction successful, exit code 0 [2024-11-07 16:34:22,440 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt,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:34:22,440 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-07 16:34:22,440 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 16:34:22,441 INFO L85 PathProgramCache]: Analyzing trace with hash -1231523088, now seen corresponding path program 1 times [2024-11-07 16:34:22,441 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-07 16:34:22,441 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1644280897] [2024-11-07 16:34:22,441 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 16:34:22,441 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:34:22,441 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-07 16:34:22,442 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:34:22,446 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:34:22,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 16:34:22,473 INFO L255 TraceCheckSpWp]: Trace formula consists of 53 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-11-07 16:34:22,473 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 16:34:22,508 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 16:34:22,509 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-07 16:34:22,509 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-07 16:34:22,509 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1644280897] [2024-11-07 16:34:22,509 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1644280897] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 16:34:22,509 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 16:34:22,509 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-07 16:34:22,509 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [135671448] [2024-11-07 16:34:22,509 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 16:34:22,509 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-07 16:34:22,509 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-07 16:34:22,510 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-07 16:34:22,510 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-07 16:34:22,510 INFO L87 Difference]: Start difference. First operand 38 states and 51 transitions. Second operand has 5 states, 5 states have (on average 2.6) internal successors, (13), 4 states have internal predecessors, (13), 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:34:22,539 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 16:34:22,539 INFO L93 Difference]: Finished difference Result 26 states and 30 transitions. [2024-11-07 16:34:22,539 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-07 16:34:22,539 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.6) internal successors, (13), 4 states have internal predecessors, (13), 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 17 [2024-11-07 16:34:22,540 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 16:34:22,540 INFO L225 Difference]: With dead ends: 26 [2024-11-07 16:34:22,540 INFO L226 Difference]: Without dead ends: 24 [2024-11-07 16:34:22,540 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-07 16:34:22,540 INFO L432 NwaCegarLoop]: 23 mSDtfsCounter, 0 mSDsluCounter, 56 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 79 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-07 16:34:22,541 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 79 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 16:34:22,541 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2024-11-07 16:34:22,542 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 24. [2024-11-07 16:34:22,542 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 17 states have (on average 1.1764705882352942) internal successors, (20), 19 states have internal predecessors, (20), 3 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) [2024-11-07 16:34:22,543 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 28 transitions. [2024-11-07 16:34:22,543 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 28 transitions. Word has length 17 [2024-11-07 16:34:22,543 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 16:34:22,543 INFO L471 AbstractCegarLoop]: Abstraction has 24 states and 28 transitions. [2024-11-07 16:34:22,543 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.6) internal successors, (13), 4 states have internal predecessors, (13), 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:34:22,543 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 28 transitions. [2024-11-07 16:34:22,543 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2024-11-07 16:34:22,543 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 16:34:22,543 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 16:34:22,547 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 (8)] Forceful destruction successful, exit code 0 [2024-11-07 16:34:22,743 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:34:22,744 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-07 16:34:22,744 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 16:34:22,744 INFO L85 PathProgramCache]: Analyzing trace with hash -1382319161, now seen corresponding path program 1 times [2024-11-07 16:34:22,744 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-07 16:34:22,744 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [33694906] [2024-11-07 16:34:22,744 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 16:34:22,744 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:34:22,744 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-07 16:34:22,746 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:34:22,747 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:34:22,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 16:34:22,792 INFO L255 TraceCheckSpWp]: Trace formula consists of 75 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-07 16:34:22,794 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 16:34:22,836 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-07 16:34:22,836 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-07 16:34:22,879 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-07 16:34:22,879 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-07 16:34:22,879 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [33694906] [2024-11-07 16:34:22,879 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [33694906] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-07 16:34:22,879 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-07 16:34:22,879 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 8 [2024-11-07 16:34:22,879 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2090777722] [2024-11-07 16:34:22,879 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-07 16:34:22,879 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-07 16:34:22,879 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-07 16:34:22,880 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-07 16:34:22,880 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2024-11-07 16:34:22,880 INFO L87 Difference]: Start difference. First operand 24 states and 28 transitions. Second operand has 8 states, 8 states have (on average 2.75) internal successors, (22), 8 states have internal predecessors, (22), 4 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2024-11-07 16:34:22,951 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 16:34:22,951 INFO L93 Difference]: Finished difference Result 36 states and 46 transitions. [2024-11-07 16:34:22,951 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-07 16:34:22,951 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.75) internal successors, (22), 8 states have internal predecessors, (22), 4 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Word has length 21 [2024-11-07 16:34:22,952 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 16:34:22,952 INFO L225 Difference]: With dead ends: 36 [2024-11-07 16:34:22,952 INFO L226 Difference]: Without dead ends: 36 [2024-11-07 16:34:22,952 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2024-11-07 16:34:22,953 INFO L432 NwaCegarLoop]: 18 mSDtfsCounter, 38 mSDsluCounter, 31 mSDsCounter, 0 mSdLazyCounter, 35 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 39 SdHoareTripleChecker+Valid, 49 SdHoareTripleChecker+Invalid, 44 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 35 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-07 16:34:22,953 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [39 Valid, 49 Invalid, 44 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 35 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 16:34:22,953 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2024-11-07 16:34:22,955 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 36. [2024-11-07 16:34:22,955 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36 states, 27 states have (on average 1.1851851851851851) internal successors, (32), 29 states have internal predecessors, (32), 5 states have call successors, (5), 1 states have call predecessors, (5), 2 states have return successors, (9), 5 states have call predecessors, (9), 5 states have call successors, (9) [2024-11-07 16:34:22,955 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 46 transitions. [2024-11-07 16:34:22,956 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 46 transitions. Word has length 21 [2024-11-07 16:34:22,956 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 16:34:22,956 INFO L471 AbstractCegarLoop]: Abstraction has 36 states and 46 transitions. [2024-11-07 16:34:22,956 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 2.75) internal successors, (22), 8 states have internal predecessors, (22), 4 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2024-11-07 16:34:22,956 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 46 transitions. [2024-11-07 16:34:22,956 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2024-11-07 16:34:22,956 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 16:34:22,956 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 16:34:22,959 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Ended with exit code 0 [2024-11-07 16:34:23,157 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:34:23,157 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-07 16:34:23,158 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 16:34:23,158 INFO L85 PathProgramCache]: Analyzing trace with hash -704273649, now seen corresponding path program 1 times [2024-11-07 16:34:23,158 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-07 16:34:23,158 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [699877363] [2024-11-07 16:34:23,158 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 16:34:23,158 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-07 16:34:23,158 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-07 16:34:23,161 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:34:23,161 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Waiting until timeout for monitored process [2024-11-07 16:34:23,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 16:34:23,207 INFO L255 TraceCheckSpWp]: Trace formula consists of 94 conjuncts, 28 conjuncts are in the unsatisfiable core [2024-11-07 16:34:23,210 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 16:34:23,227 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:34:23,231 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:34:23,342 WARN L873 $PredicateComparison]: unable to prove that (exists ((|ldv_malloc_#res.base| (_ BitVec 32))) (and (= (store |c_old(#length)| |ldv_malloc_#res.base| (select |c_#length| |ldv_malloc_#res.base|)) |c_#length|) (= (_ bv0 1) (select |c_old(#valid)| |ldv_malloc_#res.base|)))) is different from true [2024-11-07 16:34:23,363 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-07 16:34:23,364 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:34:23,375 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2024-11-07 16:34:23,375 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:34:23,481 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-07 16:34:23,483 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:34:23,492 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2024-11-07 16:34:23,493 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:34:23,520 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 4 trivial. 4 not checked. [2024-11-07 16:34:23,520 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-07 16:34:23,713 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-07 16:34:23,713 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [699877363] [2024-11-07 16:34:23,713 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [699877363] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-07 16:34:23,713 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [964045639] [2024-11-07 16:34:23,713 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 16:34:23,713 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-11-07 16:34:23,713 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/cvc4 [2024-11-07 16:34:23,715 INFO L229 MonitoredProcess]: Starting monitored process 11 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:34:23,716 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (11)] Waiting until timeout for monitored process [2024-11-07 16:34:23,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 16:34:23,798 INFO L255 TraceCheckSpWp]: Trace formula consists of 94 conjuncts, 28 conjuncts are in the unsatisfiable core [2024-11-07 16:34:23,800 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 16:34:23,809 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:34:23,813 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:34:23,884 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-07 16:34:23,885 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:34:23,893 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2024-11-07 16:34:23,893 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:34:23,973 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-07 16:34:23,974 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:34:23,986 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2024-11-07 16:34:23,987 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:34:23,999 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 4 trivial. 4 not checked. [2024-11-07 16:34:23,999 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-07 16:34:32,130 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [964045639] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-07 16:34:32,131 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-07 16:34:32,131 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 11 [2024-11-07 16:34:32,134 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2007284925] [2024-11-07 16:34:32,134 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-07 16:34:32,134 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-07 16:34:32,134 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-07 16:34:32,135 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-07 16:34:32,135 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=126, Unknown=1, NotChecked=22, Total=182 [2024-11-07 16:34:32,135 INFO L87 Difference]: Start difference. First operand 36 states and 46 transitions. Second operand has 12 states, 10 states have (on average 1.7) internal successors, (17), 11 states have internal predecessors, (17), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-07 16:34:32,416 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 16:34:32,417 INFO L93 Difference]: Finished difference Result 40 states and 49 transitions. [2024-11-07 16:34:32,418 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-07 16:34:32,418 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 10 states have (on average 1.7) internal successors, (17), 11 states have internal predecessors, (17), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Word has length 26 [2024-11-07 16:34:32,418 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 16:34:32,419 INFO L225 Difference]: With dead ends: 40 [2024-11-07 16:34:32,419 INFO L226 Difference]: Without dead ends: 40 [2024-11-07 16:34:32,419 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 43 SyntacticMatches, 1 SemanticMatches, 19 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 8.4s TimeCoverageRelationStatistics Valid=70, Invalid=313, Unknown=1, NotChecked=36, Total=420 [2024-11-07 16:34:32,419 INFO L432 NwaCegarLoop]: 16 mSDtfsCounter, 21 mSDsluCounter, 65 mSDsCounter, 0 mSdLazyCounter, 162 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 81 SdHoareTripleChecker+Invalid, 210 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 162 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 38 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-07 16:34:32,419 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [24 Valid, 81 Invalid, 210 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 162 Invalid, 0 Unknown, 38 Unchecked, 0.2s Time] [2024-11-07 16:34:32,420 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2024-11-07 16:34:32,421 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 36. [2024-11-07 16:34:32,421 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36 states, 27 states have (on average 1.1481481481481481) internal successors, (31), 29 states have internal predecessors, (31), 5 states have call successors, (5), 1 states have call predecessors, (5), 2 states have return successors, (9), 5 states have call predecessors, (9), 5 states have call successors, (9) [2024-11-07 16:34:32,422 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 45 transitions. [2024-11-07 16:34:32,422 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 45 transitions. Word has length 26 [2024-11-07 16:34:32,422 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 16:34:32,422 INFO L471 AbstractCegarLoop]: Abstraction has 36 states and 45 transitions. [2024-11-07 16:34:32,424 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 10 states have (on average 1.7) internal successors, (17), 11 states have internal predecessors, (17), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-07 16:34:32,424 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 45 transitions. [2024-11-07 16:34:32,424 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2024-11-07 16:34:32,424 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 16:34:32,425 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 16:34:32,428 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (11)] Ended with exit code 0 [2024-11-07 16:34:32,628 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:34:32,825 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt,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:34:32,826 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-07 16:34:32,826 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 16:34:32,826 INFO L85 PathProgramCache]: Analyzing trace with hash -1383108784, now seen corresponding path program 2 times [2024-11-07 16:34:32,826 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-07 16:34:32,826 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1978137661] [2024-11-07 16:34:32,826 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-07 16:34:32,826 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:34:32,826 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-07 16:34:32,828 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:34:32,829 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:34:32,890 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-07 16:34:32,890 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-07 16:34:32,892 INFO L255 TraceCheckSpWp]: Trace formula consists of 129 conjuncts, 36 conjuncts are in the unsatisfiable core [2024-11-07 16:34:32,894 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 16:34:32,910 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:34:32,914 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:34:33,018 WARN L873 $PredicateComparison]: unable to prove that (exists ((|ldv_malloc_#res.base| (_ BitVec 32))) (and (= (store |c_old(#length)| |ldv_malloc_#res.base| (select |c_#length| |ldv_malloc_#res.base|)) |c_#length|) (= (_ bv0 1) (select |c_old(#valid)| |ldv_malloc_#res.base|)))) is different from true [2024-11-07 16:34:33,037 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-07 16:34:33,037 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:34:33,051 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2024-11-07 16:34:33,051 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:34:33,156 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-07 16:34:33,157 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:34:33,166 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2024-11-07 16:34:33,166 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:34:33,261 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-07 16:34:33,261 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:34:33,275 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2024-11-07 16:34:33,275 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:34:33,297 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 3 proven. 16 refuted. 0 times theorem prover too weak. 12 trivial. 6 not checked. [2024-11-07 16:34:33,298 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-07 16:34:33,491 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-07 16:34:33,491 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1978137661] [2024-11-07 16:34:33,491 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1978137661] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-07 16:34:33,491 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1370019683] [2024-11-07 16:34:33,491 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-07 16:34:33,491 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-11-07 16:34:33,491 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/cvc4 [2024-11-07 16:34:33,493 INFO L229 MonitoredProcess]: Starting monitored process 13 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:34:33,494 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (13)] Waiting until timeout for monitored process [2024-11-07 16:34:33,594 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-07 16:34:33,594 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-07 16:34:33,596 INFO L255 TraceCheckSpWp]: Trace formula consists of 129 conjuncts, 36 conjuncts are in the unsatisfiable core [2024-11-07 16:34:33,600 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 16:34:33,607 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:34:33,610 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:34:33,683 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-07 16:34:33,683 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:34:33,693 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2024-11-07 16:34:33,693 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:34:33,760 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-07 16:34:33,760 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:34:33,771 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2024-11-07 16:34:33,771 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:34:33,827 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-07 16:34:33,828 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:34:33,837 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2024-11-07 16:34:33,838 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:34:33,845 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 3 proven. 16 refuted. 0 times theorem prover too weak. 12 trivial. 6 not checked. [2024-11-07 16:34:33,845 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-07 16:34:33,997 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1370019683] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-07 16:34:33,997 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-07 16:34:33,997 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 13 [2024-11-07 16:34:33,997 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1600725860] [2024-11-07 16:34:33,997 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-07 16:34:33,997 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-11-07 16:34:33,997 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-07 16:34:33,998 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-11-07 16:34:33,998 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=172, Unknown=1, NotChecked=26, Total=240 [2024-11-07 16:34:33,998 INFO L87 Difference]: Start difference. First operand 36 states and 45 transitions. Second operand has 14 states, 12 states have (on average 1.75) internal successors, (21), 13 states have internal predecessors, (21), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2024-11-07 16:34:34,367 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 16:34:34,367 INFO L93 Difference]: Finished difference Result 42 states and 50 transitions. [2024-11-07 16:34:34,368 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-07 16:34:34,368 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 12 states have (on average 1.75) internal successors, (21), 13 states have internal predecessors, (21), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Word has length 35 [2024-11-07 16:34:34,368 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 16:34:34,368 INFO L225 Difference]: With dead ends: 42 [2024-11-07 16:34:34,368 INFO L226 Difference]: Without dead ends: 42 [2024-11-07 16:34:34,369 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 59 SyntacticMatches, 1 SemanticMatches, 23 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=91, Invalid=464, Unknown=1, NotChecked=44, Total=600 [2024-11-07 16:34:34,369 INFO L432 NwaCegarLoop]: 19 mSDtfsCounter, 26 mSDsluCounter, 100 mSDsCounter, 0 mSdLazyCounter, 266 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 29 SdHoareTripleChecker+Valid, 119 SdHoareTripleChecker+Invalid, 326 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 266 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 47 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-07 16:34:34,369 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [29 Valid, 119 Invalid, 326 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 266 Invalid, 0 Unknown, 47 Unchecked, 0.2s Time] [2024-11-07 16:34:34,370 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2024-11-07 16:34:34,371 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 36. [2024-11-07 16:34:34,371 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36 states, 27 states have (on average 1.1111111111111112) internal successors, (30), 29 states have internal predecessors, (30), 5 states have call successors, (5), 1 states have call predecessors, (5), 2 states have return successors, (9), 5 states have call predecessors, (9), 5 states have call successors, (9) [2024-11-07 16:34:34,372 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 44 transitions. [2024-11-07 16:34:34,372 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 44 transitions. Word has length 35 [2024-11-07 16:34:34,372 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 16:34:34,372 INFO L471 AbstractCegarLoop]: Abstraction has 36 states and 44 transitions. [2024-11-07 16:34:34,372 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 12 states have (on average 1.75) internal successors, (21), 13 states have internal predecessors, (21), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2024-11-07 16:34:34,372 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 44 transitions. [2024-11-07 16:34:34,373 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2024-11-07 16:34:34,373 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 16:34:34,373 INFO L215 NwaCegarLoop]: trace histogram [5, 5, 5, 4, 4, 4, 4, 3, 3, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 16:34:34,376 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (13)] Ended with exit code 0 [2024-11-07 16:34:34,576 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 (12)] Forceful destruction successful, exit code 0 [2024-11-07 16:34:34,773 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt,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:34:34,773 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-07 16:34:34,774 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 16:34:34,774 INFO L85 PathProgramCache]: Analyzing trace with hash -856630225, now seen corresponding path program 3 times [2024-11-07 16:34:34,774 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-07 16:34:34,774 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [12712314] [2024-11-07 16:34:34,774 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-07 16:34:34,774 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-07 16:34:34,774 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-07 16:34:34,776 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:34:34,777 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (14)] Waiting until timeout for monitored process [2024-11-07 16:34:34,874 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2024-11-07 16:34:34,874 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-07 16:34:34,877 INFO L255 TraceCheckSpWp]: Trace formula consists of 164 conjuncts, 43 conjuncts are in the unsatisfiable core [2024-11-07 16:34:34,882 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 16:34:34,894 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:34:34,980 WARN L873 $PredicateComparison]: unable to prove that (exists ((|ldv_malloc_#res.base| (_ BitVec 32))) (= (store |c_old(#length)| |ldv_malloc_#res.base| |c_ldv_malloc_#in~size|) |c_#length|)) is different from true [2024-11-07 16:34:34,998 INFO L349 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2024-11-07 16:34:34,999 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 12 treesize of output 18 [2024-11-07 16:34:35,188 WARN L873 $PredicateComparison]: unable to prove that (exists ((|ldv_malloc_#res.base| (_ BitVec 32))) (and (= (store |c_old(#length)| |ldv_malloc_#res.base| (select |c_#length| |ldv_malloc_#res.base|)) |c_#length|) (= (_ bv0 1) (select |c_old(#valid)| |ldv_malloc_#res.base|)))) is different from true [2024-11-07 16:34:35,219 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-07 16:34:35,234 INFO L349 Elim1Store]: treesize reduction 21, result has 30.0 percent of original size [2024-11-07 16:34:35,234 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 26 treesize of output 26 [2024-11-07 16:34:35,246 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2024-11-07 16:34:35,246 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:34:35,378 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-07 16:34:35,379 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:34:35,386 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2024-11-07 16:34:35,386 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:34:35,476 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-07 16:34:35,476 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:34:35,485 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2024-11-07 16:34:35,485 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:34:35,513 INFO L134 CoverageAnalysis]: Checked inductivity of 67 backedges. 8 proven. 33 refuted. 0 times theorem prover too weak. 12 trivial. 14 not checked. [2024-11-07 16:34:35,513 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-07 16:34:39,724 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-07 16:34:39,724 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [12712314] [2024-11-07 16:34:39,724 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [12712314] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-07 16:34:39,724 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1800972618] [2024-11-07 16:34:39,725 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-07 16:34:39,725 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-11-07 16:34:39,725 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/cvc4 [2024-11-07 16:34:39,726 INFO L229 MonitoredProcess]: Starting monitored process 15 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:34:39,727 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (15)] Waiting until timeout for monitored process [2024-11-07 16:34:39,875 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2024-11-07 16:34:39,875 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-07 16:34:39,878 INFO L255 TraceCheckSpWp]: Trace formula consists of 164 conjuncts, 53 conjuncts are in the unsatisfiable core [2024-11-07 16:34:39,881 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 16:34:39,891 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:34:39,897 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:34:40,097 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2024-11-07 16:34:40,097 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:34:40,109 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2024-11-07 16:34:40,109 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:34:40,223 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2024-11-07 16:34:40,223 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:34:40,237 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2024-11-07 16:34:40,237 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:34:40,356 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2024-11-07 16:34:40,356 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:34:40,368 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2024-11-07 16:34:40,368 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:34:40,488 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-07 16:34:40,489 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:34:40,496 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2024-11-07 16:34:40,496 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:34:40,505 INFO L134 CoverageAnalysis]: Checked inductivity of 67 backedges. 4 proven. 37 refuted. 0 times theorem prover too weak. 18 trivial. 8 not checked. [2024-11-07 16:34:40,506 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-07 16:34:40,645 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1800972618] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-07 16:34:40,645 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-07 16:34:40,645 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 19] total 30 [2024-11-07 16:34:40,645 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1703686497] [2024-11-07 16:34:40,645 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-07 16:34:40,646 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2024-11-07 16:34:40,646 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-07 16:34:40,646 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2024-11-07 16:34:40,646 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=100, Invalid=835, Unknown=3, NotChecked=118, Total=1056 [2024-11-07 16:34:40,647 INFO L87 Difference]: Start difference. First operand 36 states and 44 transitions. Second operand has 31 states, 29 states have (on average 1.4827586206896552) internal successors, (43), 25 states have internal predecessors, (43), 7 states have call successors, (7), 3 states have call predecessors, (7), 5 states have return successors, (9), 9 states have call predecessors, (9), 7 states have call successors, (9) [2024-11-07 16:34:41,720 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 16:34:41,720 INFO L93 Difference]: Finished difference Result 54 states and 66 transitions. [2024-11-07 16:34:41,721 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2024-11-07 16:34:41,721 INFO L78 Accepts]: Start accepts. Automaton has has 31 states, 29 states have (on average 1.4827586206896552) internal successors, (43), 25 states have internal predecessors, (43), 7 states have call successors, (7), 3 states have call predecessors, (7), 5 states have return successors, (9), 9 states have call predecessors, (9), 7 states have call successors, (9) Word has length 44 [2024-11-07 16:34:41,721 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 16:34:41,722 INFO L225 Difference]: With dead ends: 54 [2024-11-07 16:34:41,722 INFO L226 Difference]: Without dead ends: 54 [2024-11-07 16:34:41,723 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 108 GetRequests, 60 SyntacticMatches, 1 SemanticMatches, 47 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 484 ImplicationChecksByTransitivity, 5.2s TimeCoverageRelationStatistics Valid=207, Invalid=1960, Unknown=3, NotChecked=182, Total=2352 [2024-11-07 16:34:41,723 INFO L432 NwaCegarLoop]: 19 mSDtfsCounter, 52 mSDsluCounter, 178 mSDsCounter, 0 mSdLazyCounter, 759 mSolverCounterSat, 23 mSolverCounterUnsat, 3 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 55 SdHoareTripleChecker+Valid, 197 SdHoareTripleChecker+Invalid, 913 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 759 IncrementalHoareTripleChecker+Invalid, 3 IncrementalHoareTripleChecker+Unknown, 128 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-07 16:34:41,723 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [55 Valid, 197 Invalid, 913 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 759 Invalid, 3 Unknown, 128 Unchecked, 0.7s Time] [2024-11-07 16:34:41,724 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2024-11-07 16:34:41,725 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 39. [2024-11-07 16:34:41,725 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 39 states, 29 states have (on average 1.103448275862069) internal successors, (32), 31 states have internal predecessors, (32), 6 states have call successors, (6), 1 states have call predecessors, (6), 2 states have return successors, (11), 6 states have call predecessors, (11), 6 states have call successors, (11) [2024-11-07 16:34:41,726 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 49 transitions. [2024-11-07 16:34:41,726 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 49 transitions. Word has length 44 [2024-11-07 16:34:41,726 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 16:34:41,726 INFO L471 AbstractCegarLoop]: Abstraction has 39 states and 49 transitions. [2024-11-07 16:34:41,726 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 31 states, 29 states have (on average 1.4827586206896552) internal successors, (43), 25 states have internal predecessors, (43), 7 states have call successors, (7), 3 states have call predecessors, (7), 5 states have return successors, (9), 9 states have call predecessors, (9), 7 states have call successors, (9) [2024-11-07 16:34:41,726 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 49 transitions. [2024-11-07 16:34:41,727 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2024-11-07 16:34:41,727 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 16:34:41,727 INFO L215 NwaCegarLoop]: trace histogram [5, 5, 5, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 16:34:41,731 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (15)] Ended with exit code 0 [2024-11-07 16:34:41,931 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:34:42,131 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt,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:34:42,131 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-07 16:34:42,131 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 16:34:42,132 INFO L85 PathProgramCache]: Analyzing trace with hash -206900218, now seen corresponding path program 2 times [2024-11-07 16:34:42,132 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-07 16:34:42,132 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [321562539] [2024-11-07 16:34:42,132 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-07 16:34:42,132 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-07 16:34:42,132 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-07 16:34:42,135 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-07 16:34:42,141 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (16)] Waiting until timeout for monitored process [2024-11-07 16:34:42,207 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-07 16:34:42,207 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-07 16:34:42,209 INFO L255 TraceCheckSpWp]: Trace formula consists of 180 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-11-07 16:34:42,210 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 16:34:42,304 INFO L134 CoverageAnalysis]: Checked inductivity of 74 backedges. 0 proven. 34 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2024-11-07 16:34:42,305 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-07 16:34:42,433 INFO L134 CoverageAnalysis]: Checked inductivity of 74 backedges. 0 proven. 34 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2024-11-07 16:34:42,433 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-07 16:34:42,433 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [321562539] [2024-11-07 16:34:42,433 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [321562539] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-07 16:34:42,433 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-07 16:34:42,433 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 14 [2024-11-07 16:34:42,433 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [659230807] [2024-11-07 16:34:42,433 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-07 16:34:42,433 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-11-07 16:34:42,434 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-07 16:34:42,434 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-11-07 16:34:42,434 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=121, Unknown=0, NotChecked=0, Total=182 [2024-11-07 16:34:42,434 INFO L87 Difference]: Start difference. First operand 39 states and 49 transitions. Second operand has 14 states, 14 states have (on average 3.2857142857142856) internal successors, (46), 14 states have internal predecessors, (46), 10 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2024-11-07 16:34:42,673 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 16:34:42,673 INFO L93 Difference]: Finished difference Result 66 states and 91 transitions. [2024-11-07 16:34:42,674 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-07 16:34:42,674 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 3.2857142857142856) internal successors, (46), 14 states have internal predecessors, (46), 10 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) Word has length 48 [2024-11-07 16:34:42,674 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 16:34:42,675 INFO L225 Difference]: With dead ends: 66 [2024-11-07 16:34:42,675 INFO L226 Difference]: Without dead ends: 66 [2024-11-07 16:34:42,675 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 99 GetRequests, 82 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=131, Invalid=211, Unknown=0, NotChecked=0, Total=342 [2024-11-07 16:34:42,675 INFO L432 NwaCegarLoop]: 27 mSDtfsCounter, 46 mSDsluCounter, 124 mSDsCounter, 0 mSdLazyCounter, 153 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 47 SdHoareTripleChecker+Valid, 151 SdHoareTripleChecker+Invalid, 165 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 153 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-07 16:34:42,675 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [47 Valid, 151 Invalid, 165 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 153 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-07 16:34:42,676 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2024-11-07 16:34:42,679 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 66. [2024-11-07 16:34:42,679 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 66 states, 51 states have (on average 1.1568627450980393) internal successors, (59), 53 states have internal predecessors, (59), 11 states have call successors, (11), 1 states have call predecessors, (11), 2 states have return successors, (21), 11 states have call predecessors, (21), 11 states have call successors, (21) [2024-11-07 16:34:42,680 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 91 transitions. [2024-11-07 16:34:42,680 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 91 transitions. Word has length 48 [2024-11-07 16:34:42,680 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 16:34:42,680 INFO L471 AbstractCegarLoop]: Abstraction has 66 states and 91 transitions. [2024-11-07 16:34:42,680 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 3.2857142857142856) internal successors, (46), 14 states have internal predecessors, (46), 10 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2024-11-07 16:34:42,680 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 91 transitions. [2024-11-07 16:34:42,681 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2024-11-07 16:34:42,681 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 16:34:42,681 INFO L215 NwaCegarLoop]: trace histogram [6, 6, 6, 5, 5, 5, 5, 4, 4, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 16:34:42,685 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (16)] Ended with exit code 0 [2024-11-07 16:34:42,881 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-07 16:34:42,882 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-07 16:34:42,882 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 16:34:42,882 INFO L85 PathProgramCache]: Analyzing trace with hash 845314608, now seen corresponding path program 4 times [2024-11-07 16:34:42,882 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-07 16:34:42,882 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [338448296] [2024-11-07 16:34:42,882 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2024-11-07 16:34:42,883 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:34:42,883 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-07 16:34:42,884 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:34:42,885 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:34:42,975 INFO L227 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2024-11-07 16:34:42,975 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-07 16:34:42,979 INFO L255 TraceCheckSpWp]: Trace formula consists of 199 conjuncts, 52 conjuncts are in the unsatisfiable core [2024-11-07 16:34:42,981 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 16:34:42,992 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:34:42,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 5 [2024-11-07 16:34:43,077 WARN L873 $PredicateComparison]: unable to prove that (exists ((|ldv_malloc_#res.base| (_ BitVec 32))) (and (= (store |c_old(#length)| |ldv_malloc_#res.base| (select |c_#length| |ldv_malloc_#res.base|)) |c_#length|) (= (_ bv0 1) (select |c_old(#valid)| |ldv_malloc_#res.base|)))) is different from true [2024-11-07 16:34:43,087 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-07 16:34:43,088 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:34:43,095 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2024-11-07 16:34:43,095 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:34:43,163 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-07 16:34:43,163 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:34:43,170 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2024-11-07 16:34:43,170 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:34:43,250 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-07 16:34:43,251 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:34:43,259 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2024-11-07 16:34:43,259 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:34:43,346 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-07 16:34:43,347 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:34:43,356 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2024-11-07 16:34:43,356 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:34:43,441 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-07 16:34:43,442 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:34:43,451 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2024-11-07 16:34:43,451 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:34:43,479 INFO L134 CoverageAnalysis]: Checked inductivity of 106 backedges. 5 proven. 51 refuted. 0 times theorem prover too weak. 40 trivial. 10 not checked. [2024-11-07 16:34:43,479 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-07 16:34:43,661 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-07 16:34:43,661 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [338448296] [2024-11-07 16:34:43,661 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [338448296] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-07 16:34:43,661 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [104539599] [2024-11-07 16:34:43,661 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2024-11-07 16:34:43,661 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-11-07 16:34:43,661 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/cvc4 [2024-11-07 16:34:43,663 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:34:43,664 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:34:43,806 INFO L227 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2024-11-07 16:34:43,807 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-07 16:34:43,811 INFO L255 TraceCheckSpWp]: Trace formula consists of 199 conjuncts, 52 conjuncts are in the unsatisfiable core [2024-11-07 16:34:43,813 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 16:34:43,822 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:34:43,825 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:34:43,892 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-07 16:34:43,892 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:34:43,899 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2024-11-07 16:34:43,899 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:34:43,947 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-07 16:34:43,948 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:34:43,956 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2024-11-07 16:34:43,956 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:34:44,007 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-07 16:34:44,007 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:34:44,015 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2024-11-07 16:34:44,015 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:34:44,082 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-07 16:34:44,083 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:34:44,092 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2024-11-07 16:34:44,092 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:34:44,139 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-07 16:34:44,139 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:34:44,146 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2024-11-07 16:34:44,147 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:34:44,154 INFO L134 CoverageAnalysis]: Checked inductivity of 106 backedges. 5 proven. 51 refuted. 0 times theorem prover too weak. 40 trivial. 10 not checked. [2024-11-07 16:34:44,154 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-07 16:34:48,284 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [104539599] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-07 16:34:48,284 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-07 16:34:48,284 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17] total 17 [2024-11-07 16:34:48,284 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1931850944] [2024-11-07 16:34:48,284 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-07 16:34:48,285 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2024-11-07 16:34:48,285 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-07 16:34:48,285 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2024-11-07 16:34:48,285 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=288, Unknown=1, NotChecked=34, Total=380 [2024-11-07 16:34:48,285 INFO L87 Difference]: Start difference. First operand 66 states and 91 transitions. Second operand has 18 states, 16 states have (on average 1.8125) internal successors, (29), 17 states have internal predecessors, (29), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-11-07 16:34:48,883 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 16:34:48,883 INFO L93 Difference]: Finished difference Result 76 states and 100 transitions. [2024-11-07 16:34:48,883 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-11-07 16:34:48,884 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 16 states have (on average 1.8125) internal successors, (29), 17 states have internal predecessors, (29), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Word has length 53 [2024-11-07 16:34:48,884 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 16:34:48,884 INFO L225 Difference]: With dead ends: 76 [2024-11-07 16:34:48,884 INFO L226 Difference]: Without dead ends: 76 [2024-11-07 16:34:48,884 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 123 GetRequests, 91 SyntacticMatches, 1 SemanticMatches, 31 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 101 ImplicationChecksByTransitivity, 4.6s TimeCoverageRelationStatistics Valid=133, Invalid=862, Unknown=1, NotChecked=60, Total=1056 [2024-11-07 16:34:48,885 INFO L432 NwaCegarLoop]: 25 mSDtfsCounter, 37 mSDsluCounter, 155 mSDsCounter, 0 mSdLazyCounter, 441 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 40 SdHoareTripleChecker+Valid, 180 SdHoareTripleChecker+Invalid, 528 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 441 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 65 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-07 16:34:48,885 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [40 Valid, 180 Invalid, 528 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 441 Invalid, 0 Unknown, 65 Unchecked, 0.4s Time] [2024-11-07 16:34:48,885 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2024-11-07 16:34:48,890 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 66. [2024-11-07 16:34:48,890 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 66 states, 51 states have (on average 1.1372549019607843) internal successors, (58), 53 states have internal predecessors, (58), 11 states have call successors, (11), 1 states have call predecessors, (11), 2 states have return successors, (21), 11 states have call predecessors, (21), 11 states have call successors, (21) [2024-11-07 16:34:48,892 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 90 transitions. [2024-11-07 16:34:48,892 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 90 transitions. Word has length 53 [2024-11-07 16:34:48,893 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 16:34:48,893 INFO L471 AbstractCegarLoop]: Abstraction has 66 states and 90 transitions. [2024-11-07 16:34:48,893 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 16 states have (on average 1.8125) internal successors, (29), 17 states have internal predecessors, (29), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-11-07 16:34:48,893 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 90 transitions. [2024-11-07 16:34:48,893 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2024-11-07 16:34:48,893 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 16:34:48,893 INFO L215 NwaCegarLoop]: trace histogram [7, 7, 7, 6, 6, 6, 6, 5, 5, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 16:34:48,897 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:34:49,098 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 (17)] Forceful destruction successful, exit code 0 [2024-11-07 16:34:49,294 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:34:49,294 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-07 16:34:49,294 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 16:34:49,294 INFO L85 PathProgramCache]: Analyzing trace with hash -1540616881, now seen corresponding path program 5 times [2024-11-07 16:34:49,295 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-07 16:34:49,295 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [893483132] [2024-11-07 16:34:49,295 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2024-11-07 16:34:49,295 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:34:49,295 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-07 16:34:49,298 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:34:49,298 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:34:49,448 INFO L227 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 7 check-sat command(s) [2024-11-07 16:34:49,448 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-07 16:34:49,452 INFO L255 TraceCheckSpWp]: Trace formula consists of 234 conjuncts, 64 conjuncts are in the unsatisfiable core [2024-11-07 16:34:49,454 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 16:34:49,466 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:34:49,566 INFO L349 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2024-11-07 16:34:49,567 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 12 treesize of output 18 [2024-11-07 16:34:49,742 WARN L873 $PredicateComparison]: unable to prove that (exists ((|ldv_malloc_#res.base| (_ BitVec 32))) (and (= (store |c_old(#length)| |ldv_malloc_#res.base| (select |c_#length| |ldv_malloc_#res.base|)) |c_#length|) (= (_ bv0 1) (select |c_old(#valid)| |ldv_malloc_#res.base|)))) is different from true [2024-11-07 16:34:49,759 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-07 16:34:49,773 INFO L349 Elim1Store]: treesize reduction 21, result has 30.0 percent of original size [2024-11-07 16:34:49,773 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 26 treesize of output 26 [2024-11-07 16:34:49,789 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2024-11-07 16:34:49,789 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:34:49,912 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-07 16:34:49,913 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:34:49,921 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2024-11-07 16:34:49,921 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:34:50,009 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-07 16:34:50,009 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:34:50,018 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2024-11-07 16:34:50,018 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:34:50,105 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-07 16:34:50,105 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:34:50,112 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2024-11-07 16:34:50,112 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:34:50,210 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-07 16:34:50,211 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:34:50,219 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2024-11-07 16:34:50,219 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:34:50,247 INFO L134 CoverageAnalysis]: Checked inductivity of 154 backedges. 12 proven. 82 refuted. 0 times theorem prover too weak. 40 trivial. 20 not checked. [2024-11-07 16:34:50,248 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-07 16:34:54,493 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-07 16:34:54,494 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [893483132] [2024-11-07 16:34:54,494 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [893483132] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-07 16:34:54,494 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [757067176] [2024-11-07 16:34:54,494 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2024-11-07 16:34:54,494 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-11-07 16:34:54,494 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/cvc4 [2024-11-07 16:34:54,496 INFO L229 MonitoredProcess]: Starting monitored process 20 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:34:54,496 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (20)] Waiting until timeout for monitored process [2024-11-07 16:34:54,732 INFO L227 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 7 check-sat command(s) [2024-11-07 16:34:54,733 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-07 16:34:54,746 INFO L255 TraceCheckSpWp]: Trace formula consists of 234 conjuncts, 65 conjuncts are in the unsatisfiable core [2024-11-07 16:34:54,748 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 16:34:54,754 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:34:54,799 INFO L349 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2024-11-07 16:34:54,799 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 12 treesize of output 18 [2024-11-07 16:34:54,947 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-07 16:34:54,965 INFO L349 Elim1Store]: treesize reduction 21, result has 30.0 percent of original size [2024-11-07 16:34:54,965 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 26 treesize of output 26 [2024-11-07 16:34:54,979 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2024-11-07 16:34:54,979 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:34:55,039 WARN L873 $PredicateComparison]: unable to prove that (exists ((|ldv_malloc_#res.base| (_ BitVec 32))) (and (= (store |c_old(#valid)| |ldv_malloc_#res.base| (select |c_#valid| |ldv_malloc_#res.base|)) |c_#valid|) (= (store |c_old(#length)| |ldv_malloc_#res.base| (select |c_#length| |ldv_malloc_#res.base|)) |c_#length|) (= (_ bv0 1) (select |c_old(#valid)| |ldv_malloc_#res.base|)))) is different from true [2024-11-07 16:34:55,055 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-07 16:34:55,056 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:34:55,080 INFO L349 Elim1Store]: treesize reduction 24, result has 33.3 percent of original size [2024-11-07 16:34:55,080 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 2 case distinctions, treesize of input 21 treesize of output 20 [2024-11-07 16:34:55,135 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-07 16:34:55,135 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:34:55,153 INFO L349 Elim1Store]: treesize reduction 24, result has 33.3 percent of original size [2024-11-07 16:34:55,153 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 2 case distinctions, treesize of input 21 treesize of output 20 [2024-11-07 16:34:55,205 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-07 16:34:55,206 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:34:55,215 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2024-11-07 16:34:55,215 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:34:55,264 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-07 16:34:55,264 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:34:55,273 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2024-11-07 16:34:55,273 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:34:55,281 INFO L134 CoverageAnalysis]: Checked inductivity of 154 backedges. 12 proven. 82 refuted. 0 times theorem prover too weak. 28 trivial. 32 not checked. [2024-11-07 16:34:55,281 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-07 16:34:59,443 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [757067176] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-07 16:34:59,443 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-07 16:34:59,443 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 24] total 26 [2024-11-07 16:34:59,443 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [297905191] [2024-11-07 16:34:59,443 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-07 16:34:59,443 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2024-11-07 16:34:59,443 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-07 16:34:59,444 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2024-11-07 16:34:59,444 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=83, Invalid=624, Unknown=3, NotChecked=102, Total=812 [2024-11-07 16:34:59,444 INFO L87 Difference]: Start difference. First operand 66 states and 90 transitions. Second operand has 27 states, 25 states have (on average 1.68) internal successors, (42), 24 states have internal predecessors, (42), 7 states have call successors, (7), 3 states have call predecessors, (7), 4 states have return successors, (9), 9 states have call predecessors, (9), 7 states have call successors, (9) [2024-11-07 16:35:00,767 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 16:35:00,767 INFO L93 Difference]: Finished difference Result 74 states and 99 transitions. [2024-11-07 16:35:00,767 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2024-11-07 16:35:00,767 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 25 states have (on average 1.68) internal successors, (42), 24 states have internal predecessors, (42), 7 states have call successors, (7), 3 states have call predecessors, (7), 4 states have return successors, (9), 9 states have call predecessors, (9), 7 states have call successors, (9) Word has length 62 [2024-11-07 16:35:00,767 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 16:35:00,768 INFO L225 Difference]: With dead ends: 74 [2024-11-07 16:35:00,768 INFO L226 Difference]: Without dead ends: 74 [2024-11-07 16:35:00,768 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 143 GetRequests, 99 SyntacticMatches, 2 SemanticMatches, 42 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 215 ImplicationChecksByTransitivity, 9.2s TimeCoverageRelationStatistics Valid=175, Invalid=1552, Unknown=3, NotChecked=162, Total=1892 [2024-11-07 16:35:00,769 INFO L432 NwaCegarLoop]: 23 mSDtfsCounter, 52 mSDsluCounter, 201 mSDsCounter, 0 mSdLazyCounter, 886 mSolverCounterSat, 34 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 55 SdHoareTripleChecker+Valid, 224 SdHoareTripleChecker+Invalid, 1064 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 34 IncrementalHoareTripleChecker+Valid, 886 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 144 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-11-07 16:35:00,769 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [55 Valid, 224 Invalid, 1064 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [34 Valid, 886 Invalid, 0 Unknown, 144 Unchecked, 0.9s Time] [2024-11-07 16:35:00,769 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2024-11-07 16:35:00,772 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 66. [2024-11-07 16:35:00,772 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 66 states, 51 states have (on average 1.1176470588235294) internal successors, (57), 53 states have internal predecessors, (57), 11 states have call successors, (11), 1 states have call predecessors, (11), 2 states have return successors, (21), 11 states have call predecessors, (21), 11 states have call successors, (21) [2024-11-07 16:35:00,772 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 89 transitions. [2024-11-07 16:35:00,772 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 89 transitions. Word has length 62 [2024-11-07 16:35:00,772 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 16:35:00,772 INFO L471 AbstractCegarLoop]: Abstraction has 66 states and 89 transitions. [2024-11-07 16:35:00,772 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 25 states have (on average 1.68) internal successors, (42), 24 states have internal predecessors, (42), 7 states have call successors, (7), 3 states have call predecessors, (7), 4 states have return successors, (9), 9 states have call predecessors, (9), 7 states have call successors, (9) [2024-11-07 16:35:00,772 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 89 transitions. [2024-11-07 16:35:00,773 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2024-11-07 16:35:00,773 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 16:35:00,773 INFO L215 NwaCegarLoop]: trace histogram [8, 8, 8, 7, 7, 7, 7, 6, 6, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 16:35:00,779 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 (19)] Forceful destruction successful, exit code 0 [2024-11-07 16:35:00,978 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (20)] Ended with exit code 0 [2024-11-07 16:35:01,174 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,20 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt [2024-11-07 16:35:01,174 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-07 16:35:01,174 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 16:35:01,174 INFO L85 PathProgramCache]: Analyzing trace with hash -446919408, now seen corresponding path program 6 times [2024-11-07 16:35:01,174 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-07 16:35:01,174 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [794845766] [2024-11-07 16:35:01,174 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2024-11-07 16:35:01,174 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:35:01,175 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-07 16:35:01,177 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:35:01,178 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:35:01,358 INFO L227 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 8 check-sat command(s) [2024-11-07 16:35:01,358 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-07 16:35:01,363 INFO L255 TraceCheckSpWp]: Trace formula consists of 269 conjuncts, 70 conjuncts are in the unsatisfiable core [2024-11-07 16:35:01,365 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 16:35:01,378 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:35:01,382 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:35:01,475 WARN L873 $PredicateComparison]: unable to prove that (exists ((|ldv_malloc_#res.base| (_ BitVec 32))) (and (= (store |c_old(#valid)| |ldv_malloc_#res.base| (select |c_#valid| |ldv_malloc_#res.base|)) |c_#valid|) (= (store |c_old(#length)| |ldv_malloc_#res.base| (select |c_#length| |ldv_malloc_#res.base|)) |c_#length|) (= (_ bv0 1) (select |c_old(#valid)| |ldv_malloc_#res.base|)))) is different from true [2024-11-07 16:35:01,491 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-07 16:35:01,491 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:35:01,507 INFO L349 Elim1Store]: treesize reduction 24, result has 33.3 percent of original size [2024-11-07 16:35:01,507 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 2 case distinctions, treesize of input 21 treesize of output 20 [2024-11-07 16:35:01,563 WARN L873 $PredicateComparison]: unable to prove that (exists ((|ldv_malloc_#res.base| (_ BitVec 32))) (and (= (store |c_old(#length)| |ldv_malloc_#res.base| (select |c_#length| |ldv_malloc_#res.base|)) |c_#length|) (= (_ bv0 1) (select |c_old(#valid)| |ldv_malloc_#res.base|)))) is different from true [2024-11-07 16:35:01,577 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-07 16:35:01,578 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:35:01,588 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2024-11-07 16:35:01,588 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:35:01,673 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-07 16:35:01,675 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:35:01,684 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2024-11-07 16:35:01,684 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:35:01,770 WARN L873 $PredicateComparison]: unable to prove that (exists ((|ldv_malloc_#res.base| (_ BitVec 32))) (= (store |c_old(#length)| |ldv_malloc_#res.base| |c_ldv_malloc_#in~size|) |c_#length|)) is different from true [2024-11-07 16:35:01,786 INFO L349 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2024-11-07 16:35:01,786 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 12 treesize of output 18 [2024-11-07 16:35:01,971 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-07 16:35:01,987 INFO L349 Elim1Store]: treesize reduction 21, result has 30.0 percent of original size [2024-11-07 16:35:01,987 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 21 [2024-11-07 16:35:02,004 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2024-11-07 16:35:02,005 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:35:02,139 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-07 16:35:02,140 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:35:02,152 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2024-11-07 16:35:02,153 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:35:02,275 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-07 16:35:02,276 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:35:02,284 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2024-11-07 16:35:02,284 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:35:02,317 INFO L134 CoverageAnalysis]: Checked inductivity of 211 backedges. 11 proven. 114 refuted. 0 times theorem prover too weak. 50 trivial. 36 not checked. [2024-11-07 16:35:02,317 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-07 16:35:06,783 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-07 16:35:06,783 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [794845766] [2024-11-07 16:35:06,783 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [794845766] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-07 16:35:06,783 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1946019607] [2024-11-07 16:35:06,783 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2024-11-07 16:35:06,783 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-11-07 16:35:06,783 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/cvc4 [2024-11-07 16:35:06,785 INFO L229 MonitoredProcess]: Starting monitored process 22 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:35:06,786 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (22)] Waiting until timeout for monitored process [2024-11-07 16:35:07,102 INFO L227 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 8 check-sat command(s) [2024-11-07 16:35:07,103 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-07 16:35:07,107 INFO L255 TraceCheckSpWp]: Trace formula consists of 269 conjuncts, 81 conjuncts are in the unsatisfiable core [2024-11-07 16:35:07,113 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 16:35:07,120 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:35:07,123 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:35:07,238 INFO L349 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2024-11-07 16:35:07,238 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 2 case distinctions, treesize of input 19 treesize of output 27 [2024-11-07 16:35:07,248 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:35:07,522 INFO L349 Elim1Store]: treesize reduction 48, result has 32.4 percent of original size [2024-11-07 16:35:07,523 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 28 treesize of output 36 [2024-11-07 16:35:07,531 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 14 treesize of output 9 [2024-11-07 16:35:07,720 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2024-11-07 16:35:07,720 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:35:07,754 INFO L349 Elim1Store]: treesize reduction 48, result has 32.4 percent of original size [2024-11-07 16:35:07,754 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 28 treesize of output 36 [2024-11-07 16:35:08,059 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2024-11-07 16:35:08,060 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:35:08,078 INFO L349 Elim1Store]: treesize reduction 12, result has 42.9 percent of original size [2024-11-07 16:35:08,079 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 20 treesize of output 22 [2024-11-07 16:35:08,246 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2024-11-07 16:35:08,246 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:35:08,251 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:35:08,382 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-07 16:35:08,383 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:35:08,389 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2024-11-07 16:35:08,389 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:35:08,443 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-07 16:35:08,444 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:35:08,451 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2024-11-07 16:35:08,452 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:35:08,458 INFO L134 CoverageAnalysis]: Checked inductivity of 211 backedges. 7 proven. 124 refuted. 0 times theorem prover too weak. 46 trivial. 34 not checked. [2024-11-07 16:35:08,458 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-07 16:35:12,663 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1946019607] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-07 16:35:12,663 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-07 16:35:12,663 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 30] total 42 [2024-11-07 16:35:12,663 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1727408891] [2024-11-07 16:35:12,663 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-07 16:35:12,663 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 43 states [2024-11-07 16:35:12,663 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-07 16:35:12,664 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2024-11-07 16:35:12,664 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=169, Invalid=1561, Unknown=4, NotChecked=246, Total=1980 [2024-11-07 16:35:12,664 INFO L87 Difference]: Start difference. First operand 66 states and 89 transitions. Second operand has 43 states, 41 states have (on average 1.6097560975609757) internal successors, (66), 37 states have internal predecessors, (66), 12 states have call successors, (12), 3 states have call predecessors, (12), 7 states have return successors, (13), 13 states have call predecessors, (13), 12 states have call successors, (13) [2024-11-07 16:35:14,801 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 16:35:14,801 INFO L93 Difference]: Finished difference Result 96 states and 126 transitions. [2024-11-07 16:35:14,801 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2024-11-07 16:35:14,801 INFO L78 Accepts]: Start accepts. Automaton has has 43 states, 41 states have (on average 1.6097560975609757) internal successors, (66), 37 states have internal predecessors, (66), 12 states have call successors, (12), 3 states have call predecessors, (12), 7 states have return successors, (13), 13 states have call predecessors, (13), 12 states have call successors, (13) Word has length 71 [2024-11-07 16:35:14,802 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 16:35:14,802 INFO L225 Difference]: With dead ends: 96 [2024-11-07 16:35:14,802 INFO L226 Difference]: Without dead ends: 96 [2024-11-07 16:35:14,803 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 170 GetRequests, 102 SyntacticMatches, 1 SemanticMatches, 67 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 1015 ImplicationChecksByTransitivity, 10.5s TimeCoverageRelationStatistics Valid=381, Invalid=3917, Unknown=4, NotChecked=390, Total=4692 [2024-11-07 16:35:14,803 INFO L432 NwaCegarLoop]: 20 mSDtfsCounter, 90 mSDsluCounter, 189 mSDsCounter, 0 mSdLazyCounter, 1378 mSolverCounterSat, 47 mSolverCounterUnsat, 3 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 93 SdHoareTripleChecker+Valid, 209 SdHoareTripleChecker+Invalid, 1749 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 47 IncrementalHoareTripleChecker+Valid, 1378 IncrementalHoareTripleChecker+Invalid, 3 IncrementalHoareTripleChecker+Unknown, 321 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2024-11-07 16:35:14,803 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [93 Valid, 209 Invalid, 1749 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [47 Valid, 1378 Invalid, 3 Unknown, 321 Unchecked, 1.3s Time] [2024-11-07 16:35:14,804 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2024-11-07 16:35:14,809 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 66. [2024-11-07 16:35:14,809 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 66 states, 51 states have (on average 1.0980392156862746) internal successors, (56), 53 states have internal predecessors, (56), 11 states have call successors, (11), 1 states have call predecessors, (11), 2 states have return successors, (21), 11 states have call predecessors, (21), 11 states have call successors, (21) [2024-11-07 16:35:14,810 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 88 transitions. [2024-11-07 16:35:14,810 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 88 transitions. Word has length 71 [2024-11-07 16:35:14,810 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 16:35:14,810 INFO L471 AbstractCegarLoop]: Abstraction has 66 states and 88 transitions. [2024-11-07 16:35:14,810 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 43 states, 41 states have (on average 1.6097560975609757) internal successors, (66), 37 states have internal predecessors, (66), 12 states have call successors, (12), 3 states have call predecessors, (12), 7 states have return successors, (13), 13 states have call predecessors, (13), 12 states have call successors, (13) [2024-11-07 16:35:14,810 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 88 transitions. [2024-11-07 16:35:14,811 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2024-11-07 16:35:14,811 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 16:35:14,811 INFO L215 NwaCegarLoop]: trace histogram [9, 9, 9, 8, 8, 8, 8, 7, 7, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 16:35:14,819 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (21)] Ended with exit code 0 [2024-11-07 16:35:15,016 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (22)] Ended with exit code 0 [2024-11-07 16:35:15,211 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,22 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt [2024-11-07 16:35:15,211 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-07 16:35:15,212 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 16:35:15,212 INFO L85 PathProgramCache]: Analyzing trace with hash -1800849809, now seen corresponding path program 7 times [2024-11-07 16:35:15,212 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-07 16:35:15,212 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [577719609] [2024-11-07 16:35:15,212 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2024-11-07 16:35:15,212 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:35:15,212 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-07 16:35:15,214 INFO L229 MonitoredProcess]: Starting monitored process 23 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-07 16:35:15,215 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (23)] Waiting until timeout for monitored process [2024-11-07 16:35:15,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 16:35:15,364 INFO L255 TraceCheckSpWp]: Trace formula consists of 304 conjuncts, 76 conjuncts are in the unsatisfiable core [2024-11-07 16:35:15,370 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 16:35:15,382 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:35:15,386 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:35:15,461 WARN L873 $PredicateComparison]: unable to prove that (exists ((|ldv_malloc_#res.base| (_ BitVec 32))) (and (= (store |c_old(#length)| |ldv_malloc_#res.base| (select |c_#length| |ldv_malloc_#res.base|)) |c_#length|) (= (_ bv0 1) (select |c_old(#valid)| |ldv_malloc_#res.base|)))) is different from true [2024-11-07 16:35:15,471 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-07 16:35:15,471 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:35:15,478 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2024-11-07 16:35:15,478 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:35:15,556 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-07 16:35:15,557 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:35:15,566 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2024-11-07 16:35:15,566 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:35:15,664 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-07 16:35:15,665 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:35:15,673 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2024-11-07 16:35:15,673 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:35:15,749 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-07 16:35:15,749 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:35:15,756 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2024-11-07 16:35:15,756 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:35:15,846 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-07 16:35:15,847 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:35:15,856 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2024-11-07 16:35:15,856 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:35:15,940 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-07 16:35:15,941 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:35:15,948 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2024-11-07 16:35:15,948 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:35:16,034 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-07 16:35:16,034 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:35:16,042 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2024-11-07 16:35:16,042 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:35:16,139 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-07 16:35:16,139 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:35:16,145 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2024-11-07 16:35:16,145 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:35:16,174 INFO L134 CoverageAnalysis]: Checked inductivity of 277 backedges. 8 proven. 141 refuted. 0 times theorem prover too weak. 112 trivial. 16 not checked. [2024-11-07 16:35:16,174 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-07 16:35:20,423 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-07 16:35:20,423 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [577719609] [2024-11-07 16:35:20,423 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [577719609] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-07 16:35:20,423 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [148103361] [2024-11-07 16:35:20,423 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2024-11-07 16:35:20,423 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-11-07 16:35:20,423 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/cvc4 [2024-11-07 16:35:20,425 INFO L229 MonitoredProcess]: Starting monitored process 24 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:35:20,426 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (24)] Waiting until timeout for monitored process [2024-11-07 16:35:20,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 16:35:20,708 INFO L255 TraceCheckSpWp]: Trace formula consists of 304 conjuncts, 76 conjuncts are in the unsatisfiable core [2024-11-07 16:35:20,712 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 16:35:20,719 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:35:20,722 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:35:20,785 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-07 16:35:20,785 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:35:20,796 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2024-11-07 16:35:20,796 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:35:20,840 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-07 16:35:20,840 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:35:20,848 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2024-11-07 16:35:20,848 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:35:20,895 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-07 16:35:20,895 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:35:20,901 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2024-11-07 16:35:20,901 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:35:20,956 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-07 16:35:20,956 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:35:20,964 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2024-11-07 16:35:20,964 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:35:21,011 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-07 16:35:21,012 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:35:21,019 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2024-11-07 16:35:21,020 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:35:21,062 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-07 16:35:21,063 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:35:21,071 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2024-11-07 16:35:21,072 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:35:21,119 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-07 16:35:21,120 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:35:21,128 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2024-11-07 16:35:21,128 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:35:21,175 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-07 16:35:21,176 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:35:21,183 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2024-11-07 16:35:21,183 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:35:21,188 INFO L134 CoverageAnalysis]: Checked inductivity of 277 backedges. 8 proven. 141 refuted. 0 times theorem prover too weak. 112 trivial. 16 not checked. [2024-11-07 16:35:21,188 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-07 16:35:26,903 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [148103361] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-07 16:35:26,903 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-07 16:35:26,903 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 23] total 23 [2024-11-07 16:35:26,903 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [89621031] [2024-11-07 16:35:26,903 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-07 16:35:26,903 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2024-11-07 16:35:26,903 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-07 16:35:26,904 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2024-11-07 16:35:26,904 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=81, Invalid=522, Unknown=1, NotChecked=46, Total=650 [2024-11-07 16:35:26,904 INFO L87 Difference]: Start difference. First operand 66 states and 88 transitions. Second operand has 24 states, 22 states have (on average 1.8636363636363635) internal successors, (41), 23 states have internal predecessors, (41), 9 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2024-11-07 16:35:28,070 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 16:35:28,070 INFO L93 Difference]: Finished difference Result 82 states and 103 transitions. [2024-11-07 16:35:28,074 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2024-11-07 16:35:28,074 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 22 states have (on average 1.8636363636363635) internal successors, (41), 23 states have internal predecessors, (41), 9 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) Word has length 80 [2024-11-07 16:35:28,075 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 16:35:28,075 INFO L225 Difference]: With dead ends: 82 [2024-11-07 16:35:28,075 INFO L226 Difference]: Without dead ends: 82 [2024-11-07 16:35:28,075 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 183 GetRequests, 139 SyntacticMatches, 1 SemanticMatches, 43 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 230 ImplicationChecksByTransitivity, 10.6s TimeCoverageRelationStatistics Valid=196, Invalid=1699, Unknown=1, NotChecked=84, Total=1980 [2024-11-07 16:35:28,076 INFO L432 NwaCegarLoop]: 34 mSDtfsCounter, 52 mSDsluCounter, 338 mSDsCounter, 0 mSdLazyCounter, 1026 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 55 SdHoareTripleChecker+Valid, 372 SdHoareTripleChecker+Invalid, 1149 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 1026 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 92 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-11-07 16:35:28,076 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [55 Valid, 372 Invalid, 1149 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 1026 Invalid, 0 Unknown, 92 Unchecked, 0.8s Time] [2024-11-07 16:35:28,076 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2024-11-07 16:35:28,078 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 66. [2024-11-07 16:35:28,080 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 66 states, 51 states have (on average 1.0784313725490196) internal successors, (55), 53 states have internal predecessors, (55), 11 states have call successors, (11), 1 states have call predecessors, (11), 2 states have return successors, (21), 11 states have call predecessors, (21), 11 states have call successors, (21) [2024-11-07 16:35:28,081 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 87 transitions. [2024-11-07 16:35:28,081 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 87 transitions. Word has length 80 [2024-11-07 16:35:28,081 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 16:35:28,081 INFO L471 AbstractCegarLoop]: Abstraction has 66 states and 87 transitions. [2024-11-07 16:35:28,081 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 22 states have (on average 1.8636363636363635) internal successors, (41), 23 states have internal predecessors, (41), 9 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2024-11-07 16:35:28,081 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 87 transitions. [2024-11-07 16:35:28,082 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2024-11-07 16:35:28,082 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 16:35:28,082 INFO L215 NwaCegarLoop]: trace histogram [10, 10, 10, 9, 9, 9, 9, 8, 8, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 16:35:28,088 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (24)] Forceful destruction successful, exit code 0 [2024-11-07 16:35:28,287 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (23)] Ended with exit code 0 [2024-11-07 16:35:28,482 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 24 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt,23 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-07 16:35:28,482 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-07 16:35:28,483 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 16:35:28,483 INFO L85 PathProgramCache]: Analyzing trace with hash 2110498800, now seen corresponding path program 8 times [2024-11-07 16:35:28,483 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-07 16:35:28,483 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [303479583] [2024-11-07 16:35:28,483 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-07 16:35:28,483 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:35:28,483 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-07 16:35:28,485 INFO L229 MonitoredProcess]: Starting monitored process 25 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-07 16:35:28,486 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (25)] Waiting until timeout for monitored process [2024-11-07 16:35:28,651 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-07 16:35:28,652 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-07 16:35:28,658 INFO L255 TraceCheckSpWp]: Trace formula consists of 339 conjuncts, 84 conjuncts are in the unsatisfiable core [2024-11-07 16:35:28,663 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 16:35:28,674 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:35:28,678 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:35:28,760 WARN L873 $PredicateComparison]: unable to prove that (exists ((|ldv_malloc_#res.base| (_ BitVec 32))) (and (= (store |c_old(#length)| |ldv_malloc_#res.base| (select |c_#length| |ldv_malloc_#res.base|)) |c_#length|) (= (_ bv0 1) (select |c_old(#valid)| |ldv_malloc_#res.base|)))) is different from true [2024-11-07 16:35:28,769 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-07 16:35:28,769 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:35:28,776 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2024-11-07 16:35:28,776 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:35:28,847 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-07 16:35:28,848 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:35:28,855 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2024-11-07 16:35:28,855 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:35:28,927 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-07 16:35:28,928 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:35:28,935 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2024-11-07 16:35:28,935 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:35:29,012 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-07 16:35:29,013 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:35:29,018 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2024-11-07 16:35:29,019 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:35:29,109 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-07 16:35:29,109 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:35:29,117 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2024-11-07 16:35:29,117 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:35:29,199 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-07 16:35:29,199 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:35:29,206 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2024-11-07 16:35:29,207 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:35:29,294 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-07 16:35:29,294 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:35:29,301 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2024-11-07 16:35:29,302 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:35:29,394 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-07 16:35:29,394 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:35:29,401 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2024-11-07 16:35:29,401 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:35:29,491 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-07 16:35:29,491 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:35:29,499 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2024-11-07 16:35:29,499 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:35:29,529 INFO L134 CoverageAnalysis]: Checked inductivity of 352 backedges. 9 proven. 181 refuted. 0 times theorem prover too weak. 144 trivial. 18 not checked. [2024-11-07 16:35:29,529 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-07 16:35:29,808 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-07 16:35:29,808 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [303479583] [2024-11-07 16:35:29,808 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [303479583] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-07 16:35:29,808 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [597849379] [2024-11-07 16:35:29,808 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-07 16:35:29,809 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-11-07 16:35:29,809 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/cvc4 [2024-11-07 16:35:29,811 INFO L229 MonitoredProcess]: Starting monitored process 26 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:35:29,811 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (26)] Waiting until timeout for monitored process [2024-11-07 16:35:30,101 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-07 16:35:30,101 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-07 16:35:30,119 INFO L255 TraceCheckSpWp]: Trace formula consists of 339 conjuncts, 84 conjuncts are in the unsatisfiable core [2024-11-07 16:35:30,122 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 16:35:30,130 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:35:30,133 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:35:30,195 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-07 16:35:30,195 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:35:30,201 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2024-11-07 16:35:30,201 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:35:30,252 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-07 16:35:30,252 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:35:30,260 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2024-11-07 16:35:30,260 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:35:30,318 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-07 16:35:30,319 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:35:30,327 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2024-11-07 16:35:30,327 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:35:30,377 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-07 16:35:30,377 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:35:30,387 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2024-11-07 16:35:30,388 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:35:30,442 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-07 16:35:30,443 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:35:30,450 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2024-11-07 16:35:30,450 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:35:30,495 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-07 16:35:30,495 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:35:30,502 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2024-11-07 16:35:30,502 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:35:30,547 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-07 16:35:30,547 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:35:30,556 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2024-11-07 16:35:30,556 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:35:30,602 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-07 16:35:30,602 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:35:30,609 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2024-11-07 16:35:30,610 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:35:30,660 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-07 16:35:30,661 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:35:30,670 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2024-11-07 16:35:30,670 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:35:30,678 INFO L134 CoverageAnalysis]: Checked inductivity of 352 backedges. 9 proven. 181 refuted. 0 times theorem prover too weak. 144 trivial. 18 not checked. [2024-11-07 16:35:30,678 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-07 16:35:30,874 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [597849379] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-07 16:35:30,874 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-07 16:35:30,874 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 25] total 25 [2024-11-07 16:35:30,875 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1138827947] [2024-11-07 16:35:30,875 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-07 16:35:30,875 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2024-11-07 16:35:30,875 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-07 16:35:30,875 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2024-11-07 16:35:30,875 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=89, Invalid=616, Unknown=1, NotChecked=50, Total=756 [2024-11-07 16:35:30,876 INFO L87 Difference]: Start difference. First operand 66 states and 87 transitions. Second operand has 26 states, 24 states have (on average 1.875) internal successors, (45), 25 states have internal predecessors, (45), 10 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2024-11-07 16:35:32,358 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 16:35:32,358 INFO L93 Difference]: Finished difference Result 84 states and 104 transitions. [2024-11-07 16:35:32,358 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2024-11-07 16:35:32,359 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 24 states have (on average 1.875) internal successors, (45), 25 states have internal predecessors, (45), 10 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) Word has length 89 [2024-11-07 16:35:32,359 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 16:35:32,359 INFO L225 Difference]: With dead ends: 84 [2024-11-07 16:35:32,359 INFO L226 Difference]: Without dead ends: 84 [2024-11-07 16:35:32,360 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 203 GetRequests, 155 SyntacticMatches, 1 SemanticMatches, 47 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 284 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=217, Invalid=2042, Unknown=1, NotChecked=92, Total=2352 [2024-11-07 16:35:32,360 INFO L432 NwaCegarLoop]: 37 mSDtfsCounter, 56 mSDsluCounter, 436 mSDsCounter, 0 mSdLazyCounter, 1343 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 59 SdHoareTripleChecker+Valid, 473 SdHoareTripleChecker+Invalid, 1477 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 1343 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 101 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2024-11-07 16:35:32,360 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [59 Valid, 473 Invalid, 1477 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 1343 Invalid, 0 Unknown, 101 Unchecked, 1.0s Time] [2024-11-07 16:35:32,360 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2024-11-07 16:35:32,362 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 66. [2024-11-07 16:35:32,362 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 66 states, 51 states have (on average 1.0588235294117647) internal successors, (54), 53 states have internal predecessors, (54), 11 states have call successors, (11), 1 states have call predecessors, (11), 2 states have return successors, (21), 11 states have call predecessors, (21), 11 states have call successors, (21) [2024-11-07 16:35:32,363 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 86 transitions. [2024-11-07 16:35:32,363 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 86 transitions. Word has length 89 [2024-11-07 16:35:32,363 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 16:35:32,363 INFO L471 AbstractCegarLoop]: Abstraction has 66 states and 86 transitions. [2024-11-07 16:35:32,363 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 24 states have (on average 1.875) internal successors, (45), 25 states have internal predecessors, (45), 10 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2024-11-07 16:35:32,363 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 86 transitions. [2024-11-07 16:35:32,363 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2024-11-07 16:35:32,364 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 16:35:32,364 INFO L215 NwaCegarLoop]: trace histogram [11, 11, 11, 10, 10, 10, 10, 9, 9, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 16:35:32,399 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (26)] Forceful destruction successful, exit code 0 [2024-11-07 16:35:32,571 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (25)] Ended with exit code 0 [2024-11-07 16:35:32,764 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 26 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt,25 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-07 16:35:32,764 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-07 16:35:32,765 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 16:35:32,765 INFO L85 PathProgramCache]: Analyzing trace with hash 1054496655, now seen corresponding path program 9 times [2024-11-07 16:35:32,765 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-07 16:35:32,765 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2103870980] [2024-11-07 16:35:32,765 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-07 16:35:32,765 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:35:32,765 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-07 16:35:32,767 INFO L229 MonitoredProcess]: Starting monitored process 27 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-07 16:35:32,767 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (27)] Waiting until timeout for monitored process [2024-11-07 16:35:33,084 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 11 check-sat command(s) [2024-11-07 16:35:33,084 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-07 16:35:33,091 INFO L255 TraceCheckSpWp]: Trace formula consists of 374 conjuncts, 91 conjuncts are in the unsatisfiable core [2024-11-07 16:35:33,094 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 16:35:33,105 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:35:33,109 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:35:33,186 WARN L873 $PredicateComparison]: unable to prove that (exists ((|ldv_malloc_#res.base| (_ BitVec 32))) (and (= (store |c_old(#length)| |ldv_malloc_#res.base| (select |c_#length| |ldv_malloc_#res.base|)) |c_#length|) (= (_ bv0 1) (select |c_old(#valid)| |ldv_malloc_#res.base|)))) is different from true [2024-11-07 16:35:33,196 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-07 16:35:33,196 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:35:33,202 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2024-11-07 16:35:33,202 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:35:33,283 WARN L873 $PredicateComparison]: unable to prove that (exists ((|ldv_malloc_#res.base| (_ BitVec 32))) (= (store |c_old(#length)| |ldv_malloc_#res.base| |c_ldv_malloc_#in~size|) |c_#length|)) is different from true [2024-11-07 16:35:33,298 INFO L349 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2024-11-07 16:35:33,299 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 12 treesize of output 18 [2024-11-07 16:35:33,441 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-07 16:35:33,455 INFO L349 Elim1Store]: treesize reduction 21, result has 30.0 percent of original size [2024-11-07 16:35:33,455 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 26 treesize of output 26 [2024-11-07 16:35:33,466 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2024-11-07 16:35:33,467 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:35:33,603 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-07 16:35:33,604 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 20 treesize of output 13 [2024-11-07 16:35:33,615 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2024-11-07 16:35:33,615 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:35:33,720 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-07 16:35:33,721 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 20 treesize of output 13 [2024-11-07 16:35:33,727 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2024-11-07 16:35:33,727 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:35:33,828 INFO L349 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2024-11-07 16:35:33,829 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 18 treesize of output 22 [2024-11-07 16:35:34,012 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-07 16:35:34,024 INFO L349 Elim1Store]: treesize reduction 21, result has 30.0 percent of original size [2024-11-07 16:35:34,024 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 25 treesize of output 25 [2024-11-07 16:35:34,035 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2024-11-07 16:35:34,035 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:35:34,181 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-07 16:35:34,182 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 20 treesize of output 13 [2024-11-07 16:35:34,187 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2024-11-07 16:35:34,187 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:35:34,323 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-07 16:35:34,323 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 20 treesize of output 13 [2024-11-07 16:35:34,339 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2024-11-07 16:35:34,339 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:35:34,509 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-07 16:35:34,510 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:35:34,518 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2024-11-07 16:35:34,518 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:35:34,554 INFO L134 CoverageAnalysis]: Checked inductivity of 436 backedges. 23 proven. 245 refuted. 0 times theorem prover too weak. 116 trivial. 52 not checked. [2024-11-07 16:35:34,554 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-07 16:35:38,834 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-07 16:35:38,834 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2103870980] [2024-11-07 16:35:38,834 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2103870980] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-07 16:35:38,834 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [421258633] [2024-11-07 16:35:38,834 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-07 16:35:38,834 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-11-07 16:35:38,834 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/cvc4 [2024-11-07 16:35:38,836 INFO L229 MonitoredProcess]: Starting monitored process 28 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:35:38,836 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (28)] Waiting until timeout for monitored process [2024-11-07 16:35:39,446 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 11 check-sat command(s) [2024-11-07 16:35:39,446 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-07 16:35:39,468 INFO L255 TraceCheckSpWp]: Trace formula consists of 374 conjuncts, 106 conjuncts are in the unsatisfiable core [2024-11-07 16:35:39,471 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 16:35:39,477 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:35:39,481 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:35:39,526 WARN L873 $PredicateComparison]: unable to prove that (exists ((|ldv_malloc_#res.base| (_ BitVec 32))) (and (= (store |c_old(#valid)| |ldv_malloc_#res.base| (select |c_#valid| |ldv_malloc_#res.base|)) |c_#valid|) (= (store |c_old(#length)| |ldv_malloc_#res.base| (select |c_#length| |ldv_malloc_#res.base|)) |c_#length|) (= (_ bv0 1) (select |c_old(#valid)| |ldv_malloc_#res.base|)))) is different from true [2024-11-07 16:35:39,559 INFO L349 Elim1Store]: treesize reduction 24, result has 33.3 percent of original size [2024-11-07 16:35:39,559 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 2 case distinctions, treesize of input 21 treesize of output 20 [2024-11-07 16:35:39,562 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:35:39,705 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2024-11-07 16:35:39,705 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:35:39,719 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2024-11-07 16:35:39,719 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:35:39,900 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2024-11-07 16:35:39,900 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:35:39,906 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:35:40,075 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-07 16:35:40,076 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:35:40,085 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2024-11-07 16:35:40,085 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:35:40,215 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-07 16:35:40,216 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:35:40,221 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2024-11-07 16:35:40,222 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:35:40,342 INFO L349 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2024-11-07 16:35:40,342 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 12 treesize of output 18 [2024-11-07 16:35:40,550 INFO L349 Elim1Store]: treesize reduction 24, result has 48.9 percent of original size [2024-11-07 16:35:40,551 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 23 treesize of output 38 [2024-11-07 16:35:40,874 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2024-11-07 16:35:40,875 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:35:40,902 INFO L349 Elim1Store]: treesize reduction 48, result has 28.4 percent of original size [2024-11-07 16:35:40,903 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 24 treesize of output 33 [2024-11-07 16:35:41,094 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-07 16:35:41,095 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:35:41,102 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2024-11-07 16:35:41,102 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:35:41,190 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-07 16:35:41,190 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:35:41,198 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2024-11-07 16:35:41,198 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:35:41,208 INFO L134 CoverageAnalysis]: Checked inductivity of 436 backedges. 18 proven. 264 refuted. 0 times theorem prover too weak. 76 trivial. 78 not checked. [2024-11-07 16:35:41,208 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-07 16:35:41,408 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [421258633] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-07 16:35:41,409 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-07 16:35:41,409 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [35, 38] total 58 [2024-11-07 16:35:41,409 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [462874] [2024-11-07 16:35:41,409 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-07 16:35:41,409 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 59 states [2024-11-07 16:35:41,409 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-07 16:35:41,410 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 59 interpolants. [2024-11-07 16:35:41,410 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=208, Invalid=3106, Unknown=4, NotChecked=342, Total=3660 [2024-11-07 16:35:41,410 INFO L87 Difference]: Start difference. First operand 66 states and 86 transitions. Second operand has 59 states, 57 states have (on average 1.5964912280701755) internal successors, (91), 53 states have internal predecessors, (91), 19 states have call successors, (19), 3 states have call predecessors, (19), 6 states have return successors, (20), 19 states have call predecessors, (20), 19 states have call successors, (20) [2024-11-07 16:35:44,612 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 16:35:44,612 INFO L93 Difference]: Finished difference Result 99 states and 127 transitions. [2024-11-07 16:35:44,613 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2024-11-07 16:35:44,613 INFO L78 Accepts]: Start accepts. Automaton has has 59 states, 57 states have (on average 1.5964912280701755) internal successors, (91), 53 states have internal predecessors, (91), 19 states have call successors, (19), 3 states have call predecessors, (19), 6 states have return successors, (20), 19 states have call predecessors, (20), 19 states have call successors, (20) Word has length 98 [2024-11-07 16:35:44,613 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 16:35:44,613 INFO L225 Difference]: With dead ends: 99 [2024-11-07 16:35:44,613 INFO L226 Difference]: Without dead ends: 99 [2024-11-07 16:35:44,615 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 231 GetRequests, 139 SyntacticMatches, 2 SemanticMatches, 90 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 2188 ImplicationChecksByTransitivity, 7.2s TimeCoverageRelationStatistics Valid=486, Invalid=7354, Unknown=4, NotChecked=528, Total=8372 [2024-11-07 16:35:44,615 INFO L432 NwaCegarLoop]: 28 mSDtfsCounter, 114 mSDsluCounter, 379 mSDsCounter, 0 mSdLazyCounter, 2387 mSolverCounterSat, 76 mSolverCounterUnsat, 4 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 117 SdHoareTripleChecker+Valid, 407 SdHoareTripleChecker+Invalid, 2842 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 76 IncrementalHoareTripleChecker+Valid, 2387 IncrementalHoareTripleChecker+Invalid, 4 IncrementalHoareTripleChecker+Unknown, 375 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2024-11-07 16:35:44,615 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [117 Valid, 407 Invalid, 2842 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [76 Valid, 2387 Invalid, 4 Unknown, 375 Unchecked, 2.1s Time] [2024-11-07 16:35:44,617 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2024-11-07 16:35:44,619 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 69. [2024-11-07 16:35:44,619 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 69 states, 53 states have (on average 1.0566037735849056) internal successors, (56), 55 states have internal predecessors, (56), 12 states have call successors, (12), 1 states have call predecessors, (12), 2 states have return successors, (23), 12 states have call predecessors, (23), 12 states have call successors, (23) [2024-11-07 16:35:44,619 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 91 transitions. [2024-11-07 16:35:44,619 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 91 transitions. Word has length 98 [2024-11-07 16:35:44,620 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 16:35:44,620 INFO L471 AbstractCegarLoop]: Abstraction has 69 states and 91 transitions. [2024-11-07 16:35:44,620 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 59 states, 57 states have (on average 1.5964912280701755) internal successors, (91), 53 states have internal predecessors, (91), 19 states have call successors, (19), 3 states have call predecessors, (19), 6 states have return successors, (20), 19 states have call predecessors, (20), 19 states have call successors, (20) [2024-11-07 16:35:44,620 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 91 transitions. [2024-11-07 16:35:44,620 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2024-11-07 16:35:44,620 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 16:35:44,620 INFO L215 NwaCegarLoop]: trace histogram [11, 11, 11, 10, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 16:35:44,630 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (28)] Ended with exit code 0 [2024-11-07 16:35:44,827 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 (27)] Forceful destruction successful, exit code 0 [2024-11-07 16:35:45,021 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 28 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt,27 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-07 16:35:45,023 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-07 16:35:45,023 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 16:35:45,023 INFO L85 PathProgramCache]: Analyzing trace with hash 329760614, now seen corresponding path program 3 times [2024-11-07 16:35:45,024 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-07 16:35:45,024 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [409403216] [2024-11-07 16:35:45,024 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-07 16:35:45,024 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:35:45,024 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-07 16:35:45,026 INFO L229 MonitoredProcess]: Starting monitored process 29 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-07 16:35:45,027 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (29)] Waiting until timeout for monitored process [2024-11-07 16:35:45,457 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 11 check-sat command(s) [2024-11-07 16:35:45,457 INFO L228 tOrderPrioritization]: Conjunction of SSA is sat [2024-11-07 16:35:45,457 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-07 16:35:45,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-07 16:35:45,767 INFO L130 FreeRefinementEngine]: Strategy WOLF found a feasible trace [2024-11-07 16:35:45,767 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-07 16:35:45,767 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_LEAK (2 of 3 remaining) [2024-11-07 16:35:45,768 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (1 of 3 remaining) [2024-11-07 16:35:45,769 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (0 of 3 remaining) [2024-11-07 16:35:45,777 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (29)] Ended with exit code 0 [2024-11-07 16:35:45,969 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 29 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-07 16:35:45,971 INFO L407 BasicCegarLoop]: Path program histogram: [9, 3, 1, 1, 1, 1, 1, 1] [2024-11-07 16:35:45,998 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-07 16:35:46,000 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.11 04:35:45 BoogieIcfgContainer [2024-11-07 16:35:46,000 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-07 16:35:46,000 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-07 16:35:46,000 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-07 16:35:46,000 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-07 16:35:46,001 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 04:34:05" (3/4) ... [2024-11-07 16:35:46,002 INFO L145 WitnessPrinter]: No result that supports witness generation found [2024-11-07 16:35:46,003 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-07 16:35:46,003 INFO L158 Benchmark]: Toolchain (without parser) took 101139.21ms. Allocated memory was 83.9MB in the beginning and 226.5MB in the end (delta: 142.6MB). Free memory was 59.1MB in the beginning and 168.3MB in the end (delta: -109.3MB). Peak memory consumption was 35.6MB. Max. memory is 16.1GB. [2024-11-07 16:35:46,003 INFO L158 Benchmark]: CDTParser took 0.13ms. Allocated memory is still 83.9MB. Free memory is still 65.3MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-07 16:35:46,003 INFO L158 Benchmark]: CACSL2BoogieTranslator took 367.69ms. Allocated memory is still 83.9MB. Free memory was 59.1MB in the beginning and 31.8MB in the end (delta: 27.3MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2024-11-07 16:35:46,003 INFO L158 Benchmark]: Boogie Procedure Inliner took 29.15ms. Allocated memory is still 83.9MB. Free memory was 31.8MB in the beginning and 30.0MB in the end (delta: 1.8MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-11-07 16:35:46,004 INFO L158 Benchmark]: Boogie Preprocessor took 22.97ms. Allocated memory is still 83.9MB. Free memory was 30.0MB in the beginning and 28.2MB in the end (delta: 1.7MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-07 16:35:46,004 INFO L158 Benchmark]: RCFGBuilder took 228.20ms. Allocated memory is still 83.9MB. Free memory was 28.2MB in the beginning and 54.6MB in the end (delta: -26.4MB). Peak memory consumption was 11.8MB. Max. memory is 16.1GB. [2024-11-07 16:35:46,006 INFO L158 Benchmark]: TraceAbstraction took 100484.39ms. Allocated memory was 83.9MB in the beginning and 226.5MB in the end (delta: 142.6MB). Free memory was 54.1MB in the beginning and 168.4MB in the end (delta: -114.2MB). Peak memory consumption was 32.2MB. Max. memory is 16.1GB. [2024-11-07 16:35:46,007 INFO L158 Benchmark]: Witness Printer took 2.61ms. Allocated memory is still 226.5MB. Free memory was 168.4MB in the beginning and 168.3MB in the end (delta: 32.3kB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-07 16:35:46,007 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.13ms. Allocated memory is still 83.9MB. Free memory is still 65.3MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 367.69ms. Allocated memory is still 83.9MB. Free memory was 59.1MB in the beginning and 31.8MB in the end (delta: 27.3MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 29.15ms. Allocated memory is still 83.9MB. Free memory was 31.8MB in the beginning and 30.0MB in the end (delta: 1.8MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 22.97ms. Allocated memory is still 83.9MB. Free memory was 30.0MB in the beginning and 28.2MB in the end (delta: 1.7MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 228.20ms. Allocated memory is still 83.9MB. Free memory was 28.2MB in the beginning and 54.6MB in the end (delta: -26.4MB). Peak memory consumption was 11.8MB. Max. memory is 16.1GB. * TraceAbstraction took 100484.39ms. Allocated memory was 83.9MB in the beginning and 226.5MB in the end (delta: 142.6MB). Free memory was 54.1MB in the beginning and 168.4MB in the end (delta: -114.2MB). Peak memory consumption was 32.2MB. Max. memory is 16.1GB. * Witness Printer took 2.61ms. Allocated memory is still 226.5MB. Free memory was 168.4MB in the beginning and 168.3MB in the end (delta: 32.3kB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 772]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: overapproximation of memtrack at line 772. Possible FailurePath: [L569] struct ldv_list_head ldv_global_msg_list = { &(ldv_global_msg_list), &(ldv_global_msg_list) }; [L569] struct ldv_list_head ldv_global_msg_list = { &(ldv_global_msg_list), &(ldv_global_msg_list) }; [L569] struct ldv_list_head ldv_global_msg_list = { &(ldv_global_msg_list), &(ldv_global_msg_list) }; VAL [ldv_global_msg_list={1:0}] [L773] CALL entry_point() [L761] int len = 10; VAL [ldv_global_msg_list={1:0}, len=10] [L762] CALL, EXPR ldv_malloc(sizeof(struct A18*)*len) VAL [\old(size)=40, ldv_global_msg_list={1:0}] [L526] COND TRUE __VERIFIER_nondet_int() [L527] return malloc(size); [L762] RET, EXPR ldv_malloc(sizeof(struct A18*)*len) VAL [ldv_global_msg_list={1:0}, len=10] [L762] struct A18 **array = (struct A18 **)ldv_malloc(sizeof(struct A18*)*len); [L763] struct A18 *p; [L764] int i=0; VAL [array={8202:0}, i=0, ldv_global_msg_list={1:0}, len=10] [L765] COND FALSE !(!array) VAL [array={8202:0}, i=0, ldv_global_msg_list={1:0}, len=10] [L766] COND TRUE i