./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/uthash-2.0.2/uthash_BER_test6-1.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/uthash-2.0.2/uthash_BER_test6-1.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', '05edfd344a133924af20e7887ded3d695179bf474d7b39ea2b7287f4a108ff8d'] Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/uthash-2.0.2/uthash_BER_test6-1.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 05edfd344a133924af20e7887ded3d695179bf474d7b39ea2b7287f4a108ff8d --- Real Ultimate output --- This is Ultimate 0.3.0-?-4f9af40 [2024-11-07 18:44:20,608 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-07 18:44:20,675 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2024-11-07 18:44:20,680 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-07 18:44:20,682 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-07 18:44:20,716 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-07 18:44:20,718 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-07 18:44:20,718 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-07 18:44:20,718 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-07 18:44:20,719 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-07 18:44:20,719 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-07 18:44:20,720 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-07 18:44:20,720 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-07 18:44:20,720 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-07 18:44:20,720 INFO L153 SettingsManager]: * Use SBE=true [2024-11-07 18:44:20,720 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-07 18:44:20,721 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-07 18:44:20,721 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-07 18:44:20,721 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-07 18:44:20,721 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-07 18:44:20,721 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-11-07 18:44:20,721 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-11-07 18:44:20,721 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-11-07 18:44:20,722 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-07 18:44:20,722 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-07 18:44:20,722 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-07 18:44:20,722 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-07 18:44:20,722 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-07 18:44:20,722 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-07 18:44:20,723 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-07 18:44:20,723 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-07 18:44:20,723 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-07 18:44:20,723 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-07 18:44:20,723 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-07 18:44:20,724 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-07 18:44:20,724 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-07 18:44:20,724 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-07 18:44:20,724 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-07 18:44:20,724 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-07 18:44:20,724 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-07 18:44:20,724 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-07 18:44:20,724 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-07 18:44:20,725 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G valid-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 -> 05edfd344a133924af20e7887ded3d695179bf474d7b39ea2b7287f4a108ff8d [2024-11-07 18:44:21,025 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-07 18:44:21,037 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-07 18:44:21,039 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-07 18:44:21,040 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-07 18:44:21,040 INFO L274 PluginConnector]: CDTParser initialized [2024-11-07 18:44:21,041 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/uthash-2.0.2/uthash_BER_test6-1.i [2024-11-07 18:44:22,371 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-07 18:44:22,764 INFO L384 CDTParser]: Found 1 translation units. [2024-11-07 18:44:22,766 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_BER_test6-1.i [2024-11-07 18:44:22,790 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/d49d293db/b59a1393c8984b09b4b3d111db9c780b/FLAG859cfaca4 [2024-11-07 18:44:22,810 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/d49d293db/b59a1393c8984b09b4b3d111db9c780b [2024-11-07 18:44:22,813 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-07 18:44:22,814 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-07 18:44:22,815 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-07 18:44:22,816 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-07 18:44:22,823 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-07 18:44:22,826 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 06:44:22" (1/1) ... [2024-11-07 18:44:22,827 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@36f774b2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 06:44:22, skipping insertion in model container [2024-11-07 18:44:22,827 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 06:44:22" (1/1) ... [2024-11-07 18:44:22,876 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-07 18:44:23,274 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 18:44:23,306 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 18:44:23,308 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 18:44:23,311 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 18:44:23,316 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 18:44:23,343 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 18:44:23,344 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 18:44:23,346 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 18:44:23,347 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 18:44:23,349 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 18:44:23,351 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 18:44:23,352 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 18:44:23,353 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 18:44:23,356 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-07 18:44:23,366 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-07 18:44:23,386 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 18:44:23,386 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver@4d1e2ec9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 06:44:23, skipping insertion in model container [2024-11-07 18:44:23,386 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-07 18:44:23,387 INFO L186 ToolchainWalker]: Toolchain execution was canceled (user or tool) before executing de.uni_freiburg.informatik.ultimate.boogie.procedureinliner [2024-11-07 18:44:23,390 INFO L158 Benchmark]: Toolchain (without parser) took 575.04ms. Allocated memory is still 100.7MB. Free memory was 73.9MB in the beginning and 52.7MB in the end (delta: 21.2MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2024-11-07 18:44:23,391 INFO L158 Benchmark]: CDTParser took 0.20ms. Allocated memory is still 83.9MB. Free memory is still 46.8MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-07 18:44:23,391 INFO L158 Benchmark]: CACSL2BoogieTranslator took 571.52ms. Allocated memory is still 100.7MB. Free memory was 73.8MB in the beginning and 52.7MB in the end (delta: 21.1MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2024-11-07 18:44:23,394 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.20ms. Allocated memory is still 83.9MB. Free memory is still 46.8MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 571.52ms. Allocated memory is still 100.7MB. Free memory was 73.8MB in the beginning and 52.7MB in the end (delta: 21.1MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - UnsupportedSyntaxResult [Line: 1001]: Unsupported Syntax Found a cast between two array/pointer types of different sizes while using memory model HoenickeLindenmann_Original (while Not using bitvector translation) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/uthash-2.0.2/uthash_BER_test6-1.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 05edfd344a133924af20e7887ded3d695179bf474d7b39ea2b7287f4a108ff8d --- Real Ultimate output --- This is Ultimate 0.3.0-?-4f9af40 [2024-11-07 18:44:25,337 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-07 18:44:25,439 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf [2024-11-07 18:44:25,446 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-07 18:44:25,446 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-07 18:44:25,477 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-07 18:44:25,478 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-07 18:44:25,478 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-07 18:44:25,479 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-07 18:44:25,479 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-07 18:44:25,479 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-07 18:44:25,479 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-07 18:44:25,480 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-07 18:44:25,480 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-07 18:44:25,480 INFO L153 SettingsManager]: * Use SBE=true [2024-11-07 18:44:25,480 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-07 18:44:25,480 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-07 18:44:25,480 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-07 18:44:25,480 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-07 18:44:25,480 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-07 18:44:25,480 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-11-07 18:44:25,480 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-11-07 18:44:25,480 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-11-07 18:44:25,481 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-07 18:44:25,481 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-07 18:44:25,481 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-07 18:44:25,481 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-07 18:44:25,481 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-07 18:44:25,481 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-07 18:44:25,481 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-07 18:44:25,481 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-07 18:44:25,481 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-07 18:44:25,481 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-07 18:44:25,481 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-07 18:44:25,481 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-07 18:44:25,481 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-07 18:44:25,481 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-07 18:44:25,482 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-07 18:44:25,482 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-07 18:44:25,482 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-07 18:44:25,482 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-07 18:44:25,482 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-07 18:44:25,482 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-07 18:44:25,482 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-07 18:44:25,482 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 -> 05edfd344a133924af20e7887ded3d695179bf474d7b39ea2b7287f4a108ff8d [2024-11-07 18:44:25,752 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-07 18:44:25,758 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-07 18:44:25,760 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-07 18:44:25,761 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-07 18:44:25,761 INFO L274 PluginConnector]: CDTParser initialized [2024-11-07 18:44:25,762 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/uthash-2.0.2/uthash_BER_test6-1.i [2024-11-07 18:44:27,102 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-07 18:44:27,465 INFO L384 CDTParser]: Found 1 translation units. [2024-11-07 18:44:27,467 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_BER_test6-1.i [2024-11-07 18:44:27,490 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/55c6a5850/41890c3eaa9144dfb8888bd92668c184/FLAG5164088a2 [2024-11-07 18:44:27,669 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/55c6a5850/41890c3eaa9144dfb8888bd92668c184 [2024-11-07 18:44:27,671 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-07 18:44:27,672 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-07 18:44:27,674 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-07 18:44:27,674 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-07 18:44:27,677 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-07 18:44:27,678 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 06:44:27" (1/1) ... [2024-11-07 18:44:27,678 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5ed8cb38 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 06:44:27, skipping insertion in model container [2024-11-07 18:44:27,679 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 06:44:27" (1/1) ... [2024-11-07 18:44:27,718 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-07 18:44:28,193 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 18:44:28,226 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-07 18:44:28,230 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-07 18:44:28,234 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-07 18:44:28,240 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 18:44:28,270 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 18:44:28,271 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 18:44:28,273 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 18:44:28,273 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 18:44:28,278 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 18:44:28,280 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-07 18:44:28,281 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 18:44:28,281 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 18:44:28,285 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 18:44:28,290 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-07 18:44:28,303 INFO L197 MainTranslator]: Restarting translation with changed settings: SettingsChange [mNewPreferredMemoryModel=HoenickeLindenmann_1ByteResolution] [2024-11-07 18:44:28,317 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-07 18:44:28,356 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-07 18:44:28,373 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-07 18:44:28,375 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 18:44:28,377 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-07 18:44:28,381 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-07 18:44:28,400 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-07 18:44:28,401 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 18:44:28,403 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 18:44:28,403 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 18:44:28,409 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 18:44:28,410 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 18:44:28,411 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 18:44:28,412 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 18:44:28,417 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 18:44:28,421 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-07 18:44:28,429 INFO L200 MainTranslator]: Completed pre-run [2024-11-07 18:44:28,564 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-07 18:44:28,625 INFO L204 MainTranslator]: Completed translation [2024-11-07 18:44:28,627 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 06:44:28 WrapperNode [2024-11-07 18:44:28,627 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-07 18:44:28,628 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-07 18:44:28,629 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-07 18:44:28,629 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-07 18:44:28,635 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 06:44:28" (1/1) ... [2024-11-07 18:44:28,676 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 06:44:28" (1/1) ... [2024-11-07 18:44:28,765 INFO L138 Inliner]: procedures = 286, calls = 300, calls flagged for inlining = 6, calls inlined = 6, statements flattened = 1078 [2024-11-07 18:44:28,765 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-07 18:44:28,766 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-07 18:44:28,766 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-07 18:44:28,766 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-07 18:44:28,773 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 06:44:28" (1/1) ... [2024-11-07 18:44:28,773 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 06:44:28" (1/1) ... [2024-11-07 18:44:28,791 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 06:44:28" (1/1) ... [2024-11-07 18:44:28,871 INFO L175 MemorySlicer]: Split 268 memory accesses to 4 slices as follows [2, 12, 220, 34]. 82 percent of accesses are in the largest equivalence class. The 12 initializations are split as follows [2, 10, 0, 0]. The 54 writes are split as follows [0, 1, 49, 4]. [2024-11-07 18:44:28,871 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 06:44:28" (1/1) ... [2024-11-07 18:44:28,871 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 06:44:28" (1/1) ... [2024-11-07 18:44:28,930 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 06:44:28" (1/1) ... [2024-11-07 18:44:28,937 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 06:44:28" (1/1) ... [2024-11-07 18:44:28,952 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 06:44:28" (1/1) ... [2024-11-07 18:44:28,959 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 06:44:28" (1/1) ... [2024-11-07 18:44:28,973 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-07 18:44:28,974 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-07 18:44:28,975 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-07 18:44:28,975 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-07 18:44:28,976 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 06:44:28" (1/1) ... [2024-11-07 18:44:28,982 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-07 18:44:28,995 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 18:44:29,007 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 18:44:29,009 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 18:44:29,025 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2024-11-07 18:44:29,025 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2024-11-07 18:44:29,025 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#0 [2024-11-07 18:44:29,025 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#1 [2024-11-07 18:44:29,025 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#2 [2024-11-07 18:44:29,025 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#3 [2024-11-07 18:44:29,025 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#0 [2024-11-07 18:44:29,026 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#1 [2024-11-07 18:44:29,026 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#2 [2024-11-07 18:44:29,026 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#3 [2024-11-07 18:44:29,026 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-11-07 18:44:29,026 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2024-11-07 18:44:29,026 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2024-11-07 18:44:29,026 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2024-11-07 18:44:29,026 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#3 [2024-11-07 18:44:29,026 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-07 18:44:29,026 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#0 [2024-11-07 18:44:29,026 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#1 [2024-11-07 18:44:29,026 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#2 [2024-11-07 18:44:29,026 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#3 [2024-11-07 18:44:29,026 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-07 18:44:29,026 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2024-11-07 18:44:29,026 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#2 [2024-11-07 18:44:29,026 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#3 [2024-11-07 18:44:29,026 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#0 [2024-11-07 18:44:29,026 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#1 [2024-11-07 18:44:29,026 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#2 [2024-11-07 18:44:29,026 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#3 [2024-11-07 18:44:29,026 INFO L130 BoogieDeclarations]: Found specification of procedure alt_bzero [2024-11-07 18:44:29,026 INFO L138 BoogieDeclarations]: Found implementation of procedure alt_bzero [2024-11-07 18:44:29,027 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2024-11-07 18:44:29,027 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2024-11-07 18:44:29,027 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-11-07 18:44:29,027 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-07 18:44:29,027 INFO L130 BoogieDeclarations]: Found specification of procedure alt_malloc [2024-11-07 18:44:29,027 INFO L138 BoogieDeclarations]: Found implementation of procedure alt_malloc [2024-11-07 18:44:29,027 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2024-11-07 18:44:29,027 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2024-11-07 18:44:29,027 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2024-11-07 18:44:29,027 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#3 [2024-11-07 18:44:29,027 INFO L130 BoogieDeclarations]: Found specification of procedure alt_free [2024-11-07 18:44:29,027 INFO L138 BoogieDeclarations]: Found implementation of procedure alt_free [2024-11-07 18:44:29,029 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-07 18:44:29,029 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-07 18:44:29,244 INFO L238 CfgBuilder]: Building ICFG [2024-11-07 18:44:29,245 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-07 18:44:32,747 INFO L? ?]: Removed 1086 outVars from TransFormulas that were not future-live. [2024-11-07 18:44:32,747 INFO L287 CfgBuilder]: Performing block encoding [2024-11-07 18:44:32,785 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-07 18:44:32,788 INFO L316 CfgBuilder]: Removed 63 assume(true) statements. [2024-11-07 18:44:32,788 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 06:44:32 BoogieIcfgContainer [2024-11-07 18:44:32,788 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-07 18:44:32,791 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-07 18:44:32,791 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-07 18:44:32,796 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-07 18:44:32,797 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.11 06:44:27" (1/3) ... [2024-11-07 18:44:32,797 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1ae959f6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 06:44:32, skipping insertion in model container [2024-11-07 18:44:32,797 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 06:44:28" (2/3) ... [2024-11-07 18:44:32,798 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1ae959f6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 06:44:32, skipping insertion in model container [2024-11-07 18:44:32,798 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 06:44:32" (3/3) ... [2024-11-07 18:44:32,799 INFO L112 eAbstractionObserver]: Analyzing ICFG uthash_BER_test6-1.i [2024-11-07 18:44:32,810 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-07 18:44:32,810 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 522 error locations. [2024-11-07 18:44:32,859 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-07 18:44:32,869 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;@33bda4dd, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-07 18:44:32,869 INFO L334 AbstractCegarLoop]: Starting to check reachability of 522 error locations. [2024-11-07 18:44:32,882 INFO L276 IsEmpty]: Start isEmpty. Operand has 1085 states, 540 states have (on average 2.198148148148148) internal successors, (1187), 1065 states have internal predecessors, (1187), 18 states have call successors, (18), 5 states have call predecessors, (18), 5 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2024-11-07 18:44:32,886 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2024-11-07 18:44:32,887 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 18:44:32,887 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1] [2024-11-07 18:44:32,888 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, alt_mallocErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alt_mallocErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 519 more)] === [2024-11-07 18:44:32,891 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 18:44:32,891 INFO L85 PathProgramCache]: Analyzing trace with hash 85465, now seen corresponding path program 1 times [2024-11-07 18:44:32,899 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-07 18:44:32,900 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [519968254] [2024-11-07 18:44:32,900 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 18:44:32,900 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-07 18:44:32,901 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-07 18:44:32,904 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 18:44:32,906 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 18:44:33,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 18:44:33,085 INFO L255 TraceCheckSpWp]: Trace formula consists of 70 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-07 18:44:33,091 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 18:44:33,150 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 18:44:33,170 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 18:44:33,170 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-07 18:44:33,171 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-07 18:44:33,171 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [519968254] [2024-11-07 18:44:33,171 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [519968254] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 18:44:33,171 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 18:44:33,172 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-07 18:44:33,174 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [27729698] [2024-11-07 18:44:33,174 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 18:44:33,177 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-07 18:44:33,177 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-07 18:44:33,198 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-07 18:44:33,199 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-07 18:44:33,203 INFO L87 Difference]: Start difference. First operand has 1085 states, 540 states have (on average 2.198148148148148) internal successors, (1187), 1065 states have internal predecessors, (1187), 18 states have call successors, (18), 5 states have call predecessors, (18), 5 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) Second operand has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 18:44:34,485 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 18:44:34,486 INFO L93 Difference]: Finished difference Result 1165 states and 1235 transitions. [2024-11-07 18:44:34,487 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-07 18:44:34,488 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 3 [2024-11-07 18:44:34,488 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 18:44:34,502 INFO L225 Difference]: With dead ends: 1165 [2024-11-07 18:44:34,502 INFO L226 Difference]: Without dead ends: 1163 [2024-11-07 18:44:34,504 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-07 18:44:34,506 INFO L432 NwaCegarLoop]: 796 mSDtfsCounter, 720 mSDsluCounter, 246 mSDsCounter, 0 mSdLazyCounter, 592 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 723 SdHoareTripleChecker+Valid, 1042 SdHoareTripleChecker+Invalid, 604 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 592 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2024-11-07 18:44:34,506 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [723 Valid, 1042 Invalid, 604 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 592 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2024-11-07 18:44:34,521 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1163 states. [2024-11-07 18:44:34,571 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1163 to 1106. [2024-11-07 18:44:34,573 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1106 states, 576 states have (on average 2.0572916666666665) internal successors, (1185), 1088 states have internal predecessors, (1185), 17 states have call successors, (17), 5 states have call predecessors, (17), 4 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2024-11-07 18:44:34,581 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1106 states to 1106 states and 1215 transitions. [2024-11-07 18:44:34,582 INFO L78 Accepts]: Start accepts. Automaton has 1106 states and 1215 transitions. Word has length 3 [2024-11-07 18:44:34,582 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 18:44:34,582 INFO L471 AbstractCegarLoop]: Abstraction has 1106 states and 1215 transitions. [2024-11-07 18:44:34,582 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 18:44:34,583 INFO L276 IsEmpty]: Start isEmpty. Operand 1106 states and 1215 transitions. [2024-11-07 18:44:34,583 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2024-11-07 18:44:34,583 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 18:44:34,583 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1] [2024-11-07 18:44:34,586 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 18:44:34,783 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 18:44:34,784 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, alt_mallocErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alt_mallocErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 519 more)] === [2024-11-07 18:44:34,784 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 18:44:34,784 INFO L85 PathProgramCache]: Analyzing trace with hash 85466, now seen corresponding path program 1 times [2024-11-07 18:44:34,785 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-07 18:44:34,785 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [332366272] [2024-11-07 18:44:34,785 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 18:44:34,785 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 18:44:34,786 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-07 18:44:34,787 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 18:44:34,789 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 18:44:34,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 18:44:34,914 INFO L255 TraceCheckSpWp]: Trace formula consists of 70 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-07 18:44:34,915 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 18:44:34,924 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 18:44:34,935 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 18:44:34,935 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-07 18:44:34,936 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-07 18:44:34,936 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [332366272] [2024-11-07 18:44:34,936 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [332366272] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 18:44:34,936 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 18:44:34,936 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-07 18:44:34,936 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1689132169] [2024-11-07 18:44:34,936 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 18:44:34,937 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-07 18:44:34,937 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-07 18:44:34,937 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-07 18:44:34,937 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-07 18:44:34,938 INFO L87 Difference]: Start difference. First operand 1106 states and 1215 transitions. Second operand has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 18:44:36,871 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 18:44:36,873 INFO L93 Difference]: Finished difference Result 1510 states and 1656 transitions. [2024-11-07 18:44:36,873 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-07 18:44:36,873 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 3 [2024-11-07 18:44:36,874 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 18:44:36,879 INFO L225 Difference]: With dead ends: 1510 [2024-11-07 18:44:36,879 INFO L226 Difference]: Without dead ends: 1510 [2024-11-07 18:44:36,880 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-07 18:44:36,883 INFO L432 NwaCegarLoop]: 936 mSDtfsCounter, 428 mSDsluCounter, 602 mSDsCounter, 0 mSdLazyCounter, 714 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 433 SdHoareTripleChecker+Valid, 1538 SdHoareTripleChecker+Invalid, 719 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 714 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2024-11-07 18:44:36,883 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [433 Valid, 1538 Invalid, 719 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 714 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2024-11-07 18:44:36,887 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1510 states. [2024-11-07 18:44:36,911 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1510 to 1319. [2024-11-07 18:44:36,913 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1319 states, 788 states have (on average 2.0431472081218276) internal successors, (1610), 1299 states have internal predecessors, (1610), 19 states have call successors, (19), 5 states have call predecessors, (19), 4 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2024-11-07 18:44:36,918 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1319 states to 1319 states and 1644 transitions. [2024-11-07 18:44:36,919 INFO L78 Accepts]: Start accepts. Automaton has 1319 states and 1644 transitions. Word has length 3 [2024-11-07 18:44:36,919 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 18:44:36,919 INFO L471 AbstractCegarLoop]: Abstraction has 1319 states and 1644 transitions. [2024-11-07 18:44:36,919 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 18:44:36,919 INFO L276 IsEmpty]: Start isEmpty. Operand 1319 states and 1644 transitions. [2024-11-07 18:44:36,922 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2024-11-07 18:44:36,922 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 18:44:36,922 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 18:44:36,927 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2024-11-07 18:44:37,122 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 18:44:37,123 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, alt_mallocErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alt_mallocErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 519 more)] === [2024-11-07 18:44:37,123 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 18:44:37,124 INFO L85 PathProgramCache]: Analyzing trace with hash -1307350193, now seen corresponding path program 1 times [2024-11-07 18:44:37,124 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-07 18:44:37,124 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [433371493] [2024-11-07 18:44:37,124 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 18:44:37,124 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 18:44:37,125 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-07 18:44:37,127 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 18:44:37,129 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 18:44:37,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 18:44:37,289 INFO L255 TraceCheckSpWp]: Trace formula consists of 111 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-07 18:44:37,292 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 18:44:37,303 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 18:44:37,309 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 18:44:37,378 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-07 18:44:37,380 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 18:44:37,398 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2024-11-07 18:44:37,398 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 18:44:37,433 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 18:44:37,433 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-07 18:44:37,433 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-07 18:44:37,433 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [433371493] [2024-11-07 18:44:37,433 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [433371493] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 18:44:37,434 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 18:44:37,434 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-07 18:44:37,434 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [229636610] [2024-11-07 18:44:37,434 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 18:44:37,434 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-07 18:44:37,434 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-07 18:44:37,435 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-07 18:44:37,435 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-07 18:44:37,435 INFO L87 Difference]: Start difference. First operand 1319 states and 1644 transitions. Second operand has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 4 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 18:44:40,694 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 18:44:40,695 INFO L93 Difference]: Finished difference Result 2025 states and 2408 transitions. [2024-11-07 18:44:40,695 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-07 18:44:40,695 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 4 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 8 [2024-11-07 18:44:40,695 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 18:44:40,702 INFO L225 Difference]: With dead ends: 2025 [2024-11-07 18:44:40,702 INFO L226 Difference]: Without dead ends: 2025 [2024-11-07 18:44:40,702 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 5 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 18:44:40,703 INFO L432 NwaCegarLoop]: 643 mSDtfsCounter, 734 mSDsluCounter, 942 mSDsCounter, 0 mSdLazyCounter, 1792 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 738 SdHoareTripleChecker+Valid, 1585 SdHoareTripleChecker+Invalid, 1804 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 1792 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.2s IncrementalHoareTripleChecker+Time [2024-11-07 18:44:40,703 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [738 Valid, 1585 Invalid, 1804 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 1792 Invalid, 0 Unknown, 0 Unchecked, 3.2s Time] [2024-11-07 18:44:40,706 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2025 states. [2024-11-07 18:44:40,727 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2025 to 1468. [2024-11-07 18:44:40,729 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1468 states, 937 states have (on average 2.024546424759872) internal successors, (1897), 1448 states have internal predecessors, (1897), 19 states have call successors, (19), 5 states have call predecessors, (19), 4 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2024-11-07 18:44:40,734 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1468 states to 1468 states and 1931 transitions. [2024-11-07 18:44:40,734 INFO L78 Accepts]: Start accepts. Automaton has 1468 states and 1931 transitions. Word has length 8 [2024-11-07 18:44:40,735 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 18:44:40,735 INFO L471 AbstractCegarLoop]: Abstraction has 1468 states and 1931 transitions. [2024-11-07 18:44:40,735 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 4 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 18:44:40,735 INFO L276 IsEmpty]: Start isEmpty. Operand 1468 states and 1931 transitions. [2024-11-07 18:44:40,735 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2024-11-07 18:44:40,735 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 18:44:40,736 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 18:44:40,740 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 18:44:40,936 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 18:44:40,937 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, alt_mallocErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alt_mallocErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 519 more)] === [2024-11-07 18:44:40,938 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 18:44:40,939 INFO L85 PathProgramCache]: Analyzing trace with hash -1873150296, now seen corresponding path program 1 times [2024-11-07 18:44:40,939 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-07 18:44:40,939 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2052957964] [2024-11-07 18:44:40,939 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 18:44:40,939 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 18:44:40,939 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-07 18:44:40,942 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 18:44:40,944 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 18:44:41,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 18:44:41,072 INFO L255 TraceCheckSpWp]: Trace formula consists of 116 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-07 18:44:41,075 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 18:44:41,082 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 18:44:41,107 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 18:44:41,108 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-07 18:44:41,108 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-07 18:44:41,108 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2052957964] [2024-11-07 18:44:41,108 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2052957964] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 18:44:41,108 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 18:44:41,108 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-07 18:44:41,108 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1140183436] [2024-11-07 18:44:41,108 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 18:44:41,108 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-07 18:44:41,108 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-07 18:44:41,109 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-07 18:44:41,109 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-07 18:44:41,109 INFO L87 Difference]: Start difference. First operand 1468 states and 1931 transitions. Second operand has 4 states, 3 states have (on average 3.0) internal successors, (9), 4 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 18:44:42,908 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 18:44:42,909 INFO L93 Difference]: Finished difference Result 2015 states and 2706 transitions. [2024-11-07 18:44:42,909 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-07 18:44:42,909 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), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2024-11-07 18:44:42,909 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 18:44:42,915 INFO L225 Difference]: With dead ends: 2015 [2024-11-07 18:44:42,915 INFO L226 Difference]: Without dead ends: 2015 [2024-11-07 18:44:42,916 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-07 18:44:42,917 INFO L432 NwaCegarLoop]: 1015 mSDtfsCounter, 924 mSDsluCounter, 1078 mSDsCounter, 0 mSdLazyCounter, 1476 mSolverCounterSat, 49 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 927 SdHoareTripleChecker+Valid, 2093 SdHoareTripleChecker+Invalid, 1525 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 49 IncrementalHoareTripleChecker+Valid, 1476 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2024-11-07 18:44:42,918 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [927 Valid, 2093 Invalid, 1525 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [49 Valid, 1476 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2024-11-07 18:44:42,920 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2015 states. [2024-11-07 18:44:42,940 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2015 to 1423. [2024-11-07 18:44:42,942 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1423 states, 937 states have (on average 1.961579509071505) internal successors, (1838), 1403 states have internal predecessors, (1838), 19 states have call successors, (19), 5 states have call predecessors, (19), 4 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2024-11-07 18:44:42,946 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1423 states to 1423 states and 1872 transitions. [2024-11-07 18:44:42,946 INFO L78 Accepts]: Start accepts. Automaton has 1423 states and 1872 transitions. Word has length 9 [2024-11-07 18:44:42,946 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 18:44:42,946 INFO L471 AbstractCegarLoop]: Abstraction has 1423 states and 1872 transitions. [2024-11-07 18:44:42,947 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), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 18:44:42,947 INFO L276 IsEmpty]: Start isEmpty. Operand 1423 states and 1872 transitions. [2024-11-07 18:44:42,947 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2024-11-07 18:44:42,947 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 18:44:42,947 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 18:44:42,960 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 18:44:43,148 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 18:44:43,148 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, alt_mallocErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alt_mallocErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 519 more)] === [2024-11-07 18:44:43,149 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 18:44:43,149 INFO L85 PathProgramCache]: Analyzing trace with hash -1873150295, now seen corresponding path program 1 times [2024-11-07 18:44:43,149 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-07 18:44:43,149 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [72005229] [2024-11-07 18:44:43,149 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 18:44:43,149 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 18:44:43,149 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-07 18:44:43,151 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 18:44:43,152 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 18:44:43,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 18:44:43,279 INFO L255 TraceCheckSpWp]: Trace formula consists of 116 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-07 18:44:43,280 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 18:44:43,289 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 18:44:43,319 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 18:44:43,320 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-07 18:44:43,320 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-07 18:44:43,320 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [72005229] [2024-11-07 18:44:43,320 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [72005229] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 18:44:43,320 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 18:44:43,321 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-07 18:44:43,321 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [675759561] [2024-11-07 18:44:43,321 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 18:44:43,321 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-07 18:44:43,321 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-07 18:44:43,322 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-07 18:44:43,322 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-07 18:44:43,322 INFO L87 Difference]: Start difference. First operand 1423 states and 1872 transitions. Second operand has 4 states, 3 states have (on average 3.0) internal successors, (9), 4 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 18:44:45,535 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 18:44:45,535 INFO L93 Difference]: Finished difference Result 2079 states and 2728 transitions. [2024-11-07 18:44:45,536 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-07 18:44:45,536 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), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2024-11-07 18:44:45,536 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 18:44:45,541 INFO L225 Difference]: With dead ends: 2079 [2024-11-07 18:44:45,541 INFO L226 Difference]: Without dead ends: 2079 [2024-11-07 18:44:45,541 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-07 18:44:45,541 INFO L432 NwaCegarLoop]: 1191 mSDtfsCounter, 704 mSDsluCounter, 1257 mSDsCounter, 0 mSdLazyCounter, 1463 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 706 SdHoareTripleChecker+Valid, 2448 SdHoareTripleChecker+Invalid, 1477 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 1463 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2024-11-07 18:44:45,542 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [706 Valid, 2448 Invalid, 1477 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 1463 Invalid, 0 Unknown, 0 Unchecked, 2.2s Time] [2024-11-07 18:44:45,544 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2079 states. [2024-11-07 18:44:45,561 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2079 to 1415. [2024-11-07 18:44:45,563 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1415 states, 939 states have (on average 1.933972310969116) internal successors, (1816), 1395 states have internal predecessors, (1816), 19 states have call successors, (19), 5 states have call predecessors, (19), 4 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2024-11-07 18:44:45,568 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1415 states to 1415 states and 1850 transitions. [2024-11-07 18:44:45,568 INFO L78 Accepts]: Start accepts. Automaton has 1415 states and 1850 transitions. Word has length 9 [2024-11-07 18:44:45,568 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 18:44:45,568 INFO L471 AbstractCegarLoop]: Abstraction has 1415 states and 1850 transitions. [2024-11-07 18:44:45,568 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), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 18:44:45,568 INFO L276 IsEmpty]: Start isEmpty. Operand 1415 states and 1850 transitions. [2024-11-07 18:44:45,569 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2024-11-07 18:44:45,569 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 18:44:45,569 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 18:44:45,573 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Ended with exit code 0 [2024-11-07 18:44:45,769 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-07 18:44:45,770 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, alt_mallocErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alt_mallocErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 519 more)] === [2024-11-07 18:44:45,770 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 18:44:45,770 INFO L85 PathProgramCache]: Analyzing trace with hash -325578228, now seen corresponding path program 1 times [2024-11-07 18:44:45,771 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-07 18:44:45,771 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1148736184] [2024-11-07 18:44:45,771 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 18:44:45,771 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 18:44:45,771 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-07 18:44:45,773 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-07 18:44:45,774 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2024-11-07 18:44:45,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 18:44:45,898 INFO L255 TraceCheckSpWp]: Trace formula consists of 133 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-07 18:44:45,900 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 18:44:45,950 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 18:44:45,950 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-07 18:44:45,950 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-07 18:44:45,950 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1148736184] [2024-11-07 18:44:45,950 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1148736184] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 18:44:45,950 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 18:44:45,951 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-07 18:44:45,951 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1783384537] [2024-11-07 18:44:45,951 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 18:44:45,951 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-07 18:44:45,951 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-07 18:44:45,951 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-07 18:44:45,951 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-07 18:44:45,951 INFO L87 Difference]: Start difference. First operand 1415 states and 1850 transitions. Second operand has 4 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 18:44:46,411 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 18:44:46,411 INFO L93 Difference]: Finished difference Result 1863 states and 2408 transitions. [2024-11-07 18:44:46,412 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-07 18:44:46,412 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2024-11-07 18:44:46,412 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 18:44:46,417 INFO L225 Difference]: With dead ends: 1863 [2024-11-07 18:44:46,417 INFO L226 Difference]: Without dead ends: 1863 [2024-11-07 18:44:46,418 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-07 18:44:46,418 INFO L432 NwaCegarLoop]: 1155 mSDtfsCounter, 455 mSDsluCounter, 2040 mSDsCounter, 0 mSdLazyCounter, 265 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 456 SdHoareTripleChecker+Valid, 3195 SdHoareTripleChecker+Invalid, 269 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 265 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-07 18:44:46,418 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [456 Valid, 3195 Invalid, 269 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 265 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-07 18:44:46,420 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1863 states. [2024-11-07 18:44:46,441 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1863 to 1671. [2024-11-07 18:44:46,443 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1671 states, 1195 states have (on average 1.9489539748953975) internal successors, (2329), 1651 states have internal predecessors, (2329), 19 states have call successors, (19), 5 states have call predecessors, (19), 4 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2024-11-07 18:44:46,449 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1671 states to 1671 states and 2363 transitions. [2024-11-07 18:44:46,450 INFO L78 Accepts]: Start accepts. Automaton has 1671 states and 2363 transitions. Word has length 13 [2024-11-07 18:44:46,450 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 18:44:46,450 INFO L471 AbstractCegarLoop]: Abstraction has 1671 states and 2363 transitions. [2024-11-07 18:44:46,450 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 18:44:46,450 INFO L276 IsEmpty]: Start isEmpty. Operand 1671 states and 2363 transitions. [2024-11-07 18:44:46,451 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2024-11-07 18:44:46,452 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 18:44:46,452 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 18:44:46,456 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Ended with exit code 0 [2024-11-07 18:44:46,652 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-07 18:44:46,653 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr322REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, alt_mallocErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alt_mallocErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 519 more)] === [2024-11-07 18:44:46,653 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 18:44:46,653 INFO L85 PathProgramCache]: Analyzing trace with hash -922136276, now seen corresponding path program 1 times [2024-11-07 18:44:46,654 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-07 18:44:46,654 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1868073557] [2024-11-07 18:44:46,654 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 18:44:46,654 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 18:44:46,654 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-07 18:44:46,656 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 18:44:46,658 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 18:44:46,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 18:44:46,806 INFO L255 TraceCheckSpWp]: Trace formula consists of 135 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-07 18:44:46,808 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 18:44:46,822 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 18:44:46,823 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-07 18:44:46,823 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-07 18:44:46,823 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1868073557] [2024-11-07 18:44:46,823 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1868073557] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 18:44:46,823 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 18:44:46,823 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-07 18:44:46,823 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [269714153] [2024-11-07 18:44:46,823 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 18:44:46,823 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-07 18:44:46,823 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-07 18:44:46,823 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-07 18:44:46,824 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-07 18:44:46,824 INFO L87 Difference]: Start difference. First operand 1671 states and 2363 transitions. Second operand has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 18:44:46,854 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 18:44:46,855 INFO L93 Difference]: Finished difference Result 1575 states and 2191 transitions. [2024-11-07 18:44:46,855 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-07 18:44:46,856 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2024-11-07 18:44:46,856 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 18:44:46,862 INFO L225 Difference]: With dead ends: 1575 [2024-11-07 18:44:46,863 INFO L226 Difference]: Without dead ends: 1575 [2024-11-07 18:44:46,863 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-07 18:44:46,864 INFO L432 NwaCegarLoop]: 1017 mSDtfsCounter, 71 mSDsluCounter, 954 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 71 SdHoareTripleChecker+Valid, 1971 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-07 18:44:46,864 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [71 Valid, 1971 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 18:44:46,866 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1575 states. [2024-11-07 18:44:46,887 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1575 to 1575. [2024-11-07 18:44:46,889 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1575 states, 1123 states have (on average 1.9207479964381122) internal successors, (2157), 1555 states have internal predecessors, (2157), 19 states have call successors, (19), 5 states have call predecessors, (19), 4 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2024-11-07 18:44:46,894 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1575 states to 1575 states and 2191 transitions. [2024-11-07 18:44:46,894 INFO L78 Accepts]: Start accepts. Automaton has 1575 states and 2191 transitions. Word has length 13 [2024-11-07 18:44:46,894 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 18:44:46,894 INFO L471 AbstractCegarLoop]: Abstraction has 1575 states and 2191 transitions. [2024-11-07 18:44:46,894 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 18:44:46,894 INFO L276 IsEmpty]: Start isEmpty. Operand 1575 states and 2191 transitions. [2024-11-07 18:44:46,895 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2024-11-07 18:44:46,896 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 18:44:46,896 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 18:44:46,900 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Ended with exit code 0 [2024-11-07 18:44:47,099 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 18:44:47,099 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, alt_mallocErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alt_mallocErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 519 more)] === [2024-11-07 18:44:47,100 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 18:44:47,100 INFO L85 PathProgramCache]: Analyzing trace with hash -1373575884, now seen corresponding path program 1 times [2024-11-07 18:44:47,100 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-07 18:44:47,100 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1902362825] [2024-11-07 18:44:47,100 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 18:44:47,100 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 18:44:47,100 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-07 18:44:47,102 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 18:44:47,103 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 18:44:47,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 18:44:47,290 INFO L255 TraceCheckSpWp]: Trace formula consists of 139 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-07 18:44:47,292 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 18:44:47,297 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-07 18:44:47,297 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-07 18:44:47,298 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-07 18:44:47,301 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 39 [2024-11-07 18:44:47,359 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-07 18:44:47,359 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 70 treesize of output 26 [2024-11-07 18:44:47,370 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 18:44:47,370 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-07 18:44:47,370 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-07 18:44:47,370 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1902362825] [2024-11-07 18:44:47,371 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1902362825] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 18:44:47,371 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 18:44:47,371 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-07 18:44:47,371 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1487583599] [2024-11-07 18:44:47,371 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 18:44:47,371 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-07 18:44:47,371 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-07 18:44:47,372 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-07 18:44:47,372 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-07 18:44:47,372 INFO L87 Difference]: Start difference. First operand 1575 states and 2191 transitions. Second operand has 4 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 18:44:47,730 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 18:44:47,732 INFO L93 Difference]: Finished difference Result 2100 states and 2505 transitions. [2024-11-07 18:44:47,733 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-07 18:44:47,733 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2024-11-07 18:44:47,733 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 18:44:47,737 INFO L225 Difference]: With dead ends: 2100 [2024-11-07 18:44:47,737 INFO L226 Difference]: Without dead ends: 2100 [2024-11-07 18:44:47,738 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-07 18:44:47,738 INFO L432 NwaCegarLoop]: 1004 mSDtfsCounter, 899 mSDsluCounter, 1981 mSDsCounter, 0 mSdLazyCounter, 115 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 911 SdHoareTripleChecker+Valid, 2985 SdHoareTripleChecker+Invalid, 116 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 115 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-07 18:44:47,738 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [911 Valid, 2985 Invalid, 116 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 115 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-07 18:44:47,740 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2100 states. [2024-11-07 18:44:47,754 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2100 to 1240. [2024-11-07 18:44:47,756 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1240 states, 790 states have (on average 1.9037974683544303) internal successors, (1504), 1222 states have internal predecessors, (1504), 17 states have call successors, (17), 5 states have call predecessors, (17), 4 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2024-11-07 18:44:47,759 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1240 states to 1240 states and 1534 transitions. [2024-11-07 18:44:47,759 INFO L78 Accepts]: Start accepts. Automaton has 1240 states and 1534 transitions. Word has length 16 [2024-11-07 18:44:47,760 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 18:44:47,760 INFO L471 AbstractCegarLoop]: Abstraction has 1240 states and 1534 transitions. [2024-11-07 18:44:47,760 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 18:44:47,760 INFO L276 IsEmpty]: Start isEmpty. Operand 1240 states and 1534 transitions. [2024-11-07 18:44:47,760 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2024-11-07 18:44:47,760 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 18:44:47,760 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 18:44:47,766 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 18:44:47,961 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 18:44:47,961 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, alt_mallocErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alt_mallocErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 519 more)] === [2024-11-07 18:44:47,961 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 18:44:47,962 INFO L85 PathProgramCache]: Analyzing trace with hash -1057218028, now seen corresponding path program 1 times [2024-11-07 18:44:47,962 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-07 18:44:47,962 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1637858164] [2024-11-07 18:44:47,962 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 18:44:47,962 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 18:44:47,962 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-07 18:44:47,964 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 18:44:47,967 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 18:44:48,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 18:44:48,135 INFO L255 TraceCheckSpWp]: Trace formula consists of 181 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-07 18:44:48,136 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 18:44:48,143 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 18:44:48,143 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-07 18:44:48,143 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-07 18:44:48,143 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1637858164] [2024-11-07 18:44:48,143 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1637858164] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 18:44:48,143 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 18:44:48,143 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-07 18:44:48,143 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [477017060] [2024-11-07 18:44:48,143 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 18:44:48,144 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-07 18:44:48,144 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-07 18:44:48,144 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-07 18:44:48,144 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-07 18:44:48,144 INFO L87 Difference]: Start difference. First operand 1240 states and 1534 transitions. Second operand has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 18:44:48,165 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 18:44:48,165 INFO L93 Difference]: Finished difference Result 1180 states and 1448 transitions. [2024-11-07 18:44:48,165 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-07 18:44:48,165 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2024-11-07 18:44:48,165 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 18:44:48,168 INFO L225 Difference]: With dead ends: 1180 [2024-11-07 18:44:48,168 INFO L226 Difference]: Without dead ends: 1180 [2024-11-07 18:44:48,168 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-07 18:44:48,168 INFO L432 NwaCegarLoop]: 974 mSDtfsCounter, 71 mSDsluCounter, 911 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 71 SdHoareTripleChecker+Valid, 1885 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-07 18:44:48,168 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [71 Valid, 1885 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 18:44:48,170 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1180 states. [2024-11-07 18:44:48,180 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1180 to 1180. [2024-11-07 18:44:48,181 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1180 states, 754 states have (on average 1.8806366047745358) internal successors, (1418), 1162 states have internal predecessors, (1418), 17 states have call successors, (17), 5 states have call predecessors, (17), 4 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2024-11-07 18:44:48,184 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1180 states to 1180 states and 1448 transitions. [2024-11-07 18:44:48,184 INFO L78 Accepts]: Start accepts. Automaton has 1180 states and 1448 transitions. Word has length 19 [2024-11-07 18:44:48,184 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 18:44:48,184 INFO L471 AbstractCegarLoop]: Abstraction has 1180 states and 1448 transitions. [2024-11-07 18:44:48,184 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 18:44:48,184 INFO L276 IsEmpty]: Start isEmpty. Operand 1180 states and 1448 transitions. [2024-11-07 18:44:48,184 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2024-11-07 18:44:48,184 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 18:44:48,185 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 18:44:48,191 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 (10)] Forceful destruction successful, exit code 0 [2024-11-07 18:44:48,385 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-07 18:44:48,386 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr38REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, alt_mallocErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alt_mallocErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 519 more)] === [2024-11-07 18:44:48,386 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 18:44:48,386 INFO L85 PathProgramCache]: Analyzing trace with hash 1920722190, now seen corresponding path program 1 times [2024-11-07 18:44:48,386 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-07 18:44:48,386 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1190018121] [2024-11-07 18:44:48,386 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 18:44:48,386 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 18:44:48,386 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-07 18:44:48,388 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-07 18:44:48,389 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Waiting until timeout for monitored process [2024-11-07 18:44:48,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 18:44:48,561 INFO L255 TraceCheckSpWp]: Trace formula consists of 184 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-07 18:44:48,562 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 18:44:48,579 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 18:44:48,579 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-07 18:44:48,579 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-07 18:44:48,579 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1190018121] [2024-11-07 18:44:48,579 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1190018121] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 18:44:48,579 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 18:44:48,579 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-07 18:44:48,580 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1051561961] [2024-11-07 18:44:48,580 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 18:44:48,580 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-07 18:44:48,580 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-07 18:44:48,580 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-07 18:44:48,580 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-07 18:44:48,580 INFO L87 Difference]: Start difference. First operand 1180 states and 1448 transitions. Second operand has 4 states, 4 states have (on average 5.25) internal successors, (21), 4 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 18:44:48,654 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 18:44:48,655 INFO L93 Difference]: Finished difference Result 1150 states and 1390 transitions. [2024-11-07 18:44:48,655 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-07 18:44:48,655 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.25) internal successors, (21), 4 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 21 [2024-11-07 18:44:48,655 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 18:44:48,659 INFO L225 Difference]: With dead ends: 1150 [2024-11-07 18:44:48,659 INFO L226 Difference]: Without dead ends: 1150 [2024-11-07 18:44:48,660 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-07 18:44:48,660 INFO L432 NwaCegarLoop]: 929 mSDtfsCounter, 48 mSDsluCounter, 1832 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 48 SdHoareTripleChecker+Valid, 2761 SdHoareTripleChecker+Invalid, 59 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-07 18:44:48,660 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [48 Valid, 2761 Invalid, 59 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-07 18:44:48,662 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1150 states. [2024-11-07 18:44:48,671 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1150 to 1150. [2024-11-07 18:44:48,672 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1150 states, 738 states have (on average 1.8428184281842819) internal successors, (1360), 1132 states have internal predecessors, (1360), 17 states have call successors, (17), 5 states have call predecessors, (17), 4 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2024-11-07 18:44:48,677 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1150 states to 1150 states and 1390 transitions. [2024-11-07 18:44:48,677 INFO L78 Accepts]: Start accepts. Automaton has 1150 states and 1390 transitions. Word has length 21 [2024-11-07 18:44:48,677 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 18:44:48,677 INFO L471 AbstractCegarLoop]: Abstraction has 1150 states and 1390 transitions. [2024-11-07 18:44:48,677 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.25) internal successors, (21), 4 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 18:44:48,678 INFO L276 IsEmpty]: Start isEmpty. Operand 1150 states and 1390 transitions. [2024-11-07 18:44:48,678 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2024-11-07 18:44:48,678 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 18:44:48,678 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 18:44:48,686 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Forceful destruction successful, exit code 0 [2024-11-07 18:44:48,878 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-07 18:44:48,879 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr53REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, alt_mallocErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alt_mallocErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 519 more)] === [2024-11-07 18:44:48,879 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 18:44:48,879 INFO L85 PathProgramCache]: Analyzing trace with hash -956254243, now seen corresponding path program 1 times [2024-11-07 18:44:48,879 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-07 18:44:48,880 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1399961568] [2024-11-07 18:44:48,880 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 18:44:48,880 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 18:44:48,880 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-07 18:44:48,881 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 18:44:48,882 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 18:44:49,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 18:44:49,041 INFO L255 TraceCheckSpWp]: Trace formula consists of 198 conjuncts, 10 conjuncts are in the unsatisfiable core [2024-11-07 18:44:49,043 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 18:44:49,051 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 18:44:49,221 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 18:44:49,222 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-07 18:44:49,222 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-07 18:44:49,222 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1399961568] [2024-11-07 18:44:49,222 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1399961568] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 18:44:49,222 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 18:44:49,222 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-07 18:44:49,222 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1621012598] [2024-11-07 18:44:49,223 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 18:44:49,223 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-07 18:44:49,223 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-07 18:44:49,223 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-07 18:44:49,223 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-07 18:44:49,224 INFO L87 Difference]: Start difference. First operand 1150 states and 1390 transitions. Second operand has 5 states, 4 states have (on average 8.75) internal successors, (35), 5 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 18:44:51,618 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 18:44:51,618 INFO L93 Difference]: Finished difference Result 1703 states and 2070 transitions. [2024-11-07 18:44:51,618 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-07 18:44:51,619 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 8.75) internal successors, (35), 5 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 35 [2024-11-07 18:44:51,619 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 18:44:51,622 INFO L225 Difference]: With dead ends: 1703 [2024-11-07 18:44:51,622 INFO L226 Difference]: Without dead ends: 1703 [2024-11-07 18:44:51,623 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-11-07 18:44:51,623 INFO L432 NwaCegarLoop]: 1175 mSDtfsCounter, 594 mSDsluCounter, 1946 mSDsCounter, 0 mSdLazyCounter, 1993 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 596 SdHoareTripleChecker+Valid, 3121 SdHoareTripleChecker+Invalid, 1997 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 1993 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2024-11-07 18:44:51,623 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [596 Valid, 3121 Invalid, 1997 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 1993 Invalid, 0 Unknown, 0 Unchecked, 2.3s Time] [2024-11-07 18:44:51,624 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1703 states. [2024-11-07 18:44:51,634 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1703 to 1146. [2024-11-07 18:44:51,635 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1146 states, 738 states have (on average 1.8319783197831978) internal successors, (1352), 1128 states have internal predecessors, (1352), 17 states have call successors, (17), 5 states have call predecessors, (17), 4 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2024-11-07 18:44:51,637 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1146 states to 1146 states and 1382 transitions. [2024-11-07 18:44:51,638 INFO L78 Accepts]: Start accepts. Automaton has 1146 states and 1382 transitions. Word has length 35 [2024-11-07 18:44:51,638 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 18:44:51,638 INFO L471 AbstractCegarLoop]: Abstraction has 1146 states and 1382 transitions. [2024-11-07 18:44:51,638 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 8.75) internal successors, (35), 5 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 18:44:51,638 INFO L276 IsEmpty]: Start isEmpty. Operand 1146 states and 1382 transitions. [2024-11-07 18:44:51,639 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2024-11-07 18:44:51,639 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 18:44:51,639 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 18:44:51,645 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (12)] Ended with exit code 0 [2024-11-07 18:44:51,839 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-07 18:44:51,839 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr52REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, alt_mallocErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alt_mallocErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 519 more)] === [2024-11-07 18:44:51,840 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 18:44:51,840 INFO L85 PathProgramCache]: Analyzing trace with hash -956254244, now seen corresponding path program 1 times [2024-11-07 18:44:51,840 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-07 18:44:51,840 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1562602018] [2024-11-07 18:44:51,840 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 18:44:51,840 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 18:44:51,840 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-07 18:44:51,842 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-07 18:44:51,843 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (13)] Waiting until timeout for monitored process [2024-11-07 18:44:52,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 18:44:52,020 INFO L255 TraceCheckSpWp]: Trace formula consists of 198 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-07 18:44:52,023 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 18:44:52,033 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 18:44:52,098 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 18:44:52,098 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-07 18:44:52,098 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-07 18:44:52,098 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1562602018] [2024-11-07 18:44:52,098 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1562602018] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 18:44:52,098 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 18:44:52,098 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-07 18:44:52,098 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1044023887] [2024-11-07 18:44:52,098 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 18:44:52,099 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-07 18:44:52,099 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-07 18:44:52,099 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-07 18:44:52,099 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-07 18:44:52,099 INFO L87 Difference]: Start difference. First operand 1146 states and 1382 transitions. Second operand has 5 states, 4 states have (on average 8.75) internal successors, (35), 5 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 18:44:53,746 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 18:44:53,747 INFO L93 Difference]: Finished difference Result 1572 states and 1929 transitions. [2024-11-07 18:44:53,747 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-07 18:44:53,747 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 8.75) internal successors, (35), 5 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 35 [2024-11-07 18:44:53,747 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 18:44:53,752 INFO L225 Difference]: With dead ends: 1572 [2024-11-07 18:44:53,752 INFO L226 Difference]: Without dead ends: 1572 [2024-11-07 18:44:53,752 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-11-07 18:44:53,753 INFO L432 NwaCegarLoop]: 535 mSDtfsCounter, 810 mSDsluCounter, 1217 mSDsCounter, 0 mSdLazyCounter, 1557 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 813 SdHoareTripleChecker+Valid, 1752 SdHoareTripleChecker+Invalid, 1565 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 1557 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2024-11-07 18:44:53,753 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [813 Valid, 1752 Invalid, 1565 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 1557 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2024-11-07 18:44:53,754 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1572 states. [2024-11-07 18:44:53,763 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1572 to 1142. [2024-11-07 18:44:53,765 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1142 states, 738 states have (on average 1.8211382113821137) internal successors, (1344), 1124 states have internal predecessors, (1344), 17 states have call successors, (17), 5 states have call predecessors, (17), 4 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2024-11-07 18:44:53,767 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1142 states to 1142 states and 1374 transitions. [2024-11-07 18:44:53,767 INFO L78 Accepts]: Start accepts. Automaton has 1142 states and 1374 transitions. Word has length 35 [2024-11-07 18:44:53,767 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 18:44:53,767 INFO L471 AbstractCegarLoop]: Abstraction has 1142 states and 1374 transitions. [2024-11-07 18:44:53,767 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 8.75) internal successors, (35), 5 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 18:44:53,768 INFO L276 IsEmpty]: Start isEmpty. Operand 1142 states and 1374 transitions. [2024-11-07 18:44:53,768 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2024-11-07 18:44:53,768 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 18:44:53,769 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 18:44:53,774 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (13)] Ended with exit code 0 [2024-11-07 18:44:53,969 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-07 18:44:53,969 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting alt_mallocErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, alt_mallocErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alt_mallocErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 519 more)] === [2024-11-07 18:44:53,970 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 18:44:53,970 INFO L85 PathProgramCache]: Analyzing trace with hash 103689706, now seen corresponding path program 1 times [2024-11-07 18:44:53,970 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-07 18:44:53,970 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1746106242] [2024-11-07 18:44:53,970 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 18:44:53,970 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 18:44:53,970 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-07 18:44:53,974 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 18:44:53,976 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 18:44:54,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 18:44:54,254 INFO L255 TraceCheckSpWp]: Trace formula consists of 313 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-07 18:44:54,256 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 18:44:54,295 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 18:44:54,296 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-07 18:44:54,296 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-07 18:44:54,296 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1746106242] [2024-11-07 18:44:54,296 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1746106242] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 18:44:54,296 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 18:44:54,296 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-07 18:44:54,297 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1096709875] [2024-11-07 18:44:54,297 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 18:44:54,297 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-07 18:44:54,297 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-07 18:44:54,298 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-07 18:44:54,298 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-07 18:44:54,298 INFO L87 Difference]: Start difference. First operand 1142 states and 1374 transitions. Second operand has 4 states, 4 states have (on average 13.5) internal successors, (54), 4 states have internal predecessors, (54), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 18:44:54,351 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 18:44:54,351 INFO L93 Difference]: Finished difference Result 1130 states and 1354 transitions. [2024-11-07 18:44:54,352 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-07 18:44:54,352 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 13.5) internal successors, (54), 4 states have internal predecessors, (54), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 55 [2024-11-07 18:44:54,352 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 18:44:54,356 INFO L225 Difference]: With dead ends: 1130 [2024-11-07 18:44:54,356 INFO L226 Difference]: Without dead ends: 1130 [2024-11-07 18:44:54,357 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 52 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-07 18:44:54,357 INFO L432 NwaCegarLoop]: 923 mSDtfsCounter, 21 mSDsluCounter, 1815 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 2738 SdHoareTripleChecker+Invalid, 44 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-07 18:44:54,357 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 2738 Invalid, 44 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 18:44:54,359 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1130 states. [2024-11-07 18:44:54,368 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1130 to 1130. [2024-11-07 18:44:54,370 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1130 states, 726 states have (on average 1.8236914600550964) internal successors, (1324), 1112 states have internal predecessors, (1324), 17 states have call successors, (17), 5 states have call predecessors, (17), 4 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2024-11-07 18:44:54,372 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1130 states to 1130 states and 1354 transitions. [2024-11-07 18:44:54,373 INFO L78 Accepts]: Start accepts. Automaton has 1130 states and 1354 transitions. Word has length 55 [2024-11-07 18:44:54,373 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 18:44:54,373 INFO L471 AbstractCegarLoop]: Abstraction has 1130 states and 1354 transitions. [2024-11-07 18:44:54,373 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.5) internal successors, (54), 4 states have internal predecessors, (54), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 18:44:54,373 INFO L276 IsEmpty]: Start isEmpty. Operand 1130 states and 1354 transitions. [2024-11-07 18:44:54,374 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2024-11-07 18:44:54,374 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 18:44:54,374 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 18:44:54,383 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 18:44:54,579 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-07 18:44:54,580 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting alt_mallocErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, alt_mallocErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alt_mallocErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 519 more)] === [2024-11-07 18:44:54,580 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 18:44:54,580 INFO L85 PathProgramCache]: Analyzing trace with hash -636164170, now seen corresponding path program 1 times [2024-11-07 18:44:54,580 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-07 18:44:54,580 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1661430006] [2024-11-07 18:44:54,581 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 18:44:54,581 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 18:44:54,581 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-07 18:44:54,583 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-07 18:44:54,583 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (15)] Waiting until timeout for monitored process [2024-11-07 18:44:54,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 18:44:54,919 INFO L255 TraceCheckSpWp]: Trace formula consists of 337 conjuncts, 10 conjuncts are in the unsatisfiable core [2024-11-07 18:44:54,922 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 18:44:54,950 INFO L349 Elim1Store]: treesize reduction 15, result has 42.3 percent of original size [2024-11-07 18:44:54,951 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 16 treesize of output 17 [2024-11-07 18:44:55,031 INFO L349 Elim1Store]: treesize reduction 13, result has 45.8 percent of original size [2024-11-07 18:44:55,031 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 28 [2024-11-07 18:44:55,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 18:44:55,389 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-07 18:44:55,389 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-07 18:44:55,389 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1661430006] [2024-11-07 18:44:55,389 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1661430006] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 18:44:55,389 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 18:44:55,389 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-07 18:44:55,389 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2012396546] [2024-11-07 18:44:55,389 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 18:44:55,389 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-07 18:44:55,389 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-07 18:44:55,390 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-07 18:44:55,390 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2024-11-07 18:44:55,390 INFO L87 Difference]: Start difference. First operand 1130 states and 1354 transitions. Second operand has 6 states, 5 states have (on average 12.4) internal successors, (62), 5 states have internal predecessors, (62), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 18:44:57,352 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 18:44:57,352 INFO L93 Difference]: Finished difference Result 2053 states and 2462 transitions. [2024-11-07 18:44:57,352 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-07 18:44:57,353 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 12.4) internal successors, (62), 5 states have internal predecessors, (62), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 63 [2024-11-07 18:44:57,353 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 18:44:57,358 INFO L225 Difference]: With dead ends: 2053 [2024-11-07 18:44:57,358 INFO L226 Difference]: Without dead ends: 2053 [2024-11-07 18:44:57,359 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 57 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=20, Invalid=22, Unknown=0, NotChecked=0, Total=42 [2024-11-07 18:44:57,359 INFO L432 NwaCegarLoop]: 582 mSDtfsCounter, 793 mSDsluCounter, 1556 mSDsCounter, 0 mSdLazyCounter, 1626 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 793 SdHoareTripleChecker+Valid, 2138 SdHoareTripleChecker+Invalid, 1630 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 1626 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2024-11-07 18:44:57,359 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [793 Valid, 2138 Invalid, 1630 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 1626 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2024-11-07 18:44:57,361 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2053 states. [2024-11-07 18:44:57,374 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2053 to 1561. [2024-11-07 18:44:57,376 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1561 states, 1142 states have (on average 1.816987740805604) internal successors, (2075), 1531 states have internal predecessors, (2075), 29 states have call successors, (29), 9 states have call predecessors, (29), 7 states have return successors, (25), 22 states have call predecessors, (25), 25 states have call successors, (25) [2024-11-07 18:44:57,378 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1561 states to 1561 states and 2129 transitions. [2024-11-07 18:44:57,378 INFO L78 Accepts]: Start accepts. Automaton has 1561 states and 2129 transitions. Word has length 63 [2024-11-07 18:44:57,379 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 18:44:57,379 INFO L471 AbstractCegarLoop]: Abstraction has 1561 states and 2129 transitions. [2024-11-07 18:44:57,379 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 12.4) internal successors, (62), 5 states have internal predecessors, (62), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 18:44:57,379 INFO L276 IsEmpty]: Start isEmpty. Operand 1561 states and 2129 transitions. [2024-11-07 18:44:57,379 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2024-11-07 18:44:57,380 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 18:44:57,380 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 18:44:57,390 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (15)] Ended with exit code 0 [2024-11-07 18:44:57,580 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-07 18:44:57,580 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting alt_mallocErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, alt_mallocErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alt_mallocErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 519 more)] === [2024-11-07 18:44:57,581 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 18:44:57,581 INFO L85 PathProgramCache]: Analyzing trace with hash -636164169, now seen corresponding path program 1 times [2024-11-07 18:44:57,581 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-07 18:44:57,581 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [646753611] [2024-11-07 18:44:57,581 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 18:44:57,581 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 18:44:57,581 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-07 18:44:57,583 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 18:44:57,584 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 18:44:57,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 18:44:57,909 INFO L255 TraceCheckSpWp]: Trace formula consists of 337 conjuncts, 18 conjuncts are in the unsatisfiable core [2024-11-07 18:44:57,912 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 18:44:57,950 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-07 18:44:57,951 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 18:44:58,016 INFO L349 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2024-11-07 18:44:58,017 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 14 [2024-11-07 18:44:58,545 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 18:44:58,546 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-07 18:44:58,546 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-07 18:44:58,546 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [646753611] [2024-11-07 18:44:58,546 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [646753611] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 18:44:58,546 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 18:44:58,546 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-07 18:44:58,546 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1008842361] [2024-11-07 18:44:58,546 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 18:44:58,547 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-07 18:44:58,547 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-07 18:44:58,547 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-07 18:44:58,547 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-07 18:44:58,548 INFO L87 Difference]: Start difference. First operand 1561 states and 2129 transitions. Second operand has 6 states, 5 states have (on average 12.4) internal successors, (62), 5 states have internal predecessors, (62), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 18:45:00,107 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 18:45:00,108 INFO L93 Difference]: Finished difference Result 1566 states and 2135 transitions. [2024-11-07 18:45:00,109 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-07 18:45:00,109 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 12.4) internal successors, (62), 5 states have internal predecessors, (62), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 63 [2024-11-07 18:45:00,109 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 18:45:00,118 INFO L225 Difference]: With dead ends: 1566 [2024-11-07 18:45:00,118 INFO L226 Difference]: Without dead ends: 1566 [2024-11-07 18:45:00,118 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 57 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2024-11-07 18:45:00,119 INFO L432 NwaCegarLoop]: 918 mSDtfsCounter, 58 mSDsluCounter, 1029 mSDsCounter, 0 mSdLazyCounter, 927 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 58 SdHoareTripleChecker+Valid, 1947 SdHoareTripleChecker+Invalid, 929 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 927 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2024-11-07 18:45:00,119 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [58 Valid, 1947 Invalid, 929 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 927 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2024-11-07 18:45:00,120 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1566 states. [2024-11-07 18:45:00,134 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1566 to 1566. [2024-11-07 18:45:00,136 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1566 states, 1146 states have (on average 1.8141361256544504) internal successors, (2079), 1535 states have internal predecessors, (2079), 30 states have call successors, (30), 10 states have call predecessors, (30), 7 states have return successors, (26), 22 states have call predecessors, (26), 26 states have call successors, (26) [2024-11-07 18:45:00,139 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1566 states to 1566 states and 2135 transitions. [2024-11-07 18:45:00,139 INFO L78 Accepts]: Start accepts. Automaton has 1566 states and 2135 transitions. Word has length 63 [2024-11-07 18:45:00,139 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 18:45:00,139 INFO L471 AbstractCegarLoop]: Abstraction has 1566 states and 2135 transitions. [2024-11-07 18:45:00,139 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 12.4) internal successors, (62), 5 states have internal predecessors, (62), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 18:45:00,139 INFO L276 IsEmpty]: Start isEmpty. Operand 1566 states and 2135 transitions. [2024-11-07 18:45:00,140 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2024-11-07 18:45:00,140 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 18:45:00,140 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 18:45:00,151 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 18:45:00,341 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 18:45:00,341 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, alt_mallocErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alt_mallocErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 519 more)] === [2024-11-07 18:45:00,341 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 18:45:00,341 INFO L85 PathProgramCache]: Analyzing trace with hash 1657745720, now seen corresponding path program 1 times [2024-11-07 18:45:00,342 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-07 18:45:00,342 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2003498858] [2024-11-07 18:45:00,342 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 18:45:00,342 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 18:45:00,342 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-07 18:45:00,344 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 18:45:00,344 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 18:45:00,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 18:45:00,609 INFO L255 TraceCheckSpWp]: Trace formula consists of 370 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-07 18:45:00,611 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 18:45:00,651 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 18:45:00,652 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-07 18:45:00,652 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-07 18:45:00,652 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2003498858] [2024-11-07 18:45:00,652 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2003498858] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 18:45:00,652 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 18:45:00,652 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-07 18:45:00,652 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [364309295] [2024-11-07 18:45:00,652 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 18:45:00,653 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-07 18:45:00,653 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-07 18:45:00,653 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-07 18:45:00,653 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-07 18:45:00,653 INFO L87 Difference]: Start difference. First operand 1566 states and 2135 transitions. Second operand has 6 states, 6 states have (on average 11.333333333333334) internal successors, (68), 4 states have internal predecessors, (68), 3 states have call successors, (3), 3 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 18:45:00,723 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 18:45:00,723 INFO L93 Difference]: Finished difference Result 1592 states and 2162 transitions. [2024-11-07 18:45:00,724 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-07 18:45:00,725 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 11.333333333333334) internal successors, (68), 4 states have internal predecessors, (68), 3 states have call successors, (3), 3 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 71 [2024-11-07 18:45:00,725 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 18:45:00,733 INFO L225 Difference]: With dead ends: 1592 [2024-11-07 18:45:00,734 INFO L226 Difference]: Without dead ends: 1592 [2024-11-07 18:45:00,735 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 66 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2024-11-07 18:45:00,735 INFO L432 NwaCegarLoop]: 933 mSDtfsCounter, 15 mSDsluCounter, 3727 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 4660 SdHoareTripleChecker+Invalid, 39 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 37 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-07 18:45:00,736 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 4660 Invalid, 39 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 18:45:00,737 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1592 states. [2024-11-07 18:45:00,763 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1592 to 1590. [2024-11-07 18:45:00,765 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1590 states, 1164 states have (on average 1.8058419243986255) internal successors, (2102), 1555 states have internal predecessors, (2102), 32 states have call successors, (32), 14 states have call predecessors, (32), 11 states have return successors, (28), 24 states have call predecessors, (28), 28 states have call successors, (28) [2024-11-07 18:45:00,767 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1590 states to 1590 states and 2162 transitions. [2024-11-07 18:45:00,768 INFO L78 Accepts]: Start accepts. Automaton has 1590 states and 2162 transitions. Word has length 71 [2024-11-07 18:45:00,768 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 18:45:00,768 INFO L471 AbstractCegarLoop]: Abstraction has 1590 states and 2162 transitions. [2024-11-07 18:45:00,768 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.333333333333334) internal successors, (68), 4 states have internal predecessors, (68), 3 states have call successors, (3), 3 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 18:45:00,768 INFO L276 IsEmpty]: Start isEmpty. Operand 1590 states and 2162 transitions. [2024-11-07 18:45:00,769 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2024-11-07 18:45:00,769 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 18:45:00,769 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 18:45:00,778 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 18:45:00,969 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 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 18:45:00,970 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr70REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, alt_mallocErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alt_mallocErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 519 more)] === [2024-11-07 18:45:00,970 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 18:45:00,970 INFO L85 PathProgramCache]: Analyzing trace with hash 949549232, now seen corresponding path program 1 times [2024-11-07 18:45:00,971 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-07 18:45:00,971 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1686663577] [2024-11-07 18:45:00,971 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 18:45:00,971 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 18:45:00,971 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-07 18:45:00,973 INFO L229 MonitoredProcess]: Starting monitored process 18 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 18:45:00,973 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 (18)] Waiting until timeout for monitored process [2024-11-07 18:45:01,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 18:45:01,213 INFO L255 TraceCheckSpWp]: Trace formula consists of 372 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-07 18:45:01,215 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 18:45:01,305 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 18:45:01,305 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-07 18:45:01,305 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-07 18:45:01,305 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1686663577] [2024-11-07 18:45:01,305 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1686663577] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 18:45:01,305 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 18:45:01,305 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-07 18:45:01,306 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [274679042] [2024-11-07 18:45:01,306 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 18:45:01,306 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-07 18:45:01,306 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-07 18:45:01,307 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-07 18:45:01,307 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-07 18:45:01,307 INFO L87 Difference]: Start difference. First operand 1590 states and 2162 transitions. Second operand has 6 states, 6 states have (on average 11.166666666666666) internal successors, (67), 4 states have internal predecessors, (67), 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 18:45:01,468 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 18:45:01,468 INFO L93 Difference]: Finished difference Result 1602 states and 2176 transitions. [2024-11-07 18:45:01,469 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-07 18:45:01,469 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 11.166666666666666) internal successors, (67), 4 states have internal predecessors, (67), 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 69 [2024-11-07 18:45:01,470 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 18:45:01,484 INFO L225 Difference]: With dead ends: 1602 [2024-11-07 18:45:01,486 INFO L226 Difference]: Without dead ends: 1602 [2024-11-07 18:45:01,486 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 64 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2024-11-07 18:45:01,486 INFO L432 NwaCegarLoop]: 917 mSDtfsCounter, 22 mSDsluCounter, 3574 mSDsCounter, 0 mSdLazyCounter, 163 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 4491 SdHoareTripleChecker+Invalid, 179 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 163 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-07 18:45:01,487 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [23 Valid, 4491 Invalid, 179 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 163 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-07 18:45:01,488 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1602 states. [2024-11-07 18:45:01,509 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1602 to 1593. [2024-11-07 18:45:01,510 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1593 states, 1166 states have (on average 1.804459691252144) internal successors, (2104), 1557 states have internal predecessors, (2104), 32 states have call successors, (32), 14 states have call predecessors, (32), 12 states have return successors, (29), 24 states have call predecessors, (29), 28 states have call successors, (29) [2024-11-07 18:45:01,528 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1593 states to 1593 states and 2165 transitions. [2024-11-07 18:45:01,528 INFO L78 Accepts]: Start accepts. Automaton has 1593 states and 2165 transitions. Word has length 69 [2024-11-07 18:45:01,528 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 18:45:01,528 INFO L471 AbstractCegarLoop]: Abstraction has 1593 states and 2165 transitions. [2024-11-07 18:45:01,528 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.166666666666666) internal successors, (67), 4 states have internal predecessors, (67), 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 18:45:01,528 INFO L276 IsEmpty]: Start isEmpty. Operand 1593 states and 2165 transitions. [2024-11-07 18:45:01,529 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2024-11-07 18:45:01,529 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 18:45:01,529 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 18:45:01,539 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 (18)] Ended with exit code 0 [2024-11-07 18:45:01,729 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -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 18:45:01,730 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr70REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, alt_mallocErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alt_mallocErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 519 more)] === [2024-11-07 18:45:01,730 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 18:45:01,730 INFO L85 PathProgramCache]: Analyzing trace with hash 1301141160, now seen corresponding path program 1 times [2024-11-07 18:45:01,730 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-07 18:45:01,730 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1659417204] [2024-11-07 18:45:01,731 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 18:45:01,731 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 18:45:01,731 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-07 18:45:01,732 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 18:45:01,733 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 18:45:02,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 18:45:02,131 INFO L255 TraceCheckSpWp]: Trace formula consists of 379 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-11-07 18:45:02,133 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 18:45:02,136 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 18:45:02,228 WARN L873 $PredicateComparison]: unable to prove that (exists ((|alt_malloc_#res.base| (_ BitVec 32))) (= (store |c_old(#valid)| |alt_malloc_#res.base| (_ bv1 1)) |c_#valid|)) is different from true [2024-11-07 18:45:02,249 INFO L349 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2024-11-07 18:45:02,250 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 20 [2024-11-07 18:45:02,258 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 18:45:02,258 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-07 18:45:02,258 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-07 18:45:02,258 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1659417204] [2024-11-07 18:45:02,258 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1659417204] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 18:45:02,258 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 18:45:02,258 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-07 18:45:02,258 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1800972332] [2024-11-07 18:45:02,258 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 18:45:02,258 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-07 18:45:02,258 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-07 18:45:02,259 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-07 18:45:02,259 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=14, Unknown=1, NotChecked=6, Total=30 [2024-11-07 18:45:02,259 INFO L87 Difference]: Start difference. First operand 1593 states and 2165 transitions. Second operand has 6 states, 5 states have (on average 14.0) internal successors, (70), 6 states have internal predecessors, (70), 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 18:45:04,373 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 18:45:04,373 INFO L93 Difference]: Finished difference Result 2014 states and 2710 transitions. [2024-11-07 18:45:04,374 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-07 18:45:04,374 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 14.0) internal successors, (70), 6 states have internal predecessors, (70), 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 74 [2024-11-07 18:45:04,374 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 18:45:04,379 INFO L225 Difference]: With dead ends: 2014 [2024-11-07 18:45:04,380 INFO L226 Difference]: Without dead ends: 2014 [2024-11-07 18:45:04,380 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 68 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=20, Unknown=1, NotChecked=8, Total=42 [2024-11-07 18:45:04,380 INFO L432 NwaCegarLoop]: 498 mSDtfsCounter, 771 mSDsluCounter, 1153 mSDsCounter, 0 mSdLazyCounter, 1609 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 774 SdHoareTripleChecker+Valid, 1651 SdHoareTripleChecker+Invalid, 2956 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 1609 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 1326 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2024-11-07 18:45:04,380 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [774 Valid, 1651 Invalid, 2956 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 1609 Invalid, 0 Unknown, 1326 Unchecked, 2.1s Time] [2024-11-07 18:45:04,382 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2014 states. [2024-11-07 18:45:04,400 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2014 to 1592. [2024-11-07 18:45:04,401 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1592 states, 1166 states have (on average 1.8027444253859348) internal successors, (2102), 1556 states have internal predecessors, (2102), 32 states have call successors, (32), 14 states have call predecessors, (32), 12 states have return successors, (29), 24 states have call predecessors, (29), 28 states have call successors, (29) [2024-11-07 18:45:04,405 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1592 states to 1592 states and 2163 transitions. [2024-11-07 18:45:04,405 INFO L78 Accepts]: Start accepts. Automaton has 1592 states and 2163 transitions. Word has length 74 [2024-11-07 18:45:04,405 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 18:45:04,405 INFO L471 AbstractCegarLoop]: Abstraction has 1592 states and 2163 transitions. [2024-11-07 18:45:04,405 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 14.0) internal successors, (70), 6 states have internal predecessors, (70), 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 18:45:04,405 INFO L276 IsEmpty]: Start isEmpty. Operand 1592 states and 2163 transitions. [2024-11-07 18:45:04,406 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2024-11-07 18:45:04,406 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 18:45:04,406 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 18:45:04,417 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (19)] Ended with exit code 0 [2024-11-07 18:45:04,606 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-07 18:45:04,607 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr71REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, alt_mallocErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alt_mallocErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 519 more)] === [2024-11-07 18:45:04,607 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 18:45:04,607 INFO L85 PathProgramCache]: Analyzing trace with hash 1301141161, now seen corresponding path program 1 times [2024-11-07 18:45:04,607 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-07 18:45:04,608 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1612981601] [2024-11-07 18:45:04,608 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 18:45:04,608 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 18:45:04,608 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-07 18:45:04,609 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-07 18:45:04,610 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (20)] Waiting until timeout for monitored process [2024-11-07 18:45:05,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 18:45:05,102 INFO L255 TraceCheckSpWp]: Trace formula consists of 379 conjuncts, 17 conjuncts are in the unsatisfiable core [2024-11-07 18:45:05,104 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 18:45:05,115 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 18:45:05,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 18:45:05,483 WARN L873 $PredicateComparison]: unable to prove that (exists ((|alt_malloc_#res.base| (_ BitVec 32))) (and (= (store |c_old(#length)| |alt_malloc_#res.base| (select |c_#length| |alt_malloc_#res.base|)) |c_#length|) (= (_ bv0 1) (select |c_old(#valid)| |alt_malloc_#res.base|)))) is different from true [2024-11-07 18:45:05,496 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-07 18:45:05,497 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 18:45:05,505 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2024-11-07 18:45:05,505 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 18:45:05,514 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 18:45:05,514 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-07 18:45:05,514 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-07 18:45:05,514 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1612981601] [2024-11-07 18:45:05,514 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1612981601] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 18:45:05,514 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 18:45:05,514 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-07 18:45:05,514 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [440412593] [2024-11-07 18:45:05,514 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 18:45:05,514 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-07 18:45:05,514 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-07 18:45:05,516 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-07 18:45:05,516 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=21, Unknown=1, NotChecked=8, Total=42 [2024-11-07 18:45:05,517 INFO L87 Difference]: Start difference. First operand 1592 states and 2163 transitions. Second operand has 7 states, 6 states have (on average 11.666666666666666) internal successors, (70), 6 states have internal predecessors, (70), 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 18:45:09,248 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 18:45:09,248 INFO L93 Difference]: Finished difference Result 2690 states and 3619 transitions. [2024-11-07 18:45:09,248 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-07 18:45:09,249 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 11.666666666666666) internal successors, (70), 6 states have internal predecessors, (70), 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 74 [2024-11-07 18:45:09,249 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 18:45:09,254 INFO L225 Difference]: With dead ends: 2690 [2024-11-07 18:45:09,254 INFO L226 Difference]: Without dead ends: 2690 [2024-11-07 18:45:09,254 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 68 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=28, Unknown=1, NotChecked=10, Total=56 [2024-11-07 18:45:09,254 INFO L432 NwaCegarLoop]: 995 mSDtfsCounter, 1477 mSDsluCounter, 1415 mSDsCounter, 0 mSdLazyCounter, 2964 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1480 SdHoareTripleChecker+Valid, 2410 SdHoareTripleChecker+Invalid, 4800 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 2964 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 1810 IncrementalHoareTripleChecker+Unchecked, 3.6s IncrementalHoareTripleChecker+Time [2024-11-07 18:45:09,254 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1480 Valid, 2410 Invalid, 4800 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 2964 Invalid, 0 Unknown, 1810 Unchecked, 3.6s Time] [2024-11-07 18:45:09,257 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2690 states. [2024-11-07 18:45:09,276 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2690 to 1584. [2024-11-07 18:45:09,278 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1584 states, 1166 states have (on average 1.7890222984562607) internal successors, (2086), 1548 states have internal predecessors, (2086), 32 states have call successors, (32), 14 states have call predecessors, (32), 12 states have return successors, (29), 24 states have call predecessors, (29), 28 states have call successors, (29) [2024-11-07 18:45:09,280 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1584 states to 1584 states and 2147 transitions. [2024-11-07 18:45:09,280 INFO L78 Accepts]: Start accepts. Automaton has 1584 states and 2147 transitions. Word has length 74 [2024-11-07 18:45:09,280 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 18:45:09,280 INFO L471 AbstractCegarLoop]: Abstraction has 1584 states and 2147 transitions. [2024-11-07 18:45:09,281 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 11.666666666666666) internal successors, (70), 6 states have internal predecessors, (70), 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 18:45:09,281 INFO L276 IsEmpty]: Start isEmpty. Operand 1584 states and 2147 transitions. [2024-11-07 18:45:09,281 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2024-11-07 18:45:09,281 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 18:45:09,281 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 18:45:09,295 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (20)] Ended with exit code 0 [2024-11-07 18:45:09,482 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 20 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-07 18:45:09,482 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting alt_bzeroErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, alt_mallocErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alt_mallocErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 519 more)] === [2024-11-07 18:45:09,482 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 18:45:09,483 INFO L85 PathProgramCache]: Analyzing trace with hash -2023437919, now seen corresponding path program 1 times [2024-11-07 18:45:09,483 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-07 18:45:09,483 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2017379124] [2024-11-07 18:45:09,483 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 18:45:09,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 18:45:09,483 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-07 18:45:09,485 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 18:45:09,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 (21)] Waiting until timeout for monitored process [2024-11-07 18:45:09,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 18:45:09,798 INFO L255 TraceCheckSpWp]: Trace formula consists of 425 conjuncts, 10 conjuncts are in the unsatisfiable core [2024-11-07 18:45:09,801 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 18:45:09,808 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 18:45:09,831 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2024-11-07 18:45:09,863 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2024-11-07 18:45:09,890 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 18:45:09,890 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-07 18:45:09,891 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-07 18:45:09,891 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2017379124] [2024-11-07 18:45:09,891 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2017379124] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 18:45:09,891 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 18:45:09,891 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-07 18:45:09,891 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1903796016] [2024-11-07 18:45:09,891 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 18:45:09,891 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-07 18:45:09,891 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-07 18:45:09,891 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-07 18:45:09,891 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-11-07 18:45:09,892 INFO L87 Difference]: Start difference. First operand 1584 states and 2147 transitions. Second operand has 8 states, 6 states have (on average 12.666666666666666) internal successors, (76), 6 states have internal predecessors, (76), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-07 18:45:12,266 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 18:45:12,266 INFO L93 Difference]: Finished difference Result 1599 states and 2163 transitions. [2024-11-07 18:45:12,267 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-07 18:45:12,267 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 6 states have (on average 12.666666666666666) internal successors, (76), 6 states have internal predecessors, (76), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 81 [2024-11-07 18:45:12,267 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 18:45:12,270 INFO L225 Difference]: With dead ends: 1599 [2024-11-07 18:45:12,270 INFO L226 Difference]: Without dead ends: 1599 [2024-11-07 18:45:12,270 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 74 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2024-11-07 18:45:12,271 INFO L432 NwaCegarLoop]: 920 mSDtfsCounter, 16 mSDsluCounter, 3080 mSDsCounter, 0 mSdLazyCounter, 2495 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 4000 SdHoareTripleChecker+Invalid, 2497 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 2495 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2024-11-07 18:45:12,271 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 4000 Invalid, 2497 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 2495 Invalid, 0 Unknown, 0 Unchecked, 2.3s Time] [2024-11-07 18:45:12,272 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1599 states. [2024-11-07 18:45:12,285 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1599 to 1598. [2024-11-07 18:45:12,291 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1598 states, 1178 states have (on average 1.7843803056027165) internal successors, (2102), 1560 states have internal predecessors, (2102), 32 states have call successors, (32), 16 states have call predecessors, (32), 14 states have return successors, (29), 24 states have call predecessors, (29), 28 states have call successors, (29) [2024-11-07 18:45:12,294 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1598 states to 1598 states and 2163 transitions. [2024-11-07 18:45:12,294 INFO L78 Accepts]: Start accepts. Automaton has 1598 states and 2163 transitions. Word has length 81 [2024-11-07 18:45:12,294 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 18:45:12,294 INFO L471 AbstractCegarLoop]: Abstraction has 1598 states and 2163 transitions. [2024-11-07 18:45:12,294 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 6 states have (on average 12.666666666666666) internal successors, (76), 6 states have internal predecessors, (76), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-07 18:45:12,294 INFO L276 IsEmpty]: Start isEmpty. Operand 1598 states and 2163 transitions. [2024-11-07 18:45:12,295 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2024-11-07 18:45:12,295 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 18:45:12,295 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 18:45:12,308 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 18:45:12,502 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-07 18:45:12,503 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting alt_bzeroErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, alt_mallocErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alt_mallocErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 519 more)] === [2024-11-07 18:45:12,503 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 18:45:12,503 INFO L85 PathProgramCache]: Analyzing trace with hash 1697934027, now seen corresponding path program 1 times [2024-11-07 18:45:12,503 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-07 18:45:12,503 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1816575267] [2024-11-07 18:45:12,504 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 18:45:12,504 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 18:45:12,504 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-07 18:45:12,505 INFO L229 MonitoredProcess]: Starting monitored process 22 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-07 18:45:12,507 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (22)] Waiting until timeout for monitored process [2024-11-07 18:45:12,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 18:45:12,832 INFO L255 TraceCheckSpWp]: Trace formula consists of 426 conjuncts, 24 conjuncts are in the unsatisfiable core [2024-11-07 18:45:12,835 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 18:45:12,850 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 18:45:12,878 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2024-11-07 18:45:12,881 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2024-11-07 18:45:12,909 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 9 [2024-11-07 18:45:12,962 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 18:45:12,962 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-07 18:45:12,962 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-07 18:45:12,962 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1816575267] [2024-11-07 18:45:12,962 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1816575267] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 18:45:12,962 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 18:45:12,962 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-07 18:45:12,962 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [727894702] [2024-11-07 18:45:12,962 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 18:45:12,963 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-07 18:45:12,963 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-07 18:45:12,963 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-07 18:45:12,963 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2024-11-07 18:45:12,963 INFO L87 Difference]: Start difference. First operand 1598 states and 2163 transitions. Second operand has 9 states, 7 states have (on average 11.0) internal successors, (77), 7 states have internal predecessors, (77), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-07 18:45:15,861 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 18:45:15,861 INFO L93 Difference]: Finished difference Result 1598 states and 2161 transitions. [2024-11-07 18:45:15,862 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-07 18:45:15,862 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 7 states have (on average 11.0) internal successors, (77), 7 states have internal predecessors, (77), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 82 [2024-11-07 18:45:15,862 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 18:45:15,864 INFO L225 Difference]: With dead ends: 1598 [2024-11-07 18:45:15,864 INFO L226 Difference]: Without dead ends: 1598 [2024-11-07 18:45:15,864 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 74 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2024-11-07 18:45:15,865 INFO L432 NwaCegarLoop]: 916 mSDtfsCounter, 13 mSDsluCounter, 3837 mSDsCounter, 0 mSdLazyCounter, 2668 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 4753 SdHoareTripleChecker+Invalid, 2669 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 2668 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.8s IncrementalHoareTripleChecker+Time [2024-11-07 18:45:15,865 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 4753 Invalid, 2669 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 2668 Invalid, 0 Unknown, 0 Unchecked, 2.8s Time] [2024-11-07 18:45:15,866 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1598 states. [2024-11-07 18:45:15,877 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1598 to 1598. [2024-11-07 18:45:15,879 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1598 states, 1178 states have (on average 1.7826825127334465) internal successors, (2100), 1560 states have internal predecessors, (2100), 32 states have call successors, (32), 16 states have call predecessors, (32), 14 states have return successors, (29), 24 states have call predecessors, (29), 28 states have call successors, (29) [2024-11-07 18:45:15,881 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1598 states to 1598 states and 2161 transitions. [2024-11-07 18:45:15,882 INFO L78 Accepts]: Start accepts. Automaton has 1598 states and 2161 transitions. Word has length 82 [2024-11-07 18:45:15,882 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 18:45:15,882 INFO L471 AbstractCegarLoop]: Abstraction has 1598 states and 2161 transitions. [2024-11-07 18:45:15,882 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 7 states have (on average 11.0) internal successors, (77), 7 states have internal predecessors, (77), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-07 18:45:15,882 INFO L276 IsEmpty]: Start isEmpty. Operand 1598 states and 2161 transitions. [2024-11-07 18:45:15,883 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2024-11-07 18:45:15,883 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 18:45:15,883 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 18:45:15,893 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 (22)] Forceful destruction successful, exit code 0 [2024-11-07 18:45:16,083 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 22 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-07 18:45:16,084 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr78REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, alt_mallocErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alt_mallocErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 519 more)] === [2024-11-07 18:45:16,084 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 18:45:16,084 INFO L85 PathProgramCache]: Analyzing trace with hash 1028513902, now seen corresponding path program 1 times [2024-11-07 18:45:16,085 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-07 18:45:16,085 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [237403794] [2024-11-07 18:45:16,085 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 18:45:16,085 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-07 18:45:16,085 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-07 18:45:16,087 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 18:45:16,088 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (23)] Waiting until timeout for monitored process [2024-11-07 18:45:16,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 18:45:16,400 INFO L255 TraceCheckSpWp]: Trace formula consists of 443 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-07 18:45:16,402 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 18:45:16,437 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 18:45:16,437 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-07 18:45:16,437 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-07 18:45:16,437 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [237403794] [2024-11-07 18:45:16,437 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [237403794] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 18:45:16,437 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 18:45:16,437 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-07 18:45:16,437 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1797101162] [2024-11-07 18:45:16,437 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 18:45:16,438 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-07 18:45:16,438 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-07 18:45:16,438 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-07 18:45:16,438 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-07 18:45:16,440 INFO L87 Difference]: Start difference. First operand 1598 states and 2161 transitions. Second operand has 5 states, 5 states have (on average 16.6) internal successors, (83), 5 states have internal predecessors, (83), 1 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-07 18:45:16,485 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 18:45:16,485 INFO L93 Difference]: Finished difference Result 1614 states and 2179 transitions. [2024-11-07 18:45:16,486 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-07 18:45:16,486 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 16.6) internal successors, (83), 5 states have internal predecessors, (83), 1 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) Word has length 89 [2024-11-07 18:45:16,486 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 18:45:16,489 INFO L225 Difference]: With dead ends: 1614 [2024-11-07 18:45:16,489 INFO L226 Difference]: Without dead ends: 1608 [2024-11-07 18:45:16,489 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 85 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-07 18:45:16,491 INFO L432 NwaCegarLoop]: 925 mSDtfsCounter, 3 mSDsluCounter, 2759 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 3684 SdHoareTripleChecker+Invalid, 31 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 30 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-07 18:45:16,491 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 3684 Invalid, 31 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 18:45:16,492 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1608 states. [2024-11-07 18:45:16,504 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1608 to 1608. [2024-11-07 18:45:16,505 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1608 states, 1186 states have (on average 1.779089376053963) internal successors, (2110), 1570 states have internal predecessors, (2110), 32 states have call successors, (32), 16 states have call predecessors, (32), 16 states have return successors, (31), 24 states have call predecessors, (31), 28 states have call successors, (31) [2024-11-07 18:45:16,507 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1608 states to 1608 states and 2173 transitions. [2024-11-07 18:45:16,507 INFO L78 Accepts]: Start accepts. Automaton has 1608 states and 2173 transitions. Word has length 89 [2024-11-07 18:45:16,507 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 18:45:16,507 INFO L471 AbstractCegarLoop]: Abstraction has 1608 states and 2173 transitions. [2024-11-07 18:45:16,508 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 16.6) internal successors, (83), 5 states have internal predecessors, (83), 1 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-07 18:45:16,508 INFO L276 IsEmpty]: Start isEmpty. Operand 1608 states and 2173 transitions. [2024-11-07 18:45:16,508 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2024-11-07 18:45:16,508 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 18:45:16,508 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 18:45:16,518 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 18:45:16,709 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 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 18:45:16,709 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr78REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, alt_mallocErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alt_mallocErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 519 more)] === [2024-11-07 18:45:16,710 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 18:45:16,710 INFO L85 PathProgramCache]: Analyzing trace with hash -659854572, now seen corresponding path program 1 times [2024-11-07 18:45:16,710 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-07 18:45:16,710 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [166346781] [2024-11-07 18:45:16,710 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 18:45:16,710 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 18:45:16,711 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-07 18:45:16,712 INFO L229 MonitoredProcess]: Starting monitored process 24 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-07 18:45:16,714 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (24)] Waiting until timeout for monitored process [2024-11-07 18:45:17,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 18:45:17,047 INFO L255 TraceCheckSpWp]: Trace formula consists of 454 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-07 18:45:17,050 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 18:45:17,097 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 18:45:17,097 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-07 18:45:17,198 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 18:45:17,198 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-07 18:45:17,198 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [166346781] [2024-11-07 18:45:17,198 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [166346781] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-07 18:45:17,198 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-07 18:45:17,198 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 10 [2024-11-07 18:45:17,199 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [74964821] [2024-11-07 18:45:17,199 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-07 18:45:17,199 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-07 18:45:17,199 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-07 18:45:17,199 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-07 18:45:17,199 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2024-11-07 18:45:17,200 INFO L87 Difference]: Start difference. First operand 1608 states and 2173 transitions. Second operand has 10 states, 10 states have (on average 9.1) internal successors, (91), 10 states have internal predecessors, (91), 1 states have call successors, (3), 1 states have call predecessors, (3), 3 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) [2024-11-07 18:45:17,326 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 18:45:17,326 INFO L93 Difference]: Finished difference Result 1634 states and 2203 transitions. [2024-11-07 18:45:17,327 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-07 18:45:17,327 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 9.1) internal successors, (91), 10 states have internal predecessors, (91), 1 states have call successors, (3), 1 states have call predecessors, (3), 3 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) Word has length 90 [2024-11-07 18:45:17,327 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 18:45:17,329 INFO L225 Difference]: With dead ends: 1634 [2024-11-07 18:45:17,329 INFO L226 Difference]: Without dead ends: 1622 [2024-11-07 18:45:17,329 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 183 GetRequests, 170 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=80, Invalid=130, Unknown=0, NotChecked=0, Total=210 [2024-11-07 18:45:17,329 INFO L432 NwaCegarLoop]: 925 mSDtfsCounter, 21 mSDsluCounter, 2763 mSDsCounter, 0 mSdLazyCounter, 68 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 3688 SdHoareTripleChecker+Invalid, 76 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 68 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-07 18:45:17,329 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 3688 Invalid, 76 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 68 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-07 18:45:17,332 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1622 states. [2024-11-07 18:45:17,345 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1622 to 1616. [2024-11-07 18:45:17,346 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1616 states, 1194 states have (on average 1.7755443886097153) internal successors, (2120), 1578 states have internal predecessors, (2120), 32 states have call successors, (32), 16 states have call predecessors, (32), 16 states have return successors, (31), 24 states have call predecessors, (31), 28 states have call successors, (31) [2024-11-07 18:45:17,349 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1616 states to 1616 states and 2183 transitions. [2024-11-07 18:45:17,349 INFO L78 Accepts]: Start accepts. Automaton has 1616 states and 2183 transitions. Word has length 90 [2024-11-07 18:45:17,349 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 18:45:17,349 INFO L471 AbstractCegarLoop]: Abstraction has 1616 states and 2183 transitions. [2024-11-07 18:45:17,349 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 9.1) internal successors, (91), 10 states have internal predecessors, (91), 1 states have call successors, (3), 1 states have call predecessors, (3), 3 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) [2024-11-07 18:45:17,350 INFO L276 IsEmpty]: Start isEmpty. Operand 1616 states and 2183 transitions. [2024-11-07 18:45:17,350 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2024-11-07 18:45:17,350 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 18:45:17,351 INFO L215 NwaCegarLoop]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 18:45:17,361 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 (24)] Forceful destruction successful, exit code 0 [2024-11-07 18:45:17,551 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 24 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -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 18:45:17,551 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr78REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, alt_mallocErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alt_mallocErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 519 more)] === [2024-11-07 18:45:17,552 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 18:45:17,552 INFO L85 PathProgramCache]: Analyzing trace with hash -307340818, now seen corresponding path program 2 times [2024-11-07 18:45:17,552 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-07 18:45:17,552 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1278233405] [2024-11-07 18:45:17,552 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-07 18:45:17,552 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 18:45:17,553 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-07 18:45:17,554 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 18:45:17,555 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 18:45:18,232 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-07 18:45:18,232 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-07 18:45:18,248 INFO L255 TraceCheckSpWp]: Trace formula consists of 487 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-11-07 18:45:18,250 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 18:45:18,335 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 18:45:18,336 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-07 18:45:18,519 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 18:45:18,520 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-07 18:45:18,520 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1278233405] [2024-11-07 18:45:18,520 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1278233405] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-07 18:45:18,520 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-07 18:45:18,520 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 16 [2024-11-07 18:45:18,520 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1278986938] [2024-11-07 18:45:18,520 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-07 18:45:18,521 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2024-11-07 18:45:18,521 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-07 18:45:18,521 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2024-11-07 18:45:18,521 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=162, Unknown=0, NotChecked=0, Total=240 [2024-11-07 18:45:18,521 INFO L87 Difference]: Start difference. First operand 1616 states and 2183 transitions. Second operand has 16 states, 16 states have (on average 6.0625) internal successors, (97), 16 states have internal predecessors, (97), 1 states have call successors, (3), 1 states have call predecessors, (3), 3 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) [2024-11-07 18:45:18,950 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 18:45:18,950 INFO L93 Difference]: Finished difference Result 1652 states and 2233 transitions. [2024-11-07 18:45:18,951 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2024-11-07 18:45:18,952 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 6.0625) internal successors, (97), 16 states have internal predecessors, (97), 1 states have call successors, (3), 1 states have call predecessors, (3), 3 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) Word has length 93 [2024-11-07 18:45:18,952 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 18:45:18,955 INFO L225 Difference]: With dead ends: 1652 [2024-11-07 18:45:18,955 INFO L226 Difference]: Without dead ends: 1640 [2024-11-07 18:45:18,956 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 195 GetRequests, 170 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 69 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=248, Invalid=454, Unknown=0, NotChecked=0, Total=702 [2024-11-07 18:45:18,956 INFO L432 NwaCegarLoop]: 925 mSDtfsCounter, 36 mSDsluCounter, 7361 mSDsCounter, 0 mSdLazyCounter, 209 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 8286 SdHoareTripleChecker+Invalid, 226 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 209 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-07 18:45:18,956 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [36 Valid, 8286 Invalid, 226 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 209 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-07 18:45:18,958 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1640 states. [2024-11-07 18:45:18,982 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1640 to 1634. [2024-11-07 18:45:18,984 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1634 states, 1212 states have (on average 1.768976897689769) internal successors, (2144), 1596 states have internal predecessors, (2144), 32 states have call successors, (32), 16 states have call predecessors, (32), 16 states have return successors, (31), 24 states have call predecessors, (31), 28 states have call successors, (31) [2024-11-07 18:45:18,986 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1634 states to 1634 states and 2207 transitions. [2024-11-07 18:45:18,986 INFO L78 Accepts]: Start accepts. Automaton has 1634 states and 2207 transitions. Word has length 93 [2024-11-07 18:45:18,986 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 18:45:18,986 INFO L471 AbstractCegarLoop]: Abstraction has 1634 states and 2207 transitions. [2024-11-07 18:45:18,986 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 6.0625) internal successors, (97), 16 states have internal predecessors, (97), 1 states have call successors, (3), 1 states have call predecessors, (3), 3 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) [2024-11-07 18:45:18,987 INFO L276 IsEmpty]: Start isEmpty. Operand 1634 states and 2207 transitions. [2024-11-07 18:45:18,987 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2024-11-07 18:45:18,987 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 18:45:18,987 INFO L215 NwaCegarLoop]: trace histogram [10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 18:45:19,001 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 18:45:19,188 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 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 18:45:19,188 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr78REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, alt_mallocErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alt_mallocErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 519 more)] === [2024-11-07 18:45:19,189 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 18:45:19,189 INFO L85 PathProgramCache]: Analyzing trace with hash -257513426, now seen corresponding path program 3 times [2024-11-07 18:45:19,190 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-07 18:45:19,190 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [821762576] [2024-11-07 18:45:19,190 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-07 18:45:19,190 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 18:45:19,190 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-07 18:45:19,194 INFO L229 MonitoredProcess]: Starting monitored process 26 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 18:45:19,195 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 (26)] Waiting until timeout for monitored process [2024-11-07 18:45:20,138 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2024-11-07 18:45:20,138 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-07 18:45:20,156 INFO L255 TraceCheckSpWp]: Trace formula consists of 553 conjuncts, 16 conjuncts are in the unsatisfiable core [2024-11-07 18:45:20,158 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 18:45:20,331 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 18:45:20,331 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-07 18:45:20,872 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 18:45:20,872 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-07 18:45:20,872 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [821762576] [2024-11-07 18:45:20,872 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [821762576] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-07 18:45:20,873 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-07 18:45:20,873 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15] total 28 [2024-11-07 18:45:20,873 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1841770558] [2024-11-07 18:45:20,873 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-07 18:45:20,873 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2024-11-07 18:45:20,873 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-07 18:45:20,874 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2024-11-07 18:45:20,874 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=222, Invalid=534, Unknown=0, NotChecked=0, Total=756 [2024-11-07 18:45:20,874 INFO L87 Difference]: Start difference. First operand 1634 states and 2207 transitions. Second operand has 28 states, 28 states have (on average 3.892857142857143) internal successors, (109), 28 states have internal predecessors, (109), 1 states have call successors, (3), 1 states have call predecessors, (3), 3 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) [2024-11-07 18:45:22,565 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 18:45:22,565 INFO L93 Difference]: Finished difference Result 1688 states and 2291 transitions. [2024-11-07 18:45:22,566 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2024-11-07 18:45:22,566 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 28 states have (on average 3.892857142857143) internal successors, (109), 28 states have internal predecessors, (109), 1 states have call successors, (3), 1 states have call predecessors, (3), 3 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) Word has length 99 [2024-11-07 18:45:22,566 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 18:45:22,568 INFO L225 Difference]: With dead ends: 1688 [2024-11-07 18:45:22,568 INFO L226 Difference]: Without dead ends: 1670 [2024-11-07 18:45:22,569 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 219 GetRequests, 170 SyntacticMatches, 0 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 285 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=854, Invalid=1696, Unknown=0, NotChecked=0, Total=2550 [2024-11-07 18:45:22,569 INFO L432 NwaCegarLoop]: 925 mSDtfsCounter, 43 mSDsluCounter, 11960 mSDsCounter, 0 mSdLazyCounter, 477 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 43 SdHoareTripleChecker+Valid, 12885 SdHoareTripleChecker+Invalid, 494 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 477 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-07 18:45:22,570 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [43 Valid, 12885 Invalid, 494 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 477 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-07 18:45:22,571 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1670 states. [2024-11-07 18:45:22,581 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1670 to 1670. [2024-11-07 18:45:22,582 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1670 states, 1248 states have (on average 1.7548076923076923) internal successors, (2190), 1632 states have internal predecessors, (2190), 32 states have call successors, (32), 16 states have call predecessors, (32), 16 states have return successors, (31), 24 states have call predecessors, (31), 28 states have call successors, (31) [2024-11-07 18:45:22,584 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1670 states to 1670 states and 2253 transitions. [2024-11-07 18:45:22,584 INFO L78 Accepts]: Start accepts. Automaton has 1670 states and 2253 transitions. Word has length 99 [2024-11-07 18:45:22,584 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 18:45:22,584 INFO L471 AbstractCegarLoop]: Abstraction has 1670 states and 2253 transitions. [2024-11-07 18:45:22,584 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 28 states have (on average 3.892857142857143) internal successors, (109), 28 states have internal predecessors, (109), 1 states have call successors, (3), 1 states have call predecessors, (3), 3 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) [2024-11-07 18:45:22,584 INFO L276 IsEmpty]: Start isEmpty. Operand 1670 states and 2253 transitions. [2024-11-07 18:45:22,585 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2024-11-07 18:45:22,585 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 18:45:22,585 INFO L215 NwaCegarLoop]: trace histogram [22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 18:45:22,596 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (26)] Forceful destruction successful, exit code 0 [2024-11-07 18:45:22,785 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 26 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -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 18:45:22,785 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr78REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, alt_mallocErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alt_mallocErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 519 more)] === [2024-11-07 18:45:22,786 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 18:45:22,786 INFO L85 PathProgramCache]: Analyzing trace with hash 351286446, now seen corresponding path program 4 times [2024-11-07 18:45:22,786 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-07 18:45:22,786 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [670251734] [2024-11-07 18:45:22,786 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2024-11-07 18:45:22,786 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 18:45:22,787 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-07 18:45:22,788 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 18:45:22,789 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 18:45:23,512 INFO L227 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2024-11-07 18:45:23,512 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-07 18:45:23,532 INFO L255 TraceCheckSpWp]: Trace formula consists of 685 conjuncts, 27 conjuncts are in the unsatisfiable core [2024-11-07 18:45:23,534 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 18:45:23,973 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 0 proven. 253 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 18:45:23,973 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-07 18:45:25,201 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 0 proven. 253 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 18:45:25,201 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-07 18:45:25,201 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [670251734] [2024-11-07 18:45:25,201 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [670251734] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-07 18:45:25,201 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-07 18:45:25,201 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 27] total 52 [2024-11-07 18:45:25,201 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1182118510] [2024-11-07 18:45:25,201 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-07 18:45:25,202 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 52 states [2024-11-07 18:45:25,202 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-07 18:45:25,203 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2024-11-07 18:45:25,204 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=725, Invalid=1927, Unknown=0, NotChecked=0, Total=2652 [2024-11-07 18:45:25,204 INFO L87 Difference]: Start difference. First operand 1670 states and 2253 transitions. Second operand has 52 states, 52 states have (on average 2.5576923076923075) internal successors, (133), 52 states have internal predecessors, (133), 1 states have call successors, (3), 1 states have call predecessors, (3), 3 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) [2024-11-07 18:45:32,577 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 18:45:32,578 INFO L93 Difference]: Finished difference Result 1756 states and 2403 transitions. [2024-11-07 18:45:32,579 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 73 states. [2024-11-07 18:45:32,579 INFO L78 Accepts]: Start accepts. Automaton has has 52 states, 52 states have (on average 2.5576923076923075) internal successors, (133), 52 states have internal predecessors, (133), 1 states have call successors, (3), 1 states have call predecessors, (3), 3 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) Word has length 111 [2024-11-07 18:45:32,579 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 18:45:32,583 INFO L225 Difference]: With dead ends: 1756 [2024-11-07 18:45:32,583 INFO L226 Difference]: Without dead ends: 1744 [2024-11-07 18:45:32,585 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 265 GetRequests, 170 SyntacticMatches, 0 SemanticMatches, 95 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1126 ImplicationChecksByTransitivity, 6.8s TimeCoverageRelationStatistics Valid=2955, Invalid=6357, Unknown=0, NotChecked=0, Total=9312 [2024-11-07 18:45:32,586 INFO L432 NwaCegarLoop]: 925 mSDtfsCounter, 101 mSDsluCounter, 22101 mSDsCounter, 0 mSdLazyCounter, 1906 mSolverCounterSat, 51 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 101 SdHoareTripleChecker+Valid, 23026 SdHoareTripleChecker+Invalid, 1957 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 51 IncrementalHoareTripleChecker+Valid, 1906 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2024-11-07 18:45:32,586 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [101 Valid, 23026 Invalid, 1957 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [51 Valid, 1906 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2024-11-07 18:45:32,587 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1744 states. [2024-11-07 18:45:32,600 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1744 to 1738. [2024-11-07 18:45:32,601 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1738 states, 1316 states have (on average 1.7340425531914894) internal successors, (2282), 1700 states have internal predecessors, (2282), 32 states have call successors, (32), 16 states have call predecessors, (32), 16 states have return successors, (31), 24 states have call predecessors, (31), 28 states have call successors, (31) [2024-11-07 18:45:32,604 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1738 states to 1738 states and 2345 transitions. [2024-11-07 18:45:32,604 INFO L78 Accepts]: Start accepts. Automaton has 1738 states and 2345 transitions. Word has length 111 [2024-11-07 18:45:32,604 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 18:45:32,605 INFO L471 AbstractCegarLoop]: Abstraction has 1738 states and 2345 transitions. [2024-11-07 18:45:32,605 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 52 states, 52 states have (on average 2.5576923076923075) internal successors, (133), 52 states have internal predecessors, (133), 1 states have call successors, (3), 1 states have call predecessors, (3), 3 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) [2024-11-07 18:45:32,605 INFO L276 IsEmpty]: Start isEmpty. Operand 1738 states and 2345 transitions. [2024-11-07 18:45:32,606 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2024-11-07 18:45:32,606 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 18:45:32,606 INFO L215 NwaCegarLoop]: trace histogram [44, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 18:45:32,624 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 (27)] Ended with exit code 0 [2024-11-07 18:45:32,806 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 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 18:45:32,807 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr78REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, alt_mallocErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alt_mallocErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 519 more)] === [2024-11-07 18:45:32,808 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 18:45:32,808 INFO L85 PathProgramCache]: Analyzing trace with hash 2042747118, now seen corresponding path program 5 times [2024-11-07 18:45:32,809 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-07 18:45:32,809 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [834675080] [2024-11-07 18:45:32,809 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2024-11-07 18:45:32,809 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 18:45:32,810 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-07 18:45:32,812 INFO L229 MonitoredProcess]: Starting monitored process 28 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 18:45:32,814 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 (28)] Waiting until timeout for monitored process [2024-11-07 18:45:34,010 INFO L227 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 23 check-sat command(s) [2024-11-07 18:45:34,011 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-07 18:45:34,040 INFO L255 TraceCheckSpWp]: Trace formula consists of 927 conjuncts, 64 conjuncts are in the unsatisfiable core [2024-11-07 18:45:34,060 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 18:45:34,066 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 18:45:34,222 INFO L349 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2024-11-07 18:45:34,223 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 18:45:34,252 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2024-11-07 18:45:34,349 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 12 [2024-11-07 18:45:35,383 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-07 18:45:35,384 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 44 treesize of output 43 [2024-11-07 18:45:35,447 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 15 [2024-11-07 18:45:35,487 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 87 refuted. 0 times theorem prover too weak. 903 trivial. 0 not checked. [2024-11-07 18:45:35,487 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-07 18:45:35,826 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2663 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 1) (bvadd (_ bv1 1) (select |c_#valid| (select (select (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_#t~mem71#1.base| v_ArrVal_2663) |c_ULTIMATE.start_main_~user~0#1.base|) (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|)))))) is different from false [2024-11-07 18:45:35,827 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-07 18:45:35,828 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [834675080] [2024-11-07 18:45:35,828 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [834675080] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-07 18:45:35,828 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [328198907] [2024-11-07 18:45:35,828 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2024-11-07 18:45:35,828 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-11-07 18:45:35,828 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/cvc4 [2024-11-07 18:45:35,830 INFO L229 MonitoredProcess]: Starting monitored process 29 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 18:45:35,831 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (29)] Waiting until timeout for monitored process