./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/valid-memsafety.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_JEN_nondet_test2-2.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 61a67961 Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_JEN_nondet_test2-2.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/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 0fdcb64865aeb8184805095bc8dbe7392078d445cf902388dac9d1ca4533bb8c --- Real Ultimate output --- This is Ultimate 0.2.5-wip.fs.cvc5-61a6796-m [2024-10-14 19:06:16,754 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-14 19:06:16,833 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2024-10-14 19:06:16,837 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-14 19:06:16,837 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-14 19:06:16,857 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-14 19:06:16,858 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-14 19:06:16,858 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-14 19:06:16,859 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-14 19:06:16,859 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-14 19:06:16,859 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-14 19:06:16,859 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-14 19:06:16,860 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-14 19:06:16,860 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-14 19:06:16,860 INFO L153 SettingsManager]: * Use SBE=true [2024-10-14 19:06:16,861 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-14 19:06:16,861 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-14 19:06:16,863 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-14 19:06:16,863 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-14 19:06:16,864 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-14 19:06:16,866 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-10-14 19:06:16,867 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-10-14 19:06:16,867 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-10-14 19:06:16,867 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-14 19:06:16,868 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-10-14 19:06:16,868 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-14 19:06:16,868 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-10-14 19:06:16,868 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-14 19:06:16,868 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-14 19:06:16,868 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-14 19:06:16,869 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-14 19:06:16,869 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-14 19:06:16,870 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-14 19:06:16,870 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-14 19:06:16,871 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-14 19:06:16,871 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-14 19:06:16,871 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-14 19:06:16,872 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-14 19:06:16,872 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-14 19:06:16,872 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-14 19:06:16,872 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-14 19:06:16,873 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-14 19:06:16,873 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release 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/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 -> 0fdcb64865aeb8184805095bc8dbe7392078d445cf902388dac9d1ca4533bb8c [2024-10-14 19:06:17,084 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-14 19:06:17,104 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-14 19:06:17,106 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-14 19:06:17,107 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-14 19:06:17,107 INFO L274 PluginConnector]: CDTParser initialized [2024-10-14 19:06:17,108 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_JEN_nondet_test2-2.i [2024-10-14 19:06:18,449 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-14 19:06:18,708 INFO L384 CDTParser]: Found 1 translation units. [2024-10-14 19:06:18,708 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_JEN_nondet_test2-2.i [2024-10-14 19:06:18,723 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d9bbce3ae/99da7c6e94004cb7a1c9a65367331a9e/FLAG58efa2292 [2024-10-14 19:06:19,004 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d9bbce3ae/99da7c6e94004cb7a1c9a65367331a9e [2024-10-14 19:06:19,006 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-14 19:06:19,007 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-14 19:06:19,008 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-14 19:06:19,008 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-14 19:06:19,019 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-14 19:06:19,020 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.10 07:06:19" (1/1) ... [2024-10-14 19:06:19,023 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@492e842f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 07:06:19, skipping insertion in model container [2024-10-14 19:06:19,023 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.10 07:06:19" (1/1) ... [2024-10-14 19:06:19,081 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-14 19:06:19,525 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-14 19:06:19,539 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-10-14 19:06:19,540 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver@20a4c107 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 07:06:19, skipping insertion in model container [2024-10-14 19:06:19,540 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-14 19:06:19,540 INFO L186 ToolchainWalker]: Toolchain execution was canceled (user or tool) before executing de.uni_freiburg.informatik.ultimate.boogie.procedureinliner [2024-10-14 19:06:19,543 INFO L158 Benchmark]: Toolchain (without parser) took 535.55ms. Allocated memory is still 157.3MB. Free memory was 106.7MB in the beginning and 85.3MB in the end (delta: 21.4MB). Peak memory consumption was 21.0MB. Max. memory is 16.1GB. [2024-10-14 19:06:19,544 INFO L158 Benchmark]: CDTParser took 0.15ms. Allocated memory is still 157.3MB. Free memory is still 118.1MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-14 19:06:19,544 INFO L158 Benchmark]: CACSL2BoogieTranslator took 532.34ms. Allocated memory is still 157.3MB. Free memory was 106.7MB in the beginning and 85.7MB in the end (delta: 21.0MB). Peak memory consumption was 21.0MB. Max. memory is 16.1GB. [2024-10-14 19:06:19,545 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.15ms. Allocated memory is still 157.3MB. Free memory is still 118.1MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 532.34ms. Allocated memory is still 157.3MB. Free memory was 106.7MB in the beginning and 85.7MB in the end (delta: 21.0MB). Peak memory consumption was 21.0MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - UnsupportedSyntaxResult [Line: 817]: 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/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_JEN_nondet_test2-2.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/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 0fdcb64865aeb8184805095bc8dbe7392078d445cf902388dac9d1ca4533bb8c --- Real Ultimate output --- This is Ultimate 0.2.5-wip.fs.cvc5-61a6796-m [2024-10-14 19:06:21,316 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-14 19:06:21,374 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf [2024-10-14 19:06:21,379 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-14 19:06:21,379 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-14 19:06:21,407 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-14 19:06:21,408 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-14 19:06:21,408 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-14 19:06:21,409 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-14 19:06:21,410 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-14 19:06:21,410 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-14 19:06:21,410 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-14 19:06:21,411 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-14 19:06:21,411 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-14 19:06:21,411 INFO L153 SettingsManager]: * Use SBE=true [2024-10-14 19:06:21,413 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-14 19:06:21,413 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-14 19:06:21,413 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-14 19:06:21,413 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-14 19:06:21,414 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-14 19:06:21,414 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-10-14 19:06:21,417 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-10-14 19:06:21,417 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-10-14 19:06:21,417 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-14 19:06:21,417 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-10-14 19:06:21,417 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-10-14 19:06:21,417 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-14 19:06:21,418 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-10-14 19:06:21,418 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-10-14 19:06:21,418 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-14 19:06:21,418 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-14 19:06:21,418 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-14 19:06:21,418 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-14 19:06:21,419 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-14 19:06:21,419 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-14 19:06:21,419 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-14 19:06:21,419 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-14 19:06:21,421 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-14 19:06:21,421 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-10-14 19:06:21,421 INFO L153 SettingsManager]: * Command for external solver=cvc5 --incremental --print-success --lang smt [2024-10-14 19:06:21,421 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-14 19:06:21,421 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-14 19:06:21,421 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-14 19:06:21,422 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-14 19:06:21,422 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2024-10-14 19:06:21,422 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release 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/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 -> 0fdcb64865aeb8184805095bc8dbe7392078d445cf902388dac9d1ca4533bb8c [2024-10-14 19:06:21,680 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-14 19:06:21,698 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-14 19:06:21,701 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-14 19:06:21,702 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-14 19:06:21,702 INFO L274 PluginConnector]: CDTParser initialized [2024-10-14 19:06:21,704 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_JEN_nondet_test2-2.i [2024-10-14 19:06:23,171 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-14 19:06:23,446 INFO L384 CDTParser]: Found 1 translation units. [2024-10-14 19:06:23,447 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_JEN_nondet_test2-2.i [2024-10-14 19:06:23,466 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2ae14cb17/1f828390aa0b4b82b521c373f85fe736/FLAGfb1d8495c [2024-10-14 19:06:23,481 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2ae14cb17/1f828390aa0b4b82b521c373f85fe736 [2024-10-14 19:06:23,483 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-14 19:06:23,484 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-14 19:06:23,486 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-14 19:06:23,487 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-14 19:06:23,491 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-14 19:06:23,491 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.10 07:06:23" (1/1) ... [2024-10-14 19:06:23,492 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@53a87321 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 07:06:23, skipping insertion in model container [2024-10-14 19:06:23,494 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.10 07:06:23" (1/1) ... [2024-10-14 19:06:23,543 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-14 19:06:24,010 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-14 19:06:24,020 INFO L197 MainTranslator]: Restarting translation with changed settings: SettingsChange [mNewPreferredMemoryModel=HoenickeLindenmann_1ByteResolution] [2024-10-14 19:06:24,028 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-14 19:06:24,087 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-14 19:06:24,096 INFO L200 MainTranslator]: Completed pre-run [2024-10-14 19:06:24,151 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-14 19:06:24,189 INFO L204 MainTranslator]: Completed translation [2024-10-14 19:06:24,190 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 07:06:24 WrapperNode [2024-10-14 19:06:24,190 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-14 19:06:24,191 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-14 19:06:24,191 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-14 19:06:24,191 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-14 19:06:24,197 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 07:06:24" (1/1) ... [2024-10-14 19:06:24,230 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 07:06:24" (1/1) ... [2024-10-14 19:06:24,285 INFO L138 Inliner]: procedures = 210, calls = 273, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 1059 [2024-10-14 19:06:24,286 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-14 19:06:24,286 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-14 19:06:24,286 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-14 19:06:24,286 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-14 19:06:24,299 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 07:06:24" (1/1) ... [2024-10-14 19:06:24,300 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 07:06:24" (1/1) ... [2024-10-14 19:06:24,313 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 07:06:24" (1/1) ... [2024-10-14 19:06:24,372 INFO L175 MemorySlicer]: Split 254 memory accesses to 3 slices as follows [2, 34, 218]. 86 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0, 0]. The 54 writes are split as follows [0, 4, 50]. [2024-10-14 19:06:24,372 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 07:06:24" (1/1) ... [2024-10-14 19:06:24,372 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 07:06:24" (1/1) ... [2024-10-14 19:06:24,406 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 07:06:24" (1/1) ... [2024-10-14 19:06:24,415 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 07:06:24" (1/1) ... [2024-10-14 19:06:24,419 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 07:06:24" (1/1) ... [2024-10-14 19:06:24,423 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 07:06:24" (1/1) ... [2024-10-14 19:06:24,433 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-14 19:06:24,434 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-14 19:06:24,434 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-14 19:06:24,434 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-14 19:06:24,436 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 07:06:24" (1/1) ... [2024-10-14 19:06:24,441 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-14 19:06:24,455 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 19:06:24,467 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-14 19:06:24,471 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-14 19:06:24,514 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#0 [2024-10-14 19:06:24,514 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#1 [2024-10-14 19:06:24,514 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#2 [2024-10-14 19:06:24,514 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#0 [2024-10-14 19:06:24,514 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#1 [2024-10-14 19:06:24,516 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#2 [2024-10-14 19:06:24,516 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#0 [2024-10-14 19:06:24,517 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#1 [2024-10-14 19:06:24,517 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#2 [2024-10-14 19:06:24,517 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#0 [2024-10-14 19:06:24,517 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#1 [2024-10-14 19:06:24,517 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#2 [2024-10-14 19:06:24,517 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-10-14 19:06:24,517 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2024-10-14 19:06:24,517 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2024-10-14 19:06:24,517 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2024-10-14 19:06:24,518 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#0 [2024-10-14 19:06:24,518 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#1 [2024-10-14 19:06:24,518 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#2 [2024-10-14 19:06:24,518 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-10-14 19:06:24,518 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-10-14 19:06:24,518 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2024-10-14 19:06:24,518 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#2 [2024-10-14 19:06:24,518 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-10-14 19:06:24,518 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-14 19:06:24,518 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2024-10-14 19:06:24,518 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2024-10-14 19:06:24,518 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2024-10-14 19:06:24,518 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-14 19:06:24,518 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-14 19:06:24,726 INFO L238 CfgBuilder]: Building ICFG [2024-10-14 19:06:24,728 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-14 19:06:24,731 WARN L779 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2024-10-14 19:06:24,768 WARN L779 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2024-10-14 19:06:24,787 WARN L779 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2024-10-14 19:06:27,329 INFO L? ?]: Removed 1087 outVars from TransFormulas that were not future-live. [2024-10-14 19:06:27,330 INFO L287 CfgBuilder]: Performing block encoding [2024-10-14 19:06:27,462 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-14 19:06:27,462 INFO L314 CfgBuilder]: Removed 63 assume(true) statements. [2024-10-14 19:06:27,462 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 07:06:27 BoogieIcfgContainer [2024-10-14 19:06:27,462 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-14 19:06:27,464 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-14 19:06:27,464 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-14 19:06:27,467 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-14 19:06:27,467 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.10 07:06:23" (1/3) ... [2024-10-14 19:06:27,467 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@27909c9a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.10 07:06:27, skipping insertion in model container [2024-10-14 19:06:27,468 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 07:06:24" (2/3) ... [2024-10-14 19:06:27,468 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@27909c9a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.10 07:06:27, skipping insertion in model container [2024-10-14 19:06:27,468 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 07:06:27" (3/3) ... [2024-10-14 19:06:27,469 INFO L112 eAbstractionObserver]: Analyzing ICFG uthash_JEN_nondet_test2-2.i [2024-10-14 19:06:27,482 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-14 19:06:27,483 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 525 error locations. [2024-10-14 19:06:27,527 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-14 19:06:27,532 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;@6745eb06, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-14 19:06:27,532 INFO L334 AbstractCegarLoop]: Starting to check reachability of 525 error locations. [2024-10-14 19:06:27,537 INFO L276 IsEmpty]: Start isEmpty. Operand has 957 states, 430 states have (on average 2.5069767441860464) internal successors, (1078), 952 states have internal predecessors, (1078), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-10-14 19:06:27,541 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2024-10-14 19:06:27,541 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 19:06:27,542 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1] [2024-10-14 19:06:27,542 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr524ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 522 more)] === [2024-10-14 19:06:27,546 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 19:06:27,546 INFO L85 PathProgramCache]: Analyzing trace with hash 1670016, now seen corresponding path program 1 times [2024-10-14 19:06:27,554 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-14 19:06:27,555 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1917129877] [2024-10-14 19:06:27,555 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 19:06:27,555 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-10-14 19:06:27,555 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-14 19:06:27,558 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -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-10-14 19:06:27,559 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -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-10-14 19:06:27,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 19:06:27,667 INFO L255 TraceCheckSpWp]: Trace formula consists of 27 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-10-14 19:06:27,671 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 19:06:27,742 WARN L873 $PredicateComparison]: unable to prove that (exists ((|v_ULTIMATE.start_main_~#i~0#1.base_56| (_ BitVec 32))) (and (= (_ bv0 1) (select |c_ULTIMATE.start_main_old_#valid#1| |v_ULTIMATE.start_main_~#i~0#1.base_56|)) (= (store |c_ULTIMATE.start_main_old_#valid#1| |v_ULTIMATE.start_main_~#i~0#1.base_56| (_ bv0 1)) |c_#valid|))) is different from true [2024-10-14 19:06:27,743 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 19:06:27,743 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-14 19:06:27,743 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-14 19:06:27,743 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1917129877] [2024-10-14 19:06:27,744 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1917129877] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 19:06:27,744 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 19:06:27,744 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-14 19:06:27,745 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1778492240] [2024-10-14 19:06:27,748 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 19:06:27,755 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-14 19:06:27,756 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-14 19:06:27,789 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-14 19:06:27,790 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=4, Unknown=1, NotChecked=2, Total=12 [2024-10-14 19:06:27,792 INFO L87 Difference]: Start difference. First operand has 957 states, 430 states have (on average 2.5069767441860464) internal successors, (1078), 952 states have internal predecessors, (1078), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand has 4 states, 3 states have (on average 1.0) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 19:06:29,629 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 19:06:29,629 INFO L93 Difference]: Finished difference Result 1309 states and 1410 transitions. [2024-10-14 19:06:29,631 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-14 19:06:29,632 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 1.0) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 3 [2024-10-14 19:06:29,633 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 19:06:29,647 INFO L225 Difference]: With dead ends: 1309 [2024-10-14 19:06:29,647 INFO L226 Difference]: Without dead ends: 1307 [2024-10-14 19:06:29,648 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=4, Unknown=1, NotChecked=2, Total=12 [2024-10-14 19:06:29,652 INFO L432 NwaCegarLoop]: 742 mSDtfsCounter, 390 mSDsluCounter, 470 mSDsCounter, 0 mSdLazyCounter, 804 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 390 SdHoareTripleChecker+Valid, 1212 SdHoareTripleChecker+Invalid, 2215 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 804 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 1411 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2024-10-14 19:06:29,652 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [390 Valid, 1212 Invalid, 2215 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 804 Invalid, 0 Unknown, 1411 Unchecked, 1.7s Time] [2024-10-14 19:06:29,669 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1307 states. [2024-10-14 19:06:29,737 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1307 to 946. [2024-10-14 19:06:29,739 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 946 states, 425 states have (on average 2.3458823529411763) internal successors, (997), 941 states have internal predecessors, (997), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-10-14 19:06:29,741 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 946 states to 946 states and 1003 transitions. [2024-10-14 19:06:29,742 INFO L78 Accepts]: Start accepts. Automaton has 946 states and 1003 transitions. Word has length 3 [2024-10-14 19:06:29,742 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 19:06:29,742 INFO L471 AbstractCegarLoop]: Abstraction has 946 states and 1003 transitions. [2024-10-14 19:06:29,742 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 1.0) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 19:06:29,742 INFO L276 IsEmpty]: Start isEmpty. Operand 946 states and 1003 transitions. [2024-10-14 19:06:29,742 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2024-10-14 19:06:29,742 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 19:06:29,743 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1] [2024-10-14 19:06:29,747 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -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)] Forceful destruction successful, exit code 0 [2024-10-14 19:06:29,944 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -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-10-14 19:06:29,945 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 522 more)] === [2024-10-14 19:06:29,945 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 19:06:29,945 INFO L85 PathProgramCache]: Analyzing trace with hash 1668425, now seen corresponding path program 1 times [2024-10-14 19:06:29,946 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-14 19:06:29,946 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2057390128] [2024-10-14 19:06:29,946 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 19:06:29,946 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-14 19:06:29,946 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-14 19:06:29,948 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -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-10-14 19:06:29,957 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -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-10-14 19:06:30,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 19:06:30,038 INFO L255 TraceCheckSpWp]: Trace formula consists of 24 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-14 19:06:30,039 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 19:06:30,053 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-10-14 19:06:30,063 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 19:06:30,063 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-14 19:06:30,063 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-14 19:06:30,063 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2057390128] [2024-10-14 19:06:30,063 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2057390128] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 19:06:30,063 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 19:06:30,063 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-10-14 19:06:30,064 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [510558435] [2024-10-14 19:06:30,064 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 19:06:30,064 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-14 19:06:30,065 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-14 19:06:30,065 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-14 19:06:30,065 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 19:06:30,065 INFO L87 Difference]: Start difference. First operand 946 states and 1003 transitions. Second operand has 3 states, 2 states have (on average 1.5) internal successors, (3), 2 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 19:06:31,374 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 19:06:31,375 INFO L93 Difference]: Finished difference Result 1107 states and 1174 transitions. [2024-10-14 19:06:31,376 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-14 19:06:31,377 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 2 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 3 [2024-10-14 19:06:31,377 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 19:06:31,380 INFO L225 Difference]: With dead ends: 1107 [2024-10-14 19:06:31,380 INFO L226 Difference]: Without dead ends: 1107 [2024-10-14 19:06:31,380 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 19:06:31,381 INFO L432 NwaCegarLoop]: 518 mSDtfsCounter, 878 mSDsluCounter, 121 mSDsCounter, 0 mSdLazyCounter, 644 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 881 SdHoareTripleChecker+Valid, 639 SdHoareTripleChecker+Invalid, 660 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 644 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2024-10-14 19:06:31,382 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [881 Valid, 639 Invalid, 660 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 644 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2024-10-14 19:06:31,385 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1107 states. [2024-10-14 19:06:31,414 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1107 to 943. [2024-10-14 19:06:31,415 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 943 states, 433 states have (on average 2.2979214780600463) internal successors, (995), 938 states have internal predecessors, (995), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-10-14 19:06:31,418 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 943 states to 943 states and 1001 transitions. [2024-10-14 19:06:31,420 INFO L78 Accepts]: Start accepts. Automaton has 943 states and 1001 transitions. Word has length 3 [2024-10-14 19:06:31,421 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 19:06:31,421 INFO L471 AbstractCegarLoop]: Abstraction has 943 states and 1001 transitions. [2024-10-14 19:06:31,421 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 2 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 19:06:31,421 INFO L276 IsEmpty]: Start isEmpty. Operand 943 states and 1001 transitions. [2024-10-14 19:06:31,421 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2024-10-14 19:06:31,421 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 19:06:31,421 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1] [2024-10-14 19:06:31,429 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Ended with exit code 0 [2024-10-14 19:06:31,622 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -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-10-14 19:06:31,622 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 522 more)] === [2024-10-14 19:06:31,623 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 19:06:31,623 INFO L85 PathProgramCache]: Analyzing trace with hash 1668426, now seen corresponding path program 1 times [2024-10-14 19:06:31,623 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-14 19:06:31,624 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1543378019] [2024-10-14 19:06:31,624 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 19:06:31,624 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-10-14 19:06:31,624 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-14 19:06:31,627 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -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-10-14 19:06:31,629 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -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-10-14 19:06:31,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 19:06:31,703 INFO L255 TraceCheckSpWp]: Trace formula consists of 24 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-10-14 19:06:31,704 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 19:06:31,714 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-10-14 19:06:31,727 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 19:06:31,727 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-14 19:06:31,727 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-14 19:06:31,728 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1543378019] [2024-10-14 19:06:31,728 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1543378019] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 19:06:31,728 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 19:06:31,728 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-10-14 19:06:31,728 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1651374793] [2024-10-14 19:06:31,728 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 19:06:31,728 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-14 19:06:31,729 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-14 19:06:31,729 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-14 19:06:31,729 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 19:06:31,729 INFO L87 Difference]: Start difference. First operand 943 states and 1001 transitions. Second operand has 3 states, 2 states have (on average 1.5) internal successors, (3), 2 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 19:06:33,682 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 19:06:33,683 INFO L93 Difference]: Finished difference Result 1317 states and 1407 transitions. [2024-10-14 19:06:33,683 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-14 19:06:33,683 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 2 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 3 [2024-10-14 19:06:33,683 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 19:06:33,687 INFO L225 Difference]: With dead ends: 1317 [2024-10-14 19:06:33,687 INFO L226 Difference]: Without dead ends: 1317 [2024-10-14 19:06:33,687 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 19:06:33,688 INFO L432 NwaCegarLoop]: 737 mSDtfsCounter, 406 mSDsluCounter, 478 mSDsCounter, 0 mSdLazyCounter, 764 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 406 SdHoareTripleChecker+Valid, 1215 SdHoareTripleChecker+Invalid, 770 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 764 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2024-10-14 19:06:33,688 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [406 Valid, 1215 Invalid, 770 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 764 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2024-10-14 19:06:33,690 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1317 states. [2024-10-14 19:06:33,701 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1317 to 1048. [2024-10-14 19:06:33,703 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1048 states, 539 states have (on average 2.2337662337662336) internal successors, (1204), 1043 states have internal predecessors, (1204), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-10-14 19:06:33,705 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1048 states to 1048 states and 1210 transitions. [2024-10-14 19:06:33,705 INFO L78 Accepts]: Start accepts. Automaton has 1048 states and 1210 transitions. Word has length 3 [2024-10-14 19:06:33,705 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 19:06:33,706 INFO L471 AbstractCegarLoop]: Abstraction has 1048 states and 1210 transitions. [2024-10-14 19:06:33,706 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 2 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 19:06:33,706 INFO L276 IsEmpty]: Start isEmpty. Operand 1048 states and 1210 transitions. [2024-10-14 19:06:33,706 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2024-10-14 19:06:33,706 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 19:06:33,706 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2024-10-14 19:06:33,710 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Ended with exit code 0 [2024-10-14 19:06:33,908 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -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-10-14 19:06:33,909 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 522 more)] === [2024-10-14 19:06:33,909 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 19:06:33,909 INFO L85 PathProgramCache]: Analyzing trace with hash -1067389101, now seen corresponding path program 1 times [2024-10-14 19:06:33,910 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-14 19:06:33,910 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [722606251] [2024-10-14 19:06:33,910 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 19:06:33,910 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-10-14 19:06:33,910 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-14 19:06:33,917 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -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-10-14 19:06:33,919 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -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-10-14 19:06:34,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 19:06:34,030 INFO L255 TraceCheckSpWp]: Trace formula consists of 61 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-10-14 19:06:34,032 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 19:06:34,047 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-10-14 19:06:34,054 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-10-14 19:06:34,167 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-14 19:06:34,168 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 9 [2024-10-14 19:06:34,197 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2024-10-14 19:06:34,197 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 13 [2024-10-14 19:06:34,231 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 19:06:34,231 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-14 19:06:34,231 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-14 19:06:34,232 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [722606251] [2024-10-14 19:06:34,232 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [722606251] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 19:06:34,232 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 19:06:34,232 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-14 19:06:34,232 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [290855235] [2024-10-14 19:06:34,232 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 19:06:34,233 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-14 19:06:34,233 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-14 19:06:34,234 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-14 19:06:34,234 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-14 19:06:34,234 INFO L87 Difference]: Start difference. First operand 1048 states and 1210 transitions. Second operand has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 19:06:36,172 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 19:06:36,176 INFO L93 Difference]: Finished difference Result 1201 states and 1371 transitions. [2024-10-14 19:06:36,177 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-14 19:06:36,177 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2024-10-14 19:06:36,177 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 19:06:36,180 INFO L225 Difference]: With dead ends: 1201 [2024-10-14 19:06:36,180 INFO L226 Difference]: Without dead ends: 1201 [2024-10-14 19:06:36,181 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 4 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-10-14 19:06:36,182 INFO L432 NwaCegarLoop]: 261 mSDtfsCounter, 1138 mSDsluCounter, 56 mSDsCounter, 0 mSdLazyCounter, 951 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1141 SdHoareTripleChecker+Valid, 317 SdHoareTripleChecker+Invalid, 967 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 951 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2024-10-14 19:06:36,183 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1141 Valid, 317 Invalid, 967 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 951 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2024-10-14 19:06:36,184 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1201 states. [2024-10-14 19:06:36,196 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1201 to 931. [2024-10-14 19:06:36,197 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 931 states, 433 states have (on average 2.2678983833718247) internal successors, (982), 926 states have internal predecessors, (982), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-10-14 19:06:36,199 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 931 states to 931 states and 988 transitions. [2024-10-14 19:06:36,199 INFO L78 Accepts]: Start accepts. Automaton has 931 states and 988 transitions. Word has length 7 [2024-10-14 19:06:36,200 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 19:06:36,200 INFO L471 AbstractCegarLoop]: Abstraction has 931 states and 988 transitions. [2024-10-14 19:06:36,200 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 19:06:36,200 INFO L276 IsEmpty]: Start isEmpty. Operand 931 states and 988 transitions. [2024-10-14 19:06:36,200 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2024-10-14 19:06:36,201 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 19:06:36,201 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 19:06:36,205 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -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-10-14 19:06:36,401 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -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-10-14 19:06:36,402 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 522 more)] === [2024-10-14 19:06:36,403 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 19:06:36,405 INFO L85 PathProgramCache]: Analyzing trace with hash 1270676234, now seen corresponding path program 1 times [2024-10-14 19:06:36,405 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-14 19:06:36,405 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1860830450] [2024-10-14 19:06:36,405 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 19:06:36,405 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-10-14 19:06:36,405 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-14 19:06:36,406 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -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-10-14 19:06:36,408 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -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-10-14 19:06:36,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 19:06:36,492 INFO L255 TraceCheckSpWp]: Trace formula consists of 66 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-14 19:06:36,494 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 19:06:36,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 7 [2024-10-14 19:06:36,509 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 19:06:36,509 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-14 19:06:36,509 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-14 19:06:36,509 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1860830450] [2024-10-14 19:06:36,509 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1860830450] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 19:06:36,509 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 19:06:36,509 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-14 19:06:36,509 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [22549889] [2024-10-14 19:06:36,509 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 19:06:36,509 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-14 19:06:36,509 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-14 19:06:36,510 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-14 19:06:36,510 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 19:06:36,510 INFO L87 Difference]: Start difference. First operand 931 states and 988 transitions. Second operand has 3 states, 2 states have (on average 4.0) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 19:06:37,772 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 19:06:37,772 INFO L93 Difference]: Finished difference Result 1076 states and 1154 transitions. [2024-10-14 19:06:37,773 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-14 19:06:37,773 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 4.0) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 8 [2024-10-14 19:06:37,773 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 19:06:37,775 INFO L225 Difference]: With dead ends: 1076 [2024-10-14 19:06:37,775 INFO L226 Difference]: Without dead ends: 1076 [2024-10-14 19:06:37,776 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 19:06:37,776 INFO L432 NwaCegarLoop]: 705 mSDtfsCounter, 668 mSDsluCounter, 211 mSDsCounter, 0 mSdLazyCounter, 697 mSolverCounterSat, 50 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 671 SdHoareTripleChecker+Valid, 916 SdHoareTripleChecker+Invalid, 747 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 50 IncrementalHoareTripleChecker+Valid, 697 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2024-10-14 19:06:37,776 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [671 Valid, 916 Invalid, 747 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [50 Valid, 697 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2024-10-14 19:06:37,779 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1076 states. [2024-10-14 19:06:37,786 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1076 to 884. [2024-10-14 19:06:37,786 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 884 states, 433 states have (on average 2.159353348729792) internal successors, (935), 879 states have internal predecessors, (935), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-10-14 19:06:37,788 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 884 states to 884 states and 941 transitions. [2024-10-14 19:06:37,788 INFO L78 Accepts]: Start accepts. Automaton has 884 states and 941 transitions. Word has length 8 [2024-10-14 19:06:37,788 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 19:06:37,789 INFO L471 AbstractCegarLoop]: Abstraction has 884 states and 941 transitions. [2024-10-14 19:06:37,789 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 4.0) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 19:06:37,789 INFO L276 IsEmpty]: Start isEmpty. Operand 884 states and 941 transitions. [2024-10-14 19:06:37,789 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2024-10-14 19:06:37,789 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 19:06:37,789 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 19:06:37,792 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -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-10-14 19:06:37,989 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -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-10-14 19:06:37,990 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 522 more)] === [2024-10-14 19:06:37,990 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 19:06:37,990 INFO L85 PathProgramCache]: Analyzing trace with hash 1270676235, now seen corresponding path program 1 times [2024-10-14 19:06:37,991 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-14 19:06:37,991 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1365245982] [2024-10-14 19:06:37,991 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 19:06:37,991 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-10-14 19:06:37,992 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-14 19:06:37,996 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -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-10-14 19:06:37,997 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -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-10-14 19:06:38,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 19:06:38,089 INFO L255 TraceCheckSpWp]: Trace formula consists of 66 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-10-14 19:06:38,091 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 19:06:38,101 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-10-14 19:06:38,117 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 19:06:38,118 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-14 19:06:38,118 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-14 19:06:38,118 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1365245982] [2024-10-14 19:06:38,118 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1365245982] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 19:06:38,118 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 19:06:38,118 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-14 19:06:38,118 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [428102259] [2024-10-14 19:06:38,119 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 19:06:38,119 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-14 19:06:38,119 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-14 19:06:38,119 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-14 19:06:38,119 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 19:06:38,119 INFO L87 Difference]: Start difference. First operand 884 states and 941 transitions. Second operand has 3 states, 2 states have (on average 4.0) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 19:06:39,790 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 19:06:39,790 INFO L93 Difference]: Finished difference Result 1139 states and 1220 transitions. [2024-10-14 19:06:39,791 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-14 19:06:39,791 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 4.0) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 8 [2024-10-14 19:06:39,792 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 19:06:39,794 INFO L225 Difference]: With dead ends: 1139 [2024-10-14 19:06:39,798 INFO L226 Difference]: Without dead ends: 1139 [2024-10-14 19:06:39,798 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 19:06:39,799 INFO L432 NwaCegarLoop]: 854 mSDtfsCounter, 447 mSDsluCounter, 341 mSDsCounter, 0 mSdLazyCounter, 701 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 447 SdHoareTripleChecker+Valid, 1195 SdHoareTripleChecker+Invalid, 714 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 701 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2024-10-14 19:06:39,799 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [447 Valid, 1195 Invalid, 714 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 701 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2024-10-14 19:06:39,800 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1139 states. [2024-10-14 19:06:39,810 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1139 to 901. [2024-10-14 19:06:39,811 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 901 states, 460 states have (on average 2.15) internal successors, (989), 896 states have internal predecessors, (989), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-10-14 19:06:39,813 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 901 states to 901 states and 995 transitions. [2024-10-14 19:06:39,813 INFO L78 Accepts]: Start accepts. Automaton has 901 states and 995 transitions. Word has length 8 [2024-10-14 19:06:39,813 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 19:06:39,813 INFO L471 AbstractCegarLoop]: Abstraction has 901 states and 995 transitions. [2024-10-14 19:06:39,813 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 4.0) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 19:06:39,814 INFO L276 IsEmpty]: Start isEmpty. Operand 901 states and 995 transitions. [2024-10-14 19:06:39,814 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2024-10-14 19:06:39,814 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 19:06:39,814 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 19:06:39,830 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -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-10-14 19:06:40,019 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -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-10-14 19:06:40,020 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr419REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 522 more)] === [2024-10-14 19:06:40,020 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 19:06:40,020 INFO L85 PathProgramCache]: Analyzing trace with hash 1957709799, now seen corresponding path program 1 times [2024-10-14 19:06:40,020 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-14 19:06:40,020 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1981826511] [2024-10-14 19:06:40,020 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 19:06:40,020 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-10-14 19:06:40,020 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-14 19:06:40,022 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -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-10-14 19:06:40,026 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -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-10-14 19:06:40,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 19:06:40,124 INFO L255 TraceCheckSpWp]: Trace formula consists of 83 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-14 19:06:40,125 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 19:06:40,163 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 19:06:40,164 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-14 19:06:40,164 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-14 19:06:40,164 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1981826511] [2024-10-14 19:06:40,164 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1981826511] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 19:06:40,164 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 19:06:40,164 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-14 19:06:40,164 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1927062933] [2024-10-14 19:06:40,164 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 19:06:40,165 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-14 19:06:40,165 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-14 19:06:40,165 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-14 19:06:40,165 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 19:06:40,165 INFO L87 Difference]: Start difference. First operand 901 states and 995 transitions. Second operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 2 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 19:06:40,902 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 19:06:40,903 INFO L93 Difference]: Finished difference Result 1293 states and 1442 transitions. [2024-10-14 19:06:40,903 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-14 19:06:40,903 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 2 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2024-10-14 19:06:40,904 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 19:06:40,906 INFO L225 Difference]: With dead ends: 1293 [2024-10-14 19:06:40,907 INFO L226 Difference]: Without dead ends: 1293 [2024-10-14 19:06:40,907 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 19:06:40,907 INFO L432 NwaCegarLoop]: 869 mSDtfsCounter, 418 mSDsluCounter, 739 mSDsCounter, 0 mSdLazyCounter, 332 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 418 SdHoareTripleChecker+Valid, 1608 SdHoareTripleChecker+Invalid, 337 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 332 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-10-14 19:06:40,908 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [418 Valid, 1608 Invalid, 337 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 332 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-10-14 19:06:40,909 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1293 states. [2024-10-14 19:06:40,935 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1293 to 1044. [2024-10-14 19:06:40,936 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1044 states, 603 states have (on average 2.074626865671642) internal successors, (1251), 1039 states have internal predecessors, (1251), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-10-14 19:06:40,938 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1044 states to 1044 states and 1257 transitions. [2024-10-14 19:06:40,938 INFO L78 Accepts]: Start accepts. Automaton has 1044 states and 1257 transitions. Word has length 11 [2024-10-14 19:06:40,938 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 19:06:40,938 INFO L471 AbstractCegarLoop]: Abstraction has 1044 states and 1257 transitions. [2024-10-14 19:06:40,939 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 2 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 19:06:40,939 INFO L276 IsEmpty]: Start isEmpty. Operand 1044 states and 1257 transitions. [2024-10-14 19:06:40,939 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2024-10-14 19:06:40,939 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 19:06:40,939 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 19:06:40,944 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Forceful destruction successful, exit code 0 [2024-10-14 19:06:41,140 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -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-10-14 19:06:41,140 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr330REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 522 more)] === [2024-10-14 19:06:41,141 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 19:06:41,141 INFO L85 PathProgramCache]: Analyzing trace with hash -187666404, now seen corresponding path program 1 times [2024-10-14 19:06:41,141 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-14 19:06:41,141 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1565770809] [2024-10-14 19:06:41,141 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 19:06:41,141 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-10-14 19:06:41,142 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-14 19:06:41,144 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -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-10-14 19:06:41,145 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -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-10-14 19:06:41,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 19:06:41,243 INFO L255 TraceCheckSpWp]: Trace formula consists of 89 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-14 19:06:41,244 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 19:06:41,251 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 19:06:41,252 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-14 19:06:41,252 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-14 19:06:41,252 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1565770809] [2024-10-14 19:06:41,252 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1565770809] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 19:06:41,252 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 19:06:41,252 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-14 19:06:41,252 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1381546122] [2024-10-14 19:06:41,252 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 19:06:41,252 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-14 19:06:41,253 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-14 19:06:41,253 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-14 19:06:41,253 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 19:06:41,253 INFO L87 Difference]: Start difference. First operand 1044 states and 1257 transitions. Second operand has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 19:06:41,752 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 19:06:41,752 INFO L93 Difference]: Finished difference Result 990 states and 1177 transitions. [2024-10-14 19:06:41,753 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-14 19:06:41,753 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2024-10-14 19:06:41,753 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 19:06:41,756 INFO L225 Difference]: With dead ends: 990 [2024-10-14 19:06:41,756 INFO L226 Difference]: Without dead ends: 990 [2024-10-14 19:06:41,756 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 19:06:41,756 INFO L432 NwaCegarLoop]: 772 mSDtfsCounter, 61 mSDsluCounter, 730 mSDsCounter, 0 mSdLazyCounter, 202 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 61 SdHoareTripleChecker+Valid, 1502 SdHoareTripleChecker+Invalid, 202 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 202 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-10-14 19:06:41,757 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [61 Valid, 1502 Invalid, 202 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 202 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-10-14 19:06:41,762 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 990 states. [2024-10-14 19:06:41,776 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 990 to 990. [2024-10-14 19:06:41,777 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 990 states, 573 states have (on average 2.043630017452007) internal successors, (1171), 985 states have internal predecessors, (1171), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-10-14 19:06:41,779 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 990 states to 990 states and 1177 transitions. [2024-10-14 19:06:41,779 INFO L78 Accepts]: Start accepts. Automaton has 990 states and 1177 transitions. Word has length 13 [2024-10-14 19:06:41,779 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 19:06:41,779 INFO L471 AbstractCegarLoop]: Abstraction has 990 states and 1177 transitions. [2024-10-14 19:06:41,779 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 19:06:41,779 INFO L276 IsEmpty]: Start isEmpty. Operand 990 states and 1177 transitions. [2024-10-14 19:06:41,779 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2024-10-14 19:06:41,779 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 19:06:41,779 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 19:06:41,783 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Ended with exit code 0 [2024-10-14 19:06:41,980 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -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-10-14 19:06:41,980 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr524ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 522 more)] === [2024-10-14 19:06:41,980 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 19:06:41,980 INFO L85 PathProgramCache]: Analyzing trace with hash 778833688, now seen corresponding path program 1 times [2024-10-14 19:06:41,981 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-14 19:06:41,981 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [553068983] [2024-10-14 19:06:41,981 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 19:06:41,981 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-10-14 19:06:41,981 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-14 19:06:41,982 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -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-10-14 19:06:41,984 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -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-10-14 19:06:42,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 19:06:42,110 INFO L255 TraceCheckSpWp]: Trace formula consists of 93 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-10-14 19:06:42,113 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 19:06:42,209 WARN L873 $PredicateComparison]: unable to prove that (exists ((|v_ULTIMATE.start_main_~#i~0#1.base_57| (_ BitVec 32))) (and (= (_ bv0 1) (select |c_ULTIMATE.start_main_old_#valid#1| |v_ULTIMATE.start_main_~#i~0#1.base_57|)) (= (store |c_ULTIMATE.start_main_old_#valid#1| |v_ULTIMATE.start_main_~#i~0#1.base_57| (_ bv0 1)) |c_#valid|))) is different from true [2024-10-14 19:06:42,210 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 19:06:42,210 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-14 19:06:42,210 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-14 19:06:42,210 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [553068983] [2024-10-14 19:06:42,210 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [553068983] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 19:06:42,210 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 19:06:42,211 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-14 19:06:42,211 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1749789429] [2024-10-14 19:06:42,211 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 19:06:42,211 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-14 19:06:42,211 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-14 19:06:42,211 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-14 19:06:42,211 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=4, Unknown=1, NotChecked=2, Total=12 [2024-10-14 19:06:42,211 INFO L87 Difference]: Start difference. First operand 990 states and 1177 transitions. Second operand has 4 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 19:06:43,299 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 19:06:43,299 INFO L93 Difference]: Finished difference Result 1238 states and 1445 transitions. [2024-10-14 19:06:43,299 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-14 19:06:43,299 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 14 [2024-10-14 19:06:43,300 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 19:06:43,306 INFO L225 Difference]: With dead ends: 1238 [2024-10-14 19:06:43,306 INFO L226 Difference]: Without dead ends: 1236 [2024-10-14 19:06:43,306 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=4, Unknown=1, NotChecked=2, Total=12 [2024-10-14 19:06:43,308 INFO L432 NwaCegarLoop]: 694 mSDtfsCounter, 259 mSDsluCounter, 444 mSDsCounter, 0 mSdLazyCounter, 634 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 259 SdHoareTripleChecker+Valid, 1138 SdHoareTripleChecker+Invalid, 1788 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 634 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 1154 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2024-10-14 19:06:43,308 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [259 Valid, 1138 Invalid, 1788 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 634 Invalid, 0 Unknown, 1154 Unchecked, 1.1s Time] [2024-10-14 19:06:43,328 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1236 states. [2024-10-14 19:06:43,337 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1236 to 1049. [2024-10-14 19:06:43,338 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1049 states, 632 states have (on average 2.0015822784810124) internal successors, (1265), 1044 states have internal predecessors, (1265), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-10-14 19:06:43,340 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1049 states to 1049 states and 1271 transitions. [2024-10-14 19:06:43,340 INFO L78 Accepts]: Start accepts. Automaton has 1049 states and 1271 transitions. Word has length 14 [2024-10-14 19:06:43,340 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 19:06:43,340 INFO L471 AbstractCegarLoop]: Abstraction has 1049 states and 1271 transitions. [2024-10-14 19:06:43,340 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 19:06:43,340 INFO L276 IsEmpty]: Start isEmpty. Operand 1049 states and 1271 transitions. [2024-10-14 19:06:43,340 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2024-10-14 19:06:43,341 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 19:06:43,341 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 19:06:43,349 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Forceful destruction successful, exit code 0 [2024-10-14 19:06:43,544 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -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-10-14 19:06:43,545 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr421REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 522 more)] === [2024-10-14 19:06:43,545 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 19:06:43,545 INFO L85 PathProgramCache]: Analyzing trace with hash 778826778, now seen corresponding path program 1 times [2024-10-14 19:06:43,545 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-14 19:06:43,546 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1856562612] [2024-10-14 19:06:43,546 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 19:06:43,546 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-10-14 19:06:43,546 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-14 19:06:43,548 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -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-10-14 19:06:43,549 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -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-10-14 19:06:43,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 19:06:43,655 INFO L255 TraceCheckSpWp]: Trace formula consists of 91 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-10-14 19:06:43,656 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 19:06:43,728 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 19:06:43,729 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-14 19:06:43,729 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-14 19:06:43,729 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1856562612] [2024-10-14 19:06:43,729 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1856562612] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 19:06:43,729 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 19:06:43,729 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-14 19:06:43,729 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1235990233] [2024-10-14 19:06:43,729 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 19:06:43,730 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-14 19:06:43,730 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-14 19:06:43,730 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-14 19:06:43,730 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-14 19:06:43,730 INFO L87 Difference]: Start difference. First operand 1049 states and 1271 transitions. Second operand has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 19:06:45,184 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 19:06:45,184 INFO L93 Difference]: Finished difference Result 1286 states and 1457 transitions. [2024-10-14 19:06:45,186 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-14 19:06:45,186 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 14 [2024-10-14 19:06:45,186 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 19:06:45,189 INFO L225 Difference]: With dead ends: 1286 [2024-10-14 19:06:45,189 INFO L226 Difference]: Without dead ends: 1282 [2024-10-14 19:06:45,189 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-10-14 19:06:45,190 INFO L432 NwaCegarLoop]: 842 mSDtfsCounter, 392 mSDsluCounter, 2158 mSDsCounter, 0 mSdLazyCounter, 809 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 392 SdHoareTripleChecker+Valid, 3000 SdHoareTripleChecker+Invalid, 812 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 809 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2024-10-14 19:06:45,190 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [392 Valid, 3000 Invalid, 812 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 809 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2024-10-14 19:06:45,192 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1282 states. [2024-10-14 19:06:45,198 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1282 to 1047. [2024-10-14 19:06:45,200 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1047 states, 630 states have (on average 2.003174603174603) internal successors, (1262), 1042 states have internal predecessors, (1262), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-10-14 19:06:45,201 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1047 states to 1047 states and 1268 transitions. [2024-10-14 19:06:45,201 INFO L78 Accepts]: Start accepts. Automaton has 1047 states and 1268 transitions. Word has length 14 [2024-10-14 19:06:45,202 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 19:06:45,202 INFO L471 AbstractCegarLoop]: Abstraction has 1047 states and 1268 transitions. [2024-10-14 19:06:45,202 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 19:06:45,202 INFO L276 IsEmpty]: Start isEmpty. Operand 1047 states and 1268 transitions. [2024-10-14 19:06:45,202 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2024-10-14 19:06:45,202 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 19:06:45,202 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 19:06:45,214 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Forceful destruction successful, exit code 0 [2024-10-14 19:06:45,403 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -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-10-14 19:06:45,403 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr354REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 522 more)] === [2024-10-14 19:06:45,403 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 19:06:45,403 INFO L85 PathProgramCache]: Analyzing trace with hash 41237622, now seen corresponding path program 1 times [2024-10-14 19:06:45,407 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-14 19:06:45,407 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1403584216] [2024-10-14 19:06:45,407 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 19:06:45,407 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-10-14 19:06:45,408 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-14 19:06:45,413 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -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-10-14 19:06:45,415 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -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-10-14 19:06:45,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 19:06:45,511 INFO L255 TraceCheckSpWp]: Trace formula consists of 92 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-14 19:06:45,512 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 19:06:45,532 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 19:06:45,532 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-14 19:06:45,532 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-14 19:06:45,532 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1403584216] [2024-10-14 19:06:45,532 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1403584216] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 19:06:45,532 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 19:06:45,532 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-14 19:06:45,532 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1758571016] [2024-10-14 19:06:45,532 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 19:06:45,532 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-14 19:06:45,532 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-14 19:06:45,533 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-14 19:06:45,533 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-14 19:06:45,533 INFO L87 Difference]: Start difference. First operand 1047 states and 1268 transitions. Second operand has 4 states, 4 states have (on average 3.75) internal successors, (15), 4 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 19:06:46,145 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 19:06:46,146 INFO L93 Difference]: Finished difference Result 1030 states and 1202 transitions. [2024-10-14 19:06:46,147 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-14 19:06:46,147 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.75) internal successors, (15), 4 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2024-10-14 19:06:46,147 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 19:06:46,150 INFO L225 Difference]: With dead ends: 1030 [2024-10-14 19:06:46,150 INFO L226 Difference]: Without dead ends: 1030 [2024-10-14 19:06:46,150 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-14 19:06:46,150 INFO L432 NwaCegarLoop]: 741 mSDtfsCounter, 45 mSDsluCounter, 1464 mSDsCounter, 0 mSdLazyCounter, 309 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 45 SdHoareTripleChecker+Valid, 2205 SdHoareTripleChecker+Invalid, 330 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 309 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-10-14 19:06:46,150 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [45 Valid, 2205 Invalid, 330 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 309 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-10-14 19:06:46,159 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1030 states. [2024-10-14 19:06:46,173 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1030 to 1030. [2024-10-14 19:06:46,174 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1030 states, 627 states have (on average 1.9074960127591707) internal successors, (1196), 1025 states have internal predecessors, (1196), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-10-14 19:06:46,176 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1030 states to 1030 states and 1202 transitions. [2024-10-14 19:06:46,176 INFO L78 Accepts]: Start accepts. Automaton has 1030 states and 1202 transitions. Word has length 15 [2024-10-14 19:06:46,176 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 19:06:46,176 INFO L471 AbstractCegarLoop]: Abstraction has 1030 states and 1202 transitions. [2024-10-14 19:06:46,176 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.75) internal successors, (15), 4 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 19:06:46,176 INFO L276 IsEmpty]: Start isEmpty. Operand 1030 states and 1202 transitions. [2024-10-14 19:06:46,181 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2024-10-14 19:06:46,181 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 19:06:46,181 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 19:06:46,184 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -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-10-14 19:06:46,381 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -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-10-14 19:06:46,381 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 522 more)] === [2024-10-14 19:06:46,382 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 19:06:46,382 INFO L85 PathProgramCache]: Analyzing trace with hash -1080334143, now seen corresponding path program 1 times [2024-10-14 19:06:46,382 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-14 19:06:46,382 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1961659683] [2024-10-14 19:06:46,382 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 19:06:46,382 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-10-14 19:06:46,382 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-14 19:06:46,383 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -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-10-14 19:06:46,386 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -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-10-14 19:06:46,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 19:06:46,521 INFO L255 TraceCheckSpWp]: Trace formula consists of 129 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-14 19:06:46,522 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 19:06:46,536 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 19:06:46,537 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-14 19:06:46,537 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-14 19:06:46,537 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1961659683] [2024-10-14 19:06:46,537 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1961659683] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 19:06:46,537 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 19:06:46,537 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-14 19:06:46,537 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [231328148] [2024-10-14 19:06:46,537 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 19:06:46,537 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-14 19:06:46,537 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-14 19:06:46,537 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-14 19:06:46,538 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 19:06:46,538 INFO L87 Difference]: Start difference. First operand 1030 states and 1202 transitions. Second operand has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 19:06:46,990 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 19:06:46,990 INFO L93 Difference]: Finished difference Result 976 states and 1122 transitions. [2024-10-14 19:06:46,991 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-14 19:06:46,991 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2024-10-14 19:06:46,991 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 19:06:46,993 INFO L225 Difference]: With dead ends: 976 [2024-10-14 19:06:46,993 INFO L226 Difference]: Without dead ends: 976 [2024-10-14 19:06:46,993 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 19:06:46,994 INFO L432 NwaCegarLoop]: 714 mSDtfsCounter, 61 mSDsluCounter, 672 mSDsCounter, 0 mSdLazyCounter, 182 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 61 SdHoareTripleChecker+Valid, 1386 SdHoareTripleChecker+Invalid, 182 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 182 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-14 19:06:46,994 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [61 Valid, 1386 Invalid, 182 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 182 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-14 19:06:46,995 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 976 states. [2024-10-14 19:06:47,000 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 976 to 976. [2024-10-14 19:06:47,001 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 976 states, 597 states have (on average 1.8693467336683418) internal successors, (1116), 971 states have internal predecessors, (1116), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-10-14 19:06:47,002 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 976 states to 976 states and 1122 transitions. [2024-10-14 19:06:47,002 INFO L78 Accepts]: Start accepts. Automaton has 976 states and 1122 transitions. Word has length 16 [2024-10-14 19:06:47,003 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 19:06:47,003 INFO L471 AbstractCegarLoop]: Abstraction has 976 states and 1122 transitions. [2024-10-14 19:06:47,003 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 19:06:47,003 INFO L276 IsEmpty]: Start isEmpty. Operand 976 states and 1122 transitions. [2024-10-14 19:06:47,003 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2024-10-14 19:06:47,003 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 19:06:47,003 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 19:06:47,010 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (13)] Ended with exit code 0 [2024-10-14 19:06:47,204 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -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-10-14 19:06:47,204 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr38REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 522 more)] === [2024-10-14 19:06:47,204 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 19:06:47,204 INFO L85 PathProgramCache]: Analyzing trace with hash 1180971323, now seen corresponding path program 1 times [2024-10-14 19:06:47,205 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-14 19:06:47,205 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2028458213] [2024-10-14 19:06:47,205 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 19:06:47,205 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-10-14 19:06:47,205 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-14 19:06:47,207 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -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-10-14 19:06:47,208 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -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-10-14 19:06:47,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 19:06:47,326 INFO L255 TraceCheckSpWp]: Trace formula consists of 132 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-14 19:06:47,328 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 19:06:47,340 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 19:06:47,340 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-14 19:06:47,340 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-14 19:06:47,340 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2028458213] [2024-10-14 19:06:47,340 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2028458213] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 19:06:47,340 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 19:06:47,340 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-14 19:06:47,340 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2019278898] [2024-10-14 19:06:47,341 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 19:06:47,341 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-14 19:06:47,341 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-14 19:06:47,341 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-14 19:06:47,341 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-14 19:06:47,341 INFO L87 Difference]: Start difference. First operand 976 states and 1122 transitions. Second operand has 4 states, 4 states have (on average 4.5) internal successors, (18), 4 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 19:06:47,925 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 19:06:47,925 INFO L93 Difference]: Finished difference Result 960 states and 1078 transitions. [2024-10-14 19:06:47,927 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-14 19:06:47,927 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.5) internal successors, (18), 4 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2024-10-14 19:06:47,927 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 19:06:47,929 INFO L225 Difference]: With dead ends: 960 [2024-10-14 19:06:47,929 INFO L226 Difference]: Without dead ends: 960 [2024-10-14 19:06:47,929 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-14 19:06:47,930 INFO L432 NwaCegarLoop]: 683 mSDtfsCounter, 45 mSDsluCounter, 1348 mSDsCounter, 0 mSdLazyCounter, 279 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 45 SdHoareTripleChecker+Valid, 2031 SdHoareTripleChecker+Invalid, 300 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 279 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-10-14 19:06:47,930 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [45 Valid, 2031 Invalid, 300 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 279 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-10-14 19:06:47,931 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 960 states. [2024-10-14 19:06:47,936 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 960 to 960. [2024-10-14 19:06:47,937 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 960 states, 595 states have (on average 1.8016806722689076) internal successors, (1072), 955 states have internal predecessors, (1072), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-10-14 19:06:47,938 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 960 states to 960 states and 1078 transitions. [2024-10-14 19:06:47,939 INFO L78 Accepts]: Start accepts. Automaton has 960 states and 1078 transitions. Word has length 18 [2024-10-14 19:06:47,939 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 19:06:47,939 INFO L471 AbstractCegarLoop]: Abstraction has 960 states and 1078 transitions. [2024-10-14 19:06:47,939 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.5) internal successors, (18), 4 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 19:06:47,939 INFO L276 IsEmpty]: Start isEmpty. Operand 960 states and 1078 transitions. [2024-10-14 19:06:47,939 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2024-10-14 19:06:47,939 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 19:06:47,940 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 19:06:47,950 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (14)] Forceful destruction successful, exit code 0 [2024-10-14 19:06:48,140 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -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-10-14 19:06:48,140 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr368REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 522 more)] === [2024-10-14 19:06:48,140 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 19:06:48,141 INFO L85 PathProgramCache]: Analyzing trace with hash 1386590436, now seen corresponding path program 1 times [2024-10-14 19:06:48,141 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-14 19:06:48,141 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1045620047] [2024-10-14 19:06:48,141 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 19:06:48,141 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-10-14 19:06:48,141 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-14 19:06:48,144 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -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-10-14 19:06:48,144 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -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-10-14 19:06:48,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 19:06:48,245 INFO L255 TraceCheckSpWp]: Trace formula consists of 106 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-10-14 19:06:48,246 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 19:06:48,250 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-10-14 19:06:48,300 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 19:06:48,301 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-14 19:06:48,301 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-14 19:06:48,301 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1045620047] [2024-10-14 19:06:48,301 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1045620047] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 19:06:48,301 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 19:06:48,301 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-14 19:06:48,301 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1609655343] [2024-10-14 19:06:48,301 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 19:06:48,302 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-14 19:06:48,302 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-14 19:06:48,302 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-14 19:06:48,302 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-14 19:06:48,302 INFO L87 Difference]: Start difference. First operand 960 states and 1078 transitions. Second operand has 4 states, 3 states have (on average 9.666666666666666) internal successors, (29), 3 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 19:06:49,693 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 19:06:49,694 INFO L93 Difference]: Finished difference Result 1132 states and 1251 transitions. [2024-10-14 19:06:49,694 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-14 19:06:49,694 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 9.666666666666666) internal successors, (29), 3 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 29 [2024-10-14 19:06:49,694 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 19:06:49,697 INFO L225 Difference]: With dead ends: 1132 [2024-10-14 19:06:49,697 INFO L226 Difference]: Without dead ends: 1132 [2024-10-14 19:06:49,697 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-14 19:06:49,697 INFO L432 NwaCegarLoop]: 436 mSDtfsCounter, 701 mSDsluCounter, 490 mSDsCounter, 0 mSdLazyCounter, 888 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 704 SdHoareTripleChecker+Valid, 926 SdHoareTripleChecker+Invalid, 896 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 888 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2024-10-14 19:06:49,697 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [704 Valid, 926 Invalid, 896 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 888 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2024-10-14 19:06:49,699 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1132 states. [2024-10-14 19:06:49,705 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1132 to 956. [2024-10-14 19:06:49,706 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 956 states, 595 states have (on average 1.781512605042017) internal successors, (1060), 951 states have internal predecessors, (1060), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-10-14 19:06:49,707 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 956 states to 956 states and 1066 transitions. [2024-10-14 19:06:49,707 INFO L78 Accepts]: Start accepts. Automaton has 956 states and 1066 transitions. Word has length 29 [2024-10-14 19:06:49,707 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 19:06:49,707 INFO L471 AbstractCegarLoop]: Abstraction has 956 states and 1066 transitions. [2024-10-14 19:06:49,708 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 9.666666666666666) internal successors, (29), 3 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 19:06:49,708 INFO L276 IsEmpty]: Start isEmpty. Operand 956 states and 1066 transitions. [2024-10-14 19:06:49,708 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2024-10-14 19:06:49,708 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 19:06:49,708 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 19:06:49,713 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -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-10-14 19:06:49,908 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -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-10-14 19:06:49,909 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr369REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 522 more)] === [2024-10-14 19:06:49,909 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 19:06:49,909 INFO L85 PathProgramCache]: Analyzing trace with hash 1386590437, now seen corresponding path program 1 times [2024-10-14 19:06:49,910 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-14 19:06:49,910 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1411571103] [2024-10-14 19:06:49,910 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 19:06:49,910 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-10-14 19:06:49,910 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-14 19:06:49,912 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -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-10-14 19:06:49,913 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -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-10-14 19:06:50,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 19:06:50,049 INFO L255 TraceCheckSpWp]: Trace formula consists of 106 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-10-14 19:06:50,051 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 19:06:50,061 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-10-14 19:06:50,275 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 19:06:50,275 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-14 19:06:50,275 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-14 19:06:50,275 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1411571103] [2024-10-14 19:06:50,275 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1411571103] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 19:06:50,275 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 19:06:50,275 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-14 19:06:50,275 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [706808221] [2024-10-14 19:06:50,275 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 19:06:50,276 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-14 19:06:50,276 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-14 19:06:50,276 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-14 19:06:50,276 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-14 19:06:50,276 INFO L87 Difference]: Start difference. First operand 956 states and 1066 transitions. Second operand has 4 states, 3 states have (on average 9.666666666666666) internal successors, (29), 3 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 19:06:52,069 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 19:06:52,069 INFO L93 Difference]: Finished difference Result 963 states and 1068 transitions. [2024-10-14 19:06:52,070 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-14 19:06:52,070 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 9.666666666666666) internal successors, (29), 3 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 29 [2024-10-14 19:06:52,070 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 19:06:52,072 INFO L225 Difference]: With dead ends: 963 [2024-10-14 19:06:52,072 INFO L226 Difference]: Without dead ends: 963 [2024-10-14 19:06:52,072 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-14 19:06:52,072 INFO L432 NwaCegarLoop]: 694 mSDtfsCounter, 71 mSDsluCounter, 737 mSDsCounter, 0 mSdLazyCounter, 915 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 71 SdHoareTripleChecker+Valid, 1431 SdHoareTripleChecker+Invalid, 918 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 915 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2024-10-14 19:06:52,072 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [71 Valid, 1431 Invalid, 918 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 915 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2024-10-14 19:06:52,074 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 963 states. [2024-10-14 19:06:52,086 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 963 to 956. [2024-10-14 19:06:52,087 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 956 states, 595 states have (on average 1.7747899159663865) internal successors, (1056), 951 states have internal predecessors, (1056), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-10-14 19:06:52,088 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 956 states to 956 states and 1062 transitions. [2024-10-14 19:06:52,088 INFO L78 Accepts]: Start accepts. Automaton has 956 states and 1062 transitions. Word has length 29 [2024-10-14 19:06:52,092 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 19:06:52,092 INFO L471 AbstractCegarLoop]: Abstraction has 956 states and 1062 transitions. [2024-10-14 19:06:52,092 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 9.666666666666666) internal successors, (29), 3 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 19:06:52,092 INFO L276 IsEmpty]: Start isEmpty. Operand 956 states and 1062 transitions. [2024-10-14 19:06:52,093 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2024-10-14 19:06:52,093 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 19:06:52,093 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 19:06:52,101 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -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)] Forceful destruction successful, exit code 0 [2024-10-14 19:06:52,293 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -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-10-14 19:06:52,293 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr52REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 522 more)] === [2024-10-14 19:06:52,294 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 19:06:52,294 INFO L85 PathProgramCache]: Analyzing trace with hash -1972786551, now seen corresponding path program 1 times [2024-10-14 19:06:52,294 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-14 19:06:52,294 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [380677014] [2024-10-14 19:06:52,294 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 19:06:52,294 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-10-14 19:06:52,294 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-14 19:06:52,295 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -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-10-14 19:06:52,297 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -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-10-14 19:06:52,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 19:06:52,446 INFO L255 TraceCheckSpWp]: Trace formula consists of 146 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-10-14 19:06:52,447 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 19:06:52,455 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-10-14 19:06:52,532 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 19:06:52,532 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-14 19:06:52,532 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-14 19:06:52,532 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [380677014] [2024-10-14 19:06:52,532 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [380677014] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 19:06:52,532 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 19:06:52,532 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-14 19:06:52,532 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [504414940] [2024-10-14 19:06:52,532 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 19:06:52,533 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-14 19:06:52,533 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-14 19:06:52,533 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-14 19:06:52,533 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-14 19:06:52,533 INFO L87 Difference]: Start difference. First operand 956 states and 1062 transitions. Second operand has 4 states, 3 states have (on average 10.666666666666666) internal successors, (32), 4 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 19:06:53,987 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 19:06:53,987 INFO L93 Difference]: Finished difference Result 963 states and 1064 transitions. [2024-10-14 19:06:53,988 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-14 19:06:53,988 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 10.666666666666666) internal successors, (32), 4 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 32 [2024-10-14 19:06:53,988 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 19:06:53,990 INFO L225 Difference]: With dead ends: 963 [2024-10-14 19:06:53,990 INFO L226 Difference]: Without dead ends: 963 [2024-10-14 19:06:53,991 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-14 19:06:53,991 INFO L432 NwaCegarLoop]: 502 mSDtfsCounter, 538 mSDsluCounter, 511 mSDsCounter, 0 mSdLazyCounter, 935 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 541 SdHoareTripleChecker+Valid, 1013 SdHoareTripleChecker+Invalid, 942 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 935 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2024-10-14 19:06:53,991 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [541 Valid, 1013 Invalid, 942 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 935 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2024-10-14 19:06:53,992 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 963 states. [2024-10-14 19:06:54,011 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 963 to 952. [2024-10-14 19:06:54,012 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 952 states, 595 states have (on average 1.761344537815126) internal successors, (1048), 947 states have internal predecessors, (1048), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-10-14 19:06:54,013 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 952 states to 952 states and 1054 transitions. [2024-10-14 19:06:54,013 INFO L78 Accepts]: Start accepts. Automaton has 952 states and 1054 transitions. Word has length 32 [2024-10-14 19:06:54,014 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 19:06:54,014 INFO L471 AbstractCegarLoop]: Abstraction has 952 states and 1054 transitions. [2024-10-14 19:06:54,014 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 10.666666666666666) internal successors, (32), 4 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 19:06:54,014 INFO L276 IsEmpty]: Start isEmpty. Operand 952 states and 1054 transitions. [2024-10-14 19:06:54,014 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2024-10-14 19:06:54,014 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 19:06:54,014 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 19:06:54,019 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (17)] Forceful destruction successful, exit code 0 [2024-10-14 19:06:54,215 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -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-10-14 19:06:54,215 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr53REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 522 more)] === [2024-10-14 19:06:54,215 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 19:06:54,216 INFO L85 PathProgramCache]: Analyzing trace with hash -1972786550, now seen corresponding path program 1 times [2024-10-14 19:06:54,216 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-14 19:06:54,216 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1948291629] [2024-10-14 19:06:54,216 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 19:06:54,216 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-10-14 19:06:54,216 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-14 19:06:54,218 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -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-10-14 19:06:54,219 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -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-10-14 19:06:54,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 19:06:54,355 INFO L255 TraceCheckSpWp]: Trace formula consists of 146 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-10-14 19:06:54,356 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 19:06:54,360 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-10-14 19:06:54,554 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 19:06:54,554 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-14 19:06:54,555 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-14 19:06:54,555 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1948291629] [2024-10-14 19:06:54,555 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1948291629] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 19:06:54,555 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 19:06:54,555 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-14 19:06:54,555 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1501225417] [2024-10-14 19:06:54,555 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 19:06:54,556 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-14 19:06:54,556 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-14 19:06:54,556 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-14 19:06:54,557 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-14 19:06:54,557 INFO L87 Difference]: Start difference. First operand 952 states and 1054 transitions. Second operand has 4 states, 3 states have (on average 10.666666666666666) internal successors, (32), 4 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 19:06:56,590 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 19:06:56,590 INFO L93 Difference]: Finished difference Result 1191 states and 1278 transitions. [2024-10-14 19:06:56,591 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-14 19:06:56,591 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 10.666666666666666) internal successors, (32), 4 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 32 [2024-10-14 19:06:56,592 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 19:06:56,594 INFO L225 Difference]: With dead ends: 1191 [2024-10-14 19:06:56,594 INFO L226 Difference]: Without dead ends: 1191 [2024-10-14 19:06:56,594 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-14 19:06:56,595 INFO L432 NwaCegarLoop]: 787 mSDtfsCounter, 313 mSDsluCounter, 769 mSDsCounter, 0 mSdLazyCounter, 1086 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 313 SdHoareTripleChecker+Valid, 1556 SdHoareTripleChecker+Invalid, 1089 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 1086 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2024-10-14 19:06:56,595 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [313 Valid, 1556 Invalid, 1089 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 1086 Invalid, 0 Unknown, 0 Unchecked, 2.0s Time] [2024-10-14 19:06:56,596 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1191 states. [2024-10-14 19:06:56,617 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1191 to 948. [2024-10-14 19:06:56,619 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 948 states, 595 states have (on average 1.7478991596638656) internal successors, (1040), 943 states have internal predecessors, (1040), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-10-14 19:06:56,620 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 948 states to 948 states and 1046 transitions. [2024-10-14 19:06:56,620 INFO L78 Accepts]: Start accepts. Automaton has 948 states and 1046 transitions. Word has length 32 [2024-10-14 19:06:56,620 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 19:06:56,620 INFO L471 AbstractCegarLoop]: Abstraction has 948 states and 1046 transitions. [2024-10-14 19:06:56,620 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 10.666666666666666) internal successors, (32), 4 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 19:06:56,620 INFO L276 IsEmpty]: Start isEmpty. Operand 948 states and 1046 transitions. [2024-10-14 19:06:56,621 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2024-10-14 19:06:56,621 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 19:06:56,621 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 19:06:56,628 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -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-10-14 19:06:56,821 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -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-10-14 19:06:56,822 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr414ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 522 more)] === [2024-10-14 19:06:56,823 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 19:06:56,823 INFO L85 PathProgramCache]: Analyzing trace with hash -2024880475, now seen corresponding path program 1 times [2024-10-14 19:06:56,823 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-14 19:06:56,823 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [662690907] [2024-10-14 19:06:56,823 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 19:06:56,823 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-10-14 19:06:56,823 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-14 19:06:56,824 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -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-10-14 19:06:56,826 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -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-10-14 19:06:56,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 19:06:56,941 INFO L255 TraceCheckSpWp]: Trace formula consists of 131 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-14 19:06:56,942 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 19:06:56,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-10-14 19:06:56,983 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-14 19:06:56,983 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-14 19:06:56,983 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [662690907] [2024-10-14 19:06:56,983 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [662690907] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 19:06:56,983 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 19:06:56,983 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-14 19:06:56,983 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1101575497] [2024-10-14 19:06:56,983 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 19:06:56,983 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-14 19:06:56,984 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-14 19:06:56,984 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-14 19:06:56,984 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-14 19:06:56,984 INFO L87 Difference]: Start difference. First operand 948 states and 1046 transitions. Second operand has 4 states, 4 states have (on average 12.25) internal successors, (49), 4 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 19:06:57,495 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 19:06:57,496 INFO L93 Difference]: Finished difference Result 930 states and 1016 transitions. [2024-10-14 19:06:57,501 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-14 19:06:57,501 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.25) internal successors, (49), 4 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 49 [2024-10-14 19:06:57,501 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 19:06:57,503 INFO L225 Difference]: With dead ends: 930 [2024-10-14 19:06:57,503 INFO L226 Difference]: Without dead ends: 930 [2024-10-14 19:06:57,503 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 46 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-14 19:06:57,507 INFO L432 NwaCegarLoop]: 673 mSDtfsCounter, 21 mSDsluCounter, 1323 mSDsCounter, 0 mSdLazyCounter, 276 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 1996 SdHoareTripleChecker+Invalid, 282 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 276 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-10-14 19:06:57,508 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 1996 Invalid, 282 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 276 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-10-14 19:06:57,509 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 930 states. [2024-10-14 19:06:57,519 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 930 to 930. [2024-10-14 19:06:57,523 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 930 states, 577 states have (on average 1.7504332755632583) internal successors, (1010), 925 states have internal predecessors, (1010), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-10-14 19:06:57,524 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 930 states to 930 states and 1016 transitions. [2024-10-14 19:06:57,524 INFO L78 Accepts]: Start accepts. Automaton has 930 states and 1016 transitions. Word has length 49 [2024-10-14 19:06:57,524 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 19:06:57,525 INFO L471 AbstractCegarLoop]: Abstraction has 930 states and 1016 transitions. [2024-10-14 19:06:57,525 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.25) internal successors, (49), 4 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 19:06:57,525 INFO L276 IsEmpty]: Start isEmpty. Operand 930 states and 1016 transitions. [2024-10-14 19:06:57,525 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2024-10-14 19:06:57,525 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 19:06:57,525 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 19:06:57,533 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -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-10-14 19:06:57,725 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -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-10-14 19:06:57,726 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr71REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 522 more)] === [2024-10-14 19:06:57,726 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 19:06:57,726 INFO L85 PathProgramCache]: Analyzing trace with hash -486844261, now seen corresponding path program 1 times [2024-10-14 19:06:57,726 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-14 19:06:57,726 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [613753770] [2024-10-14 19:06:57,726 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 19:06:57,726 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-10-14 19:06:57,727 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-14 19:06:57,729 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -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-10-14 19:06:57,730 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -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-10-14 19:06:57,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 19:06:57,893 INFO L255 TraceCheckSpWp]: Trace formula consists of 253 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-14 19:06:57,894 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 19:06:57,928 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 19:06:57,928 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-14 19:06:57,928 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-14 19:06:57,928 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [613753770] [2024-10-14 19:06:57,929 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [613753770] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 19:06:57,929 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 19:06:57,929 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-14 19:06:57,929 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [88143584] [2024-10-14 19:06:57,929 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 19:06:57,929 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-14 19:06:57,929 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-14 19:06:57,930 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-14 19:06:57,930 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-14 19:06:57,930 INFO L87 Difference]: Start difference. First operand 930 states and 1016 transitions. Second operand has 4 states, 4 states have (on average 12.75) internal successors, (51), 4 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 19:06:58,517 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 19:06:58,517 INFO L93 Difference]: Finished difference Result 918 states and 996 transitions. [2024-10-14 19:06:58,518 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-14 19:06:58,518 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.75) internal successors, (51), 4 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 51 [2024-10-14 19:06:58,519 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 19:06:58,520 INFO L225 Difference]: With dead ends: 918 [2024-10-14 19:06:58,521 INFO L226 Difference]: Without dead ends: 918 [2024-10-14 19:06:58,521 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-14 19:06:58,521 INFO L432 NwaCegarLoop]: 669 mSDtfsCounter, 15 mSDsluCounter, 1321 mSDsCounter, 0 mSdLazyCounter, 276 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 1990 SdHoareTripleChecker+Invalid, 282 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 276 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-10-14 19:06:58,521 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 1990 Invalid, 282 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 276 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-10-14 19:06:58,522 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 918 states. [2024-10-14 19:06:58,527 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 918 to 918. [2024-10-14 19:06:58,528 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 918 states, 565 states have (on average 1.752212389380531) internal successors, (990), 913 states have internal predecessors, (990), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-10-14 19:06:58,529 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 918 states to 918 states and 996 transitions. [2024-10-14 19:06:58,529 INFO L78 Accepts]: Start accepts. Automaton has 918 states and 996 transitions. Word has length 51 [2024-10-14 19:06:58,529 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 19:06:58,529 INFO L471 AbstractCegarLoop]: Abstraction has 918 states and 996 transitions. [2024-10-14 19:06:58,529 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.75) internal successors, (51), 4 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 19:06:58,530 INFO L276 IsEmpty]: Start isEmpty. Operand 918 states and 996 transitions. [2024-10-14 19:06:58,530 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2024-10-14 19:06:58,530 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 19:06:58,530 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 19:06:58,540 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (20)] Ended with exit code 0 [2024-10-14 19:06:58,732 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 20 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -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-10-14 19:06:58,732 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr414ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 522 more)] === [2024-10-14 19:06:58,732 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 19:06:58,732 INFO L85 PathProgramCache]: Analyzing trace with hash -730644507, now seen corresponding path program 1 times [2024-10-14 19:06:58,733 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-14 19:06:58,733 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2014249185] [2024-10-14 19:06:58,733 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 19:06:58,733 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-10-14 19:06:58,733 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-14 19:06:58,736 INFO L229 MonitoredProcess]: Starting monitored process 21 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -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-10-14 19:06:58,736 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -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-10-14 19:06:58,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 19:06:58,913 INFO L255 TraceCheckSpWp]: Trace formula consists of 151 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-10-14 19:06:58,914 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 19:06:58,930 INFO L173 IndexEqualityManager]: detected equality via solver [2024-10-14 19:06:58,931 INFO L173 IndexEqualityManager]: detected equality via solver [2024-10-14 19:06:58,931 INFO L173 IndexEqualityManager]: detected equality via solver [2024-10-14 19:06:58,933 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 39 [2024-10-14 19:06:58,989 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-14 19:06:58,989 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 70 treesize of output 26 [2024-10-14 19:06:59,023 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 19:06:59,025 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-14 19:06:59,025 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-14 19:06:59,025 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2014249185] [2024-10-14 19:06:59,025 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2014249185] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 19:06:59,025 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 19:06:59,025 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-14 19:06:59,026 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1663127350] [2024-10-14 19:06:59,026 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 19:06:59,026 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-14 19:06:59,026 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-14 19:06:59,026 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-14 19:06:59,026 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2024-10-14 19:06:59,027 INFO L87 Difference]: Start difference. First operand 918 states and 996 transitions. Second operand has 6 states, 6 states have (on average 8.833333333333334) internal successors, (53), 6 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 19:07:00,299 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 19:07:00,299 INFO L93 Difference]: Finished difference Result 1346 states and 1445 transitions. [2024-10-14 19:07:00,300 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-14 19:07:00,300 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.833333333333334) internal successors, (53), 6 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 53 [2024-10-14 19:07:00,300 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 19:07:00,303 INFO L225 Difference]: With dead ends: 1346 [2024-10-14 19:07:00,303 INFO L226 Difference]: Without dead ends: 1343 [2024-10-14 19:07:00,303 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2024-10-14 19:07:00,303 INFO L432 NwaCegarLoop]: 846 mSDtfsCounter, 1079 mSDsluCounter, 2526 mSDsCounter, 0 mSdLazyCounter, 487 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1085 SdHoareTripleChecker+Valid, 3372 SdHoareTripleChecker+Invalid, 489 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 487 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2024-10-14 19:07:00,304 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1085 Valid, 3372 Invalid, 489 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 487 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2024-10-14 19:07:00,305 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1343 states. [2024-10-14 19:07:00,311 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1343 to 869. [2024-10-14 19:07:00,312 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 869 states, 516 states have (on average 1.819767441860465) internal successors, (939), 864 states have internal predecessors, (939), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-10-14 19:07:00,313 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 869 states to 869 states and 945 transitions. [2024-10-14 19:07:00,313 INFO L78 Accepts]: Start accepts. Automaton has 869 states and 945 transitions. Word has length 53 [2024-10-14 19:07:00,313 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 19:07:00,314 INFO L471 AbstractCegarLoop]: Abstraction has 869 states and 945 transitions. [2024-10-14 19:07:00,314 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.833333333333334) internal successors, (53), 6 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 19:07:00,314 INFO L276 IsEmpty]: Start isEmpty. Operand 869 states and 945 transitions. [2024-10-14 19:07:00,314 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2024-10-14 19:07:00,314 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 19:07:00,314 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 19:07:00,322 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -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-10-14 19:07:00,515 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -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-10-14 19:07:00,515 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr71REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 522 more)] === [2024-10-14 19:07:00,516 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 19:07:00,516 INFO L85 PathProgramCache]: Analyzing trace with hash -1471935975, now seen corresponding path program 1 times [2024-10-14 19:07:00,516 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-14 19:07:00,516 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [639638165] [2024-10-14 19:07:00,516 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 19:07:00,516 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-10-14 19:07:00,517 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-14 19:07:00,519 INFO L229 MonitoredProcess]: Starting monitored process 22 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -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-10-14 19:07:00,520 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -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-10-14 19:07:00,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 19:07:00,768 INFO L255 TraceCheckSpWp]: Trace formula consists of 273 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-10-14 19:07:00,770 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 19:07:00,774 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-10-14 19:07:00,780 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-10-14 19:07:01,090 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-14 19:07:01,091 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 9 [2024-10-14 19:07:01,100 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2024-10-14 19:07:01,101 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 13 [2024-10-14 19:07:01,108 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 19:07:01,108 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-14 19:07:01,108 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-14 19:07:01,108 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [639638165] [2024-10-14 19:07:01,108 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [639638165] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 19:07:01,108 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 19:07:01,108 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-14 19:07:01,108 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2054122156] [2024-10-14 19:07:01,109 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 19:07:01,109 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-14 19:07:01,109 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-14 19:07:01,109 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-14 19:07:01,109 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-14 19:07:01,110 INFO L87 Difference]: Start difference. First operand 869 states and 945 transitions. Second operand has 4 states, 3 states have (on average 18.333333333333332) internal successors, (55), 4 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 19:07:02,560 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 19:07:02,561 INFO L93 Difference]: Finished difference Result 831 states and 907 transitions. [2024-10-14 19:07:02,561 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-14 19:07:02,561 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 18.333333333333332) internal successors, (55), 4 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 55 [2024-10-14 19:07:02,561 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 19:07:02,563 INFO L225 Difference]: With dead ends: 831 [2024-10-14 19:07:02,563 INFO L226 Difference]: Without dead ends: 831 [2024-10-14 19:07:02,563 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 52 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-10-14 19:07:02,564 INFO L432 NwaCegarLoop]: 334 mSDtfsCounter, 467 mSDsluCounter, 130 mSDsCounter, 0 mSdLazyCounter, 682 mSolverCounterSat, 41 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 470 SdHoareTripleChecker+Valid, 464 SdHoareTripleChecker+Invalid, 723 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 41 IncrementalHoareTripleChecker+Valid, 682 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2024-10-14 19:07:02,564 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [470 Valid, 464 Invalid, 723 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [41 Valid, 682 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2024-10-14 19:07:02,565 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 831 states. [2024-10-14 19:07:02,569 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 831 to 804. [2024-10-14 19:07:02,570 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 804 states, 489 states have (on average 1.7116564417177915) internal successors, (837), 799 states have internal predecessors, (837), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-10-14 19:07:02,571 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 804 states to 804 states and 843 transitions. [2024-10-14 19:07:02,571 INFO L78 Accepts]: Start accepts. Automaton has 804 states and 843 transitions. Word has length 55 [2024-10-14 19:07:02,571 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 19:07:02,571 INFO L471 AbstractCegarLoop]: Abstraction has 804 states and 843 transitions. [2024-10-14 19:07:02,571 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 18.333333333333332) internal successors, (55), 4 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 19:07:02,571 INFO L276 IsEmpty]: Start isEmpty. Operand 804 states and 843 transitions. [2024-10-14 19:07:02,572 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2024-10-14 19:07:02,572 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 19:07:02,572 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 19:07:02,579 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (22)] Forceful destruction successful, exit code 0 [2024-10-14 19:07:02,776 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 22 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -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-10-14 19:07:02,777 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr76REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 522 more)] === [2024-10-14 19:07:02,778 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 19:07:02,778 INFO L85 PathProgramCache]: Analyzing trace with hash -1034628450, now seen corresponding path program 1 times [2024-10-14 19:07:02,778 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-14 19:07:02,778 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [85953765] [2024-10-14 19:07:02,778 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 19:07:02,778 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-10-14 19:07:02,779 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-14 19:07:02,781 INFO L229 MonitoredProcess]: Starting monitored process 23 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -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-10-14 19:07:02,781 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -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-10-14 19:07:02,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 19:07:02,990 INFO L255 TraceCheckSpWp]: Trace formula consists of 299 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-10-14 19:07:02,992 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 19:07:02,996 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2024-10-14 19:07:03,007 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2024-10-14 19:07:03,022 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2024-10-14 19:07:03,029 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 19:07:03,029 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-14 19:07:03,030 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-14 19:07:03,030 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [85953765] [2024-10-14 19:07:03,030 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [85953765] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 19:07:03,030 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 19:07:03,030 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-14 19:07:03,030 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [262407848] [2024-10-14 19:07:03,030 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 19:07:03,030 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-14 19:07:03,031 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-14 19:07:03,031 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-14 19:07:03,031 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-14 19:07:03,031 INFO L87 Difference]: Start difference. First operand 804 states and 843 transitions. Second operand has 5 states, 4 states have (on average 14.75) internal successors, (59), 5 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 19:07:04,739 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 19:07:04,740 INFO L93 Difference]: Finished difference Result 803 states and 842 transitions. [2024-10-14 19:07:04,740 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-14 19:07:04,740 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 14.75) internal successors, (59), 5 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 59 [2024-10-14 19:07:04,754 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 19:07:04,756 INFO L225 Difference]: With dead ends: 803 [2024-10-14 19:07:04,756 INFO L226 Difference]: Without dead ends: 803 [2024-10-14 19:07:04,756 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 55 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-10-14 19:07:04,756 INFO L432 NwaCegarLoop]: 643 mSDtfsCounter, 2 mSDsluCounter, 1036 mSDsCounter, 0 mSdLazyCounter, 1225 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 1679 SdHoareTripleChecker+Invalid, 1226 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 1225 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2024-10-14 19:07:04,756 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 1679 Invalid, 1226 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 1225 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2024-10-14 19:07:04,758 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 803 states. [2024-10-14 19:07:04,762 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 803 to 803. [2024-10-14 19:07:04,763 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 803 states, 489 states have (on average 1.7096114519427403) internal successors, (836), 798 states have internal predecessors, (836), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-10-14 19:07:04,764 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 803 states to 803 states and 842 transitions. [2024-10-14 19:07:04,764 INFO L78 Accepts]: Start accepts. Automaton has 803 states and 842 transitions. Word has length 59 [2024-10-14 19:07:04,764 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 19:07:04,764 INFO L471 AbstractCegarLoop]: Abstraction has 803 states and 842 transitions. [2024-10-14 19:07:04,764 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 14.75) internal successors, (59), 5 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 19:07:04,764 INFO L276 IsEmpty]: Start isEmpty. Operand 803 states and 842 transitions. [2024-10-14 19:07:04,765 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2024-10-14 19:07:04,765 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 19:07:04,765 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 19:07:04,772 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -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)] Forceful destruction successful, exit code 0 [2024-10-14 19:07:04,965 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 23 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -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-10-14 19:07:04,966 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr77REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 522 more)] === [2024-10-14 19:07:04,966 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 19:07:04,967 INFO L85 PathProgramCache]: Analyzing trace with hash -1034628449, now seen corresponding path program 1 times [2024-10-14 19:07:04,967 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-14 19:07:04,967 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1955467949] [2024-10-14 19:07:04,967 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 19:07:04,967 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-10-14 19:07:04,967 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-14 19:07:04,970 INFO L229 MonitoredProcess]: Starting monitored process 24 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -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-10-14 19:07:04,970 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -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-10-14 19:07:05,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 19:07:05,173 INFO L255 TraceCheckSpWp]: Trace formula consists of 299 conjuncts, 12 conjuncts are in the unsatisfiable core [2024-10-14 19:07:05,175 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 19:07:05,187 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-10-14 19:07:05,199 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2024-10-14 19:07:05,202 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2024-10-14 19:07:05,227 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 9 [2024-10-14 19:07:05,239 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 19:07:05,239 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-14 19:07:05,239 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-14 19:07:05,239 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1955467949] [2024-10-14 19:07:05,239 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1955467949] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 19:07:05,239 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 19:07:05,239 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-14 19:07:05,239 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [901322523] [2024-10-14 19:07:05,240 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 19:07:05,240 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-14 19:07:05,240 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-14 19:07:05,240 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-14 19:07:05,240 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-14 19:07:05,240 INFO L87 Difference]: Start difference. First operand 803 states and 842 transitions. Second operand has 5 states, 4 states have (on average 14.75) internal successors, (59), 5 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 19:07:07,284 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 19:07:07,284 INFO L93 Difference]: Finished difference Result 802 states and 841 transitions. [2024-10-14 19:07:07,285 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-14 19:07:07,286 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 14.75) internal successors, (59), 5 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 59 [2024-10-14 19:07:07,286 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 19:07:07,288 INFO L225 Difference]: With dead ends: 802 [2024-10-14 19:07:07,288 INFO L226 Difference]: Without dead ends: 802 [2024-10-14 19:07:07,288 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 55 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-10-14 19:07:07,288 INFO L432 NwaCegarLoop]: 643 mSDtfsCounter, 1 mSDsluCounter, 1055 mSDsCounter, 0 mSdLazyCounter, 1203 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 1698 SdHoareTripleChecker+Invalid, 1204 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 1203 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2024-10-14 19:07:07,288 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 1698 Invalid, 1204 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 1203 Invalid, 0 Unknown, 0 Unchecked, 2.0s Time] [2024-10-14 19:07:07,290 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 802 states. [2024-10-14 19:07:07,294 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 802 to 802. [2024-10-14 19:07:07,295 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 802 states, 488 states have (on average 1.7110655737704918) internal successors, (835), 797 states have internal predecessors, (835), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-10-14 19:07:07,296 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 802 states to 802 states and 841 transitions. [2024-10-14 19:07:07,296 INFO L78 Accepts]: Start accepts. Automaton has 802 states and 841 transitions. Word has length 59 [2024-10-14 19:07:07,296 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 19:07:07,296 INFO L471 AbstractCegarLoop]: Abstraction has 802 states and 841 transitions. [2024-10-14 19:07:07,296 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 14.75) internal successors, (59), 5 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 19:07:07,296 INFO L276 IsEmpty]: Start isEmpty. Operand 802 states and 841 transitions. [2024-10-14 19:07:07,306 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2024-10-14 19:07:07,307 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 19:07:07,307 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 19:07:07,318 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -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-10-14 19:07:07,507 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 24 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -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-10-14 19:07:07,508 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr80REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 522 more)] === [2024-10-14 19:07:07,509 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 19:07:07,509 INFO L85 PathProgramCache]: Analyzing trace with hash -278426142, now seen corresponding path program 1 times [2024-10-14 19:07:07,509 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-14 19:07:07,509 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [948563942] [2024-10-14 19:07:07,509 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 19:07:07,510 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-10-14 19:07:07,510 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-14 19:07:07,513 INFO L229 MonitoredProcess]: Starting monitored process 25 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -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-10-14 19:07:07,514 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -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-10-14 19:07:07,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 19:07:07,736 INFO L255 TraceCheckSpWp]: Trace formula consists of 325 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-14 19:07:07,737 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 19:07:07,749 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 19:07:07,750 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-14 19:07:07,750 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-14 19:07:07,750 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [948563942] [2024-10-14 19:07:07,750 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [948563942] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 19:07:07,750 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 19:07:07,750 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-14 19:07:07,751 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [559909735] [2024-10-14 19:07:07,751 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 19:07:07,751 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-14 19:07:07,751 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-14 19:07:07,752 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-14 19:07:07,752 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-14 19:07:07,753 INFO L87 Difference]: Start difference. First operand 802 states and 841 transitions. Second operand has 4 states, 3 states have (on average 21.0) internal successors, (63), 4 states have internal predecessors, (63), 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-10-14 19:07:08,302 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 19:07:08,302 INFO L93 Difference]: Finished difference Result 804 states and 844 transitions. [2024-10-14 19:07:08,303 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-14 19:07:08,303 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 21.0) internal successors, (63), 4 states have internal predecessors, (63), 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 65 [2024-10-14 19:07:08,304 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 19:07:08,307 INFO L225 Difference]: With dead ends: 804 [2024-10-14 19:07:08,307 INFO L226 Difference]: Without dead ends: 804 [2024-10-14 19:07:08,307 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 62 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-10-14 19:07:08,308 INFO L432 NwaCegarLoop]: 643 mSDtfsCounter, 0 mSDsluCounter, 1283 mSDsCounter, 0 mSdLazyCounter, 254 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1926 SdHoareTripleChecker+Invalid, 255 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 254 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-10-14 19:07:08,308 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1926 Invalid, 255 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 254 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-10-14 19:07:08,309 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 804 states. [2024-10-14 19:07:08,315 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 804 to 804. [2024-10-14 19:07:08,316 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 804 states, 489 states have (on average 1.7116564417177915) internal successors, (837), 799 states have internal predecessors, (837), 3 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2024-10-14 19:07:08,317 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 804 states to 804 states and 844 transitions. [2024-10-14 19:07:08,317 INFO L78 Accepts]: Start accepts. Automaton has 804 states and 844 transitions. Word has length 65 [2024-10-14 19:07:08,317 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 19:07:08,317 INFO L471 AbstractCegarLoop]: Abstraction has 804 states and 844 transitions. [2024-10-14 19:07:08,317 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 21.0) internal successors, (63), 4 states have internal predecessors, (63), 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-10-14 19:07:08,317 INFO L276 IsEmpty]: Start isEmpty. Operand 804 states and 844 transitions. [2024-10-14 19:07:08,318 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2024-10-14 19:07:08,318 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 19:07:08,318 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 19:07:08,331 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -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-10-14 19:07:08,519 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 25 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -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-10-14 19:07:08,519 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr80REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 522 more)] === [2024-10-14 19:07:08,519 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 19:07:08,519 INFO L85 PathProgramCache]: Analyzing trace with hash -816332121, now seen corresponding path program 1 times [2024-10-14 19:07:08,520 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-14 19:07:08,520 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1657703161] [2024-10-14 19:07:08,520 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 19:07:08,520 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-10-14 19:07:08,520 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-14 19:07:08,521 INFO L229 MonitoredProcess]: Starting monitored process 26 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -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-10-14 19:07:08,523 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -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-10-14 19:07:08,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 19:07:08,785 INFO L255 TraceCheckSpWp]: Trace formula consists of 336 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-10-14 19:07:08,787 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 19:07:08,806 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 19:07:08,806 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-14 19:07:08,853 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 19:07:08,853 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-14 19:07:08,853 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1657703161] [2024-10-14 19:07:08,853 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1657703161] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-14 19:07:08,853 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-14 19:07:08,853 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 8 [2024-10-14 19:07:08,854 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [177140373] [2024-10-14 19:07:08,854 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-14 19:07:08,854 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-14 19:07:08,854 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-14 19:07:08,854 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-14 19:07:08,855 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2024-10-14 19:07:08,855 INFO L87 Difference]: Start difference. First operand 804 states and 844 transitions. Second operand has 8 states, 6 states have (on average 11.166666666666666) internal successors, (67), 8 states have internal predecessors, (67), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-14 19:07:09,547 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 19:07:09,547 INFO L93 Difference]: Finished difference Result 813 states and 858 transitions. [2024-10-14 19:07:09,548 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-10-14 19:07:09,549 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 6 states have (on average 11.166666666666666) internal successors, (67), 8 states have internal predecessors, (67), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 66 [2024-10-14 19:07:09,549 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 19:07:09,551 INFO L225 Difference]: With dead ends: 813 [2024-10-14 19:07:09,551 INFO L226 Difference]: Without dead ends: 813 [2024-10-14 19:07:09,551 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 133 GetRequests, 124 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=44, Invalid=66, Unknown=0, NotChecked=0, Total=110 [2024-10-14 19:07:09,551 INFO L432 NwaCegarLoop]: 642 mSDtfsCounter, 5 mSDsluCounter, 1282 mSDsCounter, 0 mSdLazyCounter, 291 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 1924 SdHoareTripleChecker+Invalid, 298 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 291 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-10-14 19:07:09,551 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 1924 Invalid, 298 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 291 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-10-14 19:07:09,552 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 813 states. [2024-10-14 19:07:09,558 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 813 to 812. [2024-10-14 19:07:09,559 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 812 states, 496 states have (on average 1.7137096774193548) internal successors, (850), 806 states have internal predecessors, (850), 3 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2024-10-14 19:07:09,560 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 812 states to 812 states and 857 transitions. [2024-10-14 19:07:09,560 INFO L78 Accepts]: Start accepts. Automaton has 812 states and 857 transitions. Word has length 66 [2024-10-14 19:07:09,560 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 19:07:09,560 INFO L471 AbstractCegarLoop]: Abstraction has 812 states and 857 transitions. [2024-10-14 19:07:09,560 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 6 states have (on average 11.166666666666666) internal successors, (67), 8 states have internal predecessors, (67), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-14 19:07:09,560 INFO L276 IsEmpty]: Start isEmpty. Operand 812 states and 857 transitions. [2024-10-14 19:07:09,561 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2024-10-14 19:07:09,561 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 19:07:09,561 INFO L215 NwaCegarLoop]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 19:07:09,570 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -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-10-14 19:07:09,761 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 26 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -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-10-14 19:07:09,762 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr80REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 522 more)] === [2024-10-14 19:07:09,762 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 19:07:09,762 INFO L85 PathProgramCache]: Analyzing trace with hash -2077157598, now seen corresponding path program 2 times [2024-10-14 19:07:09,762 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-14 19:07:09,763 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [895529972] [2024-10-14 19:07:09,763 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-10-14 19:07:09,763 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-10-14 19:07:09,763 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-14 19:07:09,764 INFO L229 MonitoredProcess]: Starting monitored process 27 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -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-10-14 19:07:09,767 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -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-10-14 19:07:10,124 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-10-14 19:07:10,124 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-14 19:07:10,136 INFO L255 TraceCheckSpWp]: Trace formula consists of 369 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-10-14 19:07:10,137 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 19:07:10,177 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 19:07:10,177 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-14 19:07:10,291 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 19:07:10,292 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-14 19:07:10,292 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [895529972] [2024-10-14 19:07:10,292 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [895529972] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-14 19:07:10,292 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-14 19:07:10,292 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 14 [2024-10-14 19:07:10,292 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2029553833] [2024-10-14 19:07:10,292 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-14 19:07:10,292 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-10-14 19:07:10,292 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-14 19:07:10,298 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-10-14 19:07:10,298 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=121, Unknown=0, NotChecked=0, Total=182 [2024-10-14 19:07:10,299 INFO L87 Difference]: Start difference. First operand 812 states and 857 transitions. Second operand has 14 states, 12 states have (on average 6.083333333333333) internal successors, (73), 14 states have internal predecessors, (73), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-14 19:07:11,885 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 19:07:11,885 INFO L93 Difference]: Finished difference Result 824 states and 876 transitions. [2024-10-14 19:07:11,886 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2024-10-14 19:07:11,886 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 12 states have (on average 6.083333333333333) internal successors, (73), 14 states have internal predecessors, (73), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 69 [2024-10-14 19:07:11,886 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 19:07:11,888 INFO L225 Difference]: With dead ends: 824 [2024-10-14 19:07:11,888 INFO L226 Difference]: Without dead ends: 822 [2024-10-14 19:07:11,888 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 145 GetRequests, 124 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=182, Invalid=324, Unknown=0, NotChecked=0, Total=506 [2024-10-14 19:07:11,889 INFO L432 NwaCegarLoop]: 642 mSDtfsCounter, 8 mSDsluCounter, 4484 mSDsCounter, 0 mSdLazyCounter, 816 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 5126 SdHoareTripleChecker+Invalid, 834 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 816 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2024-10-14 19:07:11,889 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 5126 Invalid, 834 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 816 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2024-10-14 19:07:11,889 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 822 states. [2024-10-14 19:07:11,895 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 822 to 821. [2024-10-14 19:07:11,895 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 821 states, 505 states have (on average 1.706930693069307) internal successors, (862), 815 states have internal predecessors, (862), 3 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2024-10-14 19:07:11,896 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 821 states to 821 states and 869 transitions. [2024-10-14 19:07:11,896 INFO L78 Accepts]: Start accepts. Automaton has 821 states and 869 transitions. Word has length 69 [2024-10-14 19:07:11,896 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 19:07:11,897 INFO L471 AbstractCegarLoop]: Abstraction has 821 states and 869 transitions. [2024-10-14 19:07:11,897 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 12 states have (on average 6.083333333333333) internal successors, (73), 14 states have internal predecessors, (73), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-14 19:07:11,897 INFO L276 IsEmpty]: Start isEmpty. Operand 821 states and 869 transitions. [2024-10-14 19:07:11,897 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2024-10-14 19:07:11,897 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 19:07:11,897 INFO L215 NwaCegarLoop]: trace histogram [10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 19:07:11,905 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (27)] Forceful destruction successful, exit code 0 [2024-10-14 19:07:12,101 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 27 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -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-10-14 19:07:12,102 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr80REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 522 more)] === [2024-10-14 19:07:12,102 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 19:07:12,102 INFO L85 PathProgramCache]: Analyzing trace with hash -12060414, now seen corresponding path program 3 times [2024-10-14 19:07:12,102 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-14 19:07:12,102 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [627890910] [2024-10-14 19:07:12,102 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-10-14 19:07:12,102 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-10-14 19:07:12,102 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-14 19:07:12,104 INFO L229 MonitoredProcess]: Starting monitored process 28 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -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-10-14 19:07:12,109 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -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-10-14 19:07:12,737 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2024-10-14 19:07:12,738 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-14 19:07:12,749 INFO L255 TraceCheckSpWp]: Trace formula consists of 435 conjuncts, 14 conjuncts are in the unsatisfiable core [2024-10-14 19:07:12,751 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 19:07:12,855 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 19:07:12,856 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-14 19:07:13,259 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 19:07:13,259 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-14 19:07:13,259 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [627890910] [2024-10-14 19:07:13,259 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [627890910] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-14 19:07:13,259 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-14 19:07:13,259 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 26 [2024-10-14 19:07:13,260 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [896320008] [2024-10-14 19:07:13,260 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-14 19:07:13,260 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2024-10-14 19:07:13,260 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-14 19:07:13,261 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2024-10-14 19:07:13,261 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=193, Invalid=457, Unknown=0, NotChecked=0, Total=650 [2024-10-14 19:07:13,261 INFO L87 Difference]: Start difference. First operand 821 states and 869 transitions. Second operand has 26 states, 24 states have (on average 3.5416666666666665) internal successors, (85), 26 states have internal predecessors, (85), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-14 19:07:16,752 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 19:07:16,753 INFO L93 Difference]: Finished difference Result 842 states and 905 transitions. [2024-10-14 19:07:16,753 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2024-10-14 19:07:16,753 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 24 states have (on average 3.5416666666666665) internal successors, (85), 26 states have internal predecessors, (85), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 75 [2024-10-14 19:07:16,753 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 19:07:16,755 INFO L225 Difference]: With dead ends: 842 [2024-10-14 19:07:16,755 INFO L226 Difference]: Without dead ends: 839 [2024-10-14 19:07:16,755 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 169 GetRequests, 124 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 100 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=728, Invalid=1434, Unknown=0, NotChecked=0, Total=2162 [2024-10-14 19:07:16,756 INFO L432 NwaCegarLoop]: 642 mSDtfsCounter, 14 mSDsluCounter, 8328 mSDsCounter, 0 mSdLazyCounter, 1694 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 8970 SdHoareTripleChecker+Invalid, 1713 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 1694 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.7s IncrementalHoareTripleChecker+Time [2024-10-14 19:07:16,756 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 8970 Invalid, 1713 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 1694 Invalid, 0 Unknown, 0 Unchecked, 2.7s Time] [2024-10-14 19:07:16,757 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 839 states. [2024-10-14 19:07:16,762 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 839 to 839. [2024-10-14 19:07:16,762 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 839 states, 523 states have (on average 1.6921606118546846) internal successors, (885), 833 states have internal predecessors, (885), 3 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2024-10-14 19:07:16,763 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 839 states to 839 states and 892 transitions. [2024-10-14 19:07:16,763 INFO L78 Accepts]: Start accepts. Automaton has 839 states and 892 transitions. Word has length 75 [2024-10-14 19:07:16,763 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 19:07:16,764 INFO L471 AbstractCegarLoop]: Abstraction has 839 states and 892 transitions. [2024-10-14 19:07:16,764 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 24 states have (on average 3.5416666666666665) internal successors, (85), 26 states have internal predecessors, (85), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-14 19:07:16,764 INFO L276 IsEmpty]: Start isEmpty. Operand 839 states and 892 transitions. [2024-10-14 19:07:16,764 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2024-10-14 19:07:16,764 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 19:07:16,764 INFO L215 NwaCegarLoop]: trace histogram [22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 19:07:16,774 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -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)] Forceful destruction successful, exit code 0 [2024-10-14 19:07:16,968 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 28 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -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-10-14 19:07:16,968 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr80REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 522 more)] === [2024-10-14 19:07:16,969 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 19:07:16,969 INFO L85 PathProgramCache]: Analyzing trace with hash 1524171970, now seen corresponding path program 4 times [2024-10-14 19:07:16,969 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-14 19:07:16,969 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2035202503] [2024-10-14 19:07:16,969 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2024-10-14 19:07:16,969 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-10-14 19:07:16,969 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-14 19:07:16,972 INFO L229 MonitoredProcess]: Starting monitored process 29 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -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-10-14 19:07:16,973 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -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-10-14 19:07:17,420 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2024-10-14 19:07:17,420 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-14 19:07:17,434 INFO L255 TraceCheckSpWp]: Trace formula consists of 567 conjuncts, 25 conjuncts are in the unsatisfiable core [2024-10-14 19:07:17,435 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 19:07:17,741 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 0 proven. 253 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 19:07:17,741 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-14 19:07:18,883 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 0 proven. 253 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 19:07:18,883 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-14 19:07:18,883 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2035202503] [2024-10-14 19:07:18,883 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2035202503] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-14 19:07:18,883 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-14 19:07:18,883 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 26] total 50 [2024-10-14 19:07:18,883 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1924050693] [2024-10-14 19:07:18,883 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-14 19:07:18,884 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 50 states [2024-10-14 19:07:18,884 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-14 19:07:18,884 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2024-10-14 19:07:18,885 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=672, Invalid=1778, Unknown=0, NotChecked=0, Total=2450 [2024-10-14 19:07:18,885 INFO L87 Difference]: Start difference. First operand 839 states and 892 transitions. Second operand has 50 states, 48 states have (on average 2.2708333333333335) internal successors, (109), 50 states have internal predecessors, (109), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-14 19:07:26,363 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 19:07:26,363 INFO L93 Difference]: Finished difference Result 876 states and 961 transitions. [2024-10-14 19:07:26,365 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 71 states. [2024-10-14 19:07:26,365 INFO L78 Accepts]: Start accepts. Automaton has has 50 states, 48 states have (on average 2.2708333333333335) internal successors, (109), 50 states have internal predecessors, (109), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 87 [2024-10-14 19:07:26,365 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 19:07:26,368 INFO L225 Difference]: With dead ends: 876 [2024-10-14 19:07:26,368 INFO L226 Difference]: Without dead ends: 874 [2024-10-14 19:07:26,369 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 215 GetRequests, 124 SyntacticMatches, 0 SemanticMatches, 91 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 465 ImplicationChecksByTransitivity, 3.9s TimeCoverageRelationStatistics Valid=2713, Invalid=5843, Unknown=0, NotChecked=0, Total=8556 [2024-10-14 19:07:26,370 INFO L432 NwaCegarLoop]: 642 mSDtfsCounter, 25 mSDsluCounter, 14743 mSDsCounter, 0 mSdLazyCounter, 3827 mSolverCounterSat, 54 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 15385 SdHoareTripleChecker+Invalid, 3881 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 54 IncrementalHoareTripleChecker+Valid, 3827 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.7s IncrementalHoareTripleChecker+Time [2024-10-14 19:07:26,370 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [25 Valid, 15385 Invalid, 3881 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [54 Valid, 3827 Invalid, 0 Unknown, 0 Unchecked, 4.7s Time] [2024-10-14 19:07:26,371 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 874 states. [2024-10-14 19:07:26,376 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 874 to 873. [2024-10-14 19:07:26,377 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 873 states, 557 states have (on average 1.6714542190305206) internal successors, (931), 867 states have internal predecessors, (931), 3 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2024-10-14 19:07:26,380 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 873 states to 873 states and 938 transitions. [2024-10-14 19:07:26,380 INFO L78 Accepts]: Start accepts. Automaton has 873 states and 938 transitions. Word has length 87 [2024-10-14 19:07:26,380 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 19:07:26,381 INFO L471 AbstractCegarLoop]: Abstraction has 873 states and 938 transitions. [2024-10-14 19:07:26,381 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 50 states, 48 states have (on average 2.2708333333333335) internal successors, (109), 50 states have internal predecessors, (109), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-14 19:07:26,381 INFO L276 IsEmpty]: Start isEmpty. Operand 873 states and 938 transitions. [2024-10-14 19:07:26,381 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2024-10-14 19:07:26,381 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 19:07:26,382 INFO L215 NwaCegarLoop]: trace histogram [44, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 19:07:26,393 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -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)] Forceful destruction successful, exit code 0 [2024-10-14 19:07:26,582 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 29 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -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-10-14 19:07:26,583 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr80REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 522 more)] === [2024-10-14 19:07:26,583 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 19:07:26,583 INFO L85 PathProgramCache]: Analyzing trace with hash -208399454, now seen corresponding path program 5 times [2024-10-14 19:07:26,584 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-14 19:07:26,584 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [562742198] [2024-10-14 19:07:26,584 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2024-10-14 19:07:26,584 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-10-14 19:07:26,584 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-14 19:07:26,587 INFO L229 MonitoredProcess]: Starting monitored process 30 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -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-10-14 19:07:26,587 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (30)] Waiting until timeout for monitored process [2024-10-14 19:07:27,673 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 23 check-sat command(s) [2024-10-14 19:07:27,674 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-14 19:07:27,701 INFO L255 TraceCheckSpWp]: Trace formula consists of 809 conjuncts, 59 conjuncts are in the unsatisfiable core [2024-10-14 19:07:27,706 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 19:07:27,711 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-10-14 19:07:27,778 INFO L349 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2024-10-14 19:07:27,779 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 27 [2024-10-14 19:07:27,806 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2024-10-14 19:07:27,871 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 12 [2024-10-14 19:07:28,553 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-10-14 19:07:28,553 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 44 treesize of output 43 [2024-10-14 19:07:28,589 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 15 [2024-10-14 19:07:28,613 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 44 refuted. 0 times theorem prover too weak. 946 trivial. 0 not checked. [2024-10-14 19:07:28,613 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-14 19:07:28,920 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-14 19:07:28,921 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [562742198] [2024-10-14 19:07:28,921 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [562742198] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-14 19:07:28,921 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc5 [1468097678] [2024-10-14 19:07:28,921 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2024-10-14 19:07:28,921 INFO L173 SolverBuilder]: Constructing external solver with command: cvc5 --incremental --print-success --lang smt [2024-10-14 19:07:28,921 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc5 [2024-10-14 19:07:28,923 INFO L229 MonitoredProcess]: Starting monitored process 31 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc5 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-10-14 19:07:28,924 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc5 --incremental --print-success --lang smt (31)] Waiting until timeout for monitored process [2024-10-14 19:07:29,412 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 23 check-sat command(s) [2024-10-14 19:07:29,412 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-14 19:07:29,460 WARN L253 TraceCheckSpWp]: Trace formula consists of 809 conjuncts, 618 conjuncts are in the unsatisfiable core [2024-10-14 19:07:29,488 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 19:07:29,492 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-10-14 19:07:29,497 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 8 treesize of output 1 [2024-10-14 19:07:29,525 INFO L173 IndexEqualityManager]: detected equality via solver [2024-10-14 19:07:29,525 INFO L173 IndexEqualityManager]: detected equality via solver [2024-10-14 19:07:29,526 INFO L173 IndexEqualityManager]: detected equality via solver [2024-10-14 19:07:29,526 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 6 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-10-14 19:07:29,597 INFO L349 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2024-10-14 19:07:29,598 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 18 [2024-10-14 19:07:29,611 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-10-14 19:07:29,818 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2024-10-14 19:07:29,822 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2024-10-14 19:07:29,835 INFO L173 IndexEqualityManager]: detected equality via solver [2024-10-14 19:07:29,835 INFO L173 IndexEqualityManager]: detected equality via solver [2024-10-14 19:07:29,836 INFO L173 IndexEqualityManager]: detected equality via solver [2024-10-14 19:07:29,837 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 6 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 112 treesize of output 121 [2024-10-14 19:07:30,087 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 0 case distinctions, treesize of input 203 treesize of output 91 [2024-10-14 19:07:30,169 INFO L173 IndexEqualityManager]: detected equality via solver [2024-10-14 19:07:30,170 INFO L173 IndexEqualityManager]: detected equality via solver [2024-10-14 19:07:30,170 INFO L173 IndexEqualityManager]: detected equality via solver [2024-10-14 19:07:30,171 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 28 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 185 treesize of output 205 [2024-10-14 19:07:30,196 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2024-10-14 19:07:46,806 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2024-10-14 19:07:46,813 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 8 select indices, 8 select index equivalence classes, 66 disjoint index pairs (out of 28 index pairs), introduced 8 new quantified variables, introduced 0 case distinctions, treesize of input 149885 treesize of output 118989