./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_SAX_test2-1.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 84cfde4a Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_SAX_test2-1.i -s /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-clean/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 dbea62dc4a872959247118f049e63d406eb1e848bb1ed8397f1082fdec77074c --- Real Ultimate output --- This is Ultimate 0.2.5-dev-84cfde4 [2024-10-11 19:17:10,424 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-11 19:17:10,486 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2024-10-11 19:17:10,492 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-11 19:17:10,495 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-11 19:17:10,514 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-11 19:17:10,515 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-11 19:17:10,515 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-11 19:17:10,516 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-11 19:17:10,516 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-11 19:17:10,516 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-11 19:17:10,517 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-11 19:17:10,517 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-11 19:17:10,517 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-11 19:17:10,518 INFO L153 SettingsManager]: * Use SBE=true [2024-10-11 19:17:10,518 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-11 19:17:10,518 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-11 19:17:10,519 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-11 19:17:10,519 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-11 19:17:10,519 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-11 19:17:10,519 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-10-11 19:17:10,520 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-10-11 19:17:10,520 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-10-11 19:17:10,520 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-11 19:17:10,521 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-10-11 19:17:10,521 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-11 19:17:10,521 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-10-11 19:17:10,522 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-11 19:17:10,522 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-11 19:17:10,522 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-11 19:17:10,522 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-11 19:17:10,523 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-11 19:17:10,523 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-11 19:17:10,523 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 19:17:10,523 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-11 19:17:10,524 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-11 19:17:10,524 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-11 19:17:10,524 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-11 19:17:10,524 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-11 19:17:10,524 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-11 19:17:10,525 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-11 19:17:10,525 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-11 19:17:10,525 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-clean/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-clean/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 -> dbea62dc4a872959247118f049e63d406eb1e848bb1ed8397f1082fdec77074c [2024-10-11 19:17:10,737 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-11 19:17:10,761 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-11 19:17:10,764 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-11 19:17:10,765 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-11 19:17:10,766 INFO L274 PluginConnector]: CDTParser initialized [2024-10-11 19:17:10,767 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_SAX_test2-1.i [2024-10-11 19:17:12,174 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-11 19:17:12,411 INFO L384 CDTParser]: Found 1 translation units. [2024-10-11 19:17:12,412 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_SAX_test2-1.i [2024-10-11 19:17:12,431 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/a97528952/4d1e7872c1e34069880871ab4a21c12b/FLAG69bf95a36 [2024-10-11 19:17:12,442 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/a97528952/4d1e7872c1e34069880871ab4a21c12b [2024-10-11 19:17:12,444 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-11 19:17:12,445 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-11 19:17:12,446 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-11 19:17:12,446 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-11 19:17:12,452 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-11 19:17:12,453 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 07:17:12" (1/1) ... [2024-10-11 19:17:12,454 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1955d7ea and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:17:12, skipping insertion in model container [2024-10-11 19:17:12,454 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 07:17:12" (1/1) ... [2024-10-11 19:17:12,492 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-11 19:17:13,001 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 19:17:13,016 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-11 19:17:13,018 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver@4580f7ca and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:17:13, skipping insertion in model container [2024-10-11 19:17:13,018 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-11 19:17:13,019 INFO L186 ToolchainWalker]: Toolchain execution was canceled (user or tool) before executing de.uni_freiburg.informatik.ultimate.boogie.procedureinliner [2024-10-11 19:17:13,020 INFO L158 Benchmark]: Toolchain (without parser) took 574.65ms. Allocated memory is still 176.2MB. Free memory was 105.8MB in the beginning and 141.3MB in the end (delta: -35.5MB). Peak memory consumption was 20.2MB. Max. memory is 16.1GB. [2024-10-11 19:17:13,021 INFO L158 Benchmark]: CDTParser took 0.16ms. Allocated memory is still 176.2MB. Free memory was 133.3MB in the beginning and 133.1MB in the end (delta: 160.9kB). There was no memory consumed. Max. memory is 16.1GB. [2024-10-11 19:17:13,021 INFO L158 Benchmark]: CACSL2BoogieTranslator took 572.57ms. Allocated memory is still 176.2MB. Free memory was 105.7MB in the beginning and 141.3MB in the end (delta: -35.7MB). Peak memory consumption was 20.2MB. Max. memory is 16.1GB. [2024-10-11 19:17:13,022 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.16ms. Allocated memory is still 176.2MB. Free memory was 133.3MB in the beginning and 133.1MB in the end (delta: 160.9kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 572.57ms. Allocated memory is still 176.2MB. Free memory was 105.7MB in the beginning and 141.3MB in the end (delta: -35.7MB). Peak memory consumption was 20.2MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - UnsupportedSyntaxResult [Line: 815]: 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-clean/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_SAX_test2-1.i -s /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-clean/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 dbea62dc4a872959247118f049e63d406eb1e848bb1ed8397f1082fdec77074c --- Real Ultimate output --- This is Ultimate 0.2.5-dev-84cfde4 [2024-10-11 19:17:14,946 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-11 19:17:15,010 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf [2024-10-11 19:17:15,014 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-11 19:17:15,014 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-11 19:17:15,040 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-11 19:17:15,044 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-11 19:17:15,044 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-11 19:17:15,044 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-11 19:17:15,044 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-11 19:17:15,045 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-11 19:17:15,045 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-11 19:17:15,045 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-11 19:17:15,045 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-11 19:17:15,046 INFO L153 SettingsManager]: * Use SBE=true [2024-10-11 19:17:15,046 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-11 19:17:15,046 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-11 19:17:15,046 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-11 19:17:15,046 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-11 19:17:15,047 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-11 19:17:15,047 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-10-11 19:17:15,050 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-10-11 19:17:15,050 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-10-11 19:17:15,050 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-11 19:17:15,050 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-10-11 19:17:15,053 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-10-11 19:17:15,053 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-11 19:17:15,053 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-10-11 19:17:15,053 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-10-11 19:17:15,054 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-11 19:17:15,054 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-11 19:17:15,054 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-11 19:17:15,054 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-11 19:17:15,054 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-11 19:17:15,054 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-11 19:17:15,054 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 19:17:15,055 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-11 19:17:15,055 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-11 19:17:15,055 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-10-11 19:17:15,055 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-10-11 19:17:15,055 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-11 19:17:15,055 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-11 19:17:15,056 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-11 19:17:15,056 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-11 19:17:15,056 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2024-10-11 19:17:15,056 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-clean/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-clean/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 -> dbea62dc4a872959247118f049e63d406eb1e848bb1ed8397f1082fdec77074c [2024-10-11 19:17:15,303 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-11 19:17:15,327 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-11 19:17:15,330 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-11 19:17:15,331 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-11 19:17:15,332 INFO L274 PluginConnector]: CDTParser initialized [2024-10-11 19:17:15,333 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_SAX_test2-1.i [2024-10-11 19:17:16,701 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-11 19:17:16,968 INFO L384 CDTParser]: Found 1 translation units. [2024-10-11 19:17:16,968 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_SAX_test2-1.i [2024-10-11 19:17:16,986 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/2a2b01ba9/cda038b96e2a4fef9be8d63e0b92e0de/FLAG8eabc9d77 [2024-10-11 19:17:16,999 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/2a2b01ba9/cda038b96e2a4fef9be8d63e0b92e0de [2024-10-11 19:17:17,001 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-11 19:17:17,002 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-11 19:17:17,003 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-11 19:17:17,003 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-11 19:17:17,007 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-11 19:17:17,007 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 07:17:17" (1/1) ... [2024-10-11 19:17:17,008 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4a1d489b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:17:17, skipping insertion in model container [2024-10-11 19:17:17,008 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 07:17:17" (1/1) ... [2024-10-11 19:17:17,054 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-11 19:17:17,538 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 19:17:17,549 INFO L197 MainTranslator]: Restarting translation with changed settings: SettingsChange [mNewPreferredMemoryModel=HoenickeLindenmann_1ByteResolution] [2024-10-11 19:17:17,556 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-11 19:17:17,645 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 19:17:17,652 INFO L200 MainTranslator]: Completed pre-run [2024-10-11 19:17:17,724 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 19:17:17,785 INFO L204 MainTranslator]: Completed translation [2024-10-11 19:17:17,786 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:17:17 WrapperNode [2024-10-11 19:17:17,786 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-11 19:17:17,787 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-11 19:17:17,787 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-11 19:17:17,787 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-11 19:17:17,792 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:17:17" (1/1) ... [2024-10-11 19:17:17,825 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:17:17" (1/1) ... [2024-10-11 19:17:17,877 INFO L138 Inliner]: procedures = 211, calls = 229, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 915 [2024-10-11 19:17:17,878 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-11 19:17:17,878 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-11 19:17:17,878 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-11 19:17:17,879 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-11 19:17:17,888 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:17:17" (1/1) ... [2024-10-11 19:17:17,888 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:17:17" (1/1) ... [2024-10-11 19:17:17,902 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:17:17" (1/1) ... [2024-10-11 19:17:17,958 INFO L175 MemorySlicer]: Split 208 memory accesses to 3 slices as follows [2, 172, 34]. 83 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0, 0]. The 46 writes are split as follows [0, 42, 4]. [2024-10-11 19:17:17,961 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:17:17" (1/1) ... [2024-10-11 19:17:17,961 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:17:17" (1/1) ... [2024-10-11 19:17:17,987 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:17:17" (1/1) ... [2024-10-11 19:17:17,999 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:17:17" (1/1) ... [2024-10-11 19:17:18,002 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:17:17" (1/1) ... [2024-10-11 19:17:18,005 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:17:17" (1/1) ... [2024-10-11 19:17:18,011 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-11 19:17:18,011 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-11 19:17:18,012 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-11 19:17:18,012 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-11 19:17:18,016 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:17:17" (1/1) ... [2024-10-11 19:17:18,022 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 19:17:18,031 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 19:17:18,047 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-11 19:17:18,054 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-11 19:17:18,104 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2024-10-11 19:17:18,104 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2024-10-11 19:17:18,104 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#0 [2024-10-11 19:17:18,105 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#1 [2024-10-11 19:17:18,105 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#2 [2024-10-11 19:17:18,106 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#0 [2024-10-11 19:17:18,106 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#1 [2024-10-11 19:17:18,106 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#2 [2024-10-11 19:17:18,106 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#0 [2024-10-11 19:17:18,107 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#1 [2024-10-11 19:17:18,107 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#2 [2024-10-11 19:17:18,107 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#0 [2024-10-11 19:17:18,107 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#1 [2024-10-11 19:17:18,107 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#2 [2024-10-11 19:17:18,107 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-10-11 19:17:18,107 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2024-10-11 19:17:18,107 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2024-10-11 19:17:18,107 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2024-10-11 19:17:18,108 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-10-11 19:17:18,108 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#0 [2024-10-11 19:17:18,108 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#1 [2024-10-11 19:17:18,108 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#2 [2024-10-11 19:17:18,109 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-10-11 19:17:18,109 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2024-10-11 19:17:18,109 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#2 [2024-10-11 19:17:18,109 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2024-10-11 19:17:18,109 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2024-10-11 19:17:18,109 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-10-11 19:17:18,109 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-11 19:17:18,110 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2024-10-11 19:17:18,110 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2024-10-11 19:17:18,110 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2024-10-11 19:17:18,110 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-11 19:17:18,110 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-11 19:17:18,259 INFO L238 CfgBuilder]: Building ICFG [2024-10-11 19:17:18,261 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-11 19:17:18,275 WARN L779 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2024-10-11 19:17:18,315 WARN L779 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2024-10-11 19:17:18,335 WARN L779 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2024-10-11 19:17:20,678 INFO L? ?]: Removed 878 outVars from TransFormulas that were not future-live. [2024-10-11 19:17:20,679 INFO L287 CfgBuilder]: Performing block encoding [2024-10-11 19:17:20,818 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-11 19:17:20,818 INFO L314 CfgBuilder]: Removed 54 assume(true) statements. [2024-10-11 19:17:20,819 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 07:17:20 BoogieIcfgContainer [2024-10-11 19:17:20,819 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-11 19:17:20,823 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-11 19:17:20,823 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-11 19:17:20,825 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-11 19:17:20,826 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.10 07:17:17" (1/3) ... [2024-10-11 19:17:20,826 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@152dce77 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 07:17:20, skipping insertion in model container [2024-10-11 19:17:20,826 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:17:17" (2/3) ... [2024-10-11 19:17:20,827 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@152dce77 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 07:17:20, skipping insertion in model container [2024-10-11 19:17:20,827 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 07:17:20" (3/3) ... [2024-10-11 19:17:20,828 INFO L112 eAbstractionObserver]: Analyzing ICFG uthash_SAX_test2-1.i [2024-10-11 19:17:20,840 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-11 19:17:20,841 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 424 error locations. [2024-10-11 19:17:20,926 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-11 19:17:20,939 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;@3f9b8f3e, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-11 19:17:20,943 INFO L334 AbstractCegarLoop]: Starting to check reachability of 424 error locations. [2024-10-11 19:17:20,989 INFO L276 IsEmpty]: Start isEmpty. Operand has 795 states, 360 states have (on average 2.477777777777778) internal successors, (892), 788 states have internal predecessors, (892), 10 states have call successors, (10), 3 states have call predecessors, (10), 3 states have return successors, (10), 6 states have call predecessors, (10), 10 states have call successors, (10) [2024-10-11 19:17:20,996 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 3 [2024-10-11 19:17:20,997 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 19:17:20,997 INFO L215 NwaCegarLoop]: trace histogram [1, 1] [2024-10-11 19:17:21,002 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 421 more)] === [2024-10-11 19:17:21,008 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 19:17:21,010 INFO L85 PathProgramCache]: Analyzing trace with hash 47005, now seen corresponding path program 1 times [2024-10-11 19:17:21,026 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 19:17:21,030 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1184286601] [2024-10-11 19:17:21,030 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 19:17:21,031 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-11 19:17:21,031 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 19:17:21,034 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -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-11 19:17:21,035 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -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-11 19:17:21,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 19:17:21,149 INFO L255 TraceCheckSpWp]: Trace formula consists of 24 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-11 19:17:21,152 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 19:17:21,184 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-11 19:17:21,202 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-11 19:17:21,203 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 19:17:21,203 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 19:17:21,203 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1184286601] [2024-10-11 19:17:21,204 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1184286601] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 19:17:21,204 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 19:17:21,204 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-10-11 19:17:21,205 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1602943063] [2024-10-11 19:17:21,206 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 19:17:21,210 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 19:17:21,210 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 19:17:21,228 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 19:17:21,229 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 19:17:21,252 INFO L87 Difference]: Start difference. First operand has 795 states, 360 states have (on average 2.477777777777778) internal successors, (892), 788 states have internal predecessors, (892), 10 states have call successors, (10), 3 states have call predecessors, (10), 3 states have return successors, (10), 6 states have call predecessors, (10), 10 states have call successors, (10) Second operand has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 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-11 19:17:22,338 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 19:17:22,338 INFO L93 Difference]: Finished difference Result 781 states and 838 transitions. [2024-10-11 19:17:22,340 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 19:17:22,341 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 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 2 [2024-10-11 19:17:22,341 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 19:17:22,353 INFO L225 Difference]: With dead ends: 781 [2024-10-11 19:17:22,353 INFO L226 Difference]: Without dead ends: 780 [2024-10-11 19:17:22,358 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 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-11 19:17:22,360 INFO L432 NwaCegarLoop]: 439 mSDtfsCounter, 714 mSDsluCounter, 41 mSDsCounter, 0 mSdLazyCounter, 458 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 722 SdHoareTripleChecker+Valid, 480 SdHoareTripleChecker+Invalid, 474 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 458 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2024-10-11 19:17:22,365 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [722 Valid, 480 Invalid, 474 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 458 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2024-10-11 19:17:22,388 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 780 states. [2024-10-11 19:17:22,427 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 780 to 780. [2024-10-11 19:17:22,429 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 780 states, 363 states have (on average 2.256198347107438) internal successors, (819), 773 states have internal predecessors, (819), 10 states have call successors, (10), 3 states have call predecessors, (10), 2 states have return successors, (8), 4 states have call predecessors, (8), 8 states have call successors, (8) [2024-10-11 19:17:22,432 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 780 states to 780 states and 837 transitions. [2024-10-11 19:17:22,433 INFO L78 Accepts]: Start accepts. Automaton has 780 states and 837 transitions. Word has length 2 [2024-10-11 19:17:22,433 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 19:17:22,433 INFO L471 AbstractCegarLoop]: Abstraction has 780 states and 837 transitions. [2024-10-11 19:17:22,433 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 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-11 19:17:22,433 INFO L276 IsEmpty]: Start isEmpty. Operand 780 states and 837 transitions. [2024-10-11 19:17:22,433 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 3 [2024-10-11 19:17:22,434 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 19:17:22,434 INFO L215 NwaCegarLoop]: trace histogram [1, 1] [2024-10-11 19:17:22,440 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2024-10-11 19:17:22,634 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -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-11 19:17:22,635 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 421 more)] === [2024-10-11 19:17:22,635 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 19:17:22,635 INFO L85 PathProgramCache]: Analyzing trace with hash 47006, now seen corresponding path program 1 times [2024-10-11 19:17:22,636 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 19:17:22,636 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2132477689] [2024-10-11 19:17:22,636 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 19:17:22,636 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-11 19:17:22,636 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 19:17:22,637 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -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-11 19:17:22,639 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -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-11 19:17:22,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 19:17:22,705 INFO L255 TraceCheckSpWp]: Trace formula consists of 24 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-10-11 19:17:22,706 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 19:17:22,713 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-11 19:17:22,724 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-11 19:17:22,724 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 19:17:22,724 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 19:17:22,724 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2132477689] [2024-10-11 19:17:22,724 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2132477689] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 19:17:22,725 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 19:17:22,725 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-10-11 19:17:22,725 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [795081412] [2024-10-11 19:17:22,725 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 19:17:22,726 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 19:17:22,726 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 19:17:22,726 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 19:17:22,727 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 19:17:22,727 INFO L87 Difference]: Start difference. First operand 780 states and 837 transitions. Second operand has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 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-11 19:17:24,264 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 19:17:24,264 INFO L93 Difference]: Finished difference Result 984 states and 1073 transitions. [2024-10-11 19:17:24,264 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 19:17:24,265 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 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 2 [2024-10-11 19:17:24,265 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 19:17:24,269 INFO L225 Difference]: With dead ends: 984 [2024-10-11 19:17:24,269 INFO L226 Difference]: Without dead ends: 984 [2024-10-11 19:17:24,269 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 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-11 19:17:24,271 INFO L432 NwaCegarLoop]: 665 mSDtfsCounter, 225 mSDsluCounter, 401 mSDsCounter, 0 mSdLazyCounter, 586 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 230 SdHoareTripleChecker+Valid, 1066 SdHoareTripleChecker+Invalid, 592 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 586 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2024-10-11 19:17:24,271 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [230 Valid, 1066 Invalid, 592 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 586 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2024-10-11 19:17:24,273 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 984 states. [2024-10-11 19:17:24,292 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 984 to 896. [2024-10-11 19:17:24,293 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 896 states, 475 states have (on average 2.1957894736842105) internal successors, (1043), 889 states have internal predecessors, (1043), 15 states have call successors, (15), 3 states have call predecessors, (15), 2 states have return successors, (13), 5 states have call predecessors, (13), 13 states have call successors, (13) [2024-10-11 19:17:24,296 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 896 states to 896 states and 1071 transitions. [2024-10-11 19:17:24,299 INFO L78 Accepts]: Start accepts. Automaton has 896 states and 1071 transitions. Word has length 2 [2024-10-11 19:17:24,299 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 19:17:24,300 INFO L471 AbstractCegarLoop]: Abstraction has 896 states and 1071 transitions. [2024-10-11 19:17:24,300 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 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-11 19:17:24,300 INFO L276 IsEmpty]: Start isEmpty. Operand 896 states and 1071 transitions. [2024-10-11 19:17:24,300 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2024-10-11 19:17:24,300 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 19:17:24,301 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2024-10-11 19:17:24,305 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -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-11 19:17:24,501 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -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-11 19:17:24,502 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 421 more)] === [2024-10-11 19:17:24,502 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 19:17:24,502 INFO L85 PathProgramCache]: Analyzing trace with hash 460900519, now seen corresponding path program 1 times [2024-10-11 19:17:24,503 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 19:17:24,503 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [532613230] [2024-10-11 19:17:24,503 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 19:17:24,503 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-11 19:17:24,503 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 19:17:24,506 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -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-11 19:17:24,519 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -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-11 19:17:24,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 19:17:24,664 INFO L255 TraceCheckSpWp]: Trace formula consists of 61 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-10-11 19:17:24,666 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 19:17:24,684 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-11 19:17:24,690 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-11 19:17:24,738 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-11 19:17:24,739 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-11 19:17:24,753 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2024-10-11 19:17:24,754 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-11 19:17:24,771 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-11 19:17:24,772 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 19:17:24,772 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 19:17:24,772 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [532613230] [2024-10-11 19:17:24,772 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [532613230] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 19:17:24,772 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 19:17:24,772 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 19:17:24,772 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2023745190] [2024-10-11 19:17:24,772 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 19:17:24,773 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 19:17:24,773 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 19:17:24,773 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 19:17:24,774 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-11 19:17:24,774 INFO L87 Difference]: Start difference. First operand 896 states and 1071 transitions. Second operand has 4 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 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-11 19:17:26,195 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 19:17:26,196 INFO L93 Difference]: Finished difference Result 885 states and 1059 transitions. [2024-10-11 19:17:26,196 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 19:17:26,196 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 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 6 [2024-10-11 19:17:26,196 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 19:17:26,202 INFO L225 Difference]: With dead ends: 885 [2024-10-11 19:17:26,203 INFO L226 Difference]: Without dead ends: 885 [2024-10-11 19:17:26,203 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 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-11 19:17:26,204 INFO L432 NwaCegarLoop]: 229 mSDtfsCounter, 786 mSDsluCounter, 30 mSDsCounter, 0 mSdLazyCounter, 675 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 794 SdHoareTripleChecker+Valid, 259 SdHoareTripleChecker+Invalid, 691 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 675 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2024-10-11 19:17:26,204 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [794 Valid, 259 Invalid, 691 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 675 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2024-10-11 19:17:26,205 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 885 states. [2024-10-11 19:17:26,218 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 885 to 768. [2024-10-11 19:17:26,219 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 768 states, 363 states have (on average 2.2203856749311295) internal successors, (806), 761 states have internal predecessors, (806), 10 states have call successors, (10), 3 states have call predecessors, (10), 2 states have return successors, (8), 4 states have call predecessors, (8), 8 states have call successors, (8) [2024-10-11 19:17:26,221 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 768 states to 768 states and 824 transitions. [2024-10-11 19:17:26,221 INFO L78 Accepts]: Start accepts. Automaton has 768 states and 824 transitions. Word has length 6 [2024-10-11 19:17:26,222 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 19:17:26,223 INFO L471 AbstractCegarLoop]: Abstraction has 768 states and 824 transitions. [2024-10-11 19:17:26,224 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 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-11 19:17:26,224 INFO L276 IsEmpty]: Start isEmpty. Operand 768 states and 824 transitions. [2024-10-11 19:17:26,224 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2024-10-11 19:17:26,224 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 19:17:26,224 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2024-10-11 19:17:26,238 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Forceful destruction successful, exit code 0 [2024-10-11 19:17:26,428 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -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-11 19:17:26,429 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 421 more)] === [2024-10-11 19:17:26,430 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 19:17:26,430 INFO L85 PathProgramCache]: Analyzing trace with hash 1403014203, now seen corresponding path program 1 times [2024-10-11 19:17:26,432 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 19:17:26,432 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [919786893] [2024-10-11 19:17:26,432 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 19:17:26,433 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-11 19:17:26,433 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 19:17:26,435 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -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-11 19:17:26,436 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -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-11 19:17:26,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 19:17:26,518 INFO L255 TraceCheckSpWp]: Trace formula consists of 66 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-10-11 19:17:26,520 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 19:17:26,526 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-11 19:17:26,544 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-11 19:17:26,544 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 19:17:26,544 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 19:17:26,544 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [919786893] [2024-10-11 19:17:26,544 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [919786893] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 19:17:26,544 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 19:17:26,545 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 19:17:26,545 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2021682021] [2024-10-11 19:17:26,545 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 19:17:26,545 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 19:17:26,545 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 19:17:26,545 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 19:17:26,545 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 19:17:26,546 INFO L87 Difference]: Start difference. First operand 768 states and 824 transitions. Second operand has 3 states, 2 states have (on average 3.5) 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-11 19:17:28,050 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 19:17:28,051 INFO L93 Difference]: Finished difference Result 1038 states and 1132 transitions. [2024-10-11 19:17:28,051 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 19:17:28,051 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 3.5) 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-11 19:17:28,051 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 19:17:28,055 INFO L225 Difference]: With dead ends: 1038 [2024-10-11 19:17:28,059 INFO L226 Difference]: Without dead ends: 1038 [2024-10-11 19:17:28,059 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 5 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-11 19:17:28,060 INFO L432 NwaCegarLoop]: 756 mSDtfsCounter, 462 mSDsluCounter, 278 mSDsCounter, 0 mSdLazyCounter, 655 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 467 SdHoareTripleChecker+Valid, 1034 SdHoareTripleChecker+Invalid, 668 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 655 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2024-10-11 19:17:28,060 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [467 Valid, 1034 Invalid, 668 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 655 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2024-10-11 19:17:28,062 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1038 states. [2024-10-11 19:17:28,087 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1038 to 785. [2024-10-11 19:17:28,088 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 785 states, 390 states have (on average 2.2153846153846155) internal successors, (864), 778 states have internal predecessors, (864), 10 states have call successors, (10), 3 states have call predecessors, (10), 2 states have return successors, (8), 4 states have call predecessors, (8), 8 states have call successors, (8) [2024-10-11 19:17:28,093 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 785 states to 785 states and 882 transitions. [2024-10-11 19:17:28,094 INFO L78 Accepts]: Start accepts. Automaton has 785 states and 882 transitions. Word has length 7 [2024-10-11 19:17:28,094 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 19:17:28,094 INFO L471 AbstractCegarLoop]: Abstraction has 785 states and 882 transitions. [2024-10-11 19:17:28,094 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 3.5) 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-11 19:17:28,094 INFO L276 IsEmpty]: Start isEmpty. Operand 785 states and 882 transitions. [2024-10-11 19:17:28,099 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2024-10-11 19:17:28,099 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 19:17:28,100 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2024-10-11 19:17:28,108 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -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)] Forceful destruction successful, exit code 0 [2024-10-11 19:17:28,300 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -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-11 19:17:28,300 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 421 more)] === [2024-10-11 19:17:28,301 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 19:17:28,301 INFO L85 PathProgramCache]: Analyzing trace with hash 1403014202, now seen corresponding path program 1 times [2024-10-11 19:17:28,301 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 19:17:28,301 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1803312740] [2024-10-11 19:17:28,301 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 19:17:28,301 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-11 19:17:28,302 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 19:17:28,304 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -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-11 19:17:28,305 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -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-11 19:17:28,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 19:17:28,382 INFO L255 TraceCheckSpWp]: Trace formula consists of 66 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-11 19:17:28,384 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 19:17:28,387 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-11 19:17:28,401 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-11 19:17:28,402 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 19:17:28,402 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 19:17:28,402 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1803312740] [2024-10-11 19:17:28,402 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1803312740] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 19:17:28,402 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 19:17:28,402 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 19:17:28,402 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1086335624] [2024-10-11 19:17:28,402 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 19:17:28,403 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 19:17:28,403 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 19:17:28,403 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 19:17:28,403 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 19:17:28,403 INFO L87 Difference]: Start difference. First operand 785 states and 882 transitions. Second operand has 3 states, 2 states have (on average 3.5) 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-11 19:17:29,589 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 19:17:29,589 INFO L93 Difference]: Finished difference Result 943 states and 1068 transitions. [2024-10-11 19:17:29,589 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 19:17:29,590 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 3.5) 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-11 19:17:29,590 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 19:17:29,592 INFO L225 Difference]: With dead ends: 943 [2024-10-11 19:17:29,592 INFO L226 Difference]: Without dead ends: 943 [2024-10-11 19:17:29,593 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 5 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-11 19:17:29,593 INFO L432 NwaCegarLoop]: 574 mSDtfsCounter, 681 mSDsluCounter, 150 mSDsCounter, 0 mSdLazyCounter, 570 mSolverCounterSat, 50 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 689 SdHoareTripleChecker+Valid, 724 SdHoareTripleChecker+Invalid, 620 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 50 IncrementalHoareTripleChecker+Valid, 570 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2024-10-11 19:17:29,594 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [689 Valid, 724 Invalid, 620 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [50 Valid, 570 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2024-10-11 19:17:29,616 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 943 states. [2024-10-11 19:17:29,624 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 943 to 738. [2024-10-11 19:17:29,625 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 738 states, 390 states have (on average 2.0846153846153848) internal successors, (813), 731 states have internal predecessors, (813), 10 states have call successors, (10), 3 states have call predecessors, (10), 2 states have return successors, (8), 4 states have call predecessors, (8), 8 states have call successors, (8) [2024-10-11 19:17:29,627 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 738 states to 738 states and 831 transitions. [2024-10-11 19:17:29,627 INFO L78 Accepts]: Start accepts. Automaton has 738 states and 831 transitions. Word has length 7 [2024-10-11 19:17:29,628 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 19:17:29,628 INFO L471 AbstractCegarLoop]: Abstraction has 738 states and 831 transitions. [2024-10-11 19:17:29,628 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 3.5) 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-11 19:17:29,628 INFO L276 IsEmpty]: Start isEmpty. Operand 738 states and 831 transitions. [2024-10-11 19:17:29,628 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2024-10-11 19:17:29,628 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 19:17:29,628 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 19:17:29,634 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Forceful destruction successful, exit code 0 [2024-10-11 19:17:29,829 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -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-11 19:17:29,829 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr422ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 421 more)] === [2024-10-11 19:17:29,830 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 19:17:29,830 INFO L85 PathProgramCache]: Analyzing trace with hash 469131321, now seen corresponding path program 1 times [2024-10-11 19:17:29,830 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 19:17:29,830 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [584183688] [2024-10-11 19:17:29,830 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 19:17:29,830 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-11 19:17:29,831 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 19:17:29,832 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -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-11 19:17:29,833 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -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-11 19:17:30,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 19:17:30,019 INFO L255 TraceCheckSpWp]: Trace formula consists of 83 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-10-11 19:17:30,021 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 19:17:30,036 INFO L173 IndexEqualityManager]: detected equality via solver [2024-10-11 19:17:30,037 INFO L173 IndexEqualityManager]: detected equality via solver [2024-10-11 19:17:30,037 INFO L173 IndexEqualityManager]: detected equality via solver [2024-10-11 19:17:30,042 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-11 19:17:30,118 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-11 19:17:30,119 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-11 19:17:30,129 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-11 19:17:30,130 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 19:17:30,130 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 19:17:30,131 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [584183688] [2024-10-11 19:17:30,131 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [584183688] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 19:17:30,132 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 19:17:30,132 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 19:17:30,132 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2029996363] [2024-10-11 19:17:30,132 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 19:17:30,133 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 19:17:30,133 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 19:17:30,133 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 19:17:30,133 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 19:17:30,134 INFO L87 Difference]: Start difference. First operand 738 states and 831 transitions. Second operand has 4 states, 4 states have (on average 2.25) internal successors, (9), 4 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 19:17:31,196 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 19:17:31,197 INFO L93 Difference]: Finished difference Result 1459 states and 1647 transitions. [2024-10-11 19:17:31,197 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 19:17:31,197 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.25) internal successors, (9), 4 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2024-10-11 19:17:31,197 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 19:17:31,201 INFO L225 Difference]: With dead ends: 1459 [2024-10-11 19:17:31,201 INFO L226 Difference]: Without dead ends: 1459 [2024-10-11 19:17:31,201 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-11 19:17:31,202 INFO L432 NwaCegarLoop]: 653 mSDtfsCounter, 723 mSDsluCounter, 1294 mSDsCounter, 0 mSdLazyCounter, 330 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 731 SdHoareTripleChecker+Valid, 1947 SdHoareTripleChecker+Invalid, 331 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 330 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2024-10-11 19:17:31,202 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [731 Valid, 1947 Invalid, 331 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 330 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2024-10-11 19:17:31,204 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1459 states. [2024-10-11 19:17:31,212 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1459 to 740. [2024-10-11 19:17:31,213 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 740 states, 392 states have (on average 2.079081632653061) internal successors, (815), 733 states have internal predecessors, (815), 10 states have call successors, (10), 3 states have call predecessors, (10), 2 states have return successors, (8), 4 states have call predecessors, (8), 8 states have call successors, (8) [2024-10-11 19:17:31,214 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 740 states to 740 states and 833 transitions. [2024-10-11 19:17:31,215 INFO L78 Accepts]: Start accepts. Automaton has 740 states and 833 transitions. Word has length 9 [2024-10-11 19:17:31,215 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 19:17:31,215 INFO L471 AbstractCegarLoop]: Abstraction has 740 states and 833 transitions. [2024-10-11 19:17:31,215 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.25) internal successors, (9), 4 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 19:17:31,215 INFO L276 IsEmpty]: Start isEmpty. Operand 740 states and 833 transitions. [2024-10-11 19:17:31,215 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2024-10-11 19:17:31,216 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 19:17:31,216 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 19:17:31,225 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -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-11 19:17:31,416 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -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-11 19:17:31,417 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 421 more)] === [2024-10-11 19:17:31,417 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 19:17:31,417 INFO L85 PathProgramCache]: Analyzing trace with hash 1384503377, now seen corresponding path program 1 times [2024-10-11 19:17:31,418 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 19:17:31,418 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1385347823] [2024-10-11 19:17:31,418 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 19:17:31,418 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 19:17:31,418 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 19:17:31,419 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -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-11 19:17:31,422 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -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-11 19:17:31,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 19:17:31,542 INFO L255 TraceCheckSpWp]: Trace formula consists of 129 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-11 19:17:31,544 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 19:17:31,552 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-11 19:17:31,552 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 19:17:31,553 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 19:17:31,553 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1385347823] [2024-10-11 19:17:31,553 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1385347823] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 19:17:31,553 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 19:17:31,553 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 19:17:31,553 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1843672368] [2024-10-11 19:17:31,553 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 19:17:31,553 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 19:17:31,553 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 19:17:31,554 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 19:17:31,554 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 19:17:31,554 INFO L87 Difference]: Start difference. First operand 740 states and 833 transitions. Second operand has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 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-11 19:17:32,011 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 19:17:32,011 INFO L93 Difference]: Finished difference Result 701 states and 793 transitions. [2024-10-11 19:17:32,012 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 19:17:32,013 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 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-11 19:17:32,013 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 19:17:32,015 INFO L225 Difference]: With dead ends: 701 [2024-10-11 19:17:32,015 INFO L226 Difference]: Without dead ends: 701 [2024-10-11 19:17:32,015 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 13 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-11 19:17:32,015 INFO L432 NwaCegarLoop]: 624 mSDtfsCounter, 61 mSDsluCounter, 582 mSDsCounter, 0 mSdLazyCounter, 170 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 61 SdHoareTripleChecker+Valid, 1206 SdHoareTripleChecker+Invalid, 170 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 170 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-11 19:17:32,015 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [61 Valid, 1206 Invalid, 170 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 170 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-11 19:17:32,017 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 701 states. [2024-10-11 19:17:32,022 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 701 to 701. [2024-10-11 19:17:32,023 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 701 states, 377 states have (on average 2.055702917771883) internal successors, (775), 694 states have internal predecessors, (775), 10 states have call successors, (10), 3 states have call predecessors, (10), 2 states have return successors, (8), 4 states have call predecessors, (8), 8 states have call successors, (8) [2024-10-11 19:17:32,024 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 701 states to 701 states and 793 transitions. [2024-10-11 19:17:32,025 INFO L78 Accepts]: Start accepts. Automaton has 701 states and 793 transitions. Word has length 15 [2024-10-11 19:17:32,025 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 19:17:32,025 INFO L471 AbstractCegarLoop]: Abstraction has 701 states and 793 transitions. [2024-10-11 19:17:32,025 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 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-11 19:17:32,025 INFO L276 IsEmpty]: Start isEmpty. Operand 701 states and 793 transitions. [2024-10-11 19:17:32,025 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2024-10-11 19:17:32,025 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 19:17:32,026 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 19:17:32,030 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -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-11 19:17:32,226 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -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-11 19:17:32,227 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr38REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 421 more)] === [2024-10-11 19:17:32,227 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 19:17:32,227 INFO L85 PathProgramCache]: Analyzing trace with hash -932119221, now seen corresponding path program 1 times [2024-10-11 19:17:32,227 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 19:17:32,228 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2049609832] [2024-10-11 19:17:32,228 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 19:17:32,228 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-11 19:17:32,228 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 19:17:32,231 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -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-11 19:17:32,233 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -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-11 19:17:32,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 19:17:32,364 INFO L255 TraceCheckSpWp]: Trace formula consists of 132 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-11 19:17:32,365 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 19:17:32,378 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-11 19:17:32,378 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 19:17:32,378 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 19:17:32,378 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2049609832] [2024-10-11 19:17:32,378 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2049609832] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 19:17:32,379 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 19:17:32,379 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 19:17:32,379 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [231094681] [2024-10-11 19:17:32,379 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 19:17:32,379 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 19:17:32,379 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 19:17:32,380 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 19:17:32,380 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 19:17:32,380 INFO L87 Difference]: Start difference. First operand 701 states and 793 transitions. Second operand has 4 states, 4 states have (on average 4.25) internal successors, (17), 4 states have internal predecessors, (17), 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-11 19:17:32,989 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 19:17:32,989 INFO L93 Difference]: Finished difference Result 686 states and 771 transitions. [2024-10-11 19:17:32,991 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-11 19:17:32,991 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.25) internal successors, (17), 4 states have internal predecessors, (17), 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 17 [2024-10-11 19:17:32,991 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 19:17:32,993 INFO L225 Difference]: With dead ends: 686 [2024-10-11 19:17:32,993 INFO L226 Difference]: Without dead ends: 686 [2024-10-11 19:17:32,993 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 14 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-11 19:17:32,994 INFO L432 NwaCegarLoop]: 593 mSDtfsCounter, 45 mSDsluCounter, 1168 mSDsCounter, 0 mSdLazyCounter, 261 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 45 SdHoareTripleChecker+Valid, 1761 SdHoareTripleChecker+Invalid, 282 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 261 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-10-11 19:17:32,994 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [45 Valid, 1761 Invalid, 282 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 261 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-10-11 19:17:32,995 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 686 states. [2024-10-11 19:17:33,000 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 686 to 686. [2024-10-11 19:17:33,001 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 686 states, 376 states have (on average 2.002659574468085) internal successors, (753), 679 states have internal predecessors, (753), 10 states have call successors, (10), 3 states have call predecessors, (10), 2 states have return successors, (8), 4 states have call predecessors, (8), 8 states have call successors, (8) [2024-10-11 19:17:33,003 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 686 states to 686 states and 771 transitions. [2024-10-11 19:17:33,003 INFO L78 Accepts]: Start accepts. Automaton has 686 states and 771 transitions. Word has length 17 [2024-10-11 19:17:33,003 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 19:17:33,003 INFO L471 AbstractCegarLoop]: Abstraction has 686 states and 771 transitions. [2024-10-11 19:17:33,003 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.25) internal successors, (17), 4 states have internal predecessors, (17), 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-11 19:17:33,003 INFO L276 IsEmpty]: Start isEmpty. Operand 686 states and 771 transitions. [2024-10-11 19:17:33,004 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2024-10-11 19:17:33,004 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 19:17:33,004 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] [2024-10-11 19:17:33,012 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -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-11 19:17:33,208 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -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-11 19:17:33,208 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr52REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 421 more)] === [2024-10-11 19:17:33,209 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 19:17:33,209 INFO L85 PathProgramCache]: Analyzing trace with hash 1310162457, now seen corresponding path program 1 times [2024-10-11 19:17:33,209 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 19:17:33,209 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [478431571] [2024-10-11 19:17:33,209 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 19:17:33,209 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-11 19:17:33,210 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 19:17:33,212 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -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-11 19:17:33,213 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -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-11 19:17:33,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 19:17:33,330 INFO L255 TraceCheckSpWp]: Trace formula consists of 146 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-10-11 19:17:33,332 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 19:17:33,335 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-11 19:17:33,387 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-11 19:17:33,388 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 19:17:33,388 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 19:17:33,388 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [478431571] [2024-10-11 19:17:33,388 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [478431571] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 19:17:33,388 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 19:17:33,388 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 19:17:33,388 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [364565422] [2024-10-11 19:17:33,389 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 19:17:33,389 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 19:17:33,389 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 19:17:33,389 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 19:17:33,389 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 19:17:33,390 INFO L87 Difference]: Start difference. First operand 686 states and 771 transitions. Second operand has 4 states, 3 states have (on average 10.333333333333334) internal successors, (31), 4 states have internal predecessors, (31), 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-11 19:17:34,545 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 19:17:34,545 INFO L93 Difference]: Finished difference Result 686 states and 771 transitions. [2024-10-11 19:17:34,546 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 19:17:34,546 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 10.333333333333334) internal successors, (31), 4 states have internal predecessors, (31), 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 31 [2024-10-11 19:17:34,546 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 19:17:34,551 INFO L225 Difference]: With dead ends: 686 [2024-10-11 19:17:34,551 INFO L226 Difference]: Without dead ends: 686 [2024-10-11 19:17:34,551 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 28 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-11 19:17:34,552 INFO L432 NwaCegarLoop]: 328 mSDtfsCounter, 623 mSDsluCounter, 285 mSDsCounter, 0 mSdLazyCounter, 798 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 631 SdHoareTripleChecker+Valid, 613 SdHoareTripleChecker+Invalid, 805 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 798 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2024-10-11 19:17:34,552 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [631 Valid, 613 Invalid, 805 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 798 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2024-10-11 19:17:34,553 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 686 states. [2024-10-11 19:17:34,563 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 686 to 682. [2024-10-11 19:17:34,566 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 682 states, 376 states have (on average 1.9920212765957446) internal successors, (749), 675 states have internal predecessors, (749), 10 states have call successors, (10), 3 states have call predecessors, (10), 2 states have return successors, (8), 4 states have call predecessors, (8), 8 states have call successors, (8) [2024-10-11 19:17:34,569 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 682 states to 682 states and 767 transitions. [2024-10-11 19:17:34,570 INFO L78 Accepts]: Start accepts. Automaton has 682 states and 767 transitions. Word has length 31 [2024-10-11 19:17:34,573 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 19:17:34,573 INFO L471 AbstractCegarLoop]: Abstraction has 682 states and 767 transitions. [2024-10-11 19:17:34,573 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 10.333333333333334) internal successors, (31), 4 states have internal predecessors, (31), 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-11 19:17:34,574 INFO L276 IsEmpty]: Start isEmpty. Operand 682 states and 767 transitions. [2024-10-11 19:17:34,574 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2024-10-11 19:17:34,574 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 19:17:34,574 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] [2024-10-11 19:17:34,582 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Ended with exit code 0 [2024-10-11 19:17:34,774 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -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-11 19:17:34,775 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr53REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 421 more)] === [2024-10-11 19:17:34,775 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 19:17:34,775 INFO L85 PathProgramCache]: Analyzing trace with hash 1310162458, now seen corresponding path program 1 times [2024-10-11 19:17:34,776 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 19:17:34,776 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1700122231] [2024-10-11 19:17:34,776 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 19:17:34,776 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-11 19:17:34,776 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 19:17:34,779 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -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-11 19:17:34,780 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -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-11 19:17:34,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 19:17:34,927 INFO L255 TraceCheckSpWp]: Trace formula consists of 146 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-10-11 19:17:34,928 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 19:17:34,946 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-11 19:17:35,119 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-11 19:17:35,120 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 19:17:35,120 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 19:17:35,120 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1700122231] [2024-10-11 19:17:35,120 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1700122231] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 19:17:35,120 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 19:17:35,120 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 19:17:35,121 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1272438134] [2024-10-11 19:17:35,121 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 19:17:35,121 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 19:17:35,121 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 19:17:35,121 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 19:17:35,122 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 19:17:35,122 INFO L87 Difference]: Start difference. First operand 682 states and 767 transitions. Second operand has 4 states, 3 states have (on average 10.333333333333334) internal successors, (31), 4 states have internal predecessors, (31), 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-11 19:17:36,782 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 19:17:36,782 INFO L93 Difference]: Finished difference Result 935 states and 1017 transitions. [2024-10-11 19:17:36,783 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 19:17:36,783 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 10.333333333333334) internal successors, (31), 4 states have internal predecessors, (31), 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 31 [2024-10-11 19:17:36,783 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 19:17:36,786 INFO L225 Difference]: With dead ends: 935 [2024-10-11 19:17:36,786 INFO L226 Difference]: Without dead ends: 935 [2024-10-11 19:17:36,786 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 28 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-11 19:17:36,786 INFO L432 NwaCegarLoop]: 478 mSDtfsCounter, 400 mSDsluCounter, 561 mSDsCounter, 0 mSdLazyCounter, 895 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 405 SdHoareTripleChecker+Valid, 1039 SdHoareTripleChecker+Invalid, 898 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 895 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2024-10-11 19:17:36,787 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [405 Valid, 1039 Invalid, 898 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 895 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2024-10-11 19:17:36,788 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 935 states. [2024-10-11 19:17:36,794 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 935 to 678. [2024-10-11 19:17:36,795 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 678 states, 376 states have (on average 1.9813829787234043) internal successors, (745), 671 states have internal predecessors, (745), 10 states have call successors, (10), 3 states have call predecessors, (10), 2 states have return successors, (8), 4 states have call predecessors, (8), 8 states have call successors, (8) [2024-10-11 19:17:36,796 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 678 states to 678 states and 763 transitions. [2024-10-11 19:17:36,796 INFO L78 Accepts]: Start accepts. Automaton has 678 states and 763 transitions. Word has length 31 [2024-10-11 19:17:36,797 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 19:17:36,797 INFO L471 AbstractCegarLoop]: Abstraction has 678 states and 763 transitions. [2024-10-11 19:17:36,797 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 10.333333333333334) internal successors, (31), 4 states have internal predecessors, (31), 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-11 19:17:36,797 INFO L276 IsEmpty]: Start isEmpty. Operand 678 states and 763 transitions. [2024-10-11 19:17:36,798 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2024-10-11 19:17:36,798 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 19:17:36,798 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] [2024-10-11 19:17:36,804 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -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-11 19:17:37,002 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -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-11 19:17:37,003 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr117REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 421 more)] === [2024-10-11 19:17:37,003 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 19:17:37,003 INFO L85 PathProgramCache]: Analyzing trace with hash 1916251283, now seen corresponding path program 1 times [2024-10-11 19:17:37,003 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 19:17:37,004 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1156531732] [2024-10-11 19:17:37,004 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 19:17:37,004 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-11 19:17:37,004 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 19:17:37,006 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -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-11 19:17:37,007 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -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-11 19:17:37,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 19:17:37,179 INFO L255 TraceCheckSpWp]: Trace formula consists of 218 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-11 19:17:37,181 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 19:17:37,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-11 19:17:37,210 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 19:17:37,211 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 19:17:37,211 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1156531732] [2024-10-11 19:17:37,211 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1156531732] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 19:17:37,211 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 19:17:37,211 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 19:17:37,211 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [306455267] [2024-10-11 19:17:37,211 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 19:17:37,212 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 19:17:37,212 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 19:17:37,212 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 19:17:37,212 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 19:17:37,212 INFO L87 Difference]: Start difference. First operand 678 states and 763 transitions. Second operand has 4 states, 4 states have (on average 11.75) internal successors, (47), 4 states have internal predecessors, (47), 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-11 19:17:37,793 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 19:17:37,794 INFO L93 Difference]: Finished difference Result 672 states and 753 transitions. [2024-10-11 19:17:37,795 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-11 19:17:37,795 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 11.75) internal successors, (47), 4 states have internal predecessors, (47), 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 47 [2024-10-11 19:17:37,795 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 19:17:37,797 INFO L225 Difference]: With dead ends: 672 [2024-10-11 19:17:37,797 INFO L226 Difference]: Without dead ends: 672 [2024-10-11 19:17:37,797 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 44 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-11 19:17:37,798 INFO L432 NwaCegarLoop]: 587 mSDtfsCounter, 15 mSDsluCounter, 1157 mSDsCounter, 0 mSdLazyCounter, 258 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 1744 SdHoareTripleChecker+Invalid, 264 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 258 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-10-11 19:17:37,798 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 1744 Invalid, 264 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 258 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-10-11 19:17:37,799 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 672 states. [2024-10-11 19:17:37,804 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 672 to 672. [2024-10-11 19:17:37,805 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 672 states, 370 states have (on average 1.9864864864864864) internal successors, (735), 665 states have internal predecessors, (735), 10 states have call successors, (10), 3 states have call predecessors, (10), 2 states have return successors, (8), 4 states have call predecessors, (8), 8 states have call successors, (8) [2024-10-11 19:17:37,806 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 672 states to 672 states and 753 transitions. [2024-10-11 19:17:37,806 INFO L78 Accepts]: Start accepts. Automaton has 672 states and 753 transitions. Word has length 47 [2024-10-11 19:17:37,806 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 19:17:37,806 INFO L471 AbstractCegarLoop]: Abstraction has 672 states and 753 transitions. [2024-10-11 19:17:37,806 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.75) internal successors, (47), 4 states have internal predecessors, (47), 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-11 19:17:37,807 INFO L276 IsEmpty]: Start isEmpty. Operand 672 states and 753 transitions. [2024-10-11 19:17:37,807 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2024-10-11 19:17:37,807 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 19:17:37,807 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-11 19:17:37,816 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -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-11 19:17:38,008 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -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-11 19:17:38,008 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr117REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 421 more)] === [2024-10-11 19:17:38,008 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 19:17:38,009 INFO L85 PathProgramCache]: Analyzing trace with hash 227917556, now seen corresponding path program 1 times [2024-10-11 19:17:38,009 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 19:17:38,009 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [334980258] [2024-10-11 19:17:38,009 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 19:17:38,009 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-11 19:17:38,009 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 19:17:38,011 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -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-11 19:17:38,012 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -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-11 19:17:38,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 19:17:38,222 INFO L255 TraceCheckSpWp]: Trace formula consists of 238 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-11 19:17:38,224 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 19:17:38,446 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-11 19:17:38,446 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 19:17:38,446 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 19:17:38,446 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [334980258] [2024-10-11 19:17:38,446 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [334980258] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 19:17:38,446 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 19:17:38,446 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 19:17:38,447 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1522247293] [2024-10-11 19:17:38,447 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 19:17:38,447 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 19:17:38,447 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 19:17:38,448 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 19:17:38,448 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 19:17:38,449 INFO L87 Difference]: Start difference. First operand 672 states and 753 transitions. Second operand has 3 states, 3 states have (on average 17.0) internal successors, (51), 2 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-11 19:17:38,996 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 19:17:38,997 INFO L93 Difference]: Finished difference Result 853 states and 957 transitions. [2024-10-11 19:17:38,998 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 19:17:38,998 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 17.0) internal successors, (51), 2 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-11 19:17:38,999 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 19:17:39,001 INFO L225 Difference]: With dead ends: 853 [2024-10-11 19:17:39,001 INFO L226 Difference]: Without dead ends: 853 [2024-10-11 19:17:39,001 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 49 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-11 19:17:39,001 INFO L432 NwaCegarLoop]: 712 mSDtfsCounter, 146 mSDsluCounter, 558 mSDsCounter, 0 mSdLazyCounter, 210 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 151 SdHoareTripleChecker+Valid, 1270 SdHoareTripleChecker+Invalid, 212 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 210 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-10-11 19:17:39,002 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [151 Valid, 1270 Invalid, 212 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 210 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-10-11 19:17:39,003 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 853 states. [2024-10-11 19:17:39,015 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 853 to 799. [2024-10-11 19:17:39,016 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 799 states, 492 states have (on average 1.8821138211382114) internal successors, (926), 792 states have internal predecessors, (926), 15 states have call successors, (15), 3 states have call predecessors, (15), 2 states have return successors, (13), 5 states have call predecessors, (13), 13 states have call successors, (13) [2024-10-11 19:17:39,018 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 799 states to 799 states and 954 transitions. [2024-10-11 19:17:39,018 INFO L78 Accepts]: Start accepts. Automaton has 799 states and 954 transitions. Word has length 51 [2024-10-11 19:17:39,018 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 19:17:39,019 INFO L471 AbstractCegarLoop]: Abstraction has 799 states and 954 transitions. [2024-10-11 19:17:39,019 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 17.0) internal successors, (51), 2 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-11 19:17:39,019 INFO L276 IsEmpty]: Start isEmpty. Operand 799 states and 954 transitions. [2024-10-11 19:17:39,020 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2024-10-11 19:17:39,020 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 19:17:39,020 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] [2024-10-11 19:17:39,028 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (13)] Forceful destruction successful, exit code 0 [2024-10-11 19:17:39,221 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -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-11 19:17:39,221 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr71REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 421 more)] === [2024-10-11 19:17:39,222 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 19:17:39,222 INFO L85 PathProgramCache]: Analyzing trace with hash -558822258, now seen corresponding path program 1 times [2024-10-11 19:17:39,223 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 19:17:39,223 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [950169196] [2024-10-11 19:17:39,223 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 19:17:39,223 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-11 19:17:39,223 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 19:17:39,224 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -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-11 19:17:39,226 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -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-11 19:17:39,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 19:17:39,516 INFO L255 TraceCheckSpWp]: Trace formula consists of 273 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-10-11 19:17:39,540 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 19:17:39,554 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-11 19:17:39,559 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-11 19:17:39,892 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-11 19:17:39,893 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-11 19:17:39,904 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2024-10-11 19:17:39,904 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-11 19:17:39,912 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-11 19:17:39,912 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 19:17:39,914 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 19:17:39,914 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [950169196] [2024-10-11 19:17:39,914 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [950169196] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 19:17:39,914 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 19:17:39,915 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 19:17:39,915 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [642273831] [2024-10-11 19:17:39,915 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 19:17:39,915 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 19:17:39,915 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 19:17:39,915 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 19:17:39,915 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-11 19:17:39,916 INFO L87 Difference]: Start difference. First operand 799 states and 954 transitions. Second operand has 4 states, 3 states have (on average 18.0) internal successors, (54), 4 states have internal predecessors, (54), 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-11 19:17:40,916 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 19:17:40,916 INFO L93 Difference]: Finished difference Result 761 states and 916 transitions. [2024-10-11 19:17:40,917 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 19:17:40,917 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 18.0) internal successors, (54), 4 states have internal predecessors, (54), 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 54 [2024-10-11 19:17:40,918 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 19:17:40,920 INFO L225 Difference]: With dead ends: 761 [2024-10-11 19:17:40,920 INFO L226 Difference]: Without dead ends: 761 [2024-10-11 19:17:40,920 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 51 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-11 19:17:40,921 INFO L432 NwaCegarLoop]: 195 mSDtfsCounter, 1114 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 466 mSolverCounterSat, 51 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1122 SdHoareTripleChecker+Valid, 203 SdHoareTripleChecker+Invalid, 517 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 51 IncrementalHoareTripleChecker+Valid, 466 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2024-10-11 19:17:40,921 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1122 Valid, 203 Invalid, 517 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [51 Valid, 466 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2024-10-11 19:17:40,923 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 761 states. [2024-10-11 19:17:40,932 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 761 to 734. [2024-10-11 19:17:40,933 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 734 states, 465 states have (on average 1.772043010752688) internal successors, (824), 727 states have internal predecessors, (824), 15 states have call successors, (15), 3 states have call predecessors, (15), 2 states have return successors, (13), 5 states have call predecessors, (13), 13 states have call successors, (13) [2024-10-11 19:17:40,935 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 734 states to 734 states and 852 transitions. [2024-10-11 19:17:40,935 INFO L78 Accepts]: Start accepts. Automaton has 734 states and 852 transitions. Word has length 54 [2024-10-11 19:17:40,935 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 19:17:40,935 INFO L471 AbstractCegarLoop]: Abstraction has 734 states and 852 transitions. [2024-10-11 19:17:40,935 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 18.0) internal successors, (54), 4 states have internal predecessors, (54), 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-11 19:17:40,936 INFO L276 IsEmpty]: Start isEmpty. Operand 734 states and 852 transitions. [2024-10-11 19:17:40,937 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2024-10-11 19:17:40,938 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 19:17:40,938 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] [2024-10-11 19:17:40,947 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (14)] Ended with exit code 0 [2024-10-11 19:17:41,142 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -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-11 19:17:41,143 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr76REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 421 more)] === [2024-10-11 19:17:41,143 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 19:17:41,143 INFO L85 PathProgramCache]: Analyzing trace with hash 277799603, now seen corresponding path program 1 times [2024-10-11 19:17:41,143 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 19:17:41,143 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1721320763] [2024-10-11 19:17:41,143 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 19:17:41,144 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-11 19:17:41,144 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 19:17:41,148 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -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-11 19:17:41,150 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -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-11 19:17:41,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 19:17:41,336 INFO L255 TraceCheckSpWp]: Trace formula consists of 299 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-10-11 19:17:41,339 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 19:17:41,344 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-11 19:17:41,360 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-11 19:17:41,376 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-11 19:17:41,383 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-11 19:17:41,383 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 19:17:41,383 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 19:17:41,383 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1721320763] [2024-10-11 19:17:41,383 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1721320763] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 19:17:41,384 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 19:17:41,384 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 19:17:41,384 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1475288362] [2024-10-11 19:17:41,384 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 19:17:41,384 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 19:17:41,384 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 19:17:41,384 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 19:17:41,384 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-11 19:17:41,385 INFO L87 Difference]: Start difference. First operand 734 states and 852 transitions. Second operand has 5 states, 4 states have (on average 14.5) internal successors, (58), 5 states have internal predecessors, (58), 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-11 19:17:42,553 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 19:17:42,553 INFO L93 Difference]: Finished difference Result 733 states and 851 transitions. [2024-10-11 19:17:42,553 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-11 19:17:42,553 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 14.5) internal successors, (58), 5 states have internal predecessors, (58), 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 58 [2024-10-11 19:17:42,554 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 19:17:42,555 INFO L225 Difference]: With dead ends: 733 [2024-10-11 19:17:42,555 INFO L226 Difference]: Without dead ends: 733 [2024-10-11 19:17:42,556 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 54 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-11 19:17:42,556 INFO L432 NwaCegarLoop]: 561 mSDtfsCounter, 2 mSDsluCounter, 945 mSDsCounter, 0 mSdLazyCounter, 1046 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 1506 SdHoareTripleChecker+Invalid, 1047 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 1046 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2024-10-11 19:17:42,556 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 1506 Invalid, 1047 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 1046 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2024-10-11 19:17:42,557 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 733 states. [2024-10-11 19:17:42,592 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 733 to 733. [2024-10-11 19:17:42,594 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 733 states, 465 states have (on average 1.7698924731182795) internal successors, (823), 726 states have internal predecessors, (823), 15 states have call successors, (15), 3 states have call predecessors, (15), 2 states have return successors, (13), 5 states have call predecessors, (13), 13 states have call successors, (13) [2024-10-11 19:17:42,598 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 733 states to 733 states and 851 transitions. [2024-10-11 19:17:42,599 INFO L78 Accepts]: Start accepts. Automaton has 733 states and 851 transitions. Word has length 58 [2024-10-11 19:17:42,599 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 19:17:42,599 INFO L471 AbstractCegarLoop]: Abstraction has 733 states and 851 transitions. [2024-10-11 19:17:42,599 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 14.5) internal successors, (58), 5 states have internal predecessors, (58), 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-11 19:17:42,599 INFO L276 IsEmpty]: Start isEmpty. Operand 733 states and 851 transitions. [2024-10-11 19:17:42,600 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2024-10-11 19:17:42,600 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 19:17:42,601 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] [2024-10-11 19:17:42,613 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -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-11 19:17:42,804 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -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-11 19:17:42,805 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr77REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 421 more)] === [2024-10-11 19:17:42,805 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 19:17:42,805 INFO L85 PathProgramCache]: Analyzing trace with hash 277799604, now seen corresponding path program 1 times [2024-10-11 19:17:42,806 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 19:17:42,806 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1254878793] [2024-10-11 19:17:42,806 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 19:17:42,806 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-11 19:17:42,806 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 19:17:42,807 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -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-11 19:17:42,808 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -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-11 19:17:43,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 19:17:43,014 INFO L255 TraceCheckSpWp]: Trace formula consists of 299 conjuncts, 11 conjuncts are in the unsatisfiable core [2024-10-11 19:17:43,017 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 19:17:43,027 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-11 19:17:43,039 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-11 19:17:43,044 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-11 19:17:43,073 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-11 19:17:43,084 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-11 19:17:43,084 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 19:17:43,085 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 19:17:43,085 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1254878793] [2024-10-11 19:17:43,085 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1254878793] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 19:17:43,085 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 19:17:43,085 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 19:17:43,085 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [796272089] [2024-10-11 19:17:43,085 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 19:17:43,085 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 19:17:43,085 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 19:17:43,086 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 19:17:43,086 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-11 19:17:43,086 INFO L87 Difference]: Start difference. First operand 733 states and 851 transitions. Second operand has 5 states, 4 states have (on average 14.5) internal successors, (58), 5 states have internal predecessors, (58), 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-11 19:17:44,669 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 19:17:44,669 INFO L93 Difference]: Finished difference Result 732 states and 850 transitions. [2024-10-11 19:17:44,676 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-11 19:17:44,677 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 14.5) internal successors, (58), 5 states have internal predecessors, (58), 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 58 [2024-10-11 19:17:44,677 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 19:17:44,678 INFO L225 Difference]: With dead ends: 732 [2024-10-11 19:17:44,679 INFO L226 Difference]: Without dead ends: 732 [2024-10-11 19:17:44,679 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 54 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-10-11 19:17:44,679 INFO L432 NwaCegarLoop]: 561 mSDtfsCounter, 1 mSDsluCounter, 962 mSDsCounter, 0 mSdLazyCounter, 1026 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 1523 SdHoareTripleChecker+Invalid, 1027 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 1026 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2024-10-11 19:17:44,679 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 1523 Invalid, 1027 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 1026 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2024-10-11 19:17:44,680 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 732 states. [2024-10-11 19:17:44,684 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 732 to 732. [2024-10-11 19:17:44,687 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 732 states, 464 states have (on average 1.771551724137931) internal successors, (822), 725 states have internal predecessors, (822), 15 states have call successors, (15), 3 states have call predecessors, (15), 2 states have return successors, (13), 5 states have call predecessors, (13), 13 states have call successors, (13) [2024-10-11 19:17:44,688 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 732 states to 732 states and 850 transitions. [2024-10-11 19:17:44,688 INFO L78 Accepts]: Start accepts. Automaton has 732 states and 850 transitions. Word has length 58 [2024-10-11 19:17:44,688 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 19:17:44,688 INFO L471 AbstractCegarLoop]: Abstraction has 732 states and 850 transitions. [2024-10-11 19:17:44,689 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 14.5) internal successors, (58), 5 states have internal predecessors, (58), 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-11 19:17:44,689 INFO L276 IsEmpty]: Start isEmpty. Operand 732 states and 850 transitions. [2024-10-11 19:17:44,689 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2024-10-11 19:17:44,689 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 19:17:44,690 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] [2024-10-11 19:17:44,697 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -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-11 19:17:44,894 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -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-11 19:17:44,895 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr80REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 421 more)] === [2024-10-11 19:17:44,895 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 19:17:44,895 INFO L85 PathProgramCache]: Analyzing trace with hash 2031959543, now seen corresponding path program 1 times [2024-10-11 19:17:44,896 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 19:17:44,896 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [610819144] [2024-10-11 19:17:44,896 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 19:17:44,896 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-11 19:17:44,896 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 19:17:44,897 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -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-11 19:17:44,901 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -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-11 19:17:45,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 19:17:45,133 INFO L255 TraceCheckSpWp]: Trace formula consists of 325 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-11 19:17:45,135 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 19:17:45,150 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-11 19:17:45,151 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 19:17:45,152 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 19:17:45,152 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [610819144] [2024-10-11 19:17:45,152 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [610819144] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 19:17:45,152 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 19:17:45,152 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 19:17:45,152 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1629796335] [2024-10-11 19:17:45,152 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 19:17:45,153 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 19:17:45,153 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 19:17:45,154 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 19:17:45,154 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 19:17:45,154 INFO L87 Difference]: Start difference. First operand 732 states and 850 transitions. Second operand has 4 states, 3 states have (on average 20.666666666666668) internal successors, (62), 4 states have internal predecessors, (62), 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-11 19:17:45,674 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 19:17:45,674 INFO L93 Difference]: Finished difference Result 734 states and 853 transitions. [2024-10-11 19:17:45,676 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 19:17:45,676 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 20.666666666666668) internal successors, (62), 4 states have internal predecessors, (62), 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 64 [2024-10-11 19:17:45,677 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 19:17:45,679 INFO L225 Difference]: With dead ends: 734 [2024-10-11 19:17:45,679 INFO L226 Difference]: Without dead ends: 734 [2024-10-11 19:17:45,679 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 61 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-11 19:17:45,679 INFO L432 NwaCegarLoop]: 561 mSDtfsCounter, 0 mSDsluCounter, 1119 mSDsCounter, 0 mSdLazyCounter, 236 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1680 SdHoareTripleChecker+Invalid, 237 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 236 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-10-11 19:17:45,680 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1680 Invalid, 237 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 236 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-10-11 19:17:45,680 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 734 states. [2024-10-11 19:17:45,686 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 734 to 734. [2024-10-11 19:17:45,687 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 734 states, 465 states have (on average 1.772043010752688) internal successors, (824), 727 states have internal predecessors, (824), 15 states have call successors, (15), 3 states have call predecessors, (15), 3 states have return successors, (14), 5 states have call predecessors, (14), 13 states have call successors, (14) [2024-10-11 19:17:45,688 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 734 states to 734 states and 853 transitions. [2024-10-11 19:17:45,688 INFO L78 Accepts]: Start accepts. Automaton has 734 states and 853 transitions. Word has length 64 [2024-10-11 19:17:45,689 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 19:17:45,689 INFO L471 AbstractCegarLoop]: Abstraction has 734 states and 853 transitions. [2024-10-11 19:17:45,689 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 20.666666666666668) internal successors, (62), 4 states have internal predecessors, (62), 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-11 19:17:45,689 INFO L276 IsEmpty]: Start isEmpty. Operand 734 states and 853 transitions. [2024-10-11 19:17:45,689 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2024-10-11 19:17:45,689 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 19:17:45,690 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-11 19:17:45,699 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (17)] Ended with exit code 0 [2024-10-11 19:17:45,890 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -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-11 19:17:45,891 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr80REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 421 more)] === [2024-10-11 19:17:45,891 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 19:17:45,891 INFO L85 PathProgramCache]: Analyzing trace with hash 282811127, now seen corresponding path program 1 times [2024-10-11 19:17:45,891 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 19:17:45,891 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [64381333] [2024-10-11 19:17:45,892 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 19:17:45,892 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-11 19:17:45,892 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 19:17:45,894 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -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-11 19:17:45,895 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -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-11 19:17:46,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 19:17:46,096 INFO L255 TraceCheckSpWp]: Trace formula consists of 336 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-10-11 19:17:46,098 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 19:17:46,112 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-11 19:17:46,112 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 19:17:46,157 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-11 19:17:46,157 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 19:17:46,157 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [64381333] [2024-10-11 19:17:46,157 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [64381333] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 19:17:46,157 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-11 19:17:46,157 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 8 [2024-10-11 19:17:46,158 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1594523597] [2024-10-11 19:17:46,158 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-11 19:17:46,158 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-11 19:17:46,158 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 19:17:46,158 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-11 19:17:46,158 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2024-10-11 19:17:46,159 INFO L87 Difference]: Start difference. First operand 734 states and 853 transitions. Second operand has 8 states, 6 states have (on average 11.0) internal successors, (66), 8 states have internal predecessors, (66), 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-11 19:17:47,036 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 19:17:47,037 INFO L93 Difference]: Finished difference Result 743 states and 867 transitions. [2024-10-11 19:17:47,038 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-10-11 19:17:47,038 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 6 states have (on average 11.0) internal successors, (66), 8 states have internal predecessors, (66), 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 65 [2024-10-11 19:17:47,038 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 19:17:47,040 INFO L225 Difference]: With dead ends: 743 [2024-10-11 19:17:47,040 INFO L226 Difference]: Without dead ends: 743 [2024-10-11 19:17:47,040 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 131 GetRequests, 122 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=44, Invalid=66, Unknown=0, NotChecked=0, Total=110 [2024-10-11 19:17:47,042 INFO L432 NwaCegarLoop]: 560 mSDtfsCounter, 4 mSDsluCounter, 2790 mSDsCounter, 0 mSdLazyCounter, 504 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 3350 SdHoareTripleChecker+Invalid, 509 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 504 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-10-11 19:17:47,042 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 3350 Invalid, 509 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 504 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-10-11 19:17:47,043 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 743 states. [2024-10-11 19:17:47,057 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 743 to 742. [2024-10-11 19:17:47,062 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 742 states, 472 states have (on average 1.7733050847457628) internal successors, (837), 734 states have internal predecessors, (837), 15 states have call successors, (15), 4 states have call predecessors, (15), 4 states have return successors, (14), 5 states have call predecessors, (14), 13 states have call successors, (14) [2024-10-11 19:17:47,064 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 742 states to 742 states and 866 transitions. [2024-10-11 19:17:47,064 INFO L78 Accepts]: Start accepts. Automaton has 742 states and 866 transitions. Word has length 65 [2024-10-11 19:17:47,064 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 19:17:47,064 INFO L471 AbstractCegarLoop]: Abstraction has 742 states and 866 transitions. [2024-10-11 19:17:47,065 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 6 states have (on average 11.0) internal successors, (66), 8 states have internal predecessors, (66), 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-11 19:17:47,065 INFO L276 IsEmpty]: Start isEmpty. Operand 742 states and 866 transitions. [2024-10-11 19:17:47,066 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2024-10-11 19:17:47,066 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 19:17:47,066 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] [2024-10-11 19:17:47,077 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -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)] Forceful destruction successful, exit code 0 [2024-10-11 19:17:47,266 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -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-11 19:17:47,267 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr80REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 421 more)] === [2024-10-11 19:17:47,267 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 19:17:47,267 INFO L85 PathProgramCache]: Analyzing trace with hash -2042855945, now seen corresponding path program 2 times [2024-10-11 19:17:47,268 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 19:17:47,268 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1483099758] [2024-10-11 19:17:47,268 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-10-11 19:17:47,268 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-11 19:17:47,268 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 19:17:47,270 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -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-11 19:17:47,272 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -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-11 19:17:47,667 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-10-11 19:17:47,667 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-11 19:17:47,679 INFO L255 TraceCheckSpWp]: Trace formula consists of 369 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-10-11 19:17:47,681 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 19:17:47,724 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-11 19:17:47,724 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 19:17:47,832 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-11 19:17:47,833 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 19:17:47,833 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1483099758] [2024-10-11 19:17:47,833 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1483099758] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 19:17:47,833 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-11 19:17:47,833 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 14 [2024-10-11 19:17:47,833 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1094236000] [2024-10-11 19:17:47,833 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-11 19:17:47,833 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-10-11 19:17:47,833 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 19:17:47,834 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-10-11 19:17:47,834 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=121, Unknown=0, NotChecked=0, Total=182 [2024-10-11 19:17:47,834 INFO L87 Difference]: Start difference. First operand 742 states and 866 transitions. Second operand has 14 states, 12 states have (on average 6.0) internal successors, (72), 14 states have internal predecessors, (72), 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-11 19:17:49,132 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 19:17:49,133 INFO L93 Difference]: Finished difference Result 754 states and 885 transitions. [2024-10-11 19:17:49,134 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2024-10-11 19:17:49,134 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 12 states have (on average 6.0) internal successors, (72), 14 states have internal predecessors, (72), 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 68 [2024-10-11 19:17:49,134 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 19:17:49,136 INFO L225 Difference]: With dead ends: 754 [2024-10-11 19:17:49,137 INFO L226 Difference]: Without dead ends: 752 [2024-10-11 19:17:49,137 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 143 GetRequests, 122 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-11 19:17:49,138 INFO L432 NwaCegarLoop]: 560 mSDtfsCounter, 7 mSDsluCounter, 3352 mSDsCounter, 0 mSdLazyCounter, 687 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 3912 SdHoareTripleChecker+Invalid, 695 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 687 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2024-10-11 19:17:49,139 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 3912 Invalid, 695 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 687 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2024-10-11 19:17:49,140 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 752 states. [2024-10-11 19:17:49,146 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 752 to 751. [2024-10-11 19:17:49,147 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 751 states, 481 states have (on average 1.7650727650727651) internal successors, (849), 743 states have internal predecessors, (849), 15 states have call successors, (15), 4 states have call predecessors, (15), 4 states have return successors, (14), 5 states have call predecessors, (14), 13 states have call successors, (14) [2024-10-11 19:17:49,149 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 751 states to 751 states and 878 transitions. [2024-10-11 19:17:49,149 INFO L78 Accepts]: Start accepts. Automaton has 751 states and 878 transitions. Word has length 68 [2024-10-11 19:17:49,150 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 19:17:49,150 INFO L471 AbstractCegarLoop]: Abstraction has 751 states and 878 transitions. [2024-10-11 19:17:49,150 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 12 states have (on average 6.0) internal successors, (72), 14 states have internal predecessors, (72), 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-11 19:17:49,150 INFO L276 IsEmpty]: Start isEmpty. Operand 751 states and 878 transitions. [2024-10-11 19:17:49,151 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2024-10-11 19:17:49,151 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 19:17:49,151 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] [2024-10-11 19:17:49,162 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -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-11 19:17:49,351 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -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-11 19:17:49,351 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr80REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 421 more)] === [2024-10-11 19:17:49,352 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 19:17:49,352 INFO L85 PathProgramCache]: Analyzing trace with hash -1142989321, now seen corresponding path program 3 times [2024-10-11 19:17:49,352 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 19:17:49,352 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1805671827] [2024-10-11 19:17:49,352 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-10-11 19:17:49,352 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-11 19:17:49,352 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 19:17:49,356 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -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-11 19:17:49,358 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -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-11 19:17:49,964 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2024-10-11 19:17:49,964 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-11 19:17:49,981 INFO L255 TraceCheckSpWp]: Trace formula consists of 435 conjuncts, 14 conjuncts are in the unsatisfiable core [2024-10-11 19:17:49,983 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 19:17:50,100 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-11 19:17:50,100 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 19:17:50,581 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-11 19:17:50,581 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 19:17:50,581 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1805671827] [2024-10-11 19:17:50,582 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1805671827] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 19:17:50,582 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-11 19:17:50,582 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 26 [2024-10-11 19:17:50,582 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [710043766] [2024-10-11 19:17:50,582 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-11 19:17:50,582 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2024-10-11 19:17:50,582 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 19:17:50,583 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2024-10-11 19:17:50,583 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=193, Invalid=457, Unknown=0, NotChecked=0, Total=650 [2024-10-11 19:17:50,583 INFO L87 Difference]: Start difference. First operand 751 states and 878 transitions. Second operand has 26 states, 24 states have (on average 3.5) internal successors, (84), 26 states have internal predecessors, (84), 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-11 19:17:53,438 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 19:17:53,438 INFO L93 Difference]: Finished difference Result 772 states and 914 transitions. [2024-10-11 19:17:53,439 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2024-10-11 19:17:53,439 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 24 states have (on average 3.5) internal successors, (84), 26 states have internal predecessors, (84), 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 74 [2024-10-11 19:17:53,439 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 19:17:53,441 INFO L225 Difference]: With dead ends: 772 [2024-10-11 19:17:53,441 INFO L226 Difference]: Without dead ends: 769 [2024-10-11 19:17:53,442 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 167 GetRequests, 122 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-11 19:17:53,442 INFO L432 NwaCegarLoop]: 560 mSDtfsCounter, 14 mSDsluCounter, 6705 mSDsCounter, 0 mSdLazyCounter, 1521 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 7265 SdHoareTripleChecker+Invalid, 1534 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 1521 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2024-10-11 19:17:53,442 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 7265 Invalid, 1534 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 1521 Invalid, 0 Unknown, 0 Unchecked, 2.2s Time] [2024-10-11 19:17:53,443 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 769 states. [2024-10-11 19:17:53,450 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 769 to 769. [2024-10-11 19:17:53,450 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 769 states, 499 states have (on average 1.74749498997996) internal successors, (872), 761 states have internal predecessors, (872), 15 states have call successors, (15), 4 states have call predecessors, (15), 4 states have return successors, (14), 5 states have call predecessors, (14), 13 states have call successors, (14) [2024-10-11 19:17:53,452 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 769 states to 769 states and 901 transitions. [2024-10-11 19:17:53,452 INFO L78 Accepts]: Start accepts. Automaton has 769 states and 901 transitions. Word has length 74 [2024-10-11 19:17:53,452 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 19:17:53,452 INFO L471 AbstractCegarLoop]: Abstraction has 769 states and 901 transitions. [2024-10-11 19:17:53,452 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 24 states have (on average 3.5) internal successors, (84), 26 states have internal predecessors, (84), 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-11 19:17:53,452 INFO L276 IsEmpty]: Start isEmpty. Operand 769 states and 901 transitions. [2024-10-11 19:17:53,453 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2024-10-11 19:17:53,453 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 19:17:53,453 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] [2024-10-11 19:17:53,465 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -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-11 19:17:53,657 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 20 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -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-11 19:17:53,658 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr80REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 421 more)] === [2024-10-11 19:17:53,658 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 19:17:53,658 INFO L85 PathProgramCache]: Analyzing trace with hash -1674764809, now seen corresponding path program 4 times [2024-10-11 19:17:53,659 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 19:17:53,659 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [470080901] [2024-10-11 19:17:53,659 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2024-10-11 19:17:53,659 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-11 19:17:53,659 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 19:17:53,660 INFO L229 MonitoredProcess]: Starting monitored process 21 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -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-11 19:17:53,661 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -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-11 19:17:54,128 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2024-10-11 19:17:54,128 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-11 19:17:54,143 INFO L255 TraceCheckSpWp]: Trace formula consists of 567 conjuncts, 25 conjuncts are in the unsatisfiable core [2024-10-11 19:17:54,146 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 19:17:54,473 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-11 19:17:54,474 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 19:17:55,642 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-11 19:17:55,643 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 19:17:55,643 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [470080901] [2024-10-11 19:17:55,643 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [470080901] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 19:17:55,643 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-11 19:17:55,643 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 26] total 50 [2024-10-11 19:17:55,643 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1963842254] [2024-10-11 19:17:55,643 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-11 19:17:55,644 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 50 states [2024-10-11 19:17:55,644 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 19:17:55,644 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2024-10-11 19:17:55,645 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=672, Invalid=1778, Unknown=0, NotChecked=0, Total=2450 [2024-10-11 19:17:55,645 INFO L87 Difference]: Start difference. First operand 769 states and 901 transitions. Second operand has 50 states, 48 states have (on average 2.25) internal successors, (108), 50 states have internal predecessors, (108), 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-11 19:18:03,154 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 19:18:03,154 INFO L93 Difference]: Finished difference Result 806 states and 970 transitions. [2024-10-11 19:18:03,155 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 71 states. [2024-10-11 19:18:03,155 INFO L78 Accepts]: Start accepts. Automaton has has 50 states, 48 states have (on average 2.25) internal successors, (108), 50 states have internal predecessors, (108), 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 86 [2024-10-11 19:18:03,156 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 19:18:03,160 INFO L225 Difference]: With dead ends: 806 [2024-10-11 19:18:03,160 INFO L226 Difference]: Without dead ends: 804 [2024-10-11 19:18:03,176 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 213 GetRequests, 122 SyntacticMatches, 0 SemanticMatches, 91 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 465 ImplicationChecksByTransitivity, 3.8s TimeCoverageRelationStatistics Valid=2713, Invalid=5843, Unknown=0, NotChecked=0, Total=8556 [2024-10-11 19:18:03,177 INFO L432 NwaCegarLoop]: 560 mSDtfsCounter, 25 mSDsluCounter, 13415 mSDsCounter, 0 mSdLazyCounter, 3743 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 13975 SdHoareTripleChecker+Invalid, 3773 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 3743 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.7s IncrementalHoareTripleChecker+Time [2024-10-11 19:18:03,177 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [25 Valid, 13975 Invalid, 3773 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 3743 Invalid, 0 Unknown, 0 Unchecked, 4.7s Time] [2024-10-11 19:18:03,178 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 804 states. [2024-10-11 19:18:03,191 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 804 to 803. [2024-10-11 19:18:03,192 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 803 states, 533 states have (on average 1.722326454033771) internal successors, (918), 795 states have internal predecessors, (918), 15 states have call successors, (15), 4 states have call predecessors, (15), 4 states have return successors, (14), 5 states have call predecessors, (14), 13 states have call successors, (14) [2024-10-11 19:18:03,193 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 803 states to 803 states and 947 transitions. [2024-10-11 19:18:03,193 INFO L78 Accepts]: Start accepts. Automaton has 803 states and 947 transitions. Word has length 86 [2024-10-11 19:18:03,193 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 19:18:03,194 INFO L471 AbstractCegarLoop]: Abstraction has 803 states and 947 transitions. [2024-10-11 19:18:03,194 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 50 states, 48 states have (on average 2.25) internal successors, (108), 50 states have internal predecessors, (108), 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-11 19:18:03,194 INFO L276 IsEmpty]: Start isEmpty. Operand 803 states and 947 transitions. [2024-10-11 19:18:03,194 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2024-10-11 19:18:03,194 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 19:18:03,195 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] [2024-10-11 19:18:03,209 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -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-11 19:18:03,398 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -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-11 19:18:03,399 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr80REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 421 more)] === [2024-10-11 19:18:03,399 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 19:18:03,400 INFO L85 PathProgramCache]: Analyzing trace with hash -535495177, now seen corresponding path program 5 times [2024-10-11 19:18:03,400 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 19:18:03,400 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [15202706] [2024-10-11 19:18:03,400 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2024-10-11 19:18:03,401 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-11 19:18:03,401 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 19:18:03,403 INFO L229 MonitoredProcess]: Starting monitored process 22 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -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-11 19:18:03,405 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -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-11 19:18:04,546 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 23 check-sat command(s) [2024-10-11 19:18:04,547 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-11 19:18:04,583 INFO L255 TraceCheckSpWp]: Trace formula consists of 809 conjuncts, 59 conjuncts are in the unsatisfiable core [2024-10-11 19:18:04,590 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 19:18:04,595 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-11 19:18:04,680 INFO L349 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2024-10-11 19:18:04,681 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-11 19:18:04,706 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-11 19:18:04,766 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-11 19:18:05,451 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-10-11 19:18:05,451 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-11 19:18:05,490 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-11 19:18:05,519 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-11 19:18:05,519 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 19:18:05,853 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 19:18:05,853 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [15202706] [2024-10-11 19:18:05,853 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [15202706] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 19:18:05,853 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [371674498] [2024-10-11 19:18:05,853 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2024-10-11 19:18:05,853 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-10-11 19:18:05,853 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/cvc4 [2024-10-11 19:18:05,855 INFO L229 MonitoredProcess]: Starting monitored process 23 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-10-11 19:18:05,856 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (23)] Waiting until timeout for monitored process