./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_test10-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_test10-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 1c32e831c11e67575bf9fc4420a056c0795572e7218bcd99a0067a1a2caea6f7 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-84cfde4 [2024-10-11 19:16:58,498 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-11 19:16:58,595 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:16:58,601 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-11 19:16:58,601 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-11 19:16:58,635 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-11 19:16:58,635 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-11 19:16:58,636 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-11 19:16:58,637 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-11 19:16:58,641 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-11 19:16:58,641 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-11 19:16:58,641 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-11 19:16:58,642 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-11 19:16:58,642 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-11 19:16:58,642 INFO L153 SettingsManager]: * Use SBE=true [2024-10-11 19:16:58,642 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-11 19:16:58,643 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-11 19:16:58,643 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-11 19:16:58,643 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-11 19:16:58,643 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-11 19:16:58,643 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-10-11 19:16:58,646 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-10-11 19:16:58,646 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-10-11 19:16:58,646 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-11 19:16:58,646 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-10-11 19:16:58,647 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-11 19:16:58,647 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-10-11 19:16:58,647 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-11 19:16:58,647 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-11 19:16:58,648 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-11 19:16:58,648 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-11 19:16:58,648 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-11 19:16:58,648 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-11 19:16:58,648 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 19:16:58,649 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-11 19:16:58,649 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-11 19:16:58,649 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-11 19:16:58,650 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-11 19:16:58,651 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-11 19:16:58,651 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-11 19:16:58,651 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-11 19:16:58,651 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-11 19:16:58,652 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 -> 1c32e831c11e67575bf9fc4420a056c0795572e7218bcd99a0067a1a2caea6f7 [2024-10-11 19:16:58,904 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-11 19:16:58,926 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-11 19:16:58,929 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-11 19:16:58,931 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-11 19:16:58,931 INFO L274 PluginConnector]: CDTParser initialized [2024-10-11 19:16:58,932 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_SAX_test10-1.i [2024-10-11 19:17:00,455 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-11 19:17:00,784 INFO L384 CDTParser]: Found 1 translation units. [2024-10-11 19:17:00,785 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_SAX_test10-1.i [2024-10-11 19:17:00,816 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/f26656493/d822894aa5074566be08d3224fc48b7b/FLAG093d8eaf8 [2024-10-11 19:17:01,034 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/f26656493/d822894aa5074566be08d3224fc48b7b [2024-10-11 19:17:01,036 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-11 19:17:01,037 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-11 19:17:01,038 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-11 19:17:01,038 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-11 19:17:01,044 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-11 19:17:01,045 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 07:17:01" (1/1) ... [2024-10-11 19:17:01,046 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3589171d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:17:01, skipping insertion in model container [2024-10-11 19:17:01,047 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 07:17:01" (1/1) ... [2024-10-11 19:17:01,116 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-11 19:17:01,860 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 19:17:01,870 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:01,870 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver@57ebb652 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:17:01, skipping insertion in model container [2024-10-11 19:17:01,870 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-11 19:17:01,871 INFO L186 ToolchainWalker]: Toolchain execution was canceled (user or tool) before executing de.uni_freiburg.informatik.ultimate.boogie.procedureinliner [2024-10-11 19:17:01,872 INFO L158 Benchmark]: Toolchain (without parser) took 834.48ms. Allocated memory is still 190.8MB. Free memory was 118.4MB in the beginning and 142.3MB in the end (delta: -24.0MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2024-10-11 19:17:01,873 INFO L158 Benchmark]: CDTParser took 0.17ms. Allocated memory is still 104.9MB. Free memory is still 68.6MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-11 19:17:01,874 INFO L158 Benchmark]: CACSL2BoogieTranslator took 832.47ms. Allocated memory is still 190.8MB. Free memory was 118.2MB in the beginning and 142.3MB in the end (delta: -24.1MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2024-10-11 19:17:01,875 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.17ms. Allocated memory is still 104.9MB. Free memory is still 68.6MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 832.47ms. Allocated memory is still 190.8MB. Free memory was 118.2MB in the beginning and 142.3MB in the end (delta: -24.1MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - UnsupportedSyntaxResult [Line: 734]: 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_test10-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 1c32e831c11e67575bf9fc4420a056c0795572e7218bcd99a0067a1a2caea6f7 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-84cfde4 [2024-10-11 19:17:03,966 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-11 19:17:04,057 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:04,063 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-11 19:17:04,064 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-11 19:17:04,100 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-11 19:17:04,101 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-11 19:17:04,102 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-11 19:17:04,103 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-11 19:17:04,104 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-11 19:17:04,105 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-11 19:17:04,105 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-11 19:17:04,106 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-11 19:17:04,106 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-11 19:17:04,106 INFO L153 SettingsManager]: * Use SBE=true [2024-10-11 19:17:04,110 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-11 19:17:04,110 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-11 19:17:04,110 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-11 19:17:04,111 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-11 19:17:04,111 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-11 19:17:04,111 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-10-11 19:17:04,112 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-10-11 19:17:04,112 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-10-11 19:17:04,113 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-11 19:17:04,113 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-10-11 19:17:04,113 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-10-11 19:17:04,113 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-11 19:17:04,114 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-10-11 19:17:04,114 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-10-11 19:17:04,114 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-11 19:17:04,115 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-11 19:17:04,115 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-11 19:17:04,115 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-11 19:17:04,116 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-11 19:17:04,116 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-11 19:17:04,117 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 19:17:04,117 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-11 19:17:04,118 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-11 19:17:04,118 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-10-11 19:17:04,118 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-10-11 19:17:04,119 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-11 19:17:04,119 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-11 19:17:04,119 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-11 19:17:04,119 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-11 19:17:04,120 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2024-10-11 19:17:04,120 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 -> 1c32e831c11e67575bf9fc4420a056c0795572e7218bcd99a0067a1a2caea6f7 [2024-10-11 19:17:04,472 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-11 19:17:04,495 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-11 19:17:04,500 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-11 19:17:04,501 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-11 19:17:04,501 INFO L274 PluginConnector]: CDTParser initialized [2024-10-11 19:17:04,504 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_SAX_test10-1.i [2024-10-11 19:17:06,177 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-11 19:17:06,511 INFO L384 CDTParser]: Found 1 translation units. [2024-10-11 19:17:06,511 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_SAX_test10-1.i [2024-10-11 19:17:06,535 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/fb23db647/3dd321307849470491392dc52e00c6be/FLAGfc9afec8f [2024-10-11 19:17:06,547 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/fb23db647/3dd321307849470491392dc52e00c6be [2024-10-11 19:17:06,550 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-11 19:17:06,551 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-11 19:17:06,552 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-11 19:17:06,552 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-11 19:17:06,557 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-11 19:17:06,558 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 07:17:06" (1/1) ... [2024-10-11 19:17:06,559 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@13362495 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:17:06, skipping insertion in model container [2024-10-11 19:17:06,559 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 07:17:06" (1/1) ... [2024-10-11 19:17:06,614 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-11 19:17:07,299 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 19:17:07,314 INFO L197 MainTranslator]: Restarting translation with changed settings: SettingsChange [mNewPreferredMemoryModel=HoenickeLindenmann_1ByteResolution] [2024-10-11 19:17:07,325 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-11 19:17:07,451 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 19:17:07,457 INFO L200 MainTranslator]: Completed pre-run [2024-10-11 19:17:07,571 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 19:17:07,618 INFO L204 MainTranslator]: Completed translation [2024-10-11 19:17:07,618 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:17:07 WrapperNode [2024-10-11 19:17:07,619 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-11 19:17:07,620 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-11 19:17:07,620 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-11 19:17:07,620 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-11 19:17:07,627 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:07" (1/1) ... [2024-10-11 19:17:07,674 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:07" (1/1) ... [2024-10-11 19:17:07,782 INFO L138 Inliner]: procedures = 180, calls = 507, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 2272 [2024-10-11 19:17:07,783 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-11 19:17:07,784 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-11 19:17:07,784 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-11 19:17:07,784 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-11 19:17:07,795 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:07" (1/1) ... [2024-10-11 19:17:07,796 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:07" (1/1) ... [2024-10-11 19:17:07,818 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:07" (1/1) ... [2024-10-11 19:17:07,999 INFO L175 MemorySlicer]: Split 480 memory accesses to 3 slices as follows [2, 106, 372]. 78 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0, 0]. The 86 writes are split as follows [0, 4, 82]. [2024-10-11 19:17:07,999 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:07" (1/1) ... [2024-10-11 19:17:07,999 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:07" (1/1) ... [2024-10-11 19:17:08,079 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:07" (1/1) ... [2024-10-11 19:17:08,102 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:07" (1/1) ... [2024-10-11 19:17:08,113 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:07" (1/1) ... [2024-10-11 19:17:08,123 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:07" (1/1) ... [2024-10-11 19:17:08,143 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-11 19:17:08,147 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-11 19:17:08,148 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-11 19:17:08,148 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-11 19:17:08,149 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:17:07" (1/1) ... [2024-10-11 19:17:08,157 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 19:17:08,169 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 19:17:08,186 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:08,192 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:08,241 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#0 [2024-10-11 19:17:08,241 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#1 [2024-10-11 19:17:08,241 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#2 [2024-10-11 19:17:08,242 INFO L130 BoogieDeclarations]: Found specification of procedure test_int_int [2024-10-11 19:17:08,242 INFO L138 BoogieDeclarations]: Found implementation of procedure test_int_int [2024-10-11 19:17:08,243 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#0 [2024-10-11 19:17:08,243 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#1 [2024-10-11 19:17:08,244 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#2 [2024-10-11 19:17:08,244 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2024-10-11 19:17:08,244 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2024-10-11 19:17:08,244 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#0 [2024-10-11 19:17:08,244 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#1 [2024-10-11 19:17:08,245 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#2 [2024-10-11 19:17:08,245 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#0 [2024-10-11 19:17:08,245 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#1 [2024-10-11 19:17:08,245 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#2 [2024-10-11 19:17:08,246 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-10-11 19:17:08,246 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-11 19:17:08,246 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2024-10-11 19:17:08,246 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2024-10-11 19:17:08,246 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2024-10-11 19:17:08,246 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-10-11 19:17:08,247 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2024-10-11 19:17:08,247 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2024-10-11 19:17:08,247 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2024-10-11 19:17:08,247 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-10-11 19:17:08,248 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#0 [2024-10-11 19:17:08,248 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#1 [2024-10-11 19:17:08,248 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#2 [2024-10-11 19:17:08,248 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-10-11 19:17:08,248 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2024-10-11 19:17:08,249 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#2 [2024-10-11 19:17:08,249 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-11 19:17:08,249 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-11 19:17:08,527 INFO L238 CfgBuilder]: Building ICFG [2024-10-11 19:17:08,528 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-11 19:17:08,593 WARN L779 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2024-10-11 19:17:08,623 WARN L779 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2024-10-11 19:17:08,645 WARN L779 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2024-10-11 19:17:15,204 INFO L? ?]: Removed 2009 outVars from TransFormulas that were not future-live. [2024-10-11 19:17:15,205 INFO L287 CfgBuilder]: Performing block encoding [2024-10-11 19:17:15,480 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-11 19:17:15,480 INFO L314 CfgBuilder]: Removed 151 assume(true) statements. [2024-10-11 19:17:15,481 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 07:17:15 BoogieIcfgContainer [2024-10-11 19:17:15,481 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-11 19:17:15,483 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-11 19:17:15,484 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-11 19:17:15,488 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-11 19:17:15,488 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.10 07:17:06" (1/3) ... [2024-10-11 19:17:15,489 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@236b8678 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 07:17:15, skipping insertion in model container [2024-10-11 19:17:15,489 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:17:07" (2/3) ... [2024-10-11 19:17:15,490 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@236b8678 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 07:17:15, skipping insertion in model container [2024-10-11 19:17:15,490 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 07:17:15" (3/3) ... [2024-10-11 19:17:15,492 INFO L112 eAbstractionObserver]: Analyzing ICFG uthash_SAX_test10-1.i [2024-10-11 19:17:15,510 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-11 19:17:15,511 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 986 error locations. [2024-10-11 19:17:15,597 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-11 19:17:15,605 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;@2555f331, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-11 19:17:15,605 INFO L334 AbstractCegarLoop]: Starting to check reachability of 986 error locations. [2024-10-11 19:17:15,613 INFO L276 IsEmpty]: Start isEmpty. Operand has 1877 states, 879 states have (on average 2.4436860068259385) internal successors, (2148), 1863 states have internal predecessors, (2148), 14 states have call successors, (14), 3 states have call predecessors, (14), 3 states have return successors, (14), 11 states have call predecessors, (14), 14 states have call successors, (14) [2024-10-11 19:17:15,618 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 3 [2024-10-11 19:17:15,619 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 19:17:15,619 INFO L215 NwaCegarLoop]: trace histogram [1, 1] [2024-10-11 19:17:15,620 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 983 more)] === [2024-10-11 19:17:15,624 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 19:17:15,625 INFO L85 PathProgramCache]: Analyzing trace with hash 110388, now seen corresponding path program 1 times [2024-10-11 19:17:15,636 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 19:17:15,636 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1026558107] [2024-10-11 19:17:15,636 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 19:17:15,637 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:15,637 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 19:17:15,640 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:15,642 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:15,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 19:17:15,842 INFO L255 TraceCheckSpWp]: Trace formula consists of 26 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-11 19:17:15,847 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 19:17:15,885 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:15,899 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:15,900 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 19:17:15,901 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 19:17:15,901 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1026558107] [2024-10-11 19:17:15,902 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1026558107] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 19:17:15,902 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 19:17:15,903 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-10-11 19:17:15,904 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [275947800] [2024-10-11 19:17:15,905 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 19:17:15,908 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 19:17:15,908 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 19:17:15,934 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 19:17:15,935 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 19:17:15,940 INFO L87 Difference]: Start difference. First operand has 1877 states, 879 states have (on average 2.4436860068259385) internal successors, (2148), 1863 states have internal predecessors, (2148), 14 states have call successors, (14), 3 states have call predecessors, (14), 3 states have return successors, (14), 11 states have call predecessors, (14), 14 states have call successors, (14) 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:18,806 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 19:17:18,806 INFO L93 Difference]: Finished difference Result 2312 states and 2476 transitions. [2024-10-11 19:17:18,807 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 19:17:18,808 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:18,809 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 19:17:18,843 INFO L225 Difference]: With dead ends: 2312 [2024-10-11 19:17:18,844 INFO L226 Difference]: Without dead ends: 2311 [2024-10-11 19:17:18,874 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:18,880 INFO L432 NwaCegarLoop]: 1063 mSDtfsCounter, 1769 mSDsluCounter, 307 mSDsCounter, 0 mSdLazyCounter, 1293 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1779 SdHoareTripleChecker+Valid, 1370 SdHoareTripleChecker+Invalid, 1318 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 1293 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.7s IncrementalHoareTripleChecker+Time [2024-10-11 19:17:18,882 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1779 Valid, 1370 Invalid, 1318 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 1293 Invalid, 0 Unknown, 0 Unchecked, 2.7s Time] [2024-10-11 19:17:18,907 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2311 states. [2024-10-11 19:17:19,001 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2311 to 1986. [2024-10-11 19:17:19,005 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1986 states, 1016 states have (on average 2.2401574803149606) internal successors, (2276), 1970 states have internal predecessors, (2276), 16 states have call successors, (16), 3 states have call predecessors, (16), 3 states have return successors, (16), 13 states have call predecessors, (16), 16 states have call successors, (16) [2024-10-11 19:17:19,013 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1986 states to 1986 states and 2308 transitions. [2024-10-11 19:17:19,015 INFO L78 Accepts]: Start accepts. Automaton has 1986 states and 2308 transitions. Word has length 2 [2024-10-11 19:17:19,015 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 19:17:19,015 INFO L471 AbstractCegarLoop]: Abstraction has 1986 states and 2308 transitions. [2024-10-11 19:17:19,016 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:19,017 INFO L276 IsEmpty]: Start isEmpty. Operand 1986 states and 2308 transitions. [2024-10-11 19:17:19,017 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 3 [2024-10-11 19:17:19,017 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 19:17:19,017 INFO L215 NwaCegarLoop]: trace histogram [1, 1] [2024-10-11 19:17:19,023 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 (2)] Forceful destruction successful, exit code 0 [2024-10-11 19:17:19,220 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:19,221 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 983 more)] === [2024-10-11 19:17:19,222 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 19:17:19,222 INFO L85 PathProgramCache]: Analyzing trace with hash 110389, now seen corresponding path program 1 times [2024-10-11 19:17:19,222 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 19:17:19,222 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [964992150] [2024-10-11 19:17:19,222 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 19:17:19,222 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:19,223 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 19:17:19,225 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:19,227 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:19,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 19:17:19,382 INFO L255 TraceCheckSpWp]: Trace formula consists of 26 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-10-11 19:17:19,384 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 19:17:19,395 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:19,407 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:19,407 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 19:17:19,407 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 19:17:19,408 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [964992150] [2024-10-11 19:17:19,408 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [964992150] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 19:17:19,409 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 19:17:19,409 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-10-11 19:17:19,409 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1500658258] [2024-10-11 19:17:19,409 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 19:17:19,410 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 19:17:19,411 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 19:17:19,412 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 19:17:19,412 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 19:17:19,413 INFO L87 Difference]: Start difference. First operand 1986 states and 2308 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:23,379 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 19:17:23,380 INFO L93 Difference]: Finished difference Result 2711 states and 3113 transitions. [2024-10-11 19:17:23,380 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 19:17:23,381 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:23,381 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 19:17:23,390 INFO L225 Difference]: With dead ends: 2711 [2024-10-11 19:17:23,390 INFO L226 Difference]: Without dead ends: 2711 [2024-10-11 19:17:23,391 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:23,392 INFO L432 NwaCegarLoop]: 1507 mSDtfsCounter, 799 mSDsluCounter, 997 mSDsCounter, 0 mSdLazyCounter, 1450 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 802 SdHoareTripleChecker+Valid, 2504 SdHoareTripleChecker+Invalid, 1461 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 1450 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.9s IncrementalHoareTripleChecker+Time [2024-10-11 19:17:23,392 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [802 Valid, 2504 Invalid, 1461 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 1450 Invalid, 0 Unknown, 0 Unchecked, 3.9s Time] [2024-10-11 19:17:23,397 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2711 states. [2024-10-11 19:17:23,437 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2711 to 2383. [2024-10-11 19:17:23,440 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2383 states, 1411 states have (on average 2.179305457122608) internal successors, (3075), 2364 states have internal predecessors, (3075), 19 states have call successors, (19), 3 states have call predecessors, (19), 3 states have return successors, (19), 16 states have call predecessors, (19), 19 states have call successors, (19) [2024-10-11 19:17:23,448 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2383 states to 2383 states and 3113 transitions. [2024-10-11 19:17:23,448 INFO L78 Accepts]: Start accepts. Automaton has 2383 states and 3113 transitions. Word has length 2 [2024-10-11 19:17:23,448 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 19:17:23,448 INFO L471 AbstractCegarLoop]: Abstraction has 2383 states and 3113 transitions. [2024-10-11 19:17:23,449 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:23,449 INFO L276 IsEmpty]: Start isEmpty. Operand 2383 states and 3113 transitions. [2024-10-11 19:17:23,449 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2024-10-11 19:17:23,449 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 19:17:23,449 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2024-10-11 19:17:23,453 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 (3)] Forceful destruction successful, exit code 0 [2024-10-11 19:17:23,649 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:23,650 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 983 more)] === [2024-10-11 19:17:23,651 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 19:17:23,651 INFO L85 PathProgramCache]: Analyzing trace with hash -1132525186, now seen corresponding path program 1 times [2024-10-11 19:17:23,651 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 19:17:23,651 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1598738688] [2024-10-11 19:17:23,651 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 19:17:23,652 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:23,652 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 19:17:23,654 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:23,655 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:23,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 19:17:23,847 INFO L255 TraceCheckSpWp]: Trace formula consists of 63 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-10-11 19:17:23,852 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 19:17:23,862 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:23,871 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:23,959 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-11 19:17:23,962 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:23,983 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2024-10-11 19:17:23,984 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,016 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,017 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 19:17:24,017 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 19:17:24,017 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1598738688] [2024-10-11 19:17:24,017 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1598738688] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 19:17:24,017 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 19:17:24,017 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 19:17:24,018 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2049468256] [2024-10-11 19:17:24,018 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 19:17:24,018 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 19:17:24,018 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 19:17:24,019 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 19:17:24,019 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-11 19:17:24,020 INFO L87 Difference]: Start difference. First operand 2383 states and 3113 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:30,705 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 19:17:30,706 INFO L93 Difference]: Finished difference Result 4425 states and 5305 transitions. [2024-10-11 19:17:30,706 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 19:17:30,706 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:30,707 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 19:17:30,721 INFO L225 Difference]: With dead ends: 4425 [2024-10-11 19:17:30,721 INFO L226 Difference]: Without dead ends: 4425 [2024-10-11 19:17:30,722 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:30,723 INFO L432 NwaCegarLoop]: 584 mSDtfsCounter, 2161 mSDsluCounter, 1507 mSDsCounter, 0 mSdLazyCounter, 3839 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2170 SdHoareTripleChecker+Valid, 2091 SdHoareTripleChecker+Invalid, 3864 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 3839 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.5s IncrementalHoareTripleChecker+Time [2024-10-11 19:17:30,724 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2170 Valid, 2091 Invalid, 3864 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 3839 Invalid, 0 Unknown, 0 Unchecked, 6.5s Time] [2024-10-11 19:17:30,729 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4425 states. [2024-10-11 19:17:30,771 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4425 to 2957. [2024-10-11 19:17:30,775 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2957 states, 1985 states have (on average 2.234256926952141) internal successors, (4435), 2932 states have internal predecessors, (4435), 25 states have call successors, (25), 3 states have call predecessors, (25), 3 states have return successors, (25), 22 states have call predecessors, (25), 25 states have call successors, (25) [2024-10-11 19:17:30,785 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2957 states to 2957 states and 4485 transitions. [2024-10-11 19:17:30,786 INFO L78 Accepts]: Start accepts. Automaton has 2957 states and 4485 transitions. Word has length 6 [2024-10-11 19:17:30,786 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 19:17:30,786 INFO L471 AbstractCegarLoop]: Abstraction has 2957 states and 4485 transitions. [2024-10-11 19:17:30,786 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:30,787 INFO L276 IsEmpty]: Start isEmpty. Operand 2957 states and 4485 transitions. [2024-10-11 19:17:30,787 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2024-10-11 19:17:30,787 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 19:17:30,787 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2024-10-11 19:17:30,792 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 (4)] Ended with exit code 0 [2024-10-11 19:17:30,987 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:30,988 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 983 more)] === [2024-10-11 19:17:30,989 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 19:17:30,989 INFO L85 PathProgramCache]: Analyzing trace with hash -748542378, now seen corresponding path program 1 times [2024-10-11 19:17:30,989 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 19:17:30,989 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1042344024] [2024-10-11 19:17:30,990 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 19:17:30,990 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:30,990 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 19:17:30,995 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:30,996 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:31,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 19:17:31,145 INFO L255 TraceCheckSpWp]: Trace formula consists of 68 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-11 19:17:31,147 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 19:17:31,156 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:31,167 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,167 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 19:17:31,167 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 19:17:31,167 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1042344024] [2024-10-11 19:17:31,167 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1042344024] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 19:17:31,167 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 19:17:31,167 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 19:17:31,168 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1668970585] [2024-10-11 19:17:31,168 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 19:17:31,168 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 19:17:31,168 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 19:17:31,168 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 19:17:31,169 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 19:17:31,169 INFO L87 Difference]: Start difference. First operand 2957 states and 4485 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:33,845 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 19:17:33,845 INFO L93 Difference]: Finished difference Result 3593 states and 5079 transitions. [2024-10-11 19:17:33,845 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 19:17:33,845 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:33,845 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 19:17:33,857 INFO L225 Difference]: With dead ends: 3593 [2024-10-11 19:17:33,858 INFO L226 Difference]: Without dead ends: 3593 [2024-10-11 19:17:33,858 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:33,859 INFO L432 NwaCegarLoop]: 1662 mSDtfsCounter, 1726 mSDsluCounter, 492 mSDsCounter, 0 mSdLazyCounter, 1488 mSolverCounterSat, 99 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1736 SdHoareTripleChecker+Valid, 2154 SdHoareTripleChecker+Invalid, 1587 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 99 IncrementalHoareTripleChecker+Valid, 1488 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.6s IncrementalHoareTripleChecker+Time [2024-10-11 19:17:33,859 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1736 Valid, 2154 Invalid, 1587 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [99 Valid, 1488 Invalid, 0 Unknown, 0 Unchecked, 2.6s Time] [2024-10-11 19:17:33,866 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3593 states. [2024-10-11 19:17:33,909 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3593 to 2865. [2024-10-11 19:17:33,913 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2865 states, 1985 states have (on average 2.1259445843828715) internal successors, (4220), 2840 states have internal predecessors, (4220), 25 states have call successors, (25), 3 states have call predecessors, (25), 3 states have return successors, (25), 22 states have call predecessors, (25), 25 states have call successors, (25) [2024-10-11 19:17:33,921 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2865 states to 2865 states and 4270 transitions. [2024-10-11 19:17:33,921 INFO L78 Accepts]: Start accepts. Automaton has 2865 states and 4270 transitions. Word has length 7 [2024-10-11 19:17:33,921 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 19:17:33,922 INFO L471 AbstractCegarLoop]: Abstraction has 2865 states and 4270 transitions. [2024-10-11 19:17:33,922 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:33,923 INFO L276 IsEmpty]: Start isEmpty. Operand 2865 states and 4270 transitions. [2024-10-11 19:17:33,924 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2024-10-11 19:17:33,926 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 19:17:33,926 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2024-10-11 19:17:33,931 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 (5)] Ended with exit code 0 [2024-10-11 19:17:34,127 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:34,127 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 983 more)] === [2024-10-11 19:17:34,127 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 19:17:34,128 INFO L85 PathProgramCache]: Analyzing trace with hash -748542377, now seen corresponding path program 1 times [2024-10-11 19:17:34,128 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 19:17:34,128 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [391101917] [2024-10-11 19:17:34,128 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 19:17:34,128 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,128 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 19:17:34,131 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:34,132 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:34,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 19:17:34,287 INFO L255 TraceCheckSpWp]: Trace formula consists of 68 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-10-11 19:17:34,289 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 19:17:34,297 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:34,317 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:34,317 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 19:17:34,318 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 19:17:34,318 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [391101917] [2024-10-11 19:17:34,318 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [391101917] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 19:17:34,318 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 19:17:34,318 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 19:17:34,318 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1201757542] [2024-10-11 19:17:34,318 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 19:17:34,318 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 19:17:34,318 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 19:17:34,319 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 19:17:34,319 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 19:17:34,319 INFO L87 Difference]: Start difference. First operand 2865 states and 4270 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:37,605 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 19:17:37,605 INFO L93 Difference]: Finished difference Result 4436 states and 6495 transitions. [2024-10-11 19:17:37,606 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 19:17:37,606 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:37,606 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 19:17:37,617 INFO L225 Difference]: With dead ends: 4436 [2024-10-11 19:17:37,617 INFO L226 Difference]: Without dead ends: 4436 [2024-10-11 19:17:37,617 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:37,618 INFO L432 NwaCegarLoop]: 1961 mSDtfsCounter, 1287 mSDsluCounter, 827 mSDsCounter, 0 mSdLazyCounter, 1616 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1291 SdHoareTripleChecker+Valid, 2788 SdHoareTripleChecker+Invalid, 1641 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 1616 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.2s IncrementalHoareTripleChecker+Time [2024-10-11 19:17:37,618 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1291 Valid, 2788 Invalid, 1641 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 1616 Invalid, 0 Unknown, 0 Unchecked, 3.2s Time] [2024-10-11 19:17:37,623 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4436 states. [2024-10-11 19:17:37,669 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4436 to 3133. [2024-10-11 19:17:37,674 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3133 states, 2263 states have (on average 2.114007954043305) internal successors, (4784), 3108 states have internal predecessors, (4784), 25 states have call successors, (25), 3 states have call predecessors, (25), 3 states have return successors, (25), 22 states have call predecessors, (25), 25 states have call successors, (25) [2024-10-11 19:17:37,688 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3133 states to 3133 states and 4834 transitions. [2024-10-11 19:17:37,689 INFO L78 Accepts]: Start accepts. Automaton has 3133 states and 4834 transitions. Word has length 7 [2024-10-11 19:17:37,689 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 19:17:37,689 INFO L471 AbstractCegarLoop]: Abstraction has 3133 states and 4834 transitions. [2024-10-11 19:17:37,689 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:37,689 INFO L276 IsEmpty]: Start isEmpty. Operand 3133 states and 4834 transitions. [2024-10-11 19:17:37,689 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2024-10-11 19:17:37,689 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 19:17:37,690 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 19:17:37,694 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 (6)] Ended with exit code 0 [2024-10-11 19:17:37,893 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:37,893 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr638REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 983 more)] === [2024-10-11 19:17:37,894 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 19:17:37,894 INFO L85 PathProgramCache]: Analyzing trace with hash -1658779517, now seen corresponding path program 1 times [2024-10-11 19:17:37,894 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 19:17:37,895 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [139981320] [2024-10-11 19:17:37,895 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 19:17:37,895 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,895 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 19:17:37,898 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:37,899 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:38,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 19:17:38,056 INFO L255 TraceCheckSpWp]: Trace formula consists of 85 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-11 19:17:38,058 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 19:17:38,067 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,068 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 19:17:38,068 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 19:17:38,068 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [139981320] [2024-10-11 19:17:38,068 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [139981320] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 19:17:38,068 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 19:17:38,069 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 19:17:38,070 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [456274687] [2024-10-11 19:17:38,070 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 19:17:38,070 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 19:17:38,070 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 19:17:38,071 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 19:17:38,071 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 19:17:38,071 INFO L87 Difference]: Start difference. First operand 3133 states and 4834 transitions. Second operand has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 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,899 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 19:17:38,899 INFO L93 Difference]: Finished difference Result 3079 states and 4754 transitions. [2024-10-11 19:17:38,900 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 19:17:38,900 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 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 10 [2024-10-11 19:17:38,900 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 19:17:38,907 INFO L225 Difference]: With dead ends: 3079 [2024-10-11 19:17:38,907 INFO L226 Difference]: Without dead ends: 3079 [2024-10-11 19:17:38,907 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 8 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:38,908 INFO L432 NwaCegarLoop]: 1629 mSDtfsCounter, 61 mSDsluCounter, 1587 mSDsCounter, 0 mSdLazyCounter, 394 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 61 SdHoareTripleChecker+Valid, 3216 SdHoareTripleChecker+Invalid, 394 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 394 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-10-11 19:17:38,908 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [61 Valid, 3216 Invalid, 394 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 394 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-10-11 19:17:38,911 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3079 states. [2024-10-11 19:17:38,940 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3079 to 3079. [2024-10-11 19:17:38,944 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3079 states, 2233 states have (on average 2.1065830721003134) internal successors, (4704), 3054 states have internal predecessors, (4704), 25 states have call successors, (25), 3 states have call predecessors, (25), 3 states have return successors, (25), 22 states have call predecessors, (25), 25 states have call successors, (25) [2024-10-11 19:17:38,950 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3079 states to 3079 states and 4754 transitions. [2024-10-11 19:17:38,950 INFO L78 Accepts]: Start accepts. Automaton has 3079 states and 4754 transitions. Word has length 10 [2024-10-11 19:17:38,950 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 19:17:38,951 INFO L471 AbstractCegarLoop]: Abstraction has 3079 states and 4754 transitions. [2024-10-11 19:17:38,951 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 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,951 INFO L276 IsEmpty]: Start isEmpty. Operand 3079 states and 4754 transitions. [2024-10-11 19:17:38,951 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2024-10-11 19:17:38,951 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 19:17:38,951 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 19:17:38,957 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:39,152 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:39,152 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr662REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 983 more)] === [2024-10-11 19:17:39,153 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 19:17:39,153 INFO L85 PathProgramCache]: Analyzing trace with hash -654195427, now seen corresponding path program 1 times [2024-10-11 19:17:39,153 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 19:17:39,153 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [755836404] [2024-10-11 19:17:39,153 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 19:17:39,153 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,153 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 19:17:39,155 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:39,156 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:39,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 19:17:39,312 INFO L255 TraceCheckSpWp]: Trace formula consists of 88 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-11 19:17:39,314 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 19:17:39,341 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,342 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 19:17:39,342 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 19:17:39,342 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [755836404] [2024-10-11 19:17:39,342 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [755836404] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 19:17:39,342 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 19:17:39,342 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 19:17:39,343 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1378370954] [2024-10-11 19:17:39,343 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 19:17:39,343 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 19:17:39,343 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 19:17:39,347 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 19:17:39,347 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 19:17:39,347 INFO L87 Difference]: Start difference. First operand 3079 states and 4754 transitions. Second operand has 4 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 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,546 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 19:17:40,546 INFO L93 Difference]: Finished difference Result 3063 states and 4710 transitions. [2024-10-11 19:17:40,547 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-11 19:17:40,548 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 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 12 [2024-10-11 19:17:40,548 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 19:17:40,556 INFO L225 Difference]: With dead ends: 3063 [2024-10-11 19:17:40,556 INFO L226 Difference]: Without dead ends: 3063 [2024-10-11 19:17:40,557 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 9 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:40,557 INFO L432 NwaCegarLoop]: 1598 mSDtfsCounter, 45 mSDsluCounter, 3178 mSDsCounter, 0 mSdLazyCounter, 597 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 45 SdHoareTripleChecker+Valid, 4776 SdHoareTripleChecker+Invalid, 618 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 597 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2024-10-11 19:17:40,558 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [45 Valid, 4776 Invalid, 618 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 597 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2024-10-11 19:17:40,561 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3063 states. [2024-10-11 19:17:40,591 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3063 to 3063. [2024-10-11 19:17:40,595 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3063 states, 2231 states have (on average 2.088749439713133) internal successors, (4660), 3038 states have internal predecessors, (4660), 25 states have call successors, (25), 3 states have call predecessors, (25), 3 states have return successors, (25), 22 states have call predecessors, (25), 25 states have call successors, (25) [2024-10-11 19:17:40,600 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3063 states to 3063 states and 4710 transitions. [2024-10-11 19:17:40,600 INFO L78 Accepts]: Start accepts. Automaton has 3063 states and 4710 transitions. Word has length 12 [2024-10-11 19:17:40,600 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 19:17:40,600 INFO L471 AbstractCegarLoop]: Abstraction has 3063 states and 4710 transitions. [2024-10-11 19:17:40,600 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 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,601 INFO L276 IsEmpty]: Start isEmpty. Operand 3063 states and 4710 transitions. [2024-10-11 19:17:40,601 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2024-10-11 19:17:40,601 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 19:17:40,601 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:40,606 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 (8)] Ended with exit code 0 [2024-10-11 19:17:40,802 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:40,802 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr324REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 983 more)] === [2024-10-11 19:17:40,803 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 19:17:40,803 INFO L85 PathProgramCache]: Analyzing trace with hash -20247634, now seen corresponding path program 1 times [2024-10-11 19:17:40,803 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 19:17:40,803 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [58487749] [2024-10-11 19:17:40,803 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 19:17:40,803 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:40,804 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 19:17:40,805 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:40,805 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:41,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 19:17:41,018 INFO L255 TraceCheckSpWp]: Trace formula consists of 137 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-11 19:17:41,020 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 19:17:41,033 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,034 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 19:17:41,035 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 19:17:41,035 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [58487749] [2024-10-11 19:17:41,035 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [58487749] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 19:17:41,035 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 19:17:41,035 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 19:17:41,035 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [833008727] [2024-10-11 19:17:41,035 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 19:17:41,036 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 19:17:41,036 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 19:17:41,036 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 19:17:41,036 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 19:17:41,037 INFO L87 Difference]: Start difference. First operand 3063 states and 4710 transitions. Second operand has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 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:41,772 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 19:17:41,772 INFO L93 Difference]: Finished difference Result 2949 states and 4470 transitions. [2024-10-11 19:17:41,773 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 19:17:41,773 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 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:41,773 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 19:17:41,780 INFO L225 Difference]: With dead ends: 2949 [2024-10-11 19:17:41,780 INFO L226 Difference]: Without dead ends: 2949 [2024-10-11 19:17:41,781 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 15 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:41,781 INFO L432 NwaCegarLoop]: 1571 mSDtfsCounter, 61 mSDsluCounter, 1529 mSDsCounter, 0 mSdLazyCounter, 374 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 61 SdHoareTripleChecker+Valid, 3100 SdHoareTripleChecker+Invalid, 374 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 374 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-10-11 19:17:41,782 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [61 Valid, 3100 Invalid, 374 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 374 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-10-11 19:17:41,785 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2949 states. [2024-10-11 19:17:41,814 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2949 to 2949. [2024-10-11 19:17:41,817 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2949 states, 2141 states have (on average 2.0644558617468474) internal successors, (4420), 2924 states have internal predecessors, (4420), 25 states have call successors, (25), 3 states have call predecessors, (25), 3 states have return successors, (25), 22 states have call predecessors, (25), 25 states have call successors, (25) [2024-10-11 19:17:41,823 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2949 states to 2949 states and 4470 transitions. [2024-10-11 19:17:41,823 INFO L78 Accepts]: Start accepts. Automaton has 2949 states and 4470 transitions. Word has length 17 [2024-10-11 19:17:41,823 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 19:17:41,823 INFO L471 AbstractCegarLoop]: Abstraction has 2949 states and 4470 transitions. [2024-10-11 19:17:41,824 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 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:41,824 INFO L276 IsEmpty]: Start isEmpty. Operand 2949 states and 4470 transitions. [2024-10-11 19:17:41,824 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2024-10-11 19:17:41,824 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 19:17:41,824 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:41,832 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:42,028 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:42,029 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr16REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 983 more)] === [2024-10-11 19:17:42,030 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 19:17:42,030 INFO L85 PathProgramCache]: Analyzing trace with hash 248617070, now seen corresponding path program 1 times [2024-10-11 19:17:42,030 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 19:17:42,031 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1099105335] [2024-10-11 19:17:42,031 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 19:17:42,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:42,031 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 19:17:42,034 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:42,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 (10)] Waiting until timeout for monitored process [2024-10-11 19:17:42,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 19:17:42,241 INFO L255 TraceCheckSpWp]: Trace formula consists of 137 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-11 19:17:42,244 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 19:17:42,252 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:42,253 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 19:17:42,253 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 19:17:42,253 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1099105335] [2024-10-11 19:17:42,253 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1099105335] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 19:17:42,253 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 19:17:42,253 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 19:17:42,253 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1327733773] [2024-10-11 19:17:42,254 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 19:17:42,254 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 19:17:42,254 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 19:17:42,254 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 19:17:42,255 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 19:17:42,255 INFO L87 Difference]: Start difference. First operand 2949 states and 4470 transitions. Second operand has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 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:43,025 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 19:17:43,025 INFO L93 Difference]: Finished difference Result 2895 states and 4390 transitions. [2024-10-11 19:17:43,025 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 19:17:43,025 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 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:43,026 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 19:17:43,031 INFO L225 Difference]: With dead ends: 2895 [2024-10-11 19:17:43,031 INFO L226 Difference]: Without dead ends: 2895 [2024-10-11 19:17:43,031 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 15 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:43,031 INFO L432 NwaCegarLoop]: 1534 mSDtfsCounter, 61 mSDsluCounter, 1492 mSDsCounter, 0 mSdLazyCounter, 368 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 61 SdHoareTripleChecker+Valid, 3026 SdHoareTripleChecker+Invalid, 368 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 368 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-10-11 19:17:43,031 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [61 Valid, 3026 Invalid, 368 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 368 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-10-11 19:17:43,034 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2895 states. [2024-10-11 19:17:43,058 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2895 to 2895. [2024-10-11 19:17:43,066 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2895 states, 2111 states have (on average 2.0558976788252012) internal successors, (4340), 2870 states have internal predecessors, (4340), 25 states have call successors, (25), 3 states have call predecessors, (25), 3 states have return successors, (25), 22 states have call predecessors, (25), 25 states have call successors, (25) [2024-10-11 19:17:43,074 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2895 states to 2895 states and 4390 transitions. [2024-10-11 19:17:43,074 INFO L78 Accepts]: Start accepts. Automaton has 2895 states and 4390 transitions. Word has length 17 [2024-10-11 19:17:43,074 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 19:17:43,074 INFO L471 AbstractCegarLoop]: Abstraction has 2895 states and 4390 transitions. [2024-10-11 19:17:43,075 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 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:43,075 INFO L276 IsEmpty]: Start isEmpty. Operand 2895 states and 4390 transitions. [2024-10-11 19:17:43,076 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2024-10-11 19:17:43,076 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 19:17:43,076 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 19:17:43,086 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:43,276 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:43,276 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr348REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 983 more)] === [2024-10-11 19:17:43,277 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 19:17:43,277 INFO L85 PathProgramCache]: Analyzing trace with hash 2016885832, now seen corresponding path program 1 times [2024-10-11 19:17:43,277 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 19:17:43,277 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [426000459] [2024-10-11 19:17:43,277 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 19:17:43,277 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:43,278 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 19:17:43,280 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:43,281 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:43,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 19:17:43,481 INFO L255 TraceCheckSpWp]: Trace formula consists of 140 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-11 19:17:43,483 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 19:17:43,503 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,503 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 19:17:43,504 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 19:17:43,504 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [426000459] [2024-10-11 19:17:43,504 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [426000459] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 19:17:43,504 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 19:17:43,504 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 19:17:43,504 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2049692952] [2024-10-11 19:17:43,504 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 19:17:43,504 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 19:17:43,504 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 19:17:43,505 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 19:17:43,505 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 19:17:43,505 INFO L87 Difference]: Start difference. First operand 2895 states and 4390 transitions. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 19:17:44,439 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 19:17:44,440 INFO L93 Difference]: Finished difference Result 2875 states and 4258 transitions. [2024-10-11 19:17:44,440 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-11 19:17:44,440 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2024-10-11 19:17:44,441 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 19:17:44,445 INFO L225 Difference]: With dead ends: 2875 [2024-10-11 19:17:44,445 INFO L226 Difference]: Without dead ends: 2875 [2024-10-11 19:17:44,445 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 16 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:44,446 INFO L432 NwaCegarLoop]: 1503 mSDtfsCounter, 45 mSDsluCounter, 2988 mSDsCounter, 0 mSdLazyCounter, 558 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 45 SdHoareTripleChecker+Valid, 4491 SdHoareTripleChecker+Invalid, 579 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 558 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-10-11 19:17:44,446 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [45 Valid, 4491 Invalid, 579 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 558 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-10-11 19:17:44,449 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2875 states. [2024-10-11 19:17:44,473 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2875 to 2875. [2024-10-11 19:17:44,475 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2875 states, 2105 states have (on average 1.9990498812351545) internal successors, (4208), 2850 states have internal predecessors, (4208), 25 states have call successors, (25), 3 states have call predecessors, (25), 3 states have return successors, (25), 22 states have call predecessors, (25), 25 states have call successors, (25) [2024-10-11 19:17:44,481 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2875 states to 2875 states and 4258 transitions. [2024-10-11 19:17:44,481 INFO L78 Accepts]: Start accepts. Automaton has 2875 states and 4258 transitions. Word has length 19 [2024-10-11 19:17:44,481 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 19:17:44,481 INFO L471 AbstractCegarLoop]: Abstraction has 2875 states and 4258 transitions. [2024-10-11 19:17:44,481 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 19:17:44,482 INFO L276 IsEmpty]: Start isEmpty. Operand 2875 states and 4258 transitions. [2024-10-11 19:17:44,482 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2024-10-11 19:17:44,482 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 19:17:44,482 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 19:17:44,491 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:44,683 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:44,683 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr40REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 983 more)] === [2024-10-11 19:17:44,684 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 19:17:44,684 INFO L85 PathProgramCache]: Analyzing trace with hash -1597166264, now seen corresponding path program 1 times [2024-10-11 19:17:44,684 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 19:17:44,684 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1356595677] [2024-10-11 19:17:44,684 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 19:17:44,684 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,684 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 19:17:44,685 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:44,686 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:44,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 19:17:44,877 INFO L255 TraceCheckSpWp]: Trace formula consists of 140 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-11 19:17:44,879 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 19:17:44,902 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:44,903 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 19:17:44,903 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 19:17:44,903 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1356595677] [2024-10-11 19:17:44,903 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1356595677] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 19:17:44,903 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 19:17:44,903 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 19:17:44,904 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1407575672] [2024-10-11 19:17:44,904 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 19:17:44,904 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 19:17:44,904 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 19:17:44,905 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 19:17:44,905 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 19:17:44,905 INFO L87 Difference]: Start difference. First operand 2875 states and 4258 transitions. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 19:17:45,852 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 19:17:45,852 INFO L93 Difference]: Finished difference Result 2859 states and 4214 transitions. [2024-10-11 19:17:45,853 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-11 19:17:45,853 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2024-10-11 19:17:45,853 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 19:17:45,857 INFO L225 Difference]: With dead ends: 2859 [2024-10-11 19:17:45,857 INFO L226 Difference]: Without dead ends: 2859 [2024-10-11 19:17:45,857 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 16 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:45,858 INFO L432 NwaCegarLoop]: 1482 mSDtfsCounter, 45 mSDsluCounter, 2946 mSDsCounter, 0 mSdLazyCounter, 537 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 45 SdHoareTripleChecker+Valid, 4428 SdHoareTripleChecker+Invalid, 558 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 537 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-10-11 19:17:45,858 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [45 Valid, 4428 Invalid, 558 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 537 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-10-11 19:17:45,860 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2859 states. [2024-10-11 19:17:45,883 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2859 to 2859. [2024-10-11 19:17:45,885 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2859 states, 2103 states have (on average 1.9800285306704708) internal successors, (4164), 2834 states have internal predecessors, (4164), 25 states have call successors, (25), 3 states have call predecessors, (25), 3 states have return successors, (25), 22 states have call predecessors, (25), 25 states have call successors, (25) [2024-10-11 19:17:45,911 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2859 states to 2859 states and 4214 transitions. [2024-10-11 19:17:45,911 INFO L78 Accepts]: Start accepts. Automaton has 2859 states and 4214 transitions. Word has length 19 [2024-10-11 19:17:45,912 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 19:17:45,912 INFO L471 AbstractCegarLoop]: Abstraction has 2859 states and 4214 transitions. [2024-10-11 19:17:45,912 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 19:17:45,912 INFO L276 IsEmpty]: Start isEmpty. Operand 2859 states and 4214 transitions. [2024-10-11 19:17:45,913 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2024-10-11 19:17:45,913 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 19:17:45,913 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] [2024-10-11 19:17:45,919 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:46,117 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:46,118 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr676REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 983 more)] === [2024-10-11 19:17:46,118 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 19:17:46,118 INFO L85 PathProgramCache]: Analyzing trace with hash -381678773, now seen corresponding path program 1 times [2024-10-11 19:17:46,118 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 19:17:46,119 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1215064870] [2024-10-11 19:17:46,119 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 19:17:46,119 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:46,119 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 19:17:46,121 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:46,122 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:46,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 19:17:46,304 INFO L255 TraceCheckSpWp]: Trace formula consists of 102 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-10-11 19:17:46,307 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 19:17:46,316 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:46,398 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:46,399 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 19:17:46,399 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 19:17:46,399 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1215064870] [2024-10-11 19:17:46,399 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1215064870] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 19:17:46,399 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 19:17:46,400 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 19:17:46,400 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1138628163] [2024-10-11 19:17:46,400 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 19:17:46,400 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 19:17:46,400 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 19:17:46,401 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 19:17:46,401 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 19:17:46,401 INFO L87 Difference]: Start difference. First operand 2859 states and 4214 transitions. Second operand has 4 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 states have internal predecessors, (26), 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:48,750 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 19:17:48,750 INFO L93 Difference]: Finished difference Result 3113 states and 4366 transitions. [2024-10-11 19:17:48,750 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 19:17:48,751 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 states have internal predecessors, (26), 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 26 [2024-10-11 19:17:48,751 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 19:17:48,756 INFO L225 Difference]: With dead ends: 3113 [2024-10-11 19:17:48,756 INFO L226 Difference]: Without dead ends: 3113 [2024-10-11 19:17:48,756 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 23 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:48,757 INFO L432 NwaCegarLoop]: 944 mSDtfsCounter, 1489 mSDsluCounter, 1121 mSDsCounter, 0 mSdLazyCounter, 1803 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1499 SdHoareTripleChecker+Valid, 2065 SdHoareTripleChecker+Invalid, 1814 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 1803 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2024-10-11 19:17:48,757 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1499 Valid, 2065 Invalid, 1814 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 1803 Invalid, 0 Unknown, 0 Unchecked, 2.3s Time] [2024-10-11 19:17:48,760 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3113 states. [2024-10-11 19:17:48,782 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3113 to 2855. [2024-10-11 19:17:48,784 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2855 states, 2103 states have (on average 1.97622444127437) internal successors, (4156), 2830 states have internal predecessors, (4156), 25 states have call successors, (25), 3 states have call predecessors, (25), 3 states have return successors, (25), 22 states have call predecessors, (25), 25 states have call successors, (25) [2024-10-11 19:17:48,788 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2855 states to 2855 states and 4206 transitions. [2024-10-11 19:17:48,788 INFO L78 Accepts]: Start accepts. Automaton has 2855 states and 4206 transitions. Word has length 26 [2024-10-11 19:17:48,789 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 19:17:48,789 INFO L471 AbstractCegarLoop]: Abstraction has 2855 states and 4206 transitions. [2024-10-11 19:17:48,789 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 states have internal predecessors, (26), 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:48,790 INFO L276 IsEmpty]: Start isEmpty. Operand 2855 states and 4206 transitions. [2024-10-11 19:17:48,791 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2024-10-11 19:17:48,791 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 19:17:48,791 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] [2024-10-11 19:17:48,796 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 (13)] Ended with exit code 0 [2024-10-11 19:17:48,992 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:48,993 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr677REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 983 more)] === [2024-10-11 19:17:48,993 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 19:17:48,993 INFO L85 PathProgramCache]: Analyzing trace with hash -381678772, now seen corresponding path program 1 times [2024-10-11 19:17:48,993 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 19:17:48,994 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [537322009] [2024-10-11 19:17:48,994 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 19:17:48,994 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:48,994 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 19:17:48,997 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:48,998 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:49,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 19:17:49,171 INFO L255 TraceCheckSpWp]: Trace formula consists of 102 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-10-11 19:17:49,173 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 19:17:49,181 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:49,344 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:49,344 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 19:17:49,344 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 19:17:49,344 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [537322009] [2024-10-11 19:17:49,344 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [537322009] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 19:17:49,344 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 19:17:49,344 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 19:17:49,345 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1051356952] [2024-10-11 19:17:49,345 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 19:17:49,345 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 19:17:49,345 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 19:17:49,345 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 19:17:49,345 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 19:17:49,345 INFO L87 Difference]: Start difference. First operand 2855 states and 4206 transitions. Second operand has 4 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 states have internal predecessors, (26), 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:52,648 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 19:17:52,648 INFO L93 Difference]: Finished difference Result 3523 states and 4946 transitions. [2024-10-11 19:17:52,649 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 19:17:52,649 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 states have internal predecessors, (26), 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 26 [2024-10-11 19:17:52,649 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 19:17:52,654 INFO L225 Difference]: With dead ends: 3523 [2024-10-11 19:17:52,655 INFO L226 Difference]: Without dead ends: 3523 [2024-10-11 19:17:52,655 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 23 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:52,656 INFO L432 NwaCegarLoop]: 1259 mSDtfsCounter, 737 mSDsluCounter, 1620 mSDsCounter, 0 mSdLazyCounter, 2123 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 740 SdHoareTripleChecker+Valid, 2879 SdHoareTripleChecker+Invalid, 2126 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 2123 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.2s IncrementalHoareTripleChecker+Time [2024-10-11 19:17:52,656 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [740 Valid, 2879 Invalid, 2126 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 2123 Invalid, 0 Unknown, 0 Unchecked, 3.2s Time] [2024-10-11 19:17:52,660 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3523 states. [2024-10-11 19:17:52,684 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3523 to 2888. [2024-10-11 19:17:52,687 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2888 states, 2136 states have (on average 1.9634831460674158) internal successors, (4194), 2863 states have internal predecessors, (4194), 25 states have call successors, (25), 3 states have call predecessors, (25), 3 states have return successors, (25), 22 states have call predecessors, (25), 25 states have call successors, (25) [2024-10-11 19:17:52,691 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2888 states to 2888 states and 4244 transitions. [2024-10-11 19:17:52,691 INFO L78 Accepts]: Start accepts. Automaton has 2888 states and 4244 transitions. Word has length 26 [2024-10-11 19:17:52,692 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 19:17:52,692 INFO L471 AbstractCegarLoop]: Abstraction has 2888 states and 4244 transitions. [2024-10-11 19:17:52,692 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 states have internal predecessors, (26), 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:52,692 INFO L276 IsEmpty]: Start isEmpty. Operand 2888 states and 4244 transitions. [2024-10-11 19:17:52,693 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2024-10-11 19:17:52,693 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 19:17:52,693 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] [2024-10-11 19:17:52,698 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:52,893 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:52,894 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr362REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 983 more)] === [2024-10-11 19:17:52,894 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 19:17:52,894 INFO L85 PathProgramCache]: Analyzing trace with hash -539382154, now seen corresponding path program 1 times [2024-10-11 19:17:52,895 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 19:17:52,895 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1107796642] [2024-10-11 19:17:52,895 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 19:17:52,895 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:52,895 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 19:17:52,898 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:52,900 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:53,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 19:17:53,110 INFO L255 TraceCheckSpWp]: Trace formula consists of 154 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-10-11 19:17:53,112 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 19:17:53,122 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:53,191 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:53,192 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 19:17:53,192 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 19:17:53,192 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1107796642] [2024-10-11 19:17:53,192 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1107796642] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 19:17:53,192 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 19:17:53,192 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 19:17:53,192 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [711254528] [2024-10-11 19:17:53,192 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 19:17:53,193 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 19:17:53,193 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 19:17:53,193 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 19:17:53,193 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 19:17:53,194 INFO L87 Difference]: Start difference. First operand 2888 states and 4244 transitions. Second operand has 4 states, 3 states have (on average 11.0) internal successors, (33), 4 states have internal predecessors, (33), 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:55,900 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 19:17:55,901 INFO L93 Difference]: Finished difference Result 3541 states and 4945 transitions. [2024-10-11 19:17:55,901 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 19:17:55,901 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 11.0) internal successors, (33), 4 states have internal predecessors, (33), 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 33 [2024-10-11 19:17:55,901 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 19:17:55,906 INFO L225 Difference]: With dead ends: 3541 [2024-10-11 19:17:55,906 INFO L226 Difference]: Without dead ends: 3541 [2024-10-11 19:17:55,907 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 30 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:55,907 INFO L432 NwaCegarLoop]: 1502 mSDtfsCounter, 1526 mSDsluCounter, 1673 mSDsCounter, 0 mSdLazyCounter, 2449 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1536 SdHoareTripleChecker+Valid, 3175 SdHoareTripleChecker+Invalid, 2460 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 2449 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.7s IncrementalHoareTripleChecker+Time [2024-10-11 19:17:55,907 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1536 Valid, 3175 Invalid, 2460 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 2449 Invalid, 0 Unknown, 0 Unchecked, 2.7s Time] [2024-10-11 19:17:55,910 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3541 states. [2024-10-11 19:17:55,935 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3541 to 2884. [2024-10-11 19:17:55,937 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2884 states, 2136 states have (on average 1.952247191011236) internal successors, (4170), 2859 states have internal predecessors, (4170), 25 states have call successors, (25), 3 states have call predecessors, (25), 3 states have return successors, (25), 22 states have call predecessors, (25), 25 states have call successors, (25) [2024-10-11 19:17:55,941 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2884 states to 2884 states and 4220 transitions. [2024-10-11 19:17:55,941 INFO L78 Accepts]: Start accepts. Automaton has 2884 states and 4220 transitions. Word has length 33 [2024-10-11 19:17:55,942 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 19:17:55,942 INFO L471 AbstractCegarLoop]: Abstraction has 2884 states and 4220 transitions. [2024-10-11 19:17:55,942 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 11.0) internal successors, (33), 4 states have internal predecessors, (33), 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:55,942 INFO L276 IsEmpty]: Start isEmpty. Operand 2884 states and 4220 transitions. [2024-10-11 19:17:55,942 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2024-10-11 19:17:55,942 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 19:17:55,943 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] [2024-10-11 19:17:55,963 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 (15)] Forceful destruction successful, exit code 0 [2024-10-11 19:17:56,143 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:56,143 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr363REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 983 more)] === [2024-10-11 19:17:56,144 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 19:17:56,144 INFO L85 PathProgramCache]: Analyzing trace with hash -539382153, now seen corresponding path program 1 times [2024-10-11 19:17:56,144 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 19:17:56,144 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [590721138] [2024-10-11 19:17:56,144 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 19:17:56,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:56,145 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 19:17:56,148 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:56,149 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:56,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 19:17:56,332 INFO L255 TraceCheckSpWp]: Trace formula consists of 154 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-10-11 19:17:56,334 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 19:17:56,339 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:56,480 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:56,481 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 19:17:56,481 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 19:17:56,481 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [590721138] [2024-10-11 19:17:56,481 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [590721138] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 19:17:56,481 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 19:17:56,481 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 19:17:56,481 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [164010619] [2024-10-11 19:17:56,481 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 19:17:56,481 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 19:17:56,481 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 19:17:56,482 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 19:17:56,482 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 19:17:56,482 INFO L87 Difference]: Start difference. First operand 2884 states and 4220 transitions. Second operand has 4 states, 3 states have (on average 11.0) internal successors, (33), 4 states have internal predecessors, (33), 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:18:00,265 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 19:18:00,265 INFO L93 Difference]: Finished difference Result 4075 states and 5749 transitions. [2024-10-11 19:18:00,266 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 19:18:00,266 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 11.0) internal successors, (33), 4 states have internal predecessors, (33), 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 33 [2024-10-11 19:18:00,266 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 19:18:00,270 INFO L225 Difference]: With dead ends: 4075 [2024-10-11 19:18:00,270 INFO L226 Difference]: Without dead ends: 4075 [2024-10-11 19:18:00,270 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 30 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:18:00,270 INFO L432 NwaCegarLoop]: 1803 mSDtfsCounter, 1083 mSDsluCounter, 2003 mSDsCounter, 0 mSdLazyCounter, 2577 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1087 SdHoareTripleChecker+Valid, 3806 SdHoareTripleChecker+Invalid, 2580 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 2577 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.7s IncrementalHoareTripleChecker+Time [2024-10-11 19:18:00,270 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1087 Valid, 3806 Invalid, 2580 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 2577 Invalid, 0 Unknown, 0 Unchecked, 3.7s Time] [2024-10-11 19:18:00,273 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4075 states. [2024-10-11 19:18:00,294 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4075 to 2884. [2024-10-11 19:18:00,296 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2884 states, 2136 states have (on average 1.948501872659176) internal successors, (4162), 2859 states have internal predecessors, (4162), 25 states have call successors, (25), 3 states have call predecessors, (25), 3 states have return successors, (25), 22 states have call predecessors, (25), 25 states have call successors, (25) [2024-10-11 19:18:00,299 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2884 states to 2884 states and 4212 transitions. [2024-10-11 19:18:00,299 INFO L78 Accepts]: Start accepts. Automaton has 2884 states and 4212 transitions. Word has length 33 [2024-10-11 19:18:00,300 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 19:18:00,300 INFO L471 AbstractCegarLoop]: Abstraction has 2884 states and 4212 transitions. [2024-10-11 19:18:00,300 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 11.0) internal successors, (33), 4 states have internal predecessors, (33), 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:18:00,300 INFO L276 IsEmpty]: Start isEmpty. Operand 2884 states and 4212 transitions. [2024-10-11 19:18:00,300 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2024-10-11 19:18:00,300 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 19:18:00,300 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] [2024-10-11 19:18:00,305 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:18:00,501 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:18:00,501 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr54REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 983 more)] === [2024-10-11 19:18:00,501 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 19:18:00,501 INFO L85 PathProgramCache]: Analyzing trace with hash -514220746, now seen corresponding path program 1 times [2024-10-11 19:18:00,502 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 19:18:00,502 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2144087664] [2024-10-11 19:18:00,502 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 19:18:00,502 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:00,502 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 19:18:00,503 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:18:00,504 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:18:00,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 19:18:00,685 INFO L255 TraceCheckSpWp]: Trace formula consists of 154 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-10-11 19:18:00,687 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 19:18:00,692 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:00,749 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 19:18:00,750 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 19:18:00,750 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 19:18:00,750 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2144087664] [2024-10-11 19:18:00,750 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2144087664] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 19:18:00,750 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 19:18:00,750 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 19:18:00,750 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1998827152] [2024-10-11 19:18:00,750 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 19:18:00,750 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 19:18:00,750 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 19:18:00,751 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 19:18:00,751 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 19:18:00,751 INFO L87 Difference]: Start difference. First operand 2884 states and 4212 transitions. Second operand has 4 states, 3 states have (on average 11.0) internal successors, (33), 4 states have internal predecessors, (33), 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:18:03,531 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 19:18:03,531 INFO L93 Difference]: Finished difference Result 3521 states and 4913 transitions. [2024-10-11 19:18:03,532 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 19:18:03,532 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 11.0) internal successors, (33), 4 states have internal predecessors, (33), 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 33 [2024-10-11 19:18:03,532 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 19:18:03,536 INFO L225 Difference]: With dead ends: 3521 [2024-10-11 19:18:03,536 INFO L226 Difference]: Without dead ends: 3521 [2024-10-11 19:18:03,536 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 30 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:18:03,536 INFO L432 NwaCegarLoop]: 1502 mSDtfsCounter, 1522 mSDsluCounter, 1673 mSDsCounter, 0 mSdLazyCounter, 2441 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1532 SdHoareTripleChecker+Valid, 3175 SdHoareTripleChecker+Invalid, 2452 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 2441 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.7s IncrementalHoareTripleChecker+Time [2024-10-11 19:18:03,536 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1532 Valid, 3175 Invalid, 2452 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 2441 Invalid, 0 Unknown, 0 Unchecked, 2.7s Time] [2024-10-11 19:18:03,539 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3521 states. [2024-10-11 19:18:03,556 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3521 to 2880. [2024-10-11 19:18:03,558 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2880 states, 2136 states have (on average 1.9447565543071161) internal successors, (4154), 2855 states have internal predecessors, (4154), 25 states have call successors, (25), 3 states have call predecessors, (25), 3 states have return successors, (25), 22 states have call predecessors, (25), 25 states have call successors, (25) [2024-10-11 19:18:03,562 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2880 states to 2880 states and 4204 transitions. [2024-10-11 19:18:03,563 INFO L78 Accepts]: Start accepts. Automaton has 2880 states and 4204 transitions. Word has length 33 [2024-10-11 19:18:03,563 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 19:18:03,563 INFO L471 AbstractCegarLoop]: Abstraction has 2880 states and 4204 transitions. [2024-10-11 19:18:03,563 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 11.0) internal successors, (33), 4 states have internal predecessors, (33), 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:18:03,563 INFO L276 IsEmpty]: Start isEmpty. Operand 2880 states and 4204 transitions. [2024-10-11 19:18:03,564 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2024-10-11 19:18:03,564 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 19:18:03,564 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] [2024-10-11 19:18:03,571 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:18:03,764 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:18:03,765 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr55REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 983 more)] === [2024-10-11 19:18:03,766 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 19:18:03,766 INFO L85 PathProgramCache]: Analyzing trace with hash -514220745, now seen corresponding path program 1 times [2024-10-11 19:18:03,766 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 19:18:03,766 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [565918569] [2024-10-11 19:18:03,766 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 19:18:03,767 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,767 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 19:18:03,769 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:18:03,771 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:18:04,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 19:18:04,032 INFO L255 TraceCheckSpWp]: Trace formula consists of 154 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-10-11 19:18:04,034 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 19:18:04,041 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:18:04,169 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:18:04,169 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 19:18:04,170 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 19:18:04,170 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [565918569] [2024-10-11 19:18:04,170 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [565918569] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 19:18:04,170 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 19:18:04,170 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 19:18:04,170 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [747690675] [2024-10-11 19:18:04,170 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 19:18:04,170 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 19:18:04,170 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 19:18:04,171 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 19:18:04,171 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 19:18:04,171 INFO L87 Difference]: Start difference. First operand 2880 states and 4204 transitions. Second operand has 4 states, 3 states have (on average 11.0) internal successors, (33), 4 states have internal predecessors, (33), 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:18:08,052 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 19:18:08,053 INFO L93 Difference]: Finished difference Result 4067 states and 5733 transitions. [2024-10-11 19:18:08,053 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 19:18:08,053 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 11.0) internal successors, (33), 4 states have internal predecessors, (33), 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 33 [2024-10-11 19:18:08,053 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 19:18:08,057 INFO L225 Difference]: With dead ends: 4067 [2024-10-11 19:18:08,057 INFO L226 Difference]: Without dead ends: 4067 [2024-10-11 19:18:08,057 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 30 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:18:08,058 INFO L432 NwaCegarLoop]: 1799 mSDtfsCounter, 1075 mSDsluCounter, 1972 mSDsCounter, 0 mSdLazyCounter, 2565 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1079 SdHoareTripleChecker+Valid, 3771 SdHoareTripleChecker+Invalid, 2568 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 2565 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.8s IncrementalHoareTripleChecker+Time [2024-10-11 19:18:08,058 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1079 Valid, 3771 Invalid, 2568 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 2565 Invalid, 0 Unknown, 0 Unchecked, 3.8s Time] [2024-10-11 19:18:08,060 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4067 states. [2024-10-11 19:18:08,083 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4067 to 2876. [2024-10-11 19:18:08,085 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2876 states, 2136 states have (on average 1.9410112359550562) internal successors, (4146), 2851 states have internal predecessors, (4146), 25 states have call successors, (25), 3 states have call predecessors, (25), 3 states have return successors, (25), 22 states have call predecessors, (25), 25 states have call successors, (25) [2024-10-11 19:18:08,088 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2876 states to 2876 states and 4196 transitions. [2024-10-11 19:18:08,089 INFO L78 Accepts]: Start accepts. Automaton has 2876 states and 4196 transitions. Word has length 33 [2024-10-11 19:18:08,089 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 19:18:08,089 INFO L471 AbstractCegarLoop]: Abstraction has 2876 states and 4196 transitions. [2024-10-11 19:18:08,089 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 11.0) internal successors, (33), 4 states have internal predecessors, (33), 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:18:08,089 INFO L276 IsEmpty]: Start isEmpty. Operand 2876 states and 4196 transitions. [2024-10-11 19:18:08,090 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2024-10-11 19:18:08,090 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 19:18:08,090 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] [2024-10-11 19:18:08,096 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 (18)] Ended with exit code 0 [2024-10-11 19:18:08,293 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:18:08,294 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr684REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 983 more)] === [2024-10-11 19:18:08,294 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 19:18:08,294 INFO L85 PathProgramCache]: Analyzing trace with hash -1343686139, now seen corresponding path program 1 times [2024-10-11 19:18:08,295 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 19:18:08,295 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1579332394] [2024-10-11 19:18:08,295 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 19:18:08,295 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 19:18:08,295 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 19:18:08,296 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:18:08,297 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:18:08,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 19:18:08,468 INFO L255 TraceCheckSpWp]: Trace formula consists of 119 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-11 19:18:08,470 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 19:18:08,502 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:18:08,502 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 19:18:08,502 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 19:18:08,502 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1579332394] [2024-10-11 19:18:08,502 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1579332394] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 19:18:08,502 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 19:18:08,502 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 19:18:08,503 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1542607900] [2024-10-11 19:18:08,503 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 19:18:08,503 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 19:18:08,503 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 19:18:08,503 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 19:18:08,503 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 19:18:08,504 INFO L87 Difference]: Start difference. First operand 2876 states and 4196 transitions. Second operand has 4 states, 4 states have (on average 10.0) internal successors, (40), 4 states have internal predecessors, (40), 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:18:09,466 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 19:18:09,466 INFO L93 Difference]: Finished difference Result 2864 states and 4172 transitions. [2024-10-11 19:18:09,467 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-11 19:18:09,467 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 10.0) internal successors, (40), 4 states have internal predecessors, (40), 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 40 [2024-10-11 19:18:09,468 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 19:18:09,471 INFO L225 Difference]: With dead ends: 2864 [2024-10-11 19:18:09,471 INFO L226 Difference]: Without dead ends: 2864 [2024-10-11 19:18:09,471 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 37 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:18:09,472 INFO L432 NwaCegarLoop]: 1468 mSDtfsCounter, 21 mSDsluCounter, 2913 mSDsCounter, 0 mSdLazyCounter, 534 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 4381 SdHoareTripleChecker+Invalid, 540 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 534 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-10-11 19:18:09,472 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 4381 Invalid, 540 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 534 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-10-11 19:18:09,474 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2864 states. [2024-10-11 19:18:09,495 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2864 to 2864. [2024-10-11 19:18:09,498 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2864 states, 2124 states have (on average 1.9406779661016949) internal successors, (4122), 2839 states have internal predecessors, (4122), 25 states have call successors, (25), 3 states have call predecessors, (25), 3 states have return successors, (25), 22 states have call predecessors, (25), 25 states have call successors, (25) [2024-10-11 19:18:09,502 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2864 states to 2864 states and 4172 transitions. [2024-10-11 19:18:09,502 INFO L78 Accepts]: Start accepts. Automaton has 2864 states and 4172 transitions. Word has length 40 [2024-10-11 19:18:09,502 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 19:18:09,502 INFO L471 AbstractCegarLoop]: Abstraction has 2864 states and 4172 transitions. [2024-10-11 19:18:09,503 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.0) internal successors, (40), 4 states have internal predecessors, (40), 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:18:09,503 INFO L276 IsEmpty]: Start isEmpty. Operand 2864 states and 4172 transitions. [2024-10-11 19:18:09,504 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2024-10-11 19:18:09,504 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 19:18:09,504 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] [2024-10-11 19:18:09,510 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:18:09,704 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:18:09,705 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr684REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 983 more)] === [2024-10-11 19:18:09,705 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 19:18:09,705 INFO L85 PathProgramCache]: Analyzing trace with hash 2088153858, now seen corresponding path program 1 times [2024-10-11 19:18:09,705 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 19:18:09,705 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2134464278] [2024-10-11 19:18:09,705 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 19:18:09,705 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:09,705 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 19:18:09,706 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:18:09,707 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:18:09,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 19:18:09,890 INFO L255 TraceCheckSpWp]: Trace formula consists of 139 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-11 19:18:09,891 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 19:18:10,035 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:18:10,035 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 19:18:10,035 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 19:18:10,035 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2134464278] [2024-10-11 19:18:10,035 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2134464278] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 19:18:10,035 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 19:18:10,035 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 19:18:10,035 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1161750073] [2024-10-11 19:18:10,036 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 19:18:10,036 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 19:18:10,036 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 19:18:10,036 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 19:18:10,036 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 19:18:10,036 INFO L87 Difference]: Start difference. First operand 2864 states and 4172 transitions. Second operand has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 2 states have internal predecessors, (44), 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:18:11,080 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 19:18:11,080 INFO L93 Difference]: Finished difference Result 4172 states and 5857 transitions. [2024-10-11 19:18:11,081 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 19:18:11,081 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 2 states have internal predecessors, (44), 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 44 [2024-10-11 19:18:11,081 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 19:18:11,085 INFO L225 Difference]: With dead ends: 4172 [2024-10-11 19:18:11,085 INFO L226 Difference]: Without dead ends: 4172 [2024-10-11 19:18:11,086 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 42 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:18:11,086 INFO L432 NwaCegarLoop]: 1484 mSDtfsCounter, 1014 mSDsluCounter, 1422 mSDsCounter, 0 mSdLazyCounter, 397 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1021 SdHoareTripleChecker+Valid, 2906 SdHoareTripleChecker+Invalid, 401 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 397 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2024-10-11 19:18:11,086 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1021 Valid, 2906 Invalid, 401 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 397 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2024-10-11 19:18:11,088 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4172 states. [2024-10-11 19:18:11,123 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4172 to 3536. [2024-10-11 19:18:11,126 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3536 states, 2792 states have (on average 1.9255014326647564) internal successors, (5376), 3504 states have internal predecessors, (5376), 32 states have call successors, (32), 3 states have call predecessors, (32), 3 states have return successors, (32), 29 states have call predecessors, (32), 32 states have call successors, (32) [2024-10-11 19:18:11,130 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3536 states to 3536 states and 5440 transitions. [2024-10-11 19:18:11,130 INFO L78 Accepts]: Start accepts. Automaton has 3536 states and 5440 transitions. Word has length 44 [2024-10-11 19:18:11,130 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 19:18:11,130 INFO L471 AbstractCegarLoop]: Abstraction has 3536 states and 5440 transitions. [2024-10-11 19:18:11,130 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 2 states have internal predecessors, (44), 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:18:11,130 INFO L276 IsEmpty]: Start isEmpty. Operand 3536 states and 5440 transitions. [2024-10-11 19:18:11,131 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2024-10-11 19:18:11,131 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 19:18:11,131 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 19:18:11,137 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:18:11,331 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:18:11,332 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr427REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 983 more)] === [2024-10-11 19:18:11,332 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 19:18:11,332 INFO L85 PathProgramCache]: Analyzing trace with hash 1373428208, now seen corresponding path program 1 times [2024-10-11 19:18:11,333 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 19:18:11,333 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [123589762] [2024-10-11 19:18:11,333 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 19:18:11,333 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:11,333 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 19:18:11,334 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:18:11,335 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:18:11,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 19:18:11,550 INFO L255 TraceCheckSpWp]: Trace formula consists of 226 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-11 19:18:11,552 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 19:18:11,589 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:18:11,590 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 19:18:11,590 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 19:18:11,590 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [123589762] [2024-10-11 19:18:11,590 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [123589762] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 19:18:11,590 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 19:18:11,590 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 19:18:11,591 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [769434160] [2024-10-11 19:18:11,591 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 19:18:11,591 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 19:18:11,591 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 19:18:11,592 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 19:18:11,592 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 19:18:11,592 INFO L87 Difference]: Start difference. First operand 3536 states and 5440 transitions. Second operand has 4 states, 4 states have (on average 12.25) internal successors, (49), 4 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 19:18:12,562 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 19:18:12,562 INFO L93 Difference]: Finished difference Result 3494 states and 5370 transitions. [2024-10-11 19:18:12,563 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-11 19:18:12,563 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.25) internal successors, (49), 4 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 49 [2024-10-11 19:18:12,563 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 19:18:12,567 INFO L225 Difference]: With dead ends: 3494 [2024-10-11 19:18:12,567 INFO L226 Difference]: Without dead ends: 3494 [2024-10-11 19:18:12,567 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 46 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-11 19:18:12,568 INFO L432 NwaCegarLoop]: 1464 mSDtfsCounter, 21 mSDsluCounter, 2905 mSDsCounter, 0 mSdLazyCounter, 534 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 4369 SdHoareTripleChecker+Invalid, 540 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 534 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-10-11 19:18:12,568 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 4369 Invalid, 540 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 534 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-10-11 19:18:12,570 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3494 states. [2024-10-11 19:18:12,594 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3494 to 3494. [2024-10-11 19:18:12,597 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3494 states, 2750 states have (on average 1.9294545454545455) internal successors, (5306), 3462 states have internal predecessors, (5306), 32 states have call successors, (32), 3 states have call predecessors, (32), 3 states have return successors, (32), 29 states have call predecessors, (32), 32 states have call successors, (32) [2024-10-11 19:18:12,602 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3494 states to 3494 states and 5370 transitions. [2024-10-11 19:18:12,603 INFO L78 Accepts]: Start accepts. Automaton has 3494 states and 5370 transitions. Word has length 49 [2024-10-11 19:18:12,603 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 19:18:12,603 INFO L471 AbstractCegarLoop]: Abstraction has 3494 states and 5370 transitions. [2024-10-11 19:18:12,603 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.25) internal successors, (49), 4 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 19:18:12,604 INFO L276 IsEmpty]: Start isEmpty. Operand 3494 states and 5370 transitions. [2024-10-11 19:18:12,604 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2024-10-11 19:18:12,604 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 19:18:12,604 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] [2024-10-11 19:18:12,612 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:12,805 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:12,806 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr73REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 983 more)] === [2024-10-11 19:18:12,806 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 19:18:12,806 INFO L85 PathProgramCache]: Analyzing trace with hash -1443981237, now seen corresponding path program 1 times [2024-10-11 19:18:12,807 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 19:18:12,807 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1139684474] [2024-10-11 19:18:12,807 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 19:18:12,807 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:12,807 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 19:18:12,810 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:12,812 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:13,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 19:18:13,084 INFO L255 TraceCheckSpWp]: Trace formula consists of 261 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-11 19:18:13,086 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 19:18:13,151 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:18:13,151 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 19:18:13,151 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 19:18:13,151 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1139684474] [2024-10-11 19:18:13,152 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1139684474] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 19:18:13,152 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 19:18:13,152 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 19:18:13,152 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1933201660] [2024-10-11 19:18:13,152 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 19:18:13,152 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 19:18:13,152 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 19:18:13,153 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 19:18:13,153 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 19:18:13,153 INFO L87 Difference]: Start difference. First operand 3494 states and 5370 transitions. Second operand has 4 states, 4 states have (on average 13.0) internal successors, (52), 4 states have internal predecessors, (52), 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:18:14,136 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 19:18:14,136 INFO L93 Difference]: Finished difference Result 3476 states and 5340 transitions. [2024-10-11 19:18:14,137 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-11 19:18:14,137 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 13.0) internal successors, (52), 4 states have internal predecessors, (52), 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 52 [2024-10-11 19:18:14,137 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 19:18:14,140 INFO L225 Difference]: With dead ends: 3476 [2024-10-11 19:18:14,140 INFO L226 Difference]: Without dead ends: 3476 [2024-10-11 19:18:14,141 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 49 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:18:14,141 INFO L432 NwaCegarLoop]: 1460 mSDtfsCounter, 15 mSDsluCounter, 2903 mSDsCounter, 0 mSdLazyCounter, 534 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 4363 SdHoareTripleChecker+Invalid, 540 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 534 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2024-10-11 19:18:14,141 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 4363 Invalid, 540 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 534 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2024-10-11 19:18:14,143 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3476 states. [2024-10-11 19:18:14,171 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3476 to 3476. [2024-10-11 19:18:14,174 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3476 states, 2732 states have (on average 1.9311859443631039) internal successors, (5276), 3444 states have internal predecessors, (5276), 32 states have call successors, (32), 3 states have call predecessors, (32), 3 states have return successors, (32), 29 states have call predecessors, (32), 32 states have call successors, (32) [2024-10-11 19:18:14,179 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3476 states to 3476 states and 5340 transitions. [2024-10-11 19:18:14,179 INFO L78 Accepts]: Start accepts. Automaton has 3476 states and 5340 transitions. Word has length 52 [2024-10-11 19:18:14,179 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 19:18:14,180 INFO L471 AbstractCegarLoop]: Abstraction has 3476 states and 5340 transitions. [2024-10-11 19:18:14,180 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.0) internal successors, (52), 4 states have internal predecessors, (52), 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:18:14,180 INFO L276 IsEmpty]: Start isEmpty. Operand 3476 states and 5340 transitions. [2024-10-11 19:18:14,180 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2024-10-11 19:18:14,181 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 19:18:14,181 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 19:18:14,189 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 (22)] Ended with exit code 0 [2024-10-11 19:18:14,381 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 22 /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:14,382 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 983 more)] === [2024-10-11 19:18:14,382 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 19:18:14,382 INFO L85 PathProgramCache]: Analyzing trace with hash -2083281976, now seen corresponding path program 1 times [2024-10-11 19:18:14,383 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 19:18:14,383 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2145587325] [2024-10-11 19:18:14,383 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 19:18:14,383 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:14,383 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 19:18:14,386 INFO L229 MonitoredProcess]: Starting monitored process 23 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:14,388 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 (23)] Waiting until timeout for monitored process [2024-10-11 19:18:14,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 19:18:14,666 INFO L255 TraceCheckSpWp]: Trace formula consists of 164 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-10-11 19:18:14,669 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 19:18:14,677 INFO L173 IndexEqualityManager]: detected equality via solver [2024-10-11 19:18:14,678 INFO L173 IndexEqualityManager]: detected equality via solver [2024-10-11 19:18:14,682 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 33 treesize of output 31 [2024-10-11 19:18:14,712 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-11 19:18:14,712 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 62 treesize of output 22 [2024-10-11 19:18:14,748 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:18:14,749 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 19:18:14,749 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 19:18:14,749 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2145587325] [2024-10-11 19:18:14,749 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2145587325] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 19:18:14,750 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 19:18:14,750 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 19:18:14,750 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [370907590] [2024-10-11 19:18:14,750 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 19:18:14,751 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 19:18:14,751 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 19:18:14,751 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 19:18:14,751 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 19:18:14,752 INFO L87 Difference]: Start difference. First operand 3476 states and 5340 transitions. Second operand has 4 states, 4 states have (on average 13.25) internal successors, (53), 4 states have internal predecessors, (53), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 19:18:16,866 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 19:18:16,866 INFO L93 Difference]: Finished difference Result 4728 states and 7149 transitions. [2024-10-11 19:18:16,866 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 19:18:16,867 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 13.25) internal successors, (53), 4 states have internal predecessors, (53), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 55 [2024-10-11 19:18:16,867 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 19:18:16,872 INFO L225 Difference]: With dead ends: 4728 [2024-10-11 19:18:16,872 INFO L226 Difference]: Without dead ends: 4728 [2024-10-11 19:18:16,872 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 52 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:18:16,873 INFO L432 NwaCegarLoop]: 1591 mSDtfsCounter, 1535 mSDsluCounter, 2374 mSDsCounter, 0 mSdLazyCounter, 639 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1544 SdHoareTripleChecker+Valid, 3965 SdHoareTripleChecker+Invalid, 641 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 639 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2024-10-11 19:18:16,873 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1544 Valid, 3965 Invalid, 641 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 639 Invalid, 0 Unknown, 0 Unchecked, 2.1s Time] [2024-10-11 19:18:16,875 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4728 states. [2024-10-11 19:18:16,899 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4728 to 3445. [2024-10-11 19:18:16,902 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3445 states, 2701 states have (on average 1.941503146982599) internal successors, (5244), 3413 states have internal predecessors, (5244), 32 states have call successors, (32), 3 states have call predecessors, (32), 3 states have return successors, (32), 29 states have call predecessors, (32), 32 states have call successors, (32) [2024-10-11 19:18:16,905 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3445 states to 3445 states and 5308 transitions. [2024-10-11 19:18:16,906 INFO L78 Accepts]: Start accepts. Automaton has 3445 states and 5308 transitions. Word has length 55 [2024-10-11 19:18:16,906 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 19:18:16,906 INFO L471 AbstractCegarLoop]: Abstraction has 3445 states and 5308 transitions. [2024-10-11 19:18:16,906 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.25) internal successors, (53), 4 states have internal predecessors, (53), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 19:18:16,906 INFO L276 IsEmpty]: Start isEmpty. Operand 3445 states and 5308 transitions. [2024-10-11 19:18:16,906 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2024-10-11 19:18:16,906 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 19:18:16,906 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 19:18:16,912 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 (23)] Ended with exit code 0 [2024-10-11 19:18:17,107 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 23 /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:17,107 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr427REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 983 more)] === [2024-10-11 19:18:17,107 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 19:18:17,107 INFO L85 PathProgramCache]: Analyzing trace with hash -2106413678, now seen corresponding path program 1 times [2024-10-11 19:18:17,108 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 19:18:17,108 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1408821004] [2024-10-11 19:18:17,108 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 19:18:17,108 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:17,108 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 19:18:17,109 INFO L229 MonitoredProcess]: Starting monitored process 24 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:17,110 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 (24)] Waiting until timeout for monitored process [2024-10-11 19:18:17,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 19:18:17,356 INFO L255 TraceCheckSpWp]: Trace formula consists of 246 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-11 19:18:17,358 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 19:18:17,556 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:18:17,556 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 19:18:17,557 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 19:18:17,557 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1408821004] [2024-10-11 19:18:17,557 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1408821004] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 19:18:17,557 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 19:18:17,557 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 19:18:17,557 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [548734213] [2024-10-11 19:18:17,557 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 19:18:17,557 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 19:18:17,557 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 19:18:17,558 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 19:18:17,558 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 19:18:17,558 INFO L87 Difference]: Start difference. First operand 3445 states and 5308 transitions. Second operand has 3 states, 3 states have (on average 17.666666666666668) internal successors, (53), 2 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 19:18:18,636 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 19:18:18,636 INFO L93 Difference]: Finished difference Result 4570 states and 6768 transitions. [2024-10-11 19:18:18,637 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 19:18:18,637 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 17.666666666666668) internal successors, (53), 2 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 53 [2024-10-11 19:18:18,637 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 19:18:18,641 INFO L225 Difference]: With dead ends: 4570 [2024-10-11 19:18:18,641 INFO L226 Difference]: Without dead ends: 4570 [2024-10-11 19:18:18,642 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 51 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:18:18,642 INFO L432 NwaCegarLoop]: 1547 mSDtfsCounter, 721 mSDsluCounter, 1414 mSDsCounter, 0 mSdLazyCounter, 401 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 727 SdHoareTripleChecker+Valid, 2961 SdHoareTripleChecker+Invalid, 404 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 401 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2024-10-11 19:18:18,642 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [727 Valid, 2961 Invalid, 404 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 401 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2024-10-11 19:18:18,644 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4570 states. [2024-10-11 19:18:18,676 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4570 to 4234. [2024-10-11 19:18:18,679 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4234 states, 3484 states have (on average 1.9153272101033294) internal successors, (6673), 4193 states have internal predecessors, (6673), 41 states have call successors, (41), 3 states have call predecessors, (41), 3 states have return successors, (41), 38 states have call predecessors, (41), 41 states have call successors, (41) [2024-10-11 19:18:18,686 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4234 states to 4234 states and 6755 transitions. [2024-10-11 19:18:18,686 INFO L78 Accepts]: Start accepts. Automaton has 4234 states and 6755 transitions. Word has length 53 [2024-10-11 19:18:18,686 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 19:18:18,686 INFO L471 AbstractCegarLoop]: Abstraction has 4234 states and 6755 transitions. [2024-10-11 19:18:18,687 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 17.666666666666668) internal successors, (53), 2 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 19:18:18,687 INFO L276 IsEmpty]: Start isEmpty. Operand 4234 states and 6755 transitions. [2024-10-11 19:18:18,687 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2024-10-11 19:18:18,687 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 19:18:18,687 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] [2024-10-11 19:18:18,696 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 (24)] Ended with exit code 0 [2024-10-11 19:18:18,888 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 24 /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:18,888 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr381REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 983 more)] === [2024-10-11 19:18:18,888 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 19:18:18,889 INFO L85 PathProgramCache]: Analyzing trace with hash 1490723271, now seen corresponding path program 1 times [2024-10-11 19:18:18,889 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 19:18:18,889 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [980286452] [2024-10-11 19:18:18,889 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 19:18:18,889 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:18,889 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 19:18:18,890 INFO L229 MonitoredProcess]: Starting monitored process 25 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:18,891 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 (25)] Waiting until timeout for monitored process [2024-10-11 19:18:19,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 19:18:19,223 INFO L255 TraceCheckSpWp]: Trace formula consists of 281 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-10-11 19:18:19,225 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 19:18:19,229 INFO L173 IndexEqualityManager]: detected equality via solver [2024-10-11 19:18:19,230 INFO L173 IndexEqualityManager]: detected equality via solver [2024-10-11 19:18:19,230 INFO L173 IndexEqualityManager]: detected equality via solver [2024-10-11 19:18:19,232 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:18:19,336 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-11 19:18:19,337 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:18:19,348 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:18:19,348 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 19:18:19,349 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 19:18:19,349 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [980286452] [2024-10-11 19:18:19,349 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [980286452] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 19:18:19,349 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 19:18:19,349 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 19:18:19,349 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1106658309] [2024-10-11 19:18:19,349 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 19:18:19,349 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 19:18:19,349 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 19:18:19,350 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 19:18:19,350 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 19:18:19,350 INFO L87 Difference]: Start difference. First operand 4234 states and 6755 transitions. Second operand has 4 states, 4 states have (on average 14.0) internal successors, (56), 4 states have internal predecessors, (56), 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:18:20,937 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 19:18:20,937 INFO L93 Difference]: Finished difference Result 4551 states and 6834 transitions. [2024-10-11 19:18:20,938 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 19:18:20,938 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 14.0) internal successors, (56), 4 states have internal predecessors, (56), 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 56 [2024-10-11 19:18:20,938 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 19:18:20,942 INFO L225 Difference]: With dead ends: 4551 [2024-10-11 19:18:20,943 INFO L226 Difference]: Without dead ends: 4551 [2024-10-11 19:18:20,943 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 53 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:18:20,943 INFO L432 NwaCegarLoop]: 1467 mSDtfsCounter, 770 mSDsluCounter, 2866 mSDsCounter, 0 mSdLazyCounter, 598 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 776 SdHoareTripleChecker+Valid, 4333 SdHoareTripleChecker+Invalid, 598 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 598 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2024-10-11 19:18:20,943 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [776 Valid, 4333 Invalid, 598 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 598 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2024-10-11 19:18:20,947 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4551 states. [2024-10-11 19:18:20,978 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4551 to 3866. [2024-10-11 19:18:20,981 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3866 states, 3116 states have (on average 1.9409499358151476) internal successors, (6048), 3828 states have internal predecessors, (6048), 38 states have call successors, (38), 3 states have call predecessors, (38), 3 states have return successors, (38), 35 states have call predecessors, (38), 38 states have call successors, (38) [2024-10-11 19:18:20,987 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3866 states to 3866 states and 6124 transitions. [2024-10-11 19:18:20,987 INFO L78 Accepts]: Start accepts. Automaton has 3866 states and 6124 transitions. Word has length 56 [2024-10-11 19:18:20,988 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 19:18:20,988 INFO L471 AbstractCegarLoop]: Abstraction has 3866 states and 6124 transitions. [2024-10-11 19:18:20,988 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.0) internal successors, (56), 4 states have internal predecessors, (56), 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:18:20,988 INFO L276 IsEmpty]: Start isEmpty. Operand 3866 states and 6124 transitions. [2024-10-11 19:18:20,988 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2024-10-11 19:18:20,989 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 19:18:20,989 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] [2024-10-11 19:18:20,998 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 (25)] Ended with exit code 0 [2024-10-11 19:18:21,189 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 25 /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:21,190 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr73REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 983 more)] === [2024-10-11 19:18:21,190 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 19:18:21,190 INFO L85 PathProgramCache]: Analyzing trace with hash 1155902858, now seen corresponding path program 1 times [2024-10-11 19:18:21,190 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 19:18:21,191 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2111565491] [2024-10-11 19:18:21,191 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 19:18:21,191 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:21,191 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 19:18:21,194 INFO L229 MonitoredProcess]: Starting monitored process 26 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:21,195 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 (26)] Waiting until timeout for monitored process [2024-10-11 19:18:21,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 19:18:21,519 INFO L255 TraceCheckSpWp]: Trace formula consists of 281 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-10-11 19:18:21,522 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 19:18:21,527 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:21,532 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:18:21,847 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-11 19:18:21,847 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 9 [2024-10-11 19:18:21,856 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2024-10-11 19:18:21,857 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:18:21,865 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:18:21,865 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 19:18:21,865 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 19:18:21,865 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2111565491] [2024-10-11 19:18:21,865 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2111565491] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 19:18:21,865 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 19:18:21,865 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 19:18:21,865 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1986297037] [2024-10-11 19:18:21,865 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 19:18:21,866 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 19:18:21,866 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 19:18:21,866 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 19:18:21,866 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-11 19:18:21,866 INFO L87 Difference]: Start difference. First operand 3866 states and 6124 transitions. Second operand has 4 states, 3 states have (on average 18.666666666666668) internal successors, (56), 4 states have internal predecessors, (56), 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)