./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/ldv-memsafety/memleaks_test22_2-2.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 4f9af400 extending candidate: java ['java'] extending candidate: /usr/bin/java ['java', '/usr/bin/java'] extending candidate: /opt/oracle-jdk-bin-*/bin/java ['java', '/usr/bin/java'] extending candidate: /opt/openjdk-*/bin/java ['java', '/usr/bin/java'] extending candidate: /usr/lib/jvm/java-*-openjdk-amd64/bin/java ['java', '/usr/bin/java', '/usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java', '/usr/lib/jvm/java-17-openjdk-amd64/bin/java', '/usr/lib/jvm/java-11-openjdk-amd64/bin/java', '/usr/lib/jvm/java-1.17.0-openjdk-amd64/bin/java'] ['/root/.sdkman/candidates/java/21.0.5-tem/bin/java', '-Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config', '-Xmx15G', '-Xms4m', '-jar', '/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar', '-data', '@noDefault', '-ultimatedata', '/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data', '-tc', '/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml', '-i', '../sv-benchmarks/c/ldv-memsafety/memleaks_test22_2-2.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', 'beb004be26a355c223f1a45515f5377c37b18fc46f09e77727f89b964ae9789d'] Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/ldv-memsafety/memleaks_test22_2-2.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 beb004be26a355c223f1a45515f5377c37b18fc46f09e77727f89b964ae9789d --- Real Ultimate output --- This is Ultimate 0.3.0-?-4f9af40 [2024-11-07 16:35:05,348 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-07 16:35:05,404 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2024-11-07 16:35:05,411 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-07 16:35:05,412 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-07 16:35:05,433 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-07 16:35:05,433 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-07 16:35:05,433 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-07 16:35:05,434 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-07 16:35:05,434 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-07 16:35:05,434 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-07 16:35:05,434 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-07 16:35:05,436 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-07 16:35:05,436 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-07 16:35:05,437 INFO L153 SettingsManager]: * Use SBE=true [2024-11-07 16:35:05,437 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-07 16:35:05,437 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-07 16:35:05,437 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-07 16:35:05,437 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-07 16:35:05,437 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-07 16:35:05,437 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-11-07 16:35:05,438 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-11-07 16:35:05,438 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-11-07 16:35:05,438 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-07 16:35:05,438 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-07 16:35:05,438 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-07 16:35:05,438 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-07 16:35:05,438 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-07 16:35:05,438 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-07 16:35:05,439 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-07 16:35:05,439 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-07 16:35:05,439 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-07 16:35:05,439 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-07 16:35:05,439 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-07 16:35:05,439 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-07 16:35:05,440 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-07 16:35:05,440 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-07 16:35:05,440 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-07 16:35:05,440 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-07 16:35:05,440 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-07 16:35:05,440 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-07 16:35:05,440 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-07 16:35:05,440 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 -> beb004be26a355c223f1a45515f5377c37b18fc46f09e77727f89b964ae9789d [2024-11-07 16:35:05,648 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-07 16:35:05,656 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-07 16:35:05,657 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-07 16:35:05,659 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-07 16:35:05,659 INFO L274 PluginConnector]: CDTParser initialized [2024-11-07 16:35:05,660 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/ldv-memsafety/memleaks_test22_2-2.i [2024-11-07 16:35:06,829 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-07 16:35:07,115 INFO L384 CDTParser]: Found 1 translation units. [2024-11-07 16:35:07,116 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/ldv-memsafety/memleaks_test22_2-2.i [2024-11-07 16:35:07,125 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/b7baaf91a/3112773182cb4bcbb4895775511ff472/FLAG1205bdd4b [2024-11-07 16:35:07,408 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/b7baaf91a/3112773182cb4bcbb4895775511ff472 [2024-11-07 16:35:07,409 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-07 16:35:07,411 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-07 16:35:07,411 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-07 16:35:07,412 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-07 16:35:07,414 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-07 16:35:07,415 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 04:35:07" (1/1) ... [2024-11-07 16:35:07,416 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@720e25 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:35:07, skipping insertion in model container [2024-11-07 16:35:07,416 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 04:35:07" (1/1) ... [2024-11-07 16:35:07,437 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-07 16:35:07,613 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-07 16:35:07,637 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-07 16:35:07,653 ERROR L321 MainTranslator]: Unsupported Syntax: Found a cast between two array/pointer types of different sizes while using memory model HoenickeLindenmann_Original (while Not using bitvector translation) [2024-11-07 16:35:07,653 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver@c22a02e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:35:07, skipping insertion in model container [2024-11-07 16:35:07,654 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-07 16:35:07,654 INFO L186 ToolchainWalker]: Toolchain execution was canceled (user or tool) before executing de.uni_freiburg.informatik.ultimate.boogie.procedureinliner [2024-11-07 16:35:07,655 INFO L158 Benchmark]: Toolchain (without parser) took 244.49ms. Allocated memory is still 109.1MB. Free memory was 83.1MB in the beginning and 69.5MB in the end (delta: 13.6MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-11-07 16:35:07,656 INFO L158 Benchmark]: CDTParser took 0.56ms. Allocated memory is still 83.9MB. Free memory is still 47.9MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-07 16:35:07,656 INFO L158 Benchmark]: CACSL2BoogieTranslator took 242.78ms. Allocated memory is still 109.1MB. Free memory was 83.0MB in the beginning and 69.5MB in the end (delta: 13.5MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-11-07 16:35:07,656 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.56ms. Allocated memory is still 83.9MB. Free memory is still 47.9MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 242.78ms. Allocated memory is still 109.1MB. Free memory was 83.0MB in the beginning and 69.5MB in the end (delta: 13.5MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - UnsupportedSyntaxResult [Line: 607]: Unsupported Syntax Found a cast between two array/pointer types of different sizes while using memory model HoenickeLindenmann_Original (while Not using bitvector translation) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/ldv-memsafety/memleaks_test22_2-2.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 beb004be26a355c223f1a45515f5377c37b18fc46f09e77727f89b964ae9789d --- Real Ultimate output --- This is Ultimate 0.3.0-?-4f9af40 [2024-11-07 16:35:09,618 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-07 16:35:09,704 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf [2024-11-07 16:35:09,707 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-07 16:35:09,707 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-07 16:35:09,731 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-07 16:35:09,732 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-07 16:35:09,733 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-07 16:35:09,733 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-07 16:35:09,733 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-07 16:35:09,733 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-07 16:35:09,733 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-07 16:35:09,733 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-07 16:35:09,733 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-07 16:35:09,733 INFO L153 SettingsManager]: * Use SBE=true [2024-11-07 16:35:09,733 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-07 16:35:09,733 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-07 16:35:09,734 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-07 16:35:09,734 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-07 16:35:09,734 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-07 16:35:09,734 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-11-07 16:35:09,734 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-11-07 16:35:09,734 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-11-07 16:35:09,734 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-07 16:35:09,734 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-07 16:35:09,734 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-07 16:35:09,734 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-07 16:35:09,735 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-07 16:35:09,735 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-07 16:35:09,736 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-07 16:35:09,736 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-07 16:35:09,736 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-07 16:35:09,736 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-07 16:35:09,736 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-07 16:35:09,736 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-07 16:35:09,736 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-07 16:35:09,736 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-07 16:35:09,736 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-07 16:35:09,736 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-07 16:35:09,736 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-07 16:35:09,737 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-07 16:35:09,737 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-07 16:35:09,737 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-07 16:35:09,737 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-07 16:35:09,737 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 -> beb004be26a355c223f1a45515f5377c37b18fc46f09e77727f89b964ae9789d [2024-11-07 16:35:09,994 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-07 16:35:10,000 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-07 16:35:10,002 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-07 16:35:10,002 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-07 16:35:10,003 INFO L274 PluginConnector]: CDTParser initialized [2024-11-07 16:35:10,004 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/ldv-memsafety/memleaks_test22_2-2.i [2024-11-07 16:35:11,643 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-07 16:35:11,951 INFO L384 CDTParser]: Found 1 translation units. [2024-11-07 16:35:11,952 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/ldv-memsafety/memleaks_test22_2-2.i [2024-11-07 16:35:11,969 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/0d942608e/6d22515109724ad7960b36b1f4655e2f/FLAG35edf8d8c [2024-11-07 16:35:11,985 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/0d942608e/6d22515109724ad7960b36b1f4655e2f [2024-11-07 16:35:11,987 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-07 16:35:11,989 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-07 16:35:11,991 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-07 16:35:11,992 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-07 16:35:11,995 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-07 16:35:11,996 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 04:35:11" (1/1) ... [2024-11-07 16:35:11,996 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7aa47db7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:35:11, skipping insertion in model container [2024-11-07 16:35:11,997 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 04:35:11" (1/1) ... [2024-11-07 16:35:12,030 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-07 16:35:12,258 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-07 16:35:12,297 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-07 16:35:12,310 INFO L197 MainTranslator]: Restarting translation with changed settings: SettingsChange [mNewPreferredMemoryModel=HoenickeLindenmann_1ByteResolution] [2024-11-07 16:35:12,316 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-07 16:35:12,336 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-07 16:35:12,356 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-07 16:35:12,365 INFO L200 MainTranslator]: Completed pre-run [2024-11-07 16:35:12,412 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-07 16:35:12,444 INFO L204 MainTranslator]: Completed translation [2024-11-07 16:35:12,444 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:35:12 WrapperNode [2024-11-07 16:35:12,444 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-07 16:35:12,445 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-07 16:35:12,445 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-07 16:35:12,445 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-07 16:35:12,449 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:35:12" (1/1) ... [2024-11-07 16:35:12,466 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:35:12" (1/1) ... [2024-11-07 16:35:12,486 INFO L138 Inliner]: procedures = 165, calls = 71, calls flagged for inlining = 23, calls inlined = 17, statements flattened = 123 [2024-11-07 16:35:12,486 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-07 16:35:12,487 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-07 16:35:12,487 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-07 16:35:12,487 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-07 16:35:12,492 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:35:12" (1/1) ... [2024-11-07 16:35:12,492 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:35:12" (1/1) ... [2024-11-07 16:35:12,495 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:35:12" (1/1) ... [2024-11-07 16:35:12,507 INFO L175 MemorySlicer]: Split 12 memory accesses to 2 slices as follows [2, 10]. 83 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0]. The 7 writes are split as follows [0, 7]. [2024-11-07 16:35:12,507 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:35:12" (1/1) ... [2024-11-07 16:35:12,507 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:35:12" (1/1) ... [2024-11-07 16:35:12,515 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:35:12" (1/1) ... [2024-11-07 16:35:12,517 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:35:12" (1/1) ... [2024-11-07 16:35:12,521 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:35:12" (1/1) ... [2024-11-07 16:35:12,522 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:35:12" (1/1) ... [2024-11-07 16:35:12,528 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-07 16:35:12,528 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-07 16:35:12,528 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-07 16:35:12,528 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-07 16:35:12,529 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:35:12" (1/1) ... [2024-11-07 16:35:12,536 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-07 16:35:12,547 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 16:35:12,556 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-07 16:35:12,558 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-07 16:35:12,573 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#0 [2024-11-07 16:35:12,573 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#1 [2024-11-07 16:35:12,573 INFO L130 BoogieDeclarations]: Found specification of procedure LDV_INIT_LIST_HEAD [2024-11-07 16:35:12,574 INFO L138 BoogieDeclarations]: Found implementation of procedure LDV_INIT_LIST_HEAD [2024-11-07 16:35:12,574 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_malloc [2024-11-07 16:35:12,574 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_malloc [2024-11-07 16:35:12,574 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_kobject_put [2024-11-07 16:35:12,574 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_kobject_put [2024-11-07 16:35:12,574 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-11-07 16:35:12,574 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-07 16:35:12,574 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2024-11-07 16:35:12,574 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2024-11-07 16:35:12,574 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2024-11-07 16:35:12,574 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2024-11-07 16:35:12,574 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#0 [2024-11-07 16:35:12,575 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#1 [2024-11-07 16:35:12,575 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-07 16:35:12,575 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#0 [2024-11-07 16:35:12,575 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#1 [2024-11-07 16:35:12,575 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-07 16:35:12,575 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-07 16:35:12,716 INFO L238 CfgBuilder]: Building ICFG [2024-11-07 16:35:12,718 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-07 16:35:13,049 INFO L? ?]: Removed 133 outVars from TransFormulas that were not future-live. [2024-11-07 16:35:13,049 INFO L287 CfgBuilder]: Performing block encoding [2024-11-07 16:35:13,056 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-07 16:35:13,057 INFO L316 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-07 16:35:13,057 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 04:35:13 BoogieIcfgContainer [2024-11-07 16:35:13,057 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-07 16:35:13,059 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-07 16:35:13,059 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-07 16:35:13,062 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-07 16:35:13,062 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.11 04:35:11" (1/3) ... [2024-11-07 16:35:13,063 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5dcc99c8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 04:35:13, skipping insertion in model container [2024-11-07 16:35:13,063 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:35:12" (2/3) ... [2024-11-07 16:35:13,063 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5dcc99c8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 04:35:13, skipping insertion in model container [2024-11-07 16:35:13,063 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 04:35:13" (3/3) ... [2024-11-07 16:35:13,064 INFO L112 eAbstractionObserver]: Analyzing ICFG memleaks_test22_2-2.i [2024-11-07 16:35:13,074 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-07 16:35:13,074 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 25 error locations. [2024-11-07 16:35:13,099 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-07 16:35:13,107 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;@5be794b8, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-07 16:35:13,108 INFO L334 AbstractCegarLoop]: Starting to check reachability of 25 error locations. [2024-11-07 16:35:13,112 INFO L276 IsEmpty]: Start isEmpty. Operand has 90 states, 57 states have (on average 1.5964912280701755) internal successors, (91), 83 states have internal predecessors, (91), 4 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2024-11-07 16:35:13,117 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2024-11-07 16:35:13,117 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 16:35:13,117 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 16:35:13,118 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE === [LDV_INIT_LIST_HEADErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, LDV_INIT_LIST_HEADErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, LDV_INIT_LIST_HEADErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 22 more)] === [2024-11-07 16:35:13,121 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 16:35:13,121 INFO L85 PathProgramCache]: Analyzing trace with hash -459041073, now seen corresponding path program 1 times [2024-11-07 16:35:13,128 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-07 16:35:13,128 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [904784296] [2024-11-07 16:35:13,128 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 16:35:13,129 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-07 16:35:13,129 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-07 16:35:13,132 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-07 16:35:13,133 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2024-11-07 16:35:13,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 16:35:13,264 INFO L255 TraceCheckSpWp]: Trace formula consists of 40 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-07 16:35:13,267 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 16:35:13,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 7 [2024-11-07 16:35:13,347 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 16:35:13,347 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-07 16:35:13,347 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-07 16:35:13,348 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [904784296] [2024-11-07 16:35:13,348 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [904784296] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 16:35:13,348 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 16:35:13,348 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-07 16:35:13,349 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [731888386] [2024-11-07 16:35:13,350 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 16:35:13,352 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-07 16:35:13,352 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-07 16:35:13,367 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-07 16:35:13,367 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-07 16:35:13,369 INFO L87 Difference]: Start difference. First operand has 90 states, 57 states have (on average 1.5964912280701755) internal successors, (91), 83 states have internal predecessors, (91), 4 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Second operand has 6 states, 5 states have (on average 1.6) internal successors, (8), 5 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-07 16:35:13,600 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 16:35:13,601 INFO L93 Difference]: Finished difference Result 108 states and 122 transitions. [2024-11-07 16:35:13,602 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-07 16:35:13,603 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 1.6) internal successors, (8), 5 states have internal predecessors, (8), 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 10 [2024-11-07 16:35:13,603 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 16:35:13,608 INFO L225 Difference]: With dead ends: 108 [2024-11-07 16:35:13,609 INFO L226 Difference]: Without dead ends: 106 [2024-11-07 16:35:13,611 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-11-07 16:35:13,614 INFO L432 NwaCegarLoop]: 89 mSDtfsCounter, 23 mSDsluCounter, 245 mSDsCounter, 0 mSdLazyCounter, 160 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 334 SdHoareTripleChecker+Invalid, 161 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 160 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-07 16:35:13,614 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [24 Valid, 334 Invalid, 161 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 160 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-07 16:35:13,623 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2024-11-07 16:35:13,639 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 93. [2024-11-07 16:35:13,640 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 93 states, 60 states have (on average 1.5666666666666667) internal successors, (94), 85 states have internal predecessors, (94), 4 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (5), 5 states have call predecessors, (5), 4 states have call successors, (5) [2024-11-07 16:35:13,642 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 103 transitions. [2024-11-07 16:35:13,644 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 103 transitions. Word has length 10 [2024-11-07 16:35:13,644 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 16:35:13,644 INFO L471 AbstractCegarLoop]: Abstraction has 93 states and 103 transitions. [2024-11-07 16:35:13,645 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 1.6) internal successors, (8), 5 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-07 16:35:13,645 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 103 transitions. [2024-11-07 16:35:13,645 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2024-11-07 16:35:13,645 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 16:35:13,646 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 16:35:13,648 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2024-11-07 16:35:13,846 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-07 16:35:13,847 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE === [LDV_INIT_LIST_HEADErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, LDV_INIT_LIST_HEADErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, LDV_INIT_LIST_HEADErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 22 more)] === [2024-11-07 16:35:13,848 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 16:35:13,848 INFO L85 PathProgramCache]: Analyzing trace with hash -430411922, now seen corresponding path program 1 times [2024-11-07 16:35:13,848 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-07 16:35:13,848 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2089532304] [2024-11-07 16:35:13,848 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 16:35:13,848 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-07 16:35:13,848 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-07 16:35:13,855 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-07 16:35:13,856 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2024-11-07 16:35:13,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 16:35:13,926 INFO L255 TraceCheckSpWp]: Trace formula consists of 34 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-11-07 16:35:13,926 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 16:35:13,983 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 16:35:13,983 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-07 16:35:13,983 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-07 16:35:13,984 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2089532304] [2024-11-07 16:35:13,984 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2089532304] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 16:35:13,984 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 16:35:13,984 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-07 16:35:13,984 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [5313010] [2024-11-07 16:35:13,984 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 16:35:13,985 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-07 16:35:13,985 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-07 16:35:13,985 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-07 16:35:13,985 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-07 16:35:13,985 INFO L87 Difference]: Start difference. First operand 93 states and 103 transitions. Second operand has 5 states, 5 states have (on average 1.6) internal successors, (8), 4 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-07 16:35:14,012 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 16:35:14,012 INFO L93 Difference]: Finished difference Result 91 states and 100 transitions. [2024-11-07 16:35:14,013 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-07 16:35:14,013 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 1.6) internal successors, (8), 4 states have internal predecessors, (8), 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 10 [2024-11-07 16:35:14,013 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 16:35:14,014 INFO L225 Difference]: With dead ends: 91 [2024-11-07 16:35:14,014 INFO L226 Difference]: Without dead ends: 91 [2024-11-07 16:35:14,014 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-07 16:35:14,015 INFO L432 NwaCegarLoop]: 98 mSDtfsCounter, 0 mSDsluCounter, 280 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 378 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-07 16:35:14,015 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 378 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 16:35:14,015 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2024-11-07 16:35:14,018 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 91. [2024-11-07 16:35:14,019 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 91 states, 59 states have (on average 1.5423728813559323) internal successors, (91), 83 states have internal predecessors, (91), 4 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (5), 5 states have call predecessors, (5), 4 states have call successors, (5) [2024-11-07 16:35:14,020 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 100 transitions. [2024-11-07 16:35:14,020 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 100 transitions. Word has length 10 [2024-11-07 16:35:14,020 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 16:35:14,020 INFO L471 AbstractCegarLoop]: Abstraction has 91 states and 100 transitions. [2024-11-07 16:35:14,020 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 1.6) internal successors, (8), 4 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-07 16:35:14,020 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 100 transitions. [2024-11-07 16:35:14,020 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2024-11-07 16:35:14,021 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 16:35:14,021 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 16:35:14,025 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 16:35:14,221 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-07 16:35:14,222 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE === [LDV_INIT_LIST_HEADErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, LDV_INIT_LIST_HEADErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, LDV_INIT_LIST_HEADErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 22 more)] === [2024-11-07 16:35:14,223 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 16:35:14,223 INFO L85 PathProgramCache]: Analyzing trace with hash -1345371264, now seen corresponding path program 1 times [2024-11-07 16:35:14,223 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-07 16:35:14,225 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1150940068] [2024-11-07 16:35:14,225 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 16:35:14,226 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-07 16:35:14,226 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-07 16:35:14,227 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-07 16:35:14,228 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2024-11-07 16:35:14,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 16:35:14,280 INFO L255 TraceCheckSpWp]: Trace formula consists of 41 conjuncts, 13 conjuncts are in the unsatisfiable core [2024-11-07 16:35:14,281 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 16:35:14,296 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-07 16:35:14,395 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 16:35:14,395 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-07 16:35:14,395 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-07 16:35:14,395 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1150940068] [2024-11-07 16:35:14,395 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1150940068] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 16:35:14,395 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 16:35:14,395 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-07 16:35:14,396 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1774301644] [2024-11-07 16:35:14,396 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 16:35:14,396 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-07 16:35:14,396 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-07 16:35:14,396 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-07 16:35:14,396 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-07 16:35:14,397 INFO L87 Difference]: Start difference. First operand 91 states and 100 transitions. Second operand has 7 states, 6 states have (on average 1.5) internal successors, (9), 6 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-07 16:35:14,626 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 16:35:14,626 INFO L93 Difference]: Finished difference Result 90 states and 99 transitions. [2024-11-07 16:35:14,627 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-07 16:35:14,627 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 1.5) internal successors, (9), 6 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 11 [2024-11-07 16:35:14,627 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 16:35:14,628 INFO L225 Difference]: With dead ends: 90 [2024-11-07 16:35:14,628 INFO L226 Difference]: Without dead ends: 90 [2024-11-07 16:35:14,628 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2024-11-07 16:35:14,628 INFO L432 NwaCegarLoop]: 83 mSDtfsCounter, 19 mSDsluCounter, 328 mSDsCounter, 0 mSdLazyCounter, 145 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 411 SdHoareTripleChecker+Invalid, 145 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 145 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-07 16:35:14,629 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 411 Invalid, 145 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 145 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-07 16:35:14,629 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2024-11-07 16:35:14,632 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 90. [2024-11-07 16:35:14,632 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 90 states, 59 states have (on average 1.5254237288135593) internal successors, (90), 82 states have internal predecessors, (90), 4 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (5), 5 states have call predecessors, (5), 4 states have call successors, (5) [2024-11-07 16:35:14,633 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 99 transitions. [2024-11-07 16:35:14,633 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 99 transitions. Word has length 11 [2024-11-07 16:35:14,633 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 16:35:14,633 INFO L471 AbstractCegarLoop]: Abstraction has 90 states and 99 transitions. [2024-11-07 16:35:14,633 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 1.5) internal successors, (9), 6 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-07 16:35:14,633 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 99 transitions. [2024-11-07 16:35:14,633 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2024-11-07 16:35:14,633 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 16:35:14,634 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 16:35:14,636 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Forceful destruction successful, exit code 0 [2024-11-07 16:35:14,834 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-07 16:35:14,835 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [LDV_INIT_LIST_HEADErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, LDV_INIT_LIST_HEADErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, LDV_INIT_LIST_HEADErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 22 more)] === [2024-11-07 16:35:14,836 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 16:35:14,836 INFO L85 PathProgramCache]: Analyzing trace with hash 1243137109, now seen corresponding path program 1 times [2024-11-07 16:35:14,836 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-07 16:35:14,836 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [540460914] [2024-11-07 16:35:14,836 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 16:35:14,836 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-07 16:35:14,836 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-07 16:35:14,840 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-07 16:35:14,841 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2024-11-07 16:35:14,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 16:35:14,907 INFO L255 TraceCheckSpWp]: Trace formula consists of 56 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-07 16:35:14,911 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 16:35:14,934 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 16:35:14,934 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-07 16:35:14,934 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-07 16:35:14,934 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [540460914] [2024-11-07 16:35:14,934 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [540460914] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 16:35:14,934 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 16:35:14,934 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-07 16:35:14,934 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [236718452] [2024-11-07 16:35:14,934 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 16:35:14,935 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-07 16:35:14,935 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-07 16:35:14,935 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-07 16:35:14,935 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-07 16:35:14,935 INFO L87 Difference]: Start difference. First operand 90 states and 99 transitions. Second operand has 5 states, 5 states have (on average 2.0) internal successors, (10), 4 states have internal predecessors, (10), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-07 16:35:14,960 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 16:35:14,960 INFO L93 Difference]: Finished difference Result 90 states and 98 transitions. [2024-11-07 16:35:14,963 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-07 16:35:14,963 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.0) internal successors, (10), 4 states have internal predecessors, (10), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 12 [2024-11-07 16:35:14,963 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 16:35:14,964 INFO L225 Difference]: With dead ends: 90 [2024-11-07 16:35:14,964 INFO L226 Difference]: Without dead ends: 90 [2024-11-07 16:35:14,964 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-07 16:35:14,964 INFO L432 NwaCegarLoop]: 91 mSDtfsCounter, 15 mSDsluCounter, 252 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 343 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-07 16:35:14,964 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 343 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 16:35:14,965 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2024-11-07 16:35:14,967 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 90. [2024-11-07 16:35:14,967 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 90 states, 59 states have (on average 1.5084745762711864) internal successors, (89), 82 states have internal predecessors, (89), 4 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (5), 5 states have call predecessors, (5), 4 states have call successors, (5) [2024-11-07 16:35:14,968 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 98 transitions. [2024-11-07 16:35:14,968 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 98 transitions. Word has length 12 [2024-11-07 16:35:14,968 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 16:35:14,968 INFO L471 AbstractCegarLoop]: Abstraction has 90 states and 98 transitions. [2024-11-07 16:35:14,968 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.0) internal successors, (10), 4 states have internal predecessors, (10), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-07 16:35:14,969 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 98 transitions. [2024-11-07 16:35:14,969 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2024-11-07 16:35:14,969 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 16:35:14,969 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 16:35:14,972 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Ended with exit code 0 [2024-11-07 16:35:15,169 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-07 16:35:15,170 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [LDV_INIT_LIST_HEADErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, LDV_INIT_LIST_HEADErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, LDV_INIT_LIST_HEADErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 22 more)] === [2024-11-07 16:35:15,170 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 16:35:15,170 INFO L85 PathProgramCache]: Analyzing trace with hash -1309019852, now seen corresponding path program 1 times [2024-11-07 16:35:15,171 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-07 16:35:15,171 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1494994501] [2024-11-07 16:35:15,171 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 16:35:15,172 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-07 16:35:15,172 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-07 16:35:15,173 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-07 16:35:15,175 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2024-11-07 16:35:15,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 16:35:15,229 INFO L255 TraceCheckSpWp]: Trace formula consists of 50 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-11-07 16:35:15,230 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 16:35:15,253 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 16:35:15,253 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-07 16:35:15,254 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-07 16:35:15,254 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1494994501] [2024-11-07 16:35:15,254 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1494994501] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 16:35:15,255 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 16:35:15,256 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-07 16:35:15,257 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1484770303] [2024-11-07 16:35:15,257 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 16:35:15,257 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-07 16:35:15,257 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-07 16:35:15,257 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-07 16:35:15,257 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-07 16:35:15,257 INFO L87 Difference]: Start difference. First operand 90 states and 98 transitions. Second operand has 4 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-07 16:35:15,277 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 16:35:15,279 INFO L93 Difference]: Finished difference Result 93 states and 101 transitions. [2024-11-07 16:35:15,279 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-07 16:35:15,279 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 12 [2024-11-07 16:35:15,279 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 16:35:15,280 INFO L225 Difference]: With dead ends: 93 [2024-11-07 16:35:15,280 INFO L226 Difference]: Without dead ends: 93 [2024-11-07 16:35:15,280 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-07 16:35:15,281 INFO L432 NwaCegarLoop]: 92 mSDtfsCounter, 1 mSDsluCounter, 179 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 271 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-07 16:35:15,281 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 271 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 16:35:15,282 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2024-11-07 16:35:15,288 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 92. [2024-11-07 16:35:15,288 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 92 states, 61 states have (on average 1.4918032786885247) internal successors, (91), 84 states have internal predecessors, (91), 4 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (5), 5 states have call predecessors, (5), 4 states have call successors, (5) [2024-11-07 16:35:15,289 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 100 transitions. [2024-11-07 16:35:15,289 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 100 transitions. Word has length 12 [2024-11-07 16:35:15,289 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 16:35:15,289 INFO L471 AbstractCegarLoop]: Abstraction has 92 states and 100 transitions. [2024-11-07 16:35:15,289 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-07 16:35:15,289 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 100 transitions. [2024-11-07 16:35:15,289 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2024-11-07 16:35:15,289 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 16:35:15,289 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 16:35:15,298 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Ended with exit code 0 [2024-11-07 16:35:15,489 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-07 16:35:15,490 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [LDV_INIT_LIST_HEADErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, LDV_INIT_LIST_HEADErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, LDV_INIT_LIST_HEADErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 22 more)] === [2024-11-07 16:35:15,490 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 16:35:15,491 INFO L85 PathProgramCache]: Analyzing trace with hash 257401917, now seen corresponding path program 1 times [2024-11-07 16:35:15,491 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-07 16:35:15,491 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1074194765] [2024-11-07 16:35:15,491 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 16:35:15,491 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-07 16:35:15,491 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-07 16:35:15,493 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-07 16:35:15,495 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2024-11-07 16:35:15,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 16:35:15,542 INFO L255 TraceCheckSpWp]: Trace formula consists of 63 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-07 16:35:15,542 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 16:35:15,557 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 16:35:15,557 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-07 16:35:15,557 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-07 16:35:15,557 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1074194765] [2024-11-07 16:35:15,558 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1074194765] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 16:35:15,558 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 16:35:15,558 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-07 16:35:15,558 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [570588419] [2024-11-07 16:35:15,558 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 16:35:15,558 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-07 16:35:15,558 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-07 16:35:15,559 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-07 16:35:15,559 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-07 16:35:15,559 INFO L87 Difference]: Start difference. First operand 92 states and 100 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, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-07 16:35:15,574 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 16:35:15,576 INFO L93 Difference]: Finished difference Result 93 states and 101 transitions. [2024-11-07 16:35:15,576 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-07 16:35:15,576 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, (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 16 [2024-11-07 16:35:15,577 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 16:35:15,577 INFO L225 Difference]: With dead ends: 93 [2024-11-07 16:35:15,577 INFO L226 Difference]: Without dead ends: 93 [2024-11-07 16:35:15,577 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-07 16:35:15,579 INFO L432 NwaCegarLoop]: 92 mSDtfsCounter, 2 mSDsluCounter, 179 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 271 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-07 16:35:15,579 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 271 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 16:35:15,579 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2024-11-07 16:35:15,585 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 93. [2024-11-07 16:35:15,586 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 93 states, 62 states have (on average 1.4838709677419355) internal successors, (92), 85 states have internal predecessors, (92), 4 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (5), 5 states have call predecessors, (5), 4 states have call successors, (5) [2024-11-07 16:35:15,586 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 101 transitions. [2024-11-07 16:35:15,586 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 101 transitions. Word has length 16 [2024-11-07 16:35:15,586 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 16:35:15,586 INFO L471 AbstractCegarLoop]: Abstraction has 93 states and 101 transitions. [2024-11-07 16:35:15,586 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, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-07 16:35:15,586 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 101 transitions. [2024-11-07 16:35:15,587 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2024-11-07 16:35:15,587 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 16:35:15,587 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 16:35:15,592 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Ended with exit code 0 [2024-11-07 16:35:15,787 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-07 16:35:15,787 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ldv_kobject_putErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [LDV_INIT_LIST_HEADErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, LDV_INIT_LIST_HEADErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, LDV_INIT_LIST_HEADErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 22 more)] === [2024-11-07 16:35:15,788 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 16:35:15,788 INFO L85 PathProgramCache]: Analyzing trace with hash 1046509865, now seen corresponding path program 1 times [2024-11-07 16:35:15,788 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-07 16:35:15,788 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [29998955] [2024-11-07 16:35:15,788 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 16:35:15,788 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-07 16:35:15,788 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-07 16:35:15,791 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-07 16:35:15,792 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Waiting until timeout for monitored process [2024-11-07 16:35:15,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 16:35:15,839 INFO L255 TraceCheckSpWp]: Trace formula consists of 81 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-11-07 16:35:15,840 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 16:35:15,930 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 16:35:15,934 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-07 16:35:15,934 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-07 16:35:15,934 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [29998955] [2024-11-07 16:35:15,934 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [29998955] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 16:35:15,934 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 16:35:15,934 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-07 16:35:15,934 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1276467423] [2024-11-07 16:35:15,934 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 16:35:15,935 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-07 16:35:15,935 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-07 16:35:15,935 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-07 16:35:15,935 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-07 16:35:15,935 INFO L87 Difference]: Start difference. First operand 93 states and 101 transitions. Second operand has 6 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 5 states have internal predecessors, (14), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-07 16:35:16,005 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 16:35:16,005 INFO L93 Difference]: Finished difference Result 102 states and 111 transitions. [2024-11-07 16:35:16,009 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-07 16:35:16,009 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 5 states have internal predecessors, (14), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 17 [2024-11-07 16:35:16,009 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 16:35:16,010 INFO L225 Difference]: With dead ends: 102 [2024-11-07 16:35:16,010 INFO L226 Difference]: Without dead ends: 102 [2024-11-07 16:35:16,010 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-11-07 16:35:16,010 INFO L432 NwaCegarLoop]: 90 mSDtfsCounter, 3 mSDsluCounter, 355 mSDsCounter, 0 mSdLazyCounter, 29 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 445 SdHoareTripleChecker+Invalid, 30 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 29 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-07 16:35:16,010 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 445 Invalid, 30 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 29 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 16:35:16,011 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2024-11-07 16:35:16,014 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 101. [2024-11-07 16:35:16,017 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 101 states, 67 states have (on average 1.4477611940298507) internal successors, (97), 91 states have internal predecessors, (97), 6 states have call successors, (6), 4 states have call predecessors, (6), 5 states have return successors, (7), 6 states have call predecessors, (7), 6 states have call successors, (7) [2024-11-07 16:35:16,018 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 110 transitions. [2024-11-07 16:35:16,018 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 110 transitions. Word has length 17 [2024-11-07 16:35:16,018 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 16:35:16,018 INFO L471 AbstractCegarLoop]: Abstraction has 101 states and 110 transitions. [2024-11-07 16:35:16,018 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 5 states have internal predecessors, (14), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-07 16:35:16,018 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 110 transitions. [2024-11-07 16:35:16,018 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2024-11-07 16:35:16,018 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 16:35:16,018 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 16:35:16,025 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Ended with exit code 0 [2024-11-07 16:35:16,221 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-07 16:35:16,221 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [LDV_INIT_LIST_HEADErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, LDV_INIT_LIST_HEADErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, LDV_INIT_LIST_HEADErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 22 more)] === [2024-11-07 16:35:16,222 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 16:35:16,222 INFO L85 PathProgramCache]: Analyzing trace with hash -669734230, now seen corresponding path program 1 times [2024-11-07 16:35:16,222 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-07 16:35:16,222 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [813850212] [2024-11-07 16:35:16,223 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 16:35:16,224 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-07 16:35:16,224 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-07 16:35:16,225 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-07 16:35:16,227 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Waiting until timeout for monitored process [2024-11-07 16:35:16,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 16:35:16,276 INFO L255 TraceCheckSpWp]: Trace formula consists of 74 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-07 16:35:16,277 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 16:35:16,304 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 16:35:16,304 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-07 16:35:16,341 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 16:35:16,341 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-07 16:35:16,341 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [813850212] [2024-11-07 16:35:16,341 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [813850212] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-07 16:35:16,341 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-07 16:35:16,341 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 8 [2024-11-07 16:35:16,341 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [389209012] [2024-11-07 16:35:16,341 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-07 16:35:16,341 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-07 16:35:16,342 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-07 16:35:16,342 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-07 16:35:16,342 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2024-11-07 16:35:16,342 INFO L87 Difference]: Start difference. First operand 101 states and 110 transitions. Second operand has 8 states, 8 states have (on average 2.5) internal successors, (20), 8 states have internal predecessors, (20), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-07 16:35:16,382 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 16:35:16,382 INFO L93 Difference]: Finished difference Result 104 states and 113 transitions. [2024-11-07 16:35:16,382 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-07 16:35:16,382 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.5) internal successors, (20), 8 states have internal predecessors, (20), 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 17 [2024-11-07 16:35:16,382 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 16:35:16,383 INFO L225 Difference]: With dead ends: 104 [2024-11-07 16:35:16,383 INFO L226 Difference]: Without dead ends: 104 [2024-11-07 16:35:16,384 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2024-11-07 16:35:16,384 INFO L432 NwaCegarLoop]: 92 mSDtfsCounter, 4 mSDsluCounter, 359 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 451 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-07 16:35:16,384 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 451 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 16:35:16,384 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2024-11-07 16:35:16,387 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 104. [2024-11-07 16:35:16,387 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 104 states, 70 states have (on average 1.4285714285714286) internal successors, (100), 94 states have internal predecessors, (100), 6 states have call successors, (6), 4 states have call predecessors, (6), 5 states have return successors, (7), 6 states have call predecessors, (7), 6 states have call successors, (7) [2024-11-07 16:35:16,387 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 113 transitions. [2024-11-07 16:35:16,387 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 113 transitions. Word has length 17 [2024-11-07 16:35:16,388 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 16:35:16,388 INFO L471 AbstractCegarLoop]: Abstraction has 104 states and 113 transitions. [2024-11-07 16:35:16,388 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 2.5) internal successors, (20), 8 states have internal predecessors, (20), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-07 16:35:16,388 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 113 transitions. [2024-11-07 16:35:16,388 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2024-11-07 16:35:16,392 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 16:35:16,392 INFO L215 NwaCegarLoop]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 16:35:16,395 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Forceful destruction successful, exit code 0 [2024-11-07 16:35:16,592 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-07 16:35:16,593 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [LDV_INIT_LIST_HEADErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, LDV_INIT_LIST_HEADErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, LDV_INIT_LIST_HEADErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 22 more)] === [2024-11-07 16:35:16,593 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 16:35:16,593 INFO L85 PathProgramCache]: Analyzing trace with hash -644065411, now seen corresponding path program 2 times [2024-11-07 16:35:16,593 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-07 16:35:16,593 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [297022373] [2024-11-07 16:35:16,593 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-07 16:35:16,593 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-07 16:35:16,593 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-07 16:35:16,599 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-07 16:35:16,600 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Waiting until timeout for monitored process [2024-11-07 16:35:16,671 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2024-11-07 16:35:16,671 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-07 16:35:16,671 INFO L255 TraceCheckSpWp]: Trace formula consists of 63 conjuncts, 12 conjuncts are in the unsatisfiable core [2024-11-07 16:35:16,673 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 16:35:16,679 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2024-11-07 16:35:16,753 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2024-11-07 16:35:16,754 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-07 16:35:16,754 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-07 16:35:16,754 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [297022373] [2024-11-07 16:35:16,754 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [297022373] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 16:35:16,754 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 16:35:16,754 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-07 16:35:16,754 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [866103231] [2024-11-07 16:35:16,754 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 16:35:16,754 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-07 16:35:16,755 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-07 16:35:16,755 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-07 16:35:16,755 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-11-07 16:35:16,755 INFO L87 Difference]: Start difference. First operand 104 states and 113 transitions. Second operand has 8 states, 7 states have (on average 2.142857142857143) internal successors, (15), 7 states have internal predecessors, (15), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-07 16:35:16,988 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 16:35:16,988 INFO L93 Difference]: Finished difference Result 104 states and 113 transitions. [2024-11-07 16:35:16,989 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-07 16:35:16,989 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 2.142857142857143) internal successors, (15), 7 states have internal predecessors, (15), 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 20 [2024-11-07 16:35:16,989 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 16:35:16,989 INFO L225 Difference]: With dead ends: 104 [2024-11-07 16:35:16,989 INFO L226 Difference]: Without dead ends: 104 [2024-11-07 16:35:16,990 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2024-11-07 16:35:16,990 INFO L432 NwaCegarLoop]: 83 mSDtfsCounter, 13 mSDsluCounter, 336 mSDsCounter, 0 mSdLazyCounter, 221 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 419 SdHoareTripleChecker+Invalid, 223 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 221 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-07 16:35:16,990 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 419 Invalid, 223 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 221 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-07 16:35:16,990 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2024-11-07 16:35:16,993 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 103. [2024-11-07 16:35:16,993 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 103 states, 70 states have (on average 1.4142857142857144) internal successors, (99), 93 states have internal predecessors, (99), 6 states have call successors, (6), 4 states have call predecessors, (6), 5 states have return successors, (7), 6 states have call predecessors, (7), 6 states have call successors, (7) [2024-11-07 16:35:16,994 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 112 transitions. [2024-11-07 16:35:16,994 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 112 transitions. Word has length 20 [2024-11-07 16:35:16,994 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 16:35:16,994 INFO L471 AbstractCegarLoop]: Abstraction has 103 states and 112 transitions. [2024-11-07 16:35:16,994 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 2.142857142857143) internal successors, (15), 7 states have internal predecessors, (15), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-07 16:35:16,994 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 112 transitions. [2024-11-07 16:35:16,994 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2024-11-07 16:35:16,995 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 16:35:16,995 INFO L215 NwaCegarLoop]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 16:35:16,999 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Ended with exit code 0 [2024-11-07 16:35:17,198 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-07 16:35:17,198 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [LDV_INIT_LIST_HEADErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, LDV_INIT_LIST_HEADErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, LDV_INIT_LIST_HEADErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 22 more)] === [2024-11-07 16:35:17,199 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 16:35:17,199 INFO L85 PathProgramCache]: Analyzing trace with hash -644065410, now seen corresponding path program 1 times [2024-11-07 16:35:17,199 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-07 16:35:17,199 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1138826576] [2024-11-07 16:35:17,199 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 16:35:17,199 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-07 16:35:17,199 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-07 16:35:17,202 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-07 16:35:17,204 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Waiting until timeout for monitored process [2024-11-07 16:35:17,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 16:35:17,291 INFO L255 TraceCheckSpWp]: Trace formula consists of 107 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-11-07 16:35:17,292 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 16:35:17,375 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 16:35:17,376 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-07 16:35:17,505 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 16:35:17,505 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-07 16:35:17,505 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1138826576] [2024-11-07 16:35:17,505 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1138826576] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-07 16:35:17,505 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-07 16:35:17,505 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 14 [2024-11-07 16:35:17,505 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [734031517] [2024-11-07 16:35:17,505 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-07 16:35:17,505 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-11-07 16:35:17,505 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-07 16:35:17,505 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-11-07 16:35:17,506 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=121, Unknown=0, NotChecked=0, Total=182 [2024-11-07 16:35:17,506 INFO L87 Difference]: Start difference. First operand 103 states and 112 transitions. Second operand has 14 states, 14 states have (on average 1.8571428571428572) internal successors, (26), 14 states have internal predecessors, (26), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-07 16:35:17,762 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 16:35:17,762 INFO L93 Difference]: Finished difference Result 109 states and 118 transitions. [2024-11-07 16:35:17,763 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-07 16:35:17,764 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 1.8571428571428572) internal successors, (26), 14 states have internal predecessors, (26), 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 20 [2024-11-07 16:35:17,764 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 16:35:17,767 INFO L225 Difference]: With dead ends: 109 [2024-11-07 16:35:17,767 INFO L226 Difference]: Without dead ends: 109 [2024-11-07 16:35:17,767 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=131, Invalid=211, Unknown=0, NotChecked=0, Total=342 [2024-11-07 16:35:17,767 INFO L432 NwaCegarLoop]: 91 mSDtfsCounter, 14 mSDsluCounter, 533 mSDsCounter, 0 mSdLazyCounter, 54 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 624 SdHoareTripleChecker+Invalid, 55 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 54 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-07 16:35:17,768 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 624 Invalid, 55 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 54 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-07 16:35:17,768 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2024-11-07 16:35:17,770 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 109. [2024-11-07 16:35:17,770 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 109 states, 76 states have (on average 1.381578947368421) internal successors, (105), 99 states have internal predecessors, (105), 6 states have call successors, (6), 4 states have call predecessors, (6), 5 states have return successors, (7), 6 states have call predecessors, (7), 6 states have call successors, (7) [2024-11-07 16:35:17,774 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 118 transitions. [2024-11-07 16:35:17,774 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 118 transitions. Word has length 20 [2024-11-07 16:35:17,774 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 16:35:17,774 INFO L471 AbstractCegarLoop]: Abstraction has 109 states and 118 transitions. [2024-11-07 16:35:17,774 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 1.8571428571428572) internal successors, (26), 14 states have internal predecessors, (26), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-07 16:35:17,774 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 118 transitions. [2024-11-07 16:35:17,775 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2024-11-07 16:35:17,775 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 16:35:17,775 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 16:35:17,782 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Ended with exit code 0 [2024-11-07 16:35:17,975 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-07 16:35:17,975 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [LDV_INIT_LIST_HEADErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, LDV_INIT_LIST_HEADErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, LDV_INIT_LIST_HEADErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 22 more)] === [2024-11-07 16:35:17,976 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 16:35:17,976 INFO L85 PathProgramCache]: Analyzing trace with hash -590186857, now seen corresponding path program 1 times [2024-11-07 16:35:17,976 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-07 16:35:17,976 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2005275861] [2024-11-07 16:35:17,976 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 16:35:17,976 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-07 16:35:17,976 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-07 16:35:17,981 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-07 16:35:17,981 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (12)] Waiting until timeout for monitored process [2024-11-07 16:35:18,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 16:35:18,028 INFO L255 TraceCheckSpWp]: Trace formula consists of 77 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-07 16:35:18,029 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 16:35:18,058 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-07 16:35:18,058 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-07 16:35:18,058 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-07 16:35:18,059 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2005275861] [2024-11-07 16:35:18,059 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2005275861] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 16:35:18,059 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 16:35:18,059 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-07 16:35:18,059 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1198597782] [2024-11-07 16:35:18,059 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 16:35:18,059 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-07 16:35:18,059 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-07 16:35:18,059 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-07 16:35:18,059 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-07 16:35:18,059 INFO L87 Difference]: Start difference. First operand 109 states and 118 transitions. Second operand has 4 states, 3 states have (on average 5.333333333333333) internal successors, (16), 4 states have internal predecessors, (16), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-07 16:35:18,151 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 16:35:18,152 INFO L93 Difference]: Finished difference Result 115 states and 124 transitions. [2024-11-07 16:35:18,152 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-07 16:35:18,152 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 5.333333333333333) internal successors, (16), 4 states have internal predecessors, (16), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 25 [2024-11-07 16:35:18,152 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 16:35:18,153 INFO L225 Difference]: With dead ends: 115 [2024-11-07 16:35:18,153 INFO L226 Difference]: Without dead ends: 99 [2024-11-07 16:35:18,153 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-07 16:35:18,153 INFO L432 NwaCegarLoop]: 77 mSDtfsCounter, 31 mSDsluCounter, 99 mSDsCounter, 0 mSdLazyCounter, 73 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 176 SdHoareTripleChecker+Invalid, 76 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 73 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-07 16:35:18,153 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [31 Valid, 176 Invalid, 76 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 73 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-07 16:35:18,154 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2024-11-07 16:35:18,155 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 95. [2024-11-07 16:35:18,155 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 95 states, 66 states have (on average 1.4242424242424243) internal successors, (94), 88 states have internal predecessors, (94), 4 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2024-11-07 16:35:18,156 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 102 transitions. [2024-11-07 16:35:18,156 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 102 transitions. Word has length 25 [2024-11-07 16:35:18,156 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 16:35:18,156 INFO L471 AbstractCegarLoop]: Abstraction has 95 states and 102 transitions. [2024-11-07 16:35:18,156 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 5.333333333333333) internal successors, (16), 4 states have internal predecessors, (16), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-07 16:35:18,156 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 102 transitions. [2024-11-07 16:35:18,157 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2024-11-07 16:35:18,157 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 16:35:18,157 INFO L215 NwaCegarLoop]: trace histogram [10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 16:35:18,161 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (12)] Ended with exit code 0 [2024-11-07 16:35:18,357 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-07 16:35:18,358 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [LDV_INIT_LIST_HEADErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, LDV_INIT_LIST_HEADErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, LDV_INIT_LIST_HEADErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 22 more)] === [2024-11-07 16:35:18,358 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 16:35:18,358 INFO L85 PathProgramCache]: Analyzing trace with hash -1356949410, now seen corresponding path program 2 times [2024-11-07 16:35:18,358 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-07 16:35:18,359 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [577702005] [2024-11-07 16:35:18,359 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-07 16:35:18,359 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-07 16:35:18,359 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-07 16:35:18,361 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-07 16:35:18,363 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (13)] Waiting until timeout for monitored process [2024-11-07 16:35:18,448 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2024-11-07 16:35:18,448 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-07 16:35:18,453 INFO L255 TraceCheckSpWp]: Trace formula consists of 63 conjuncts, 23 conjuncts are in the unsatisfiable core [2024-11-07 16:35:18,455 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 16:35:18,467 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-07 16:35:18,719 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2024-11-07 16:35:18,719 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-07 16:35:18,719 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-07 16:35:18,721 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [577702005] [2024-11-07 16:35:18,721 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [577702005] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 16:35:18,721 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 16:35:18,721 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-07 16:35:18,721 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1721466170] [2024-11-07 16:35:18,721 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 16:35:18,721 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-07 16:35:18,721 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-07 16:35:18,721 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-07 16:35:18,721 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2024-11-07 16:35:18,721 INFO L87 Difference]: Start difference. First operand 95 states and 102 transitions. Second operand has 9 states, 8 states have (on average 1.875) internal successors, (15), 8 states have internal predecessors, (15), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-07 16:35:19,083 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 16:35:19,084 INFO L93 Difference]: Finished difference Result 95 states and 102 transitions. [2024-11-07 16:35:19,084 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-07 16:35:19,084 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 1.875) internal successors, (15), 8 states have internal predecessors, (15), 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 26 [2024-11-07 16:35:19,084 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 16:35:19,084 INFO L225 Difference]: With dead ends: 95 [2024-11-07 16:35:19,084 INFO L226 Difference]: Without dead ends: 95 [2024-11-07 16:35:19,085 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2024-11-07 16:35:19,085 INFO L432 NwaCegarLoop]: 80 mSDtfsCounter, 11 mSDsluCounter, 439 mSDsCounter, 0 mSdLazyCounter, 190 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 519 SdHoareTripleChecker+Invalid, 192 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 190 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-07 16:35:19,085 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 519 Invalid, 192 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 190 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-07 16:35:19,085 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2024-11-07 16:35:19,087 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 94. [2024-11-07 16:35:19,087 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 94 states, 66 states have (on average 1.4090909090909092) internal successors, (93), 87 states have internal predecessors, (93), 4 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2024-11-07 16:35:19,087 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 101 transitions. [2024-11-07 16:35:19,087 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 101 transitions. Word has length 26 [2024-11-07 16:35:19,087 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 16:35:19,087 INFO L471 AbstractCegarLoop]: Abstraction has 94 states and 101 transitions. [2024-11-07 16:35:19,087 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 1.875) internal successors, (15), 8 states have internal predecessors, (15), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-07 16:35:19,087 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 101 transitions. [2024-11-07 16:35:19,088 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2024-11-07 16:35:19,088 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 16:35:19,088 INFO L215 NwaCegarLoop]: trace histogram [10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 16:35:19,092 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (13)] Forceful destruction successful, exit code 0 [2024-11-07 16:35:19,290 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-07 16:35:19,291 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [LDV_INIT_LIST_HEADErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, LDV_INIT_LIST_HEADErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, LDV_INIT_LIST_HEADErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 22 more)] === [2024-11-07 16:35:19,292 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 16:35:19,292 INFO L85 PathProgramCache]: Analyzing trace with hash 1640168925, now seen corresponding path program 1 times [2024-11-07 16:35:19,292 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-07 16:35:19,292 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1227948002] [2024-11-07 16:35:19,292 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 16:35:19,292 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-07 16:35:19,292 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-07 16:35:19,294 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-07 16:35:19,296 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (14)] Waiting until timeout for monitored process [2024-11-07 16:35:19,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 16:35:19,373 INFO L255 TraceCheckSpWp]: Trace formula consists of 184 conjuncts, 13 conjuncts are in the unsatisfiable core [2024-11-07 16:35:19,374 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 16:35:19,551 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 16:35:19,551 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-07 16:35:19,822 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 16:35:19,822 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-07 16:35:19,822 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1227948002] [2024-11-07 16:35:19,822 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1227948002] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-07 16:35:19,822 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-07 16:35:19,822 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 26 [2024-11-07 16:35:19,822 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [725834421] [2024-11-07 16:35:19,822 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-07 16:35:19,823 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2024-11-07 16:35:19,823 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-07 16:35:19,823 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2024-11-07 16:35:19,824 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=178, Invalid=472, Unknown=0, NotChecked=0, Total=650 [2024-11-07 16:35:19,824 INFO L87 Difference]: Start difference. First operand 94 states and 101 transitions. Second operand has 26 states, 26 states have (on average 1.5384615384615385) internal successors, (40), 26 states have internal predecessors, (40), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-07 16:35:20,123 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 16:35:20,123 INFO L93 Difference]: Finished difference Result 100 states and 107 transitions. [2024-11-07 16:35:20,123 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2024-11-07 16:35:20,124 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 26 states have (on average 1.5384615384615385) internal successors, (40), 26 states have internal predecessors, (40), 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 28 [2024-11-07 16:35:20,124 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 16:35:20,124 INFO L225 Difference]: With dead ends: 100 [2024-11-07 16:35:20,124 INFO L226 Difference]: Without dead ends: 100 [2024-11-07 16:35:20,125 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 193 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=278, Invalid=652, Unknown=0, NotChecked=0, Total=930 [2024-11-07 16:35:20,125 INFO L432 NwaCegarLoop]: 88 mSDtfsCounter, 7 mSDsluCounter, 1116 mSDsCounter, 0 mSdLazyCounter, 147 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 1204 SdHoareTripleChecker+Invalid, 147 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 147 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-07 16:35:20,125 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 1204 Invalid, 147 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 147 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-07 16:35:20,125 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2024-11-07 16:35:20,127 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 100. [2024-11-07 16:35:20,127 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 100 states, 72 states have (on average 1.375) internal successors, (99), 93 states have internal predecessors, (99), 4 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2024-11-07 16:35:20,127 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 107 transitions. [2024-11-07 16:35:20,127 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 107 transitions. Word has length 28 [2024-11-07 16:35:20,127 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 16:35:20,128 INFO L471 AbstractCegarLoop]: Abstraction has 100 states and 107 transitions. [2024-11-07 16:35:20,128 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 26 states have (on average 1.5384615384615385) internal successors, (40), 26 states have internal predecessors, (40), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-07 16:35:20,128 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 107 transitions. [2024-11-07 16:35:20,128 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2024-11-07 16:35:20,128 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 16:35:20,128 INFO L215 NwaCegarLoop]: trace histogram [16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 16:35:20,132 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (14)] Ended with exit code 0 [2024-11-07 16:35:20,329 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-07 16:35:20,329 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [LDV_INIT_LIST_HEADErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, LDV_INIT_LIST_HEADErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, LDV_INIT_LIST_HEADErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 22 more)] === [2024-11-07 16:35:20,329 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 16:35:20,330 INFO L85 PathProgramCache]: Analyzing trace with hash 1827036861, now seen corresponding path program 2 times [2024-11-07 16:35:20,330 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-07 16:35:20,330 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [42023031] [2024-11-07 16:35:20,330 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-07 16:35:20,330 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-07 16:35:20,330 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-07 16:35:20,333 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-07 16:35:20,338 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (15)] Waiting until timeout for monitored process [2024-11-07 16:35:20,403 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2024-11-07 16:35:20,404 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-07 16:35:20,406 INFO L255 TraceCheckSpWp]: Trace formula consists of 74 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-07 16:35:20,407 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 16:35:20,461 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2024-11-07 16:35:20,461 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-07 16:35:20,461 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-07 16:35:20,461 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [42023031] [2024-11-07 16:35:20,461 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [42023031] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 16:35:20,461 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 16:35:20,461 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-07 16:35:20,461 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1890601319] [2024-11-07 16:35:20,461 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 16:35:20,462 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-07 16:35:20,465 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-07 16:35:20,465 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-07 16:35:20,465 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-07 16:35:20,466 INFO L87 Difference]: Start difference. First operand 100 states and 107 transitions. Second operand has 6 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 5 states have internal predecessors, (17), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-07 16:35:20,496 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 16:35:20,497 INFO L93 Difference]: Finished difference Result 100 states and 106 transitions. [2024-11-07 16:35:20,500 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-07 16:35:20,500 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 5 states have internal predecessors, (17), 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 34 [2024-11-07 16:35:20,501 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 16:35:20,501 INFO L225 Difference]: With dead ends: 100 [2024-11-07 16:35:20,501 INFO L226 Difference]: Without dead ends: 100 [2024-11-07 16:35:20,501 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-11-07 16:35:20,501 INFO L432 NwaCegarLoop]: 85 mSDtfsCounter, 7 mSDsluCounter, 323 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 408 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-07 16:35:20,502 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 408 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 16:35:20,502 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2024-11-07 16:35:20,503 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 100. [2024-11-07 16:35:20,503 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 100 states, 72 states have (on average 1.3611111111111112) internal successors, (98), 93 states have internal predecessors, (98), 4 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2024-11-07 16:35:20,503 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 106 transitions. [2024-11-07 16:35:20,504 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 106 transitions. Word has length 34 [2024-11-07 16:35:20,504 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 16:35:20,504 INFO L471 AbstractCegarLoop]: Abstraction has 100 states and 106 transitions. [2024-11-07 16:35:20,504 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 5 states have internal predecessors, (17), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-07 16:35:20,504 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 106 transitions. [2024-11-07 16:35:20,504 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2024-11-07 16:35:20,504 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 16:35:20,504 INFO L215 NwaCegarLoop]: trace histogram [16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 16:35:20,511 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (15)] Ended with exit code 0 [2024-11-07 16:35:20,711 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-07 16:35:20,711 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting LDV_INIT_LIST_HEADErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [LDV_INIT_LIST_HEADErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, LDV_INIT_LIST_HEADErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, LDV_INIT_LIST_HEADErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 22 more)] === [2024-11-07 16:35:20,712 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 16:35:20,712 INFO L85 PathProgramCache]: Analyzing trace with hash 589502054, now seen corresponding path program 1 times [2024-11-07 16:35:20,715 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-07 16:35:20,715 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1862772399] [2024-11-07 16:35:20,715 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 16:35:20,715 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-07 16:35:20,715 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-07 16:35:20,717 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-07 16:35:20,718 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (16)] Waiting until timeout for monitored process [2024-11-07 16:35:20,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 16:35:20,838 INFO L255 TraceCheckSpWp]: Trace formula consists of 272 conjuncts, 12 conjuncts are in the unsatisfiable core [2024-11-07 16:35:20,839 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 16:35:20,842 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2024-11-07 16:35:20,920 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2024-11-07 16:35:20,920 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-07 16:35:20,920 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-07 16:35:20,920 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1862772399] [2024-11-07 16:35:20,920 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1862772399] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 16:35:20,921 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 16:35:20,921 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-07 16:35:20,921 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [452919750] [2024-11-07 16:35:20,921 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 16:35:20,921 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-07 16:35:20,921 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-07 16:35:20,921 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-07 16:35:20,921 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2024-11-07 16:35:20,921 INFO L87 Difference]: Start difference. First operand 100 states and 106 transitions. Second operand has 9 states, 8 states have (on average 2.25) internal successors, (18), 7 states have internal predecessors, (18), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-07 16:35:21,154 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 16:35:21,154 INFO L93 Difference]: Finished difference Result 99 states and 105 transitions. [2024-11-07 16:35:21,154 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-07 16:35:21,155 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 2.25) internal successors, (18), 7 states have internal predecessors, (18), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 36 [2024-11-07 16:35:21,155 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 16:35:21,155 INFO L225 Difference]: With dead ends: 99 [2024-11-07 16:35:21,155 INFO L226 Difference]: Without dead ends: 99 [2024-11-07 16:35:21,155 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2024-11-07 16:35:21,156 INFO L432 NwaCegarLoop]: 73 mSDtfsCounter, 14 mSDsluCounter, 359 mSDsCounter, 0 mSdLazyCounter, 247 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 432 SdHoareTripleChecker+Invalid, 250 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 247 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-07 16:35:21,156 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 432 Invalid, 250 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 247 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-07 16:35:21,156 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2024-11-07 16:35:21,157 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 98. [2024-11-07 16:35:21,157 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 98 states, 72 states have (on average 1.3333333333333333) internal successors, (96), 91 states have internal predecessors, (96), 4 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2024-11-07 16:35:21,157 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 104 transitions. [2024-11-07 16:35:21,158 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 104 transitions. Word has length 36 [2024-11-07 16:35:21,158 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 16:35:21,158 INFO L471 AbstractCegarLoop]: Abstraction has 98 states and 104 transitions. [2024-11-07 16:35:21,158 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 2.25) internal successors, (18), 7 states have internal predecessors, (18), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-07 16:35:21,158 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 104 transitions. [2024-11-07 16:35:21,158 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2024-11-07 16:35:21,158 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 16:35:21,158 INFO L215 NwaCegarLoop]: trace histogram [16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 16:35:21,165 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (16)] Ended with exit code 0 [2024-11-07 16:35:21,362 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-07 16:35:21,363 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting LDV_INIT_LIST_HEADErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [LDV_INIT_LIST_HEADErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, LDV_INIT_LIST_HEADErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, LDV_INIT_LIST_HEADErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 22 more)] === [2024-11-07 16:35:21,363 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 16:35:21,363 INFO L85 PathProgramCache]: Analyzing trace with hash 589502055, now seen corresponding path program 1 times [2024-11-07 16:35:21,364 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-07 16:35:21,364 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [349390668] [2024-11-07 16:35:21,364 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 16:35:21,364 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-07 16:35:21,364 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-07 16:35:21,367 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-07 16:35:21,368 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (17)] Waiting until timeout for monitored process [2024-11-07 16:35:21,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 16:35:21,493 INFO L255 TraceCheckSpWp]: Trace formula consists of 272 conjuncts, 23 conjuncts are in the unsatisfiable core [2024-11-07 16:35:21,495 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 16:35:21,502 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-07 16:35:21,657 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2024-11-07 16:35:21,658 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-07 16:35:21,658 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-07 16:35:21,658 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [349390668] [2024-11-07 16:35:21,658 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [349390668] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 16:35:21,658 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 16:35:21,658 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-07 16:35:21,658 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1298211780] [2024-11-07 16:35:21,658 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 16:35:21,658 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-07 16:35:21,658 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-07 16:35:21,658 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-07 16:35:21,658 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2024-11-07 16:35:21,659 INFO L87 Difference]: Start difference. First operand 98 states and 104 transitions. Second operand has 10 states, 9 states have (on average 2.0) internal successors, (18), 8 states have internal predecessors, (18), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-07 16:35:21,904 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 16:35:21,904 INFO L93 Difference]: Finished difference Result 97 states and 103 transitions. [2024-11-07 16:35:21,904 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-07 16:35:21,904 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 2.0) internal successors, (18), 8 states have internal predecessors, (18), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 36 [2024-11-07 16:35:21,905 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 16:35:21,905 INFO L225 Difference]: With dead ends: 97 [2024-11-07 16:35:21,905 INFO L226 Difference]: Without dead ends: 97 [2024-11-07 16:35:21,905 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=29, Invalid=127, Unknown=0, NotChecked=0, Total=156 [2024-11-07 16:35:21,905 INFO L432 NwaCegarLoop]: 72 mSDtfsCounter, 12 mSDsluCounter, 473 mSDsCounter, 0 mSdLazyCounter, 206 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 545 SdHoareTripleChecker+Invalid, 209 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 206 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-07 16:35:21,906 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 545 Invalid, 209 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 206 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-07 16:35:21,906 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2024-11-07 16:35:21,907 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 96. [2024-11-07 16:35:21,907 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 96 states, 72 states have (on average 1.3055555555555556) internal successors, (94), 89 states have internal predecessors, (94), 4 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2024-11-07 16:35:21,907 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 102 transitions. [2024-11-07 16:35:21,907 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 102 transitions. Word has length 36 [2024-11-07 16:35:21,908 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 16:35:21,908 INFO L471 AbstractCegarLoop]: Abstraction has 96 states and 102 transitions. [2024-11-07 16:35:21,908 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 2.0) internal successors, (18), 8 states have internal predecessors, (18), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-07 16:35:21,908 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 102 transitions. [2024-11-07 16:35:21,908 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2024-11-07 16:35:21,908 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 16:35:21,908 INFO L215 NwaCegarLoop]: trace histogram [16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 16:35:21,913 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (17)] Ended with exit code 0 [2024-11-07 16:35:22,108 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 16:35:22,108 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [LDV_INIT_LIST_HEADErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, LDV_INIT_LIST_HEADErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, LDV_INIT_LIST_HEADErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 22 more)] === [2024-11-07 16:35:22,109 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 16:35:22,109 INFO L85 PathProgramCache]: Analyzing trace with hash 538860073, now seen corresponding path program 1 times [2024-11-07 16:35:22,109 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-07 16:35:22,109 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [513703597] [2024-11-07 16:35:22,109 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 16:35:22,109 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-07 16:35:22,110 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-07 16:35:22,111 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 16:35:22,113 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 16:35:22,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 16:35:22,237 INFO L255 TraceCheckSpWp]: Trace formula consists of 256 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-07 16:35:22,238 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 16:35:22,319 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2024-11-07 16:35:22,320 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-07 16:35:22,320 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-07 16:35:22,320 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [513703597] [2024-11-07 16:35:22,320 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [513703597] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 16:35:22,321 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 16:35:22,321 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-07 16:35:22,321 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [639510834] [2024-11-07 16:35:22,321 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 16:35:22,321 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-07 16:35:22,322 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-07 16:35:22,322 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-07 16:35:22,322 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-07 16:35:22,322 INFO L87 Difference]: Start difference. First operand 96 states and 102 transitions. Second operand has 7 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 6 states have internal predecessors, (19), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-07 16:35:22,369 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 16:35:22,370 INFO L93 Difference]: Finished difference Result 96 states and 101 transitions. [2024-11-07 16:35:22,373 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-07 16:35:22,373 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 6 states have internal predecessors, (19), 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 36 [2024-11-07 16:35:22,374 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 16:35:22,376 INFO L225 Difference]: With dead ends: 96 [2024-11-07 16:35:22,376 INFO L226 Difference]: Without dead ends: 96 [2024-11-07 16:35:22,376 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2024-11-07 16:35:22,376 INFO L432 NwaCegarLoop]: 79 mSDtfsCounter, 9 mSDsluCounter, 376 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 455 SdHoareTripleChecker+Invalid, 35 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 33 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-07 16:35:22,376 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 455 Invalid, 35 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 16:35:22,377 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2024-11-07 16:35:22,378 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 96. [2024-11-07 16:35:22,378 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 96 states, 72 states have (on average 1.2916666666666667) internal successors, (93), 88 states have internal predecessors, (93), 4 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2024-11-07 16:35:22,379 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 101 transitions. [2024-11-07 16:35:22,379 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 101 transitions. Word has length 36 [2024-11-07 16:35:22,379 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 16:35:22,379 INFO L471 AbstractCegarLoop]: Abstraction has 96 states and 101 transitions. [2024-11-07 16:35:22,379 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 6 states have internal predecessors, (19), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-07 16:35:22,380 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 101 transitions. [2024-11-07 16:35:22,380 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2024-11-07 16:35:22,380 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 16:35:22,380 INFO L215 NwaCegarLoop]: trace histogram [16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 16:35:22,387 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 16:35:22,581 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 16:35:22,581 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [LDV_INIT_LIST_HEADErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, LDV_INIT_LIST_HEADErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, LDV_INIT_LIST_HEADErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 22 more)] === [2024-11-07 16:35:22,581 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 16:35:22,581 INFO L85 PathProgramCache]: Analyzing trace with hash -1073517498, now seen corresponding path program 1 times [2024-11-07 16:35:22,582 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-07 16:35:22,582 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [668394795] [2024-11-07 16:35:22,582 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 16:35:22,582 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-07 16:35:22,582 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-07 16:35:22,584 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-07 16:35:22,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 (19)] Waiting until timeout for monitored process [2024-11-07 16:35:22,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 16:35:22,735 INFO L255 TraceCheckSpWp]: Trace formula consists of 320 conjuncts, 14 conjuncts are in the unsatisfiable core [2024-11-07 16:35:22,737 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 16:35:22,742 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2024-11-07 16:35:22,914 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2024-11-07 16:35:22,914 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-07 16:35:22,914 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-07 16:35:22,914 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [668394795] [2024-11-07 16:35:22,914 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [668394795] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 16:35:22,914 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 16:35:22,914 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-07 16:35:22,915 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1673412870] [2024-11-07 16:35:22,915 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 16:35:22,915 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-07 16:35:22,915 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-07 16:35:22,915 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-07 16:35:22,915 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2024-11-07 16:35:22,915 INFO L87 Difference]: Start difference. First operand 96 states and 101 transitions. Second operand has 9 states, 8 states have (on average 3.125) internal successors, (25), 8 states have internal predecessors, (25), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-07 16:35:23,258 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 16:35:23,258 INFO L93 Difference]: Finished difference Result 107 states and 115 transitions. [2024-11-07 16:35:23,259 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-07 16:35:23,259 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 3.125) internal successors, (25), 8 states have internal predecessors, (25), 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 44 [2024-11-07 16:35:23,259 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 16:35:23,259 INFO L225 Difference]: With dead ends: 107 [2024-11-07 16:35:23,259 INFO L226 Difference]: Without dead ends: 107 [2024-11-07 16:35:23,259 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 35 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2024-11-07 16:35:23,260 INFO L432 NwaCegarLoop]: 57 mSDtfsCounter, 57 mSDsluCounter, 228 mSDsCounter, 0 mSdLazyCounter, 237 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 57 SdHoareTripleChecker+Valid, 285 SdHoareTripleChecker+Invalid, 240 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 237 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-07 16:35:23,260 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [57 Valid, 285 Invalid, 240 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 237 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-07 16:35:23,260 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2024-11-07 16:35:23,261 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 94. [2024-11-07 16:35:23,262 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 94 states, 72 states have (on average 1.2638888888888888) internal successors, (91), 86 states have internal predecessors, (91), 4 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2024-11-07 16:35:23,262 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 99 transitions. [2024-11-07 16:35:23,262 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 99 transitions. Word has length 44 [2024-11-07 16:35:23,266 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 16:35:23,266 INFO L471 AbstractCegarLoop]: Abstraction has 94 states and 99 transitions. [2024-11-07 16:35:23,266 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 3.125) internal successors, (25), 8 states have internal predecessors, (25), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-07 16:35:23,266 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 99 transitions. [2024-11-07 16:35:23,266 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2024-11-07 16:35:23,267 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 16:35:23,267 INFO L215 NwaCegarLoop]: trace histogram [16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 16:35:23,277 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (19)] Ended with exit code 0 [2024-11-07 16:35:23,467 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-07 16:35:23,467 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [LDV_INIT_LIST_HEADErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, LDV_INIT_LIST_HEADErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, LDV_INIT_LIST_HEADErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 22 more)] === [2024-11-07 16:35:23,467 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 16:35:23,467 INFO L85 PathProgramCache]: Analyzing trace with hash -1073517497, now seen corresponding path program 1 times [2024-11-07 16:35:23,468 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-07 16:35:23,468 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [240022647] [2024-11-07 16:35:23,468 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 16:35:23,468 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-07 16:35:23,468 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-07 16:35:23,470 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-07 16:35:23,471 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (20)] Waiting until timeout for monitored process [2024-11-07 16:35:23,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 16:35:23,661 INFO L255 TraceCheckSpWp]: Trace formula consists of 320 conjuncts, 27 conjuncts are in the unsatisfiable core [2024-11-07 16:35:23,663 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 16:35:23,679 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-07 16:35:24,026 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2024-11-07 16:35:24,026 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-07 16:35:24,026 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-07 16:35:24,026 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [240022647] [2024-11-07 16:35:24,026 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [240022647] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 16:35:24,026 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 16:35:24,026 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-07 16:35:24,026 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1653171526] [2024-11-07 16:35:24,026 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 16:35:24,027 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-07 16:35:24,027 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-07 16:35:24,028 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-07 16:35:24,028 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2024-11-07 16:35:24,028 INFO L87 Difference]: Start difference. First operand 94 states and 99 transitions. Second operand has 10 states, 9 states have (on average 2.7777777777777777) internal successors, (25), 9 states have internal predecessors, (25), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-07 16:35:24,471 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 16:35:24,471 INFO L93 Difference]: Finished difference Result 92 states and 97 transitions. [2024-11-07 16:35:24,471 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-07 16:35:24,472 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 2.7777777777777777) internal successors, (25), 9 states have internal predecessors, (25), 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 44 [2024-11-07 16:35:24,472 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 16:35:24,472 INFO L225 Difference]: With dead ends: 92 [2024-11-07 16:35:24,472 INFO L226 Difference]: Without dead ends: 92 [2024-11-07 16:35:24,472 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 34 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2024-11-07 16:35:24,473 INFO L432 NwaCegarLoop]: 58 mSDtfsCounter, 61 mSDsluCounter, 345 mSDsCounter, 0 mSdLazyCounter, 209 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 61 SdHoareTripleChecker+Valid, 403 SdHoareTripleChecker+Invalid, 210 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 209 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-07 16:35:24,473 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [61 Valid, 403 Invalid, 210 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 209 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-07 16:35:24,473 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2024-11-07 16:35:24,474 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 92. [2024-11-07 16:35:24,474 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 92 states, 72 states have (on average 1.2361111111111112) internal successors, (89), 84 states have internal predecessors, (89), 4 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2024-11-07 16:35:24,474 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 97 transitions. [2024-11-07 16:35:24,474 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 97 transitions. Word has length 44 [2024-11-07 16:35:24,474 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 16:35:24,474 INFO L471 AbstractCegarLoop]: Abstraction has 92 states and 97 transitions. [2024-11-07 16:35:24,475 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 2.7777777777777777) internal successors, (25), 9 states have internal predecessors, (25), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-07 16:35:24,475 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 97 transitions. [2024-11-07 16:35:24,475 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2024-11-07 16:35:24,475 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 16:35:24,475 INFO L215 NwaCegarLoop]: trace histogram [16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 16:35:24,482 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 (20)] Forceful destruction successful, exit code 0 [2024-11-07 16:35:24,677 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 20 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-07 16:35:24,681 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ldv_kobject_putErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [LDV_INIT_LIST_HEADErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, LDV_INIT_LIST_HEADErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, LDV_INIT_LIST_HEADErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 22 more)] === [2024-11-07 16:35:24,681 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 16:35:24,681 INFO L85 PathProgramCache]: Analyzing trace with hash -1866262185, now seen corresponding path program 1 times [2024-11-07 16:35:24,682 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-07 16:35:24,682 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2139975641] [2024-11-07 16:35:24,682 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 16:35:24,682 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-07 16:35:24,682 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-07 16:35:24,684 INFO L229 MonitoredProcess]: Starting monitored process 21 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-07 16:35:24,686 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (21)] Waiting until timeout for monitored process [2024-11-07 16:35:24,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 16:35:24,843 INFO L255 TraceCheckSpWp]: Trace formula consists of 351 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-07 16:35:24,847 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 16:35:24,929 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2024-11-07 16:35:24,933 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-07 16:35:24,933 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-07 16:35:24,933 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2139975641] [2024-11-07 16:35:24,933 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2139975641] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 16:35:24,933 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 16:35:24,933 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-07 16:35:24,933 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1292539003] [2024-11-07 16:35:24,933 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 16:35:24,934 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-07 16:35:24,934 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-07 16:35:24,934 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-07 16:35:24,934 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-07 16:35:24,934 INFO L87 Difference]: Start difference. First operand 92 states and 97 transitions. Second operand has 7 states, 7 states have (on average 4.142857142857143) internal successors, (29), 6 states have internal predecessors, (29), 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 16:35:24,972 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 16:35:24,976 INFO L93 Difference]: Finished difference Result 92 states and 96 transitions. [2024-11-07 16:35:24,976 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-07 16:35:24,977 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 4.142857142857143) internal successors, (29), 6 states have internal predecessors, (29), 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 49 [2024-11-07 16:35:24,977 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 16:35:24,977 INFO L225 Difference]: With dead ends: 92 [2024-11-07 16:35:24,977 INFO L226 Difference]: Without dead ends: 92 [2024-11-07 16:35:24,977 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-07 16:35:24,978 INFO L432 NwaCegarLoop]: 73 mSDtfsCounter, 7 mSDsluCounter, 342 mSDsCounter, 0 mSdLazyCounter, 40 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 415 SdHoareTripleChecker+Invalid, 40 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 40 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-07 16:35:24,978 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 415 Invalid, 40 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 40 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 16:35:24,978 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2024-11-07 16:35:24,983 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 92. [2024-11-07 16:35:24,983 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 92 states, 72 states have (on average 1.2222222222222223) internal successors, (88), 84 states have internal predecessors, (88), 4 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2024-11-07 16:35:24,984 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 96 transitions. [2024-11-07 16:35:24,984 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 96 transitions. Word has length 49 [2024-11-07 16:35:24,984 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 16:35:24,984 INFO L471 AbstractCegarLoop]: Abstraction has 92 states and 96 transitions. [2024-11-07 16:35:24,984 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 4.142857142857143) internal successors, (29), 6 states have internal predecessors, (29), 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 16:35:24,984 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 96 transitions. [2024-11-07 16:35:24,984 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2024-11-07 16:35:24,984 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 16:35:24,984 INFO L215 NwaCegarLoop]: trace histogram [16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 16:35:24,992 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (21)] Ended with exit code 0 [2024-11-07 16:35:25,185 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-07 16:35:25,185 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ldv_kobject_putErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [LDV_INIT_LIST_HEADErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, LDV_INIT_LIST_HEADErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, LDV_INIT_LIST_HEADErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 22 more)] === [2024-11-07 16:35:25,186 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 16:35:25,186 INFO L85 PathProgramCache]: Analyzing trace with hash 145356145, now seen corresponding path program 1 times [2024-11-07 16:35:25,186 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-07 16:35:25,186 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1230572105] [2024-11-07 16:35:25,186 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 16:35:25,186 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-07 16:35:25,186 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-07 16:35:25,188 INFO L229 MonitoredProcess]: Starting monitored process 22 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-07 16:35:25,190 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (22)] Waiting until timeout for monitored process [2024-11-07 16:35:25,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 16:35:25,377 INFO L255 TraceCheckSpWp]: Trace formula consists of 391 conjuncts, 18 conjuncts are in the unsatisfiable core [2024-11-07 16:35:25,379 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 16:35:25,383 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2024-11-07 16:35:25,561 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2024-11-07 16:35:25,561 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-07 16:35:25,561 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-07 16:35:25,561 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1230572105] [2024-11-07 16:35:25,561 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1230572105] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 16:35:25,561 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 16:35:25,561 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-11-07 16:35:25,562 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2141873287] [2024-11-07 16:35:25,562 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 16:35:25,562 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-07 16:35:25,562 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-07 16:35:25,562 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-07 16:35:25,562 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2024-11-07 16:35:25,563 INFO L87 Difference]: Start difference. First operand 92 states and 96 transitions. Second operand has 11 states, 10 states have (on average 3.5) internal successors, (35), 9 states have internal predecessors, (35), 3 states have call successors, (3), 3 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 16:35:25,872 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 16:35:25,872 INFO L93 Difference]: Finished difference Result 124 states and 131 transitions. [2024-11-07 16:35:25,872 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-07 16:35:25,872 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 3.5) internal successors, (35), 9 states have internal predecessors, (35), 3 states have call successors, (3), 3 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 55 [2024-11-07 16:35:25,872 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 16:35:25,873 INFO L225 Difference]: With dead ends: 124 [2024-11-07 16:35:25,873 INFO L226 Difference]: Without dead ends: 124 [2024-11-07 16:35:25,873 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 44 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=37, Invalid=119, Unknown=0, NotChecked=0, Total=156 [2024-11-07 16:35:25,874 INFO L432 NwaCegarLoop]: 52 mSDtfsCounter, 71 mSDsluCounter, 312 mSDsCounter, 0 mSdLazyCounter, 316 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 71 SdHoareTripleChecker+Valid, 364 SdHoareTripleChecker+Invalid, 324 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 316 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-07 16:35:25,877 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [71 Valid, 364 Invalid, 324 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 316 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-07 16:35:25,877 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 124 states. [2024-11-07 16:35:25,879 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 124 to 108. [2024-11-07 16:35:25,880 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 108 states, 86 states have (on average 1.2209302325581395) internal successors, (105), 98 states have internal predecessors, (105), 5 states have call successors, (5), 4 states have call predecessors, (5), 5 states have return successors, (8), 5 states have call predecessors, (8), 5 states have call successors, (8) [2024-11-07 16:35:25,880 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 118 transitions. [2024-11-07 16:35:25,880 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 118 transitions. Word has length 55 [2024-11-07 16:35:25,880 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 16:35:25,880 INFO L471 AbstractCegarLoop]: Abstraction has 108 states and 118 transitions. [2024-11-07 16:35:25,881 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 3.5) internal successors, (35), 9 states have internal predecessors, (35), 3 states have call successors, (3), 3 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 16:35:25,881 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 118 transitions. [2024-11-07 16:35:25,881 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2024-11-07 16:35:25,881 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 16:35:25,881 INFO L215 NwaCegarLoop]: trace histogram [16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 16:35:25,890 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (22)] Ended with exit code 0 [2024-11-07 16:35:26,084 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 16:35:26,085 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ldv_kobject_putErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [LDV_INIT_LIST_HEADErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, LDV_INIT_LIST_HEADErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, LDV_INIT_LIST_HEADErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 22 more)] === [2024-11-07 16:35:26,085 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 16:35:26,085 INFO L85 PathProgramCache]: Analyzing trace with hash 145356146, now seen corresponding path program 1 times [2024-11-07 16:35:26,085 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-07 16:35:26,086 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [339580611] [2024-11-07 16:35:26,086 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 16:35:26,086 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-07 16:35:26,086 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-07 16:35:26,088 INFO L229 MonitoredProcess]: Starting monitored process 23 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-07 16:35:26,089 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (23)] Waiting until timeout for monitored process [2024-11-07 16:35:26,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 16:35:26,318 INFO L255 TraceCheckSpWp]: Trace formula consists of 391 conjuncts, 31 conjuncts are in the unsatisfiable core [2024-11-07 16:35:26,321 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 16:35:26,334 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-07 16:35:26,640 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2024-11-07 16:35:26,641 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-07 16:35:26,641 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-07 16:35:26,641 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [339580611] [2024-11-07 16:35:26,641 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [339580611] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 16:35:26,641 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 16:35:26,641 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-11-07 16:35:26,641 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1447547937] [2024-11-07 16:35:26,641 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 16:35:26,641 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-07 16:35:26,641 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-07 16:35:26,642 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-07 16:35:26,642 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=104, Unknown=0, NotChecked=0, Total=132 [2024-11-07 16:35:26,642 INFO L87 Difference]: Start difference. First operand 108 states and 118 transitions. Second operand has 12 states, 11 states have (on average 3.1818181818181817) internal successors, (35), 10 states have internal predecessors, (35), 3 states have call successors, (3), 3 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 16:35:26,939 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 16:35:26,939 INFO L93 Difference]: Finished difference Result 106 states and 114 transitions. [2024-11-07 16:35:26,940 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-07 16:35:26,940 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 3.1818181818181817) internal successors, (35), 10 states have internal predecessors, (35), 3 states have call successors, (3), 3 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 55 [2024-11-07 16:35:26,940 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 16:35:26,940 INFO L225 Difference]: With dead ends: 106 [2024-11-07 16:35:26,940 INFO L226 Difference]: Without dead ends: 106 [2024-11-07 16:35:26,940 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 43 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=38, Invalid=144, Unknown=0, NotChecked=0, Total=182 [2024-11-07 16:35:26,941 INFO L432 NwaCegarLoop]: 53 mSDtfsCounter, 72 mSDsluCounter, 372 mSDsCounter, 0 mSdLazyCounter, 238 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 74 SdHoareTripleChecker+Valid, 425 SdHoareTripleChecker+Invalid, 243 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 238 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-07 16:35:26,941 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [74 Valid, 425 Invalid, 243 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 238 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-07 16:35:26,942 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2024-11-07 16:35:26,945 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 106. [2024-11-07 16:35:26,945 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 106 states, 86 states have (on average 1.1744186046511629) internal successors, (101), 96 states have internal predecessors, (101), 5 states have call successors, (5), 4 states have call predecessors, (5), 5 states have return successors, (8), 5 states have call predecessors, (8), 5 states have call successors, (8) [2024-11-07 16:35:26,945 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 114 transitions. [2024-11-07 16:35:26,945 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 114 transitions. Word has length 55 [2024-11-07 16:35:26,945 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 16:35:26,945 INFO L471 AbstractCegarLoop]: Abstraction has 106 states and 114 transitions. [2024-11-07 16:35:26,945 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 3.1818181818181817) internal successors, (35), 10 states have internal predecessors, (35), 3 states have call successors, (3), 3 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 16:35:26,946 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 114 transitions. [2024-11-07 16:35:26,946 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2024-11-07 16:35:26,946 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 16:35:26,946 INFO L215 NwaCegarLoop]: trace histogram [16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 16:35:26,954 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (23)] Ended with exit code 0 [2024-11-07 16:35:27,146 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 16:35:27,146 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ldv_kobject_putErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [LDV_INIT_LIST_HEADErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, LDV_INIT_LIST_HEADErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, LDV_INIT_LIST_HEADErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 22 more)] === [2024-11-07 16:35:27,147 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 16:35:27,147 INFO L85 PathProgramCache]: Analyzing trace with hash -1143259211, now seen corresponding path program 1 times [2024-11-07 16:35:27,147 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-07 16:35:27,147 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [614359478] [2024-11-07 16:35:27,147 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 16:35:27,147 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-07 16:35:27,147 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-07 16:35:27,149 INFO L229 MonitoredProcess]: Starting monitored process 24 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-07 16:35:27,151 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (24)] Waiting until timeout for monitored process [2024-11-07 16:35:27,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 16:35:27,398 INFO L255 TraceCheckSpWp]: Trace formula consists of 438 conjuncts, 23 conjuncts are in the unsatisfiable core [2024-11-07 16:35:27,402 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 16:35:27,405 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2024-11-07 16:35:27,583 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2024-11-07 16:35:27,583 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-07 16:35:27,583 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-07 16:35:27,583 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [614359478] [2024-11-07 16:35:27,583 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [614359478] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 16:35:27,583 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 16:35:27,583 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-11-07 16:35:27,583 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [774672180] [2024-11-07 16:35:27,583 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 16:35:27,583 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-07 16:35:27,583 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-07 16:35:27,584 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-07 16:35:27,584 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2024-11-07 16:35:27,584 INFO L87 Difference]: Start difference. First operand 106 states and 114 transitions. Second operand has 12 states, 11 states have (on average 3.727272727272727) internal successors, (41), 10 states have internal predecessors, (41), 3 states have call successors, (3), 3 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 16:35:27,929 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 16:35:27,930 INFO L93 Difference]: Finished difference Result 117 states and 124 transitions. [2024-11-07 16:35:27,930 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-07 16:35:27,930 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 3.727272727272727) internal successors, (41), 10 states have internal predecessors, (41), 3 states have call successors, (3), 3 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 61 [2024-11-07 16:35:27,930 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 16:35:27,931 INFO L225 Difference]: With dead ends: 117 [2024-11-07 16:35:27,931 INFO L226 Difference]: Without dead ends: 117 [2024-11-07 16:35:27,931 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 49 SyntacticMatches, 1 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=45, Invalid=165, Unknown=0, NotChecked=0, Total=210 [2024-11-07 16:35:27,931 INFO L432 NwaCegarLoop]: 48 mSDtfsCounter, 48 mSDsluCounter, 312 mSDsCounter, 0 mSdLazyCounter, 359 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 48 SdHoareTripleChecker+Valid, 360 SdHoareTripleChecker+Invalid, 368 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 359 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-07 16:35:27,931 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [48 Valid, 360 Invalid, 368 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 359 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-07 16:35:27,932 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states. [2024-11-07 16:35:27,933 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 106. [2024-11-07 16:35:27,933 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 106 states, 87 states have (on average 1.1724137931034482) internal successors, (102), 96 states have internal predecessors, (102), 5 states have call successors, (5), 4 states have call predecessors, (5), 5 states have return successors, (8), 5 states have call predecessors, (8), 5 states have call successors, (8) [2024-11-07 16:35:27,934 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 115 transitions. [2024-11-07 16:35:27,934 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 115 transitions. Word has length 61 [2024-11-07 16:35:27,934 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 16:35:27,934 INFO L471 AbstractCegarLoop]: Abstraction has 106 states and 115 transitions. [2024-11-07 16:35:27,934 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 3.727272727272727) internal successors, (41), 10 states have internal predecessors, (41), 3 states have call successors, (3), 3 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 16:35:27,934 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 115 transitions. [2024-11-07 16:35:27,934 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2024-11-07 16:35:27,935 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 16:35:27,935 INFO L215 NwaCegarLoop]: trace histogram [16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 16:35:27,943 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 (24)] Ended with exit code 0 [2024-11-07 16:35:28,138 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 16:35:28,139 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ldv_kobject_putErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [LDV_INIT_LIST_HEADErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, LDV_INIT_LIST_HEADErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, LDV_INIT_LIST_HEADErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 22 more)] === [2024-11-07 16:35:28,139 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 16:35:28,140 INFO L85 PathProgramCache]: Analyzing trace with hash -1143259210, now seen corresponding path program 1 times [2024-11-07 16:35:28,140 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-07 16:35:28,140 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1452387078] [2024-11-07 16:35:28,140 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 16:35:28,140 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-07 16:35:28,140 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-07 16:35:28,143 INFO L229 MonitoredProcess]: Starting monitored process 25 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-07 16:35:28,144 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (25)] Waiting until timeout for monitored process [2024-11-07 16:35:28,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 16:35:28,390 INFO L255 TraceCheckSpWp]: Trace formula consists of 438 conjuncts, 41 conjuncts are in the unsatisfiable core [2024-11-07 16:35:28,393 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 16:35:28,403 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-07 16:35:28,686 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2024-11-07 16:35:28,686 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-07 16:35:28,686 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-07 16:35:28,686 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1452387078] [2024-11-07 16:35:28,686 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1452387078] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 16:35:28,687 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 16:35:28,687 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2024-11-07 16:35:28,687 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [576061953] [2024-11-07 16:35:28,687 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 16:35:28,687 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-11-07 16:35:28,687 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-07 16:35:28,687 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-11-07 16:35:28,687 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=125, Unknown=0, NotChecked=0, Total=156 [2024-11-07 16:35:28,687 INFO L87 Difference]: Start difference. First operand 106 states and 115 transitions. Second operand has 13 states, 12 states have (on average 3.4166666666666665) internal successors, (41), 11 states have internal predecessors, (41), 3 states have call successors, (3), 3 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 16:35:29,033 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 16:35:29,033 INFO L93 Difference]: Finished difference Result 104 states and 112 transitions. [2024-11-07 16:35:29,033 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-07 16:35:29,034 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 3.4166666666666665) internal successors, (41), 11 states have internal predecessors, (41), 3 states have call successors, (3), 3 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 61 [2024-11-07 16:35:29,034 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 16:35:29,034 INFO L225 Difference]: With dead ends: 104 [2024-11-07 16:35:29,034 INFO L226 Difference]: Without dead ends: 104 [2024-11-07 16:35:29,034 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 48 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=46, Invalid=194, Unknown=0, NotChecked=0, Total=240 [2024-11-07 16:35:29,035 INFO L432 NwaCegarLoop]: 49 mSDtfsCounter, 39 mSDsluCounter, 394 mSDsCounter, 0 mSdLazyCounter, 289 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 41 SdHoareTripleChecker+Valid, 443 SdHoareTripleChecker+Invalid, 293 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 289 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-07 16:35:29,035 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [41 Valid, 443 Invalid, 293 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 289 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-07 16:35:29,035 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2024-11-07 16:35:29,036 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 104. [2024-11-07 16:35:29,037 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 104 states, 87 states have (on average 1.1379310344827587) internal successors, (99), 94 states have internal predecessors, (99), 5 states have call successors, (5), 4 states have call predecessors, (5), 5 states have return successors, (8), 5 states have call predecessors, (8), 5 states have call successors, (8) [2024-11-07 16:35:29,037 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 112 transitions. [2024-11-07 16:35:29,037 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 112 transitions. Word has length 61 [2024-11-07 16:35:29,037 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 16:35:29,037 INFO L471 AbstractCegarLoop]: Abstraction has 104 states and 112 transitions. [2024-11-07 16:35:29,037 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 3.4166666666666665) internal successors, (41), 11 states have internal predecessors, (41), 3 states have call successors, (3), 3 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 16:35:29,037 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 112 transitions. [2024-11-07 16:35:29,038 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2024-11-07 16:35:29,038 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 16:35:29,038 INFO L215 NwaCegarLoop]: trace histogram [16, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 16:35:29,045 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (25)] Ended with exit code 0 [2024-11-07 16:35:29,238 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 16:35:29,238 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [LDV_INIT_LIST_HEADErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, LDV_INIT_LIST_HEADErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, LDV_INIT_LIST_HEADErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 22 more)] === [2024-11-07 16:35:29,239 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 16:35:29,239 INFO L85 PathProgramCache]: Analyzing trace with hash 656354015, now seen corresponding path program 1 times [2024-11-07 16:35:29,239 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-07 16:35:29,239 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2062482831] [2024-11-07 16:35:29,239 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 16:35:29,239 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-07 16:35:29,239 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-07 16:35:29,242 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 16:35:29,243 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 16:35:29,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 16:35:29,450 INFO L255 TraceCheckSpWp]: Trace formula consists of 387 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-07 16:35:29,452 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 16:35:29,525 INFO L134 CoverageAnalysis]: Checked inductivity of 140 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2024-11-07 16:35:29,525 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-07 16:35:29,525 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-07 16:35:29,525 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2062482831] [2024-11-07 16:35:29,525 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2062482831] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 16:35:29,525 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 16:35:29,525 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-07 16:35:29,525 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [667510031] [2024-11-07 16:35:29,525 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 16:35:29,525 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-07 16:35:29,526 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-07 16:35:29,526 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-07 16:35:29,526 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2024-11-07 16:35:29,527 INFO L87 Difference]: Start difference. First operand 104 states and 112 transitions. Second operand has 9 states, 9 states have (on average 4.444444444444445) internal successors, (40), 8 states have internal predecessors, (40), 4 states have call successors, (4), 2 states have call predecessors, (4), 4 states have return successors, (4), 3 states have call predecessors, (4), 4 states have call successors, (4) [2024-11-07 16:35:29,564 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 16:35:29,564 INFO L93 Difference]: Finished difference Result 108 states and 114 transitions. [2024-11-07 16:35:29,564 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-07 16:35:29,565 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 4.444444444444445) internal successors, (40), 8 states have internal predecessors, (40), 4 states have call successors, (4), 2 states have call predecessors, (4), 4 states have return successors, (4), 3 states have call predecessors, (4), 4 states have call successors, (4) Word has length 63 [2024-11-07 16:35:29,565 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 16:35:29,565 INFO L225 Difference]: With dead ends: 108 [2024-11-07 16:35:29,565 INFO L226 Difference]: Without dead ends: 104 [2024-11-07 16:35:29,565 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 55 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2024-11-07 16:35:29,566 INFO L432 NwaCegarLoop]: 67 mSDtfsCounter, 0 mSDsluCounter, 434 mSDsCounter, 0 mSdLazyCounter, 60 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 501 SdHoareTripleChecker+Invalid, 61 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 60 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-07 16:35:29,566 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 501 Invalid, 61 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 60 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 16:35:29,566 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2024-11-07 16:35:29,569 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 104. [2024-11-07 16:35:29,570 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 104 states, 87 states have (on average 1.1149425287356323) internal successors, (97), 94 states have internal predecessors, (97), 5 states have call successors, (5), 4 states have call predecessors, (5), 5 states have return successors, (8), 5 states have call predecessors, (8), 5 states have call successors, (8) [2024-11-07 16:35:29,571 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 110 transitions. [2024-11-07 16:35:29,571 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 110 transitions. Word has length 63 [2024-11-07 16:35:29,571 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 16:35:29,571 INFO L471 AbstractCegarLoop]: Abstraction has 104 states and 110 transitions. [2024-11-07 16:35:29,571 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 4.444444444444445) internal successors, (40), 8 states have internal predecessors, (40), 4 states have call successors, (4), 2 states have call predecessors, (4), 4 states have return successors, (4), 3 states have call predecessors, (4), 4 states have call successors, (4) [2024-11-07 16:35:29,571 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 110 transitions. [2024-11-07 16:35:29,571 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2024-11-07 16:35:29,571 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 16:35:29,571 INFO L215 NwaCegarLoop]: trace histogram [16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 16:35:29,584 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 (26)] Ended with exit code 0 [2024-11-07 16:35:29,772 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 16:35:29,772 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ldv_kobject_putErr7ASSERT_VIOLATIONMEMORY_FREE === [LDV_INIT_LIST_HEADErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, LDV_INIT_LIST_HEADErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, LDV_INIT_LIST_HEADErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 22 more)] === [2024-11-07 16:35:29,772 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 16:35:29,772 INFO L85 PathProgramCache]: Analyzing trace with hash 255500457, now seen corresponding path program 1 times [2024-11-07 16:35:29,773 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-07 16:35:29,773 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [998081635] [2024-11-07 16:35:29,773 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 16:35:29,773 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-07 16:35:29,773 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-07 16:35:29,776 INFO L229 MonitoredProcess]: Starting monitored process 27 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-07 16:35:29,777 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (27)] Waiting until timeout for monitored process [2024-11-07 16:35:30,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 16:35:30,216 INFO L255 TraceCheckSpWp]: Trace formula consists of 447 conjuncts, 21 conjuncts are in the unsatisfiable core [2024-11-07 16:35:30,219 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 16:35:30,580 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2024-11-07 16:35:30,580 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-07 16:35:30,581 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-07 16:35:30,581 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [998081635] [2024-11-07 16:35:30,581 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [998081635] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 16:35:30,581 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 16:35:30,581 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-11-07 16:35:30,581 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [587260336] [2024-11-07 16:35:30,581 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 16:35:30,581 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-11-07 16:35:30,581 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-07 16:35:30,582 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-11-07 16:35:30,582 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=114, Unknown=0, NotChecked=0, Total=156 [2024-11-07 16:35:30,582 INFO L87 Difference]: Start difference. First operand 104 states and 110 transitions. Second operand has 13 states, 12 states have (on average 3.6666666666666665) internal successors, (44), 10 states have internal predecessors, (44), 3 states have call successors, (3), 3 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 16:35:30,791 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 16:35:30,792 INFO L93 Difference]: Finished difference Result 103 states and 109 transitions. [2024-11-07 16:35:30,792 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-07 16:35:30,792 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 3.6666666666666665) internal successors, (44), 10 states have internal predecessors, (44), 3 states have call successors, (3), 3 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 64 [2024-11-07 16:35:30,792 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 16:35:30,793 INFO L225 Difference]: With dead ends: 103 [2024-11-07 16:35:30,793 INFO L226 Difference]: Without dead ends: 103 [2024-11-07 16:35:30,793 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 51 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=60, Invalid=180, Unknown=0, NotChecked=0, Total=240 [2024-11-07 16:35:30,793 INFO L432 NwaCegarLoop]: 54 mSDtfsCounter, 56 mSDsluCounter, 365 mSDsCounter, 0 mSdLazyCounter, 198 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 58 SdHoareTripleChecker+Valid, 419 SdHoareTripleChecker+Invalid, 202 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 198 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-07 16:35:30,793 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [58 Valid, 419 Invalid, 202 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 198 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-07 16:35:30,794 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2024-11-07 16:35:30,798 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 103. [2024-11-07 16:35:30,798 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 103 states, 87 states have (on average 1.103448275862069) internal successors, (96), 93 states have internal predecessors, (96), 5 states have call successors, (5), 4 states have call predecessors, (5), 5 states have return successors, (8), 5 states have call predecessors, (8), 5 states have call successors, (8) [2024-11-07 16:35:30,799 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 109 transitions. [2024-11-07 16:35:30,799 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 109 transitions. Word has length 64 [2024-11-07 16:35:30,799 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 16:35:30,799 INFO L471 AbstractCegarLoop]: Abstraction has 103 states and 109 transitions. [2024-11-07 16:35:30,799 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 3.6666666666666665) internal successors, (44), 10 states have internal predecessors, (44), 3 states have call successors, (3), 3 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 16:35:30,799 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 109 transitions. [2024-11-07 16:35:30,799 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2024-11-07 16:35:30,799 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 16:35:30,799 INFO L215 NwaCegarLoop]: trace histogram [16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 16:35:30,816 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 16:35:31,002 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 16:35:31,003 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting ldv_kobject_putErr9ASSERT_VIOLATIONMEMORY_FREE === [LDV_INIT_LIST_HEADErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, LDV_INIT_LIST_HEADErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, LDV_INIT_LIST_HEADErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 22 more)] === [2024-11-07 16:35:31,003 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 16:35:31,003 INFO L85 PathProgramCache]: Analyzing trace with hash 932129625, now seen corresponding path program 1 times [2024-11-07 16:35:31,003 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-07 16:35:31,003 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [818580457] [2024-11-07 16:35:31,003 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 16:35:31,003 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-07 16:35:31,003 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-07 16:35:31,006 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 16:35:31,006 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 16:35:31,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 16:35:31,360 INFO L255 TraceCheckSpWp]: Trace formula consists of 452 conjuncts, 77 conjuncts are in the unsatisfiable core [2024-11-07 16:35:31,364 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 16:35:31,479 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-07 16:35:31,481 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-07 16:35:31,481 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-07 16:35:31,483 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 7 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 25 [2024-11-07 16:35:31,662 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-07 16:35:31,663 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 10 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 47 treesize of output 34 [2024-11-07 16:35:31,922 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-07 16:35:31,923 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 82 treesize of output 29 [2024-11-07 16:35:32,084 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-07 16:35:32,085 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 45 treesize of output 25 [2024-11-07 16:35:32,286 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2024-11-07 16:35:32,286 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-07 16:35:32,286 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-07 16:35:32,286 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [818580457] [2024-11-07 16:35:32,286 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [818580457] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 16:35:32,286 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 16:35:32,286 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [27] imperfect sequences [] total 27 [2024-11-07 16:35:32,286 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [453305449] [2024-11-07 16:35:32,286 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 16:35:32,287 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2024-11-07 16:35:32,287 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-07 16:35:32,287 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2024-11-07 16:35:32,287 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=637, Unknown=0, NotChecked=0, Total=702 [2024-11-07 16:35:32,288 INFO L87 Difference]: Start difference. First operand 103 states and 109 transitions. Second operand has 27 states, 27 states have (on average 1.7407407407407407) internal successors, (47), 24 states have internal predecessors, (47), 3 states have call successors, (3), 3 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 16:35:33,598 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 16:35:33,598 INFO L93 Difference]: Finished difference Result 95 states and 98 transitions. [2024-11-07 16:35:33,599 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2024-11-07 16:35:33,599 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 27 states have (on average 1.7407407407407407) internal successors, (47), 24 states have internal predecessors, (47), 3 states have call successors, (3), 3 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 67 [2024-11-07 16:35:33,599 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 16:35:33,599 INFO L225 Difference]: With dead ends: 95 [2024-11-07 16:35:33,599 INFO L226 Difference]: Without dead ends: 95 [2024-11-07 16:35:33,599 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 41 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 235 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=119, Invalid=1141, Unknown=0, NotChecked=0, Total=1260 [2024-11-07 16:35:33,600 INFO L432 NwaCegarLoop]: 44 mSDtfsCounter, 19 mSDsluCounter, 968 mSDsCounter, 0 mSdLazyCounter, 732 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 1012 SdHoareTripleChecker+Invalid, 736 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 732 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2024-11-07 16:35:33,600 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [19 Valid, 1012 Invalid, 736 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 732 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2024-11-07 16:35:33,600 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2024-11-07 16:35:33,601 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 95. [2024-11-07 16:35:33,601 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 95 states, 83 states have (on average 1.072289156626506) internal successors, (89), 86 states have internal predecessors, (89), 4 states have call successors, (4), 4 states have call predecessors, (4), 4 states have return successors, (5), 4 states have call predecessors, (5), 4 states have call successors, (5) [2024-11-07 16:35:33,602 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 98 transitions. [2024-11-07 16:35:33,602 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 98 transitions. Word has length 67 [2024-11-07 16:35:33,602 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 16:35:33,602 INFO L471 AbstractCegarLoop]: Abstraction has 95 states and 98 transitions. [2024-11-07 16:35:33,602 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 27 states have (on average 1.7407407407407407) internal successors, (47), 24 states have internal predecessors, (47), 3 states have call successors, (3), 3 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 16:35:33,602 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 98 transitions. [2024-11-07 16:35:33,603 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2024-11-07 16:35:33,603 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 16:35:33,603 INFO L215 NwaCegarLoop]: trace histogram [16, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 16:35:33,613 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 (28)] Ended with exit code 0 [2024-11-07 16:35:33,806 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 28 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-07 16:35:33,807 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [LDV_INIT_LIST_HEADErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, LDV_INIT_LIST_HEADErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, LDV_INIT_LIST_HEADErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 22 more)] === [2024-11-07 16:35:33,807 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 16:35:33,807 INFO L85 PathProgramCache]: Analyzing trace with hash 1997003999, now seen corresponding path program 1 times [2024-11-07 16:35:33,807 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-07 16:35:33,808 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [852778320] [2024-11-07 16:35:33,808 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 16:35:33,808 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-07 16:35:33,808 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-07 16:35:33,809 INFO L229 MonitoredProcess]: Starting monitored process 29 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-07 16:35:33,811 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (29)] Waiting until timeout for monitored process [2024-11-07 16:35:34,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 16:35:34,183 INFO L255 TraceCheckSpWp]: Trace formula consists of 501 conjuncts, 110 conjuncts are in the unsatisfiable core [2024-11-07 16:35:34,189 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 16:35:34,272 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-07 16:35:34,273 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-07 16:35:34,274 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-07 16:35:34,274 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-07 16:35:34,274 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-07 16:35:34,275 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 7 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 33 [2024-11-07 16:35:34,411 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-07 16:35:34,411 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 15 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 55 treesize of output 45 [2024-11-07 16:35:34,811 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-07 16:35:34,811 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 153 treesize of output 81 [2024-11-07 16:35:35,236 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-07 16:35:35,238 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 201 treesize of output 129 [2024-11-07 16:35:43,683 INFO L134 CoverageAnalysis]: Checked inductivity of 148 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 139 trivial. 0 not checked. [2024-11-07 16:35:43,683 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-07 16:36:20,661 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_DerPreprocessor_3 (Array (_ BitVec 32) (_ BitVec 8)))) (or (= (_ bv1 32) (let ((.cse0 (bvadd (let ((.cse1 (bvadd (let ((.cse2 (select (store |c_#memory_int#1| |c_ULTIMATE.start_ldv_kobject_init_internal_~kobj#1.base| v_DerPreprocessor_3) |c_ULTIMATE.start_ldv_kobject_create_~kobj~1#1.base|))) (concat (concat (concat (select .cse2 (bvadd (_ bv15 32) |c_ULTIMATE.start_ldv_kobject_create_~kobj~1#1.offset|)) (select .cse2 (bvadd (_ bv14 32) |c_ULTIMATE.start_ldv_kobject_create_~kobj~1#1.offset|))) (select .cse2 (bvadd (_ bv13 32) |c_ULTIMATE.start_ldv_kobject_create_~kobj~1#1.offset|))) (select .cse2 (bvadd (_ bv12 32) |c_ULTIMATE.start_ldv_kobject_create_~kobj~1#1.offset|)))) (_ bv1 32)))) (concat (concat (concat ((_ extract 31 24) .cse1) ((_ extract 23 16) .cse1)) ((_ extract 15 8) .cse1)) ((_ extract 7 0) .cse1))) (_ bv4294967295 32)))) (concat (concat (concat ((_ extract 31 24) .cse0) ((_ extract 23 16) .cse0)) ((_ extract 15 8) .cse0)) ((_ extract 7 0) .cse0)))) (not (= (let ((.cse4 (bvadd (_ bv8 32) |c_ULTIMATE.start_ldv_kobject_init_internal_~kobj#1.offset|))) (store (let ((.cse3 (bvadd (_ bv4 32) |c_ULTIMATE.start_ldv_kobject_init_internal_~kobj#1.offset|))) (store (select |c_#memory_int#1| |c_ULTIMATE.start_ldv_kobject_init_internal_~kobj#1.base|) .cse3 (select v_DerPreprocessor_3 .cse3))) .cse4 (select v_DerPreprocessor_3 .cse4))) v_DerPreprocessor_3)))) is different from false [2024-11-07 16:36:20,663 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-07 16:36:20,663 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [852778320] [2024-11-07 16:36:20,663 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [852778320] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-07 16:36:20,663 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [8641221] [2024-11-07 16:36:20,664 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 16:36:20,664 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-11-07 16:36:20,664 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/cvc4 [2024-11-07 16:36:20,666 INFO L229 MonitoredProcess]: Starting monitored process 30 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-11-07 16:36:20,667 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (30)] Waiting until timeout for monitored process [2024-11-07 16:36:22,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 16:36:22,573 INFO L255 TraceCheckSpWp]: Trace formula consists of 501 conjuncts, 127 conjuncts are in the unsatisfiable core [2024-11-07 16:36:22,580 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 16:36:23,792 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-07 16:36:23,793 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-07 16:36:23,794 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-07 16:36:23,794 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-07 16:36:23,794 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-07 16:36:23,795 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 7 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 33 [2024-11-07 16:36:23,853 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-07 16:36:23,857 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 15 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 55 treesize of output 45 [2024-11-07 16:36:23,995 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-07 16:36:23,996 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 153 treesize of output 81 [2024-11-07 16:36:24,155 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-07 16:36:24,156 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 201 treesize of output 129 [2024-11-07 16:36:24,261 INFO L134 CoverageAnalysis]: Checked inductivity of 148 backedges. 0 proven. 135 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2024-11-07 16:36:24,261 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-07 16:36:24,802 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_DerPreprocessor_6 (Array (_ BitVec 32) (_ BitVec 8)))) (or (not (= v_DerPreprocessor_6 (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_ldv_kobject_init_internal_~kobj#1.offset|))) (store (let ((.cse0 (bvadd (_ bv4 32) |c_ULTIMATE.start_ldv_kobject_init_internal_~kobj#1.offset|))) (store (select |c_#memory_int#1| |c_ULTIMATE.start_ldv_kobject_init_internal_~kobj#1.base|) .cse0 (select v_DerPreprocessor_6 .cse0))) .cse1 (select v_DerPreprocessor_6 .cse1))))) (= (_ bv1 32) (let ((.cse2 (bvadd (_ bv4294967295 32) (let ((.cse3 (bvadd (_ bv1 32) (let ((.cse4 (select (store |c_#memory_int#1| |c_ULTIMATE.start_ldv_kobject_init_internal_~kobj#1.base| v_DerPreprocessor_6) |c_ULTIMATE.start_ldv_kobject_create_~kobj~1#1.base|))) (concat (concat (concat (select .cse4 (bvadd (_ bv15 32) |c_ULTIMATE.start_ldv_kobject_create_~kobj~1#1.offset|)) (select .cse4 (bvadd (_ bv14 32) |c_ULTIMATE.start_ldv_kobject_create_~kobj~1#1.offset|))) (select .cse4 (bvadd (_ bv13 32) |c_ULTIMATE.start_ldv_kobject_create_~kobj~1#1.offset|))) (select .cse4 (bvadd (_ bv12 32) |c_ULTIMATE.start_ldv_kobject_create_~kobj~1#1.offset|))))))) (concat (concat (concat ((_ extract 31 24) .cse3) ((_ extract 23 16) .cse3)) ((_ extract 15 8) .cse3)) ((_ extract 7 0) .cse3)))))) (concat (concat (concat ((_ extract 31 24) .cse2) ((_ extract 23 16) .cse2)) ((_ extract 15 8) .cse2)) ((_ extract 7 0) .cse2)))))) is different from false [2024-11-07 16:36:24,805 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [8641221] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-07 16:36:24,805 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-07 16:36:24,805 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [31, 43] total 43 [2024-11-07 16:36:24,805 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2115718439] [2024-11-07 16:36:24,805 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-07 16:36:24,805 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 43 states [2024-11-07 16:36:24,805 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-07 16:36:24,805 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2024-11-07 16:36:24,806 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=208, Invalid=3820, Unknown=12, NotChecked=250, Total=4290 [2024-11-07 16:36:24,806 INFO L87 Difference]: Start difference. First operand 95 states and 98 transitions. Second operand has 43 states, 42 states have (on average 1.5952380952380953) internal successors, (67), 40 states have internal predecessors, (67), 4 states have call successors, (4), 2 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2024-11-07 16:36:46,812 WARN L286 SmtUtils]: Spent 8.03s on a formula simplification that was a NOOP. DAG size: 47 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate)