./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-2.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 4a390ef5 Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_SAX_test10-2.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 22840dbbc7fdeff8c5ae44a2e4ee4ab6a60b4cab9f47ba8847305b912adb9a2c --- Real Ultimate output --- This is Ultimate 0.2.5-dev-4a390ef-m [2024-10-24 18:42:22,841 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-24 18:42:22,945 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2024-10-24 18:42:22,950 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-24 18:42:22,950 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-24 18:42:22,980 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-24 18:42:22,981 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-24 18:42:22,981 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-24 18:42:22,982 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-24 18:42:22,982 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-24 18:42:22,983 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-24 18:42:22,983 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-24 18:42:22,985 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-24 18:42:22,989 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-24 18:42:22,990 INFO L153 SettingsManager]: * Use SBE=true [2024-10-24 18:42:22,990 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-24 18:42:22,991 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-24 18:42:22,991 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-24 18:42:22,991 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-24 18:42:22,991 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-24 18:42:22,992 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-10-24 18:42:22,992 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-10-24 18:42:22,993 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-10-24 18:42:22,994 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-24 18:42:22,994 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-10-24 18:42:22,994 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-24 18:42:22,995 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-10-24 18:42:22,995 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-24 18:42:22,995 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-24 18:42:22,995 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-24 18:42:22,996 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-24 18:42:22,996 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-24 18:42:22,996 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-24 18:42:22,996 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-24 18:42:22,997 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-24 18:42:22,997 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-24 18:42:22,998 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-24 18:42:22,998 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-24 18:42:22,998 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-24 18:42:22,999 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-24 18:42:22,999 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-24 18:42:23,000 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-24 18:42:23,000 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 22840dbbc7fdeff8c5ae44a2e4ee4ab6a60b4cab9f47ba8847305b912adb9a2c [2024-10-24 18:42:23,273 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-24 18:42:23,300 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-24 18:42:23,305 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-24 18:42:23,306 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-24 18:42:23,308 INFO L274 PluginConnector]: CDTParser initialized [2024-10-24 18:42:23,309 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_SAX_test10-2.i [2024-10-24 18:42:24,915 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-24 18:42:25,299 INFO L384 CDTParser]: Found 1 translation units. [2024-10-24 18:42:25,300 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_SAX_test10-2.i [2024-10-24 18:42:25,328 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2622550e6/4ed233cdeaa64369b475097d8184642b/FLAGf389cc247 [2024-10-24 18:42:25,480 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2622550e6/4ed233cdeaa64369b475097d8184642b [2024-10-24 18:42:25,483 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-24 18:42:25,484 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-24 18:42:25,486 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-24 18:42:25,486 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-24 18:42:25,494 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-24 18:42:25,495 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 06:42:25" (1/1) ... [2024-10-24 18:42:25,498 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5074d28d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 06:42:25, skipping insertion in model container [2024-10-24 18:42:25,499 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 06:42:25" (1/1) ... [2024-10-24 18:42:25,587 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-24 18:42:26,430 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-24 18:42:26,441 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-24 18:42:26,442 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver@68308023 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 06:42:26, skipping insertion in model container [2024-10-24 18:42:26,442 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-24 18:42:26,442 INFO L186 ToolchainWalker]: Toolchain execution was canceled (user or tool) before executing de.uni_freiburg.informatik.ultimate.boogie.procedureinliner [2024-10-24 18:42:26,444 INFO L158 Benchmark]: Toolchain (without parser) took 959.10ms. Allocated memory is still 157.3MB. Free memory was 90.3MB in the beginning and 108.6MB in the end (delta: -18.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-10-24 18:42:26,445 INFO L158 Benchmark]: CDTParser took 0.29ms. Allocated memory is still 96.5MB. Free memory was 51.3MB in the beginning and 51.2MB in the end (delta: 84.1kB). There was no memory consumed. Max. memory is 16.1GB. [2024-10-24 18:42:26,445 INFO L158 Benchmark]: CACSL2BoogieTranslator took 956.47ms. Allocated memory is still 157.3MB. Free memory was 90.3MB in the beginning and 108.6MB in the end (delta: -18.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-10-24 18:42:26,447 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.29ms. Allocated memory is still 96.5MB. Free memory was 51.3MB in the beginning and 51.2MB in the end (delta: 84.1kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 956.47ms. Allocated memory is still 157.3MB. Free memory was 90.3MB in the beginning and 108.6MB in the end (delta: -18.3MB). Peak memory consumption was 8.4MB. 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/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_SAX_test10-2.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 22840dbbc7fdeff8c5ae44a2e4ee4ab6a60b4cab9f47ba8847305b912adb9a2c --- Real Ultimate output --- This is Ultimate 0.2.5-dev-4a390ef-m [2024-10-24 18:42:28,678 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-24 18:42:28,762 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf [2024-10-24 18:42:28,771 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-24 18:42:28,773 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-24 18:42:28,804 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-24 18:42:28,805 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-24 18:42:28,806 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-24 18:42:28,806 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-24 18:42:28,807 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-24 18:42:28,807 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-24 18:42:28,808 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-24 18:42:28,809 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-24 18:42:28,809 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-24 18:42:28,809 INFO L153 SettingsManager]: * Use SBE=true [2024-10-24 18:42:28,810 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-24 18:42:28,810 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-24 18:42:28,810 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-24 18:42:28,811 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-24 18:42:28,811 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-24 18:42:28,811 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-10-24 18:42:28,812 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-10-24 18:42:28,812 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-10-24 18:42:28,813 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-24 18:42:28,813 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-10-24 18:42:28,813 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-10-24 18:42:28,814 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-24 18:42:28,814 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-10-24 18:42:28,814 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-10-24 18:42:28,814 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-24 18:42:28,815 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-24 18:42:28,815 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-24 18:42:28,815 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-24 18:42:28,815 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-24 18:42:28,815 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-24 18:42:28,816 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-24 18:42:28,816 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-24 18:42:28,816 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-24 18:42:28,817 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-10-24 18:42:28,817 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-10-24 18:42:28,817 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-24 18:42:28,819 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-24 18:42:28,819 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-24 18:42:28,819 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-24 18:42:28,819 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2024-10-24 18:42:28,820 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 22840dbbc7fdeff8c5ae44a2e4ee4ab6a60b4cab9f47ba8847305b912adb9a2c [2024-10-24 18:42:29,212 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-24 18:42:29,244 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-24 18:42:29,247 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-24 18:42:29,249 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-24 18:42:29,249 INFO L274 PluginConnector]: CDTParser initialized [2024-10-24 18:42:29,252 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_SAX_test10-2.i [2024-10-24 18:42:30,964 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-24 18:42:31,361 INFO L384 CDTParser]: Found 1 translation units. [2024-10-24 18:42:31,362 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_SAX_test10-2.i [2024-10-24 18:42:31,397 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0676367cb/d08fb861653d46ef969d3688a076ae3b/FLAGeca80aa61 [2024-10-24 18:42:31,544 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0676367cb/d08fb861653d46ef969d3688a076ae3b [2024-10-24 18:42:31,546 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-24 18:42:31,548 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-24 18:42:31,549 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-24 18:42:31,549 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-24 18:42:31,556 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-24 18:42:31,557 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 06:42:31" (1/1) ... [2024-10-24 18:42:31,558 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@15fabd1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 06:42:31, skipping insertion in model container [2024-10-24 18:42:31,558 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 06:42:31" (1/1) ... [2024-10-24 18:42:31,636 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-24 18:42:32,455 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-24 18:42:32,474 INFO L197 MainTranslator]: Restarting translation with changed settings: SettingsChange [mNewPreferredMemoryModel=HoenickeLindenmann_1ByteResolution] [2024-10-24 18:42:32,487 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-24 18:42:32,620 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-24 18:42:32,626 INFO L200 MainTranslator]: Completed pre-run [2024-10-24 18:42:32,762 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-24 18:42:32,816 INFO L204 MainTranslator]: Completed translation [2024-10-24 18:42:32,817 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 06:42:32 WrapperNode [2024-10-24 18:42:32,817 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-24 18:42:32,818 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-24 18:42:32,818 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-24 18:42:32,818 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-24 18:42:32,827 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 06:42:32" (1/1) ... [2024-10-24 18:42:32,899 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 06:42:32" (1/1) ... [2024-10-24 18:42:32,989 INFO L138 Inliner]: procedures = 180, calls = 558, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 2439 [2024-10-24 18:42:32,990 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-24 18:42:32,992 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-24 18:42:32,993 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-24 18:42:32,993 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-24 18:42:33,004 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 06:42:32" (1/1) ... [2024-10-24 18:42:33,005 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 06:42:32" (1/1) ... [2024-10-24 18:42:33,028 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 06:42:32" (1/1) ... [2024-10-24 18:42:33,234 INFO L175 MemorySlicer]: Split 528 memory accesses to 3 slices as follows [2, 106, 420]. 80 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0, 0]. The 94 writes are split as follows [0, 4, 90]. [2024-10-24 18:42:33,235 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 06:42:32" (1/1) ... [2024-10-24 18:42:33,235 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 06:42:32" (1/1) ... [2024-10-24 18:42:33,325 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 06:42:32" (1/1) ... [2024-10-24 18:42:33,349 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 06:42:32" (1/1) ... [2024-10-24 18:42:33,366 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 06:42:32" (1/1) ... [2024-10-24 18:42:33,380 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 06:42:32" (1/1) ... [2024-10-24 18:42:33,400 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-24 18:42:33,401 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-24 18:42:33,401 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-24 18:42:33,401 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-24 18:42:33,402 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 06:42:32" (1/1) ... [2024-10-24 18:42:33,407 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-24 18:42:33,419 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 18:42:33,437 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-24 18:42:33,442 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-24 18:42:33,493 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#0 [2024-10-24 18:42:33,494 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#1 [2024-10-24 18:42:33,494 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#2 [2024-10-24 18:42:33,494 INFO L130 BoogieDeclarations]: Found specification of procedure test_int_int [2024-10-24 18:42:33,494 INFO L138 BoogieDeclarations]: Found implementation of procedure test_int_int [2024-10-24 18:42:33,495 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#0 [2024-10-24 18:42:33,495 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#1 [2024-10-24 18:42:33,496 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#2 [2024-10-24 18:42:33,496 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2024-10-24 18:42:33,496 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2024-10-24 18:42:33,496 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#0 [2024-10-24 18:42:33,497 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#1 [2024-10-24 18:42:33,497 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#2 [2024-10-24 18:42:33,497 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#0 [2024-10-24 18:42:33,497 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#1 [2024-10-24 18:42:33,497 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#2 [2024-10-24 18:42:33,498 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-10-24 18:42:33,498 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-24 18:42:33,498 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2024-10-24 18:42:33,498 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2024-10-24 18:42:33,498 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2024-10-24 18:42:33,499 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-10-24 18:42:33,499 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2024-10-24 18:42:33,499 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2024-10-24 18:42:33,499 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2024-10-24 18:42:33,499 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-10-24 18:42:33,499 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#0 [2024-10-24 18:42:33,499 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#1 [2024-10-24 18:42:33,499 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#2 [2024-10-24 18:42:33,500 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-10-24 18:42:33,500 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2024-10-24 18:42:33,500 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#2 [2024-10-24 18:42:33,500 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-24 18:42:33,500 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-24 18:42:33,821 INFO L238 CfgBuilder]: Building ICFG [2024-10-24 18:42:33,824 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-24 18:42:33,908 WARN L779 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2024-10-24 18:42:33,941 WARN L779 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2024-10-24 18:42:33,974 WARN L779 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2024-10-24 18:42:42,811 INFO L? ?]: Removed 2232 outVars from TransFormulas that were not future-live. [2024-10-24 18:42:42,812 INFO L287 CfgBuilder]: Performing block encoding [2024-10-24 18:42:43,162 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-24 18:42:43,162 INFO L314 CfgBuilder]: Removed 160 assume(true) statements. [2024-10-24 18:42:43,163 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 06:42:43 BoogieIcfgContainer [2024-10-24 18:42:43,163 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-24 18:42:43,166 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-24 18:42:43,167 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-24 18:42:43,170 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-24 18:42:43,171 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.10 06:42:31" (1/3) ... [2024-10-24 18:42:43,171 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1a233c3b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 06:42:43, skipping insertion in model container [2024-10-24 18:42:43,172 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 06:42:32" (2/3) ... [2024-10-24 18:42:43,172 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1a233c3b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 06:42:43, skipping insertion in model container [2024-10-24 18:42:43,172 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 06:42:43" (3/3) ... [2024-10-24 18:42:43,174 INFO L112 eAbstractionObserver]: Analyzing ICFG uthash_SAX_test10-2.i [2024-10-24 18:42:43,195 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-24 18:42:43,196 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1091 error locations. [2024-10-24 18:42:43,303 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-24 18:42:43,312 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;@7a205a43, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-24 18:42:43,313 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1091 error locations. [2024-10-24 18:42:43,325 INFO L276 IsEmpty]: Start isEmpty. Operand has 2060 states, 957 states have (on average 2.456635318704284) internal successors, (2351), 2046 states have internal predecessors, (2351), 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-24 18:42:43,331 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 3 [2024-10-24 18:42:43,331 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 18:42:43,332 INFO L215 NwaCegarLoop]: trace histogram [1, 1] [2024-10-24 18:42:43,333 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 1088 more)] === [2024-10-24 18:42:43,339 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 18:42:43,340 INFO L85 PathProgramCache]: Analyzing trace with hash 119657, now seen corresponding path program 1 times [2024-10-24 18:42:43,350 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 18:42:43,350 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [227944929] [2024-10-24 18:42:43,350 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 18:42:43,351 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-24 18:42:43,351 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 18:42:43,352 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-24 18:42:43,354 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2024-10-24 18:42:43,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 18:42:43,551 INFO L255 TraceCheckSpWp]: Trace formula consists of 26 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-24 18:42:43,560 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 18:42:43,607 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-24 18:42:43,626 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-24 18:42:43,626 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-24 18:42:43,627 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-24 18:42:43,627 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [227944929] [2024-10-24 18:42:43,628 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [227944929] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 18:42:43,628 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 18:42:43,628 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-10-24 18:42:43,630 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [279371421] [2024-10-24 18:42:43,631 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 18:42:43,635 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-24 18:42:43,635 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-24 18:42:43,727 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-24 18:42:43,733 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-24 18:42:43,747 INFO L87 Difference]: Start difference. First operand has 2060 states, 957 states have (on average 2.456635318704284) internal successors, (2351), 2046 states have internal predecessors, (2351), 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-24 18:42:48,137 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 18:42:48,138 INFO L93 Difference]: Finished difference Result 2659 states and 2843 transitions. [2024-10-24 18:42:48,141 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-24 18:42:48,143 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-24 18:42:48,143 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 18:42:48,181 INFO L225 Difference]: With dead ends: 2659 [2024-10-24 18:42:48,182 INFO L226 Difference]: Without dead ends: 2658 [2024-10-24 18:42:48,183 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-24 18:42:48,190 INFO L432 NwaCegarLoop]: 1167 mSDtfsCounter, 1946 mSDsluCounter, 394 mSDsCounter, 0 mSdLazyCounter, 1492 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1956 SdHoareTripleChecker+Valid, 1561 SdHoareTripleChecker+Invalid, 1517 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 1492 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.1s IncrementalHoareTripleChecker+Time [2024-10-24 18:42:48,192 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1956 Valid, 1561 Invalid, 1517 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 1492 Invalid, 0 Unknown, 0 Unchecked, 4.1s Time] [2024-10-24 18:42:48,220 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2658 states. [2024-10-24 18:42:48,332 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2658 to 2169. [2024-10-24 18:42:48,341 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2169 states, 1094 states have (on average 2.257769652650823) internal successors, (2470), 2153 states have internal predecessors, (2470), 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-24 18:42:48,353 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2169 states to 2169 states and 2502 transitions. [2024-10-24 18:42:48,355 INFO L78 Accepts]: Start accepts. Automaton has 2169 states and 2502 transitions. Word has length 2 [2024-10-24 18:42:48,355 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 18:42:48,356 INFO L471 AbstractCegarLoop]: Abstraction has 2169 states and 2502 transitions. [2024-10-24 18:42:48,356 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-24 18:42:48,358 INFO L276 IsEmpty]: Start isEmpty. Operand 2169 states and 2502 transitions. [2024-10-24 18:42:48,359 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 3 [2024-10-24 18:42:48,359 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 18:42:48,359 INFO L215 NwaCegarLoop]: trace histogram [1, 1] [2024-10-24 18:42:48,366 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0 [2024-10-24 18:42:48,560 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-24 18:42:48,561 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 1088 more)] === [2024-10-24 18:42:48,562 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 18:42:48,562 INFO L85 PathProgramCache]: Analyzing trace with hash 119658, now seen corresponding path program 1 times [2024-10-24 18:42:48,562 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 18:42:48,562 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [185713010] [2024-10-24 18:42:48,563 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 18:42:48,563 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-24 18:42:48,563 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 18:42:48,567 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-24 18:42:48,568 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2024-10-24 18:42:48,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 18:42:48,740 INFO L255 TraceCheckSpWp]: Trace formula consists of 26 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-10-24 18:42:48,744 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 18:42:48,756 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-24 18:42:48,774 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-24 18:42:48,774 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-24 18:42:48,774 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-24 18:42:48,775 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [185713010] [2024-10-24 18:42:48,776 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [185713010] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 18:42:48,776 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 18:42:48,776 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-10-24 18:42:48,776 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [363957243] [2024-10-24 18:42:48,777 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 18:42:48,779 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-24 18:42:48,779 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-24 18:42:48,779 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-24 18:42:48,780 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-24 18:42:48,780 INFO L87 Difference]: Start difference. First operand 2169 states and 2502 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-24 18:42:54,142 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 18:42:54,143 INFO L93 Difference]: Finished difference Result 2894 states and 3307 transitions. [2024-10-24 18:42:54,144 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-24 18:42:54,144 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-24 18:42:54,144 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 18:42:54,156 INFO L225 Difference]: With dead ends: 2894 [2024-10-24 18:42:54,156 INFO L226 Difference]: Without dead ends: 2894 [2024-10-24 18:42:54,156 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-24 18:42:54,158 INFO L432 NwaCegarLoop]: 1683 mSDtfsCounter, 799 mSDsluCounter, 1094 mSDsCounter, 0 mSdLazyCounter, 1565 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 802 SdHoareTripleChecker+Valid, 2777 SdHoareTripleChecker+Invalid, 1576 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 1565 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.2s IncrementalHoareTripleChecker+Time [2024-10-24 18:42:54,158 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [802 Valid, 2777 Invalid, 1576 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 1565 Invalid, 0 Unknown, 0 Unchecked, 5.2s Time] [2024-10-24 18:42:54,167 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2894 states. [2024-10-24 18:42:54,221 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2894 to 2566. [2024-10-24 18:42:54,226 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2566 states, 1489 states have (on average 2.19543317662861) internal successors, (3269), 2547 states have internal predecessors, (3269), 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-24 18:42:54,236 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2566 states to 2566 states and 3307 transitions. [2024-10-24 18:42:54,237 INFO L78 Accepts]: Start accepts. Automaton has 2566 states and 3307 transitions. Word has length 2 [2024-10-24 18:42:54,237 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 18:42:54,237 INFO L471 AbstractCegarLoop]: Abstraction has 2566 states and 3307 transitions. [2024-10-24 18:42:54,238 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-24 18:42:54,238 INFO L276 IsEmpty]: Start isEmpty. Operand 2566 states and 3307 transitions. [2024-10-24 18:42:54,238 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2024-10-24 18:42:54,239 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 18:42:54,239 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2024-10-24 18:42:54,243 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2024-10-24 18:42:54,442 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-24 18:42:54,442 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 1088 more)] === [2024-10-24 18:42:54,443 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 18:42:54,443 INFO L85 PathProgramCache]: Analyzing trace with hash -1162343629, now seen corresponding path program 1 times [2024-10-24 18:42:54,443 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 18:42:54,443 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [495741331] [2024-10-24 18:42:54,444 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 18:42:54,444 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-24 18:42:54,444 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 18:42:54,451 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-24 18:42:54,458 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2024-10-24 18:42:54,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 18:42:54,685 INFO L255 TraceCheckSpWp]: Trace formula consists of 63 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-10-24 18:42:54,688 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 18:42:54,703 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-24 18:42:54,710 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-24 18:42:54,796 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-24 18:42:54,799 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-24 18:42:54,819 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2024-10-24 18:42:54,820 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-24 18:42:54,850 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-24 18:42:54,852 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-24 18:42:54,852 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-24 18:42:54,852 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [495741331] [2024-10-24 18:42:54,852 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [495741331] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 18:42:54,852 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 18:42:54,855 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-24 18:42:54,855 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [391007082] [2024-10-24 18:42:54,856 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 18:42:54,856 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-24 18:42:54,856 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-24 18:42:54,857 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-24 18:42:54,857 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-24 18:42:54,857 INFO L87 Difference]: Start difference. First operand 2566 states and 3307 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-24 18:43:02,417 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 18:43:02,417 INFO L93 Difference]: Finished difference Result 4608 states and 5499 transitions. [2024-10-24 18:43:02,418 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-24 18:43:02,418 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-24 18:43:02,418 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 18:43:02,434 INFO L225 Difference]: With dead ends: 4608 [2024-10-24 18:43:02,435 INFO L226 Difference]: Without dead ends: 4608 [2024-10-24 18:43:02,435 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-24 18:43:02,436 INFO L432 NwaCegarLoop]: 760 mSDtfsCounter, 3927 mSDsluCounter, 1173 mSDsCounter, 0 mSdLazyCounter, 2804 mSolverCounterSat, 40 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3936 SdHoareTripleChecker+Valid, 1933 SdHoareTripleChecker+Invalid, 2844 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 40 IncrementalHoareTripleChecker+Valid, 2804 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 7.3s IncrementalHoareTripleChecker+Time [2024-10-24 18:43:02,436 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [3936 Valid, 1933 Invalid, 2844 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [40 Valid, 2804 Invalid, 0 Unknown, 0 Unchecked, 7.3s Time] [2024-10-24 18:43:02,445 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4608 states. [2024-10-24 18:43:02,502 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4608 to 3140. [2024-10-24 18:43:02,508 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3140 states, 2063 states have (on average 2.243819680077557) internal successors, (4629), 3115 states have internal predecessors, (4629), 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-24 18:43:02,520 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3140 states to 3140 states and 4679 transitions. [2024-10-24 18:43:02,521 INFO L78 Accepts]: Start accepts. Automaton has 3140 states and 4679 transitions. Word has length 6 [2024-10-24 18:43:02,521 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 18:43:02,523 INFO L471 AbstractCegarLoop]: Abstraction has 3140 states and 4679 transitions. [2024-10-24 18:43:02,523 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-24 18:43:02,524 INFO L276 IsEmpty]: Start isEmpty. Operand 3140 states and 4679 transitions. [2024-10-24 18:43:02,524 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2024-10-24 18:43:02,524 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 18:43:02,524 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2024-10-24 18:43:02,530 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Forceful destruction successful, exit code 0 [2024-10-24 18:43:02,728 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-24 18:43:02,729 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 1088 more)] === [2024-10-24 18:43:02,729 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 18:43:02,729 INFO L85 PathProgramCache]: Analyzing trace with hash -1672914111, now seen corresponding path program 1 times [2024-10-24 18:43:02,730 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 18:43:02,730 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [999617426] [2024-10-24 18:43:02,730 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 18:43:02,730 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-24 18:43:02,731 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 18:43:02,734 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-24 18:43:02,736 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2024-10-24 18:43:02,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 18:43:02,929 INFO L255 TraceCheckSpWp]: Trace formula consists of 68 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-24 18:43:02,932 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 18:43:02,940 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-24 18:43:02,950 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 18:43:02,950 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-24 18:43:02,950 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-24 18:43:02,951 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [999617426] [2024-10-24 18:43:02,951 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [999617426] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 18:43:02,951 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 18:43:02,951 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-24 18:43:02,951 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [159718332] [2024-10-24 18:43:02,951 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 18:43:02,951 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-24 18:43:02,951 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-24 18:43:02,952 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-24 18:43:02,952 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-24 18:43:02,952 INFO L87 Difference]: Start difference. First operand 3140 states and 4679 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-24 18:43:06,021 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 18:43:06,021 INFO L93 Difference]: Finished difference Result 3776 states and 5273 transitions. [2024-10-24 18:43:06,021 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-24 18:43:06,022 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-24 18:43:06,022 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 18:43:06,034 INFO L225 Difference]: With dead ends: 3776 [2024-10-24 18:43:06,034 INFO L226 Difference]: Without dead ends: 3776 [2024-10-24 18:43:06,035 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-24 18:43:06,036 INFO L432 NwaCegarLoop]: 1839 mSDtfsCounter, 1726 mSDsluCounter, 578 mSDsCounter, 0 mSdLazyCounter, 1613 mSolverCounterSat, 99 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1736 SdHoareTripleChecker+Valid, 2417 SdHoareTripleChecker+Invalid, 1712 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 99 IncrementalHoareTripleChecker+Valid, 1613 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.0s IncrementalHoareTripleChecker+Time [2024-10-24 18:43:06,036 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1736 Valid, 2417 Invalid, 1712 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [99 Valid, 1613 Invalid, 0 Unknown, 0 Unchecked, 3.0s Time] [2024-10-24 18:43:06,042 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3776 states. [2024-10-24 18:43:06,092 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3776 to 3048. [2024-10-24 18:43:06,097 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3048 states, 2063 states have (on average 2.1396025206010663) internal successors, (4414), 3023 states have internal predecessors, (4414), 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-24 18:43:06,105 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3048 states to 3048 states and 4464 transitions. [2024-10-24 18:43:06,106 INFO L78 Accepts]: Start accepts. Automaton has 3048 states and 4464 transitions. Word has length 7 [2024-10-24 18:43:06,106 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 18:43:06,106 INFO L471 AbstractCegarLoop]: Abstraction has 3048 states and 4464 transitions. [2024-10-24 18:43:06,106 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-24 18:43:06,107 INFO L276 IsEmpty]: Start isEmpty. Operand 3048 states and 4464 transitions. [2024-10-24 18:43:06,107 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2024-10-24 18:43:06,107 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 18:43:06,107 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2024-10-24 18:43:06,113 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Ended with exit code 0 [2024-10-24 18:43:06,308 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-24 18:43:06,308 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 1088 more)] === [2024-10-24 18:43:06,308 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 18:43:06,308 INFO L85 PathProgramCache]: Analyzing trace with hash -1672914110, now seen corresponding path program 1 times [2024-10-24 18:43:06,309 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 18:43:06,309 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [76371234] [2024-10-24 18:43:06,309 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 18:43:06,309 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-24 18:43:06,309 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 18:43:06,310 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-24 18:43:06,311 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2024-10-24 18:43:06,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 18:43:06,500 INFO L255 TraceCheckSpWp]: Trace formula consists of 68 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-10-24 18:43:06,502 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 18:43:06,508 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-24 18:43:06,533 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-24 18:43:06,533 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-24 18:43:06,533 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-24 18:43:06,533 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [76371234] [2024-10-24 18:43:06,534 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [76371234] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 18:43:06,534 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 18:43:06,534 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-24 18:43:06,534 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [886954674] [2024-10-24 18:43:06,534 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 18:43:06,534 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-24 18:43:06,534 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-24 18:43:06,535 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-24 18:43:06,535 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-24 18:43:06,535 INFO L87 Difference]: Start difference. First operand 3048 states and 4464 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-24 18:43:10,778 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 18:43:10,778 INFO L93 Difference]: Finished difference Result 4617 states and 6688 transitions. [2024-10-24 18:43:10,778 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-24 18:43:10,779 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-24 18:43:10,779 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 18:43:10,793 INFO L225 Difference]: With dead ends: 4617 [2024-10-24 18:43:10,793 INFO L226 Difference]: Without dead ends: 4617 [2024-10-24 18:43:10,794 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-24 18:43:10,794 INFO L432 NwaCegarLoop]: 2133 mSDtfsCounter, 1285 mSDsluCounter, 915 mSDsCounter, 0 mSdLazyCounter, 1741 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1289 SdHoareTripleChecker+Valid, 3048 SdHoareTripleChecker+Invalid, 1766 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 1741 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.1s IncrementalHoareTripleChecker+Time [2024-10-24 18:43:10,794 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1289 Valid, 3048 Invalid, 1766 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 1741 Invalid, 0 Unknown, 0 Unchecked, 4.1s Time] [2024-10-24 18:43:10,799 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4617 states. [2024-10-24 18:43:10,848 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4617 to 3316. [2024-10-24 18:43:10,853 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3316 states, 2341 states have (on average 2.126441691584793) internal successors, (4978), 3291 states have internal predecessors, (4978), 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-24 18:43:10,865 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3316 states to 3316 states and 5028 transitions. [2024-10-24 18:43:10,866 INFO L78 Accepts]: Start accepts. Automaton has 3316 states and 5028 transitions. Word has length 7 [2024-10-24 18:43:10,866 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 18:43:10,866 INFO L471 AbstractCegarLoop]: Abstraction has 3316 states and 5028 transitions. [2024-10-24 18:43:10,867 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-24 18:43:10,867 INFO L276 IsEmpty]: Start isEmpty. Operand 3316 states and 5028 transitions. [2024-10-24 18:43:10,867 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2024-10-24 18:43:10,867 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 18:43:10,867 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 18:43:10,872 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Ended with exit code 0 [2024-10-24 18:43:11,071 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-24 18:43:11,072 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr638REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 1088 more)] === [2024-10-24 18:43:11,072 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 18:43:11,072 INFO L85 PathProgramCache]: Analyzing trace with hash -286775368, now seen corresponding path program 1 times [2024-10-24 18:43:11,072 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 18:43:11,072 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1197343483] [2024-10-24 18:43:11,073 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 18:43:11,073 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-24 18:43:11,073 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 18:43:11,074 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-24 18:43:11,075 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2024-10-24 18:43:11,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 18:43:11,247 INFO L255 TraceCheckSpWp]: Trace formula consists of 85 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-24 18:43:11,250 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 18:43:11,258 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 18:43:11,258 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-24 18:43:11,258 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-24 18:43:11,260 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1197343483] [2024-10-24 18:43:11,260 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1197343483] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 18:43:11,260 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 18:43:11,260 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-24 18:43:11,260 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2112486369] [2024-10-24 18:43:11,260 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 18:43:11,261 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-24 18:43:11,261 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-24 18:43:11,261 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-24 18:43:11,261 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-24 18:43:11,262 INFO L87 Difference]: Start difference. First operand 3316 states and 5028 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-24 18:43:12,319 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 18:43:12,319 INFO L93 Difference]: Finished difference Result 3262 states and 4948 transitions. [2024-10-24 18:43:12,321 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-24 18:43:12,322 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-24 18:43:12,322 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 18:43:12,334 INFO L225 Difference]: With dead ends: 3262 [2024-10-24 18:43:12,334 INFO L226 Difference]: Without dead ends: 3262 [2024-10-24 18:43:12,335 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-24 18:43:12,335 INFO L432 NwaCegarLoop]: 1805 mSDtfsCounter, 61 mSDsluCounter, 1763 mSDsCounter, 0 mSdLazyCounter, 430 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 61 SdHoareTripleChecker+Valid, 3568 SdHoareTripleChecker+Invalid, 430 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 430 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2024-10-24 18:43:12,336 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [61 Valid, 3568 Invalid, 430 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 430 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2024-10-24 18:43:12,340 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3262 states. [2024-10-24 18:43:12,382 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3262 to 3262. [2024-10-24 18:43:12,387 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3262 states, 2311 states have (on average 2.119428818693206) internal successors, (4898), 3237 states have internal predecessors, (4898), 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-24 18:43:12,396 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3262 states to 3262 states and 4948 transitions. [2024-10-24 18:43:12,397 INFO L78 Accepts]: Start accepts. Automaton has 3262 states and 4948 transitions. Word has length 10 [2024-10-24 18:43:12,397 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 18:43:12,397 INFO L471 AbstractCegarLoop]: Abstraction has 3262 states and 4948 transitions. [2024-10-24 18:43:12,397 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-24 18:43:12,397 INFO L276 IsEmpty]: Start isEmpty. Operand 3262 states and 4948 transitions. [2024-10-24 18:43:12,398 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2024-10-24 18:43:12,398 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 18:43:12,398 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 18:43:12,403 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Forceful destruction successful, exit code 0 [2024-10-24 18:43:12,598 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-24 18:43:12,599 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr662REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 1088 more)] === [2024-10-24 18:43:12,600 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 18:43:12,600 INFO L85 PathProgramCache]: Analyzing trace with hash -713168110, now seen corresponding path program 1 times [2024-10-24 18:43:12,600 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 18:43:12,601 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [997762604] [2024-10-24 18:43:12,601 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 18:43:12,601 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-24 18:43:12,601 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 18:43:12,604 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-24 18:43:12,606 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Waiting until timeout for monitored process [2024-10-24 18:43:12,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 18:43:12,776 INFO L255 TraceCheckSpWp]: Trace formula consists of 88 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-24 18:43:12,778 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 18:43:12,796 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-24 18:43:12,797 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-24 18:43:12,797 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-24 18:43:12,797 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [997762604] [2024-10-24 18:43:12,797 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [997762604] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 18:43:12,797 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 18:43:12,797 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-24 18:43:12,797 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [447344748] [2024-10-24 18:43:12,798 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 18:43:12,798 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-24 18:43:12,798 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-24 18:43:12,798 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-24 18:43:12,798 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-24 18:43:12,799 INFO L87 Difference]: Start difference. First operand 3262 states and 4948 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-24 18:43:14,390 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 18:43:14,390 INFO L93 Difference]: Finished difference Result 3246 states and 4904 transitions. [2024-10-24 18:43:14,392 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-24 18:43:14,392 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-24 18:43:14,392 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 18:43:14,403 INFO L225 Difference]: With dead ends: 3246 [2024-10-24 18:43:14,403 INFO L226 Difference]: Without dead ends: 3246 [2024-10-24 18:43:14,403 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-24 18:43:14,404 INFO L432 NwaCegarLoop]: 1774 mSDtfsCounter, 45 mSDsluCounter, 3530 mSDsCounter, 0 mSdLazyCounter, 651 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 45 SdHoareTripleChecker+Valid, 5304 SdHoareTripleChecker+Invalid, 672 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 651 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2024-10-24 18:43:14,404 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [45 Valid, 5304 Invalid, 672 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 651 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2024-10-24 18:43:14,408 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3246 states. [2024-10-24 18:43:14,451 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3246 to 3246. [2024-10-24 18:43:14,457 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3246 states, 2309 states have (on average 2.1022087483759204) internal successors, (4854), 3221 states have internal predecessors, (4854), 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-24 18:43:14,463 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3246 states to 3246 states and 4904 transitions. [2024-10-24 18:43:14,464 INFO L78 Accepts]: Start accepts. Automaton has 3246 states and 4904 transitions. Word has length 12 [2024-10-24 18:43:14,464 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 18:43:14,464 INFO L471 AbstractCegarLoop]: Abstraction has 3246 states and 4904 transitions. [2024-10-24 18:43:14,464 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-24 18:43:14,465 INFO L276 IsEmpty]: Start isEmpty. Operand 3246 states and 4904 transitions. [2024-10-24 18:43:14,465 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2024-10-24 18:43:14,466 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 18:43:14,466 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 18:43:14,472 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Forceful destruction successful, exit code 0 [2024-10-24 18:43:14,666 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-24 18:43:14,667 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr324REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 1088 more)] === [2024-10-24 18:43:14,667 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 18:43:14,667 INFO L85 PathProgramCache]: Analyzing trace with hash 1884128953, now seen corresponding path program 1 times [2024-10-24 18:43:14,668 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 18:43:14,668 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1421030999] [2024-10-24 18:43:14,668 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 18:43:14,668 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-24 18:43:14,668 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 18:43:14,670 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-24 18:43:14,671 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Waiting until timeout for monitored process [2024-10-24 18:43:14,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 18:43:14,891 INFO L255 TraceCheckSpWp]: Trace formula consists of 137 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-24 18:43:14,894 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 18:43:14,904 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-24 18:43:14,904 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-24 18:43:14,904 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-24 18:43:14,905 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1421030999] [2024-10-24 18:43:14,905 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1421030999] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 18:43:14,905 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 18:43:14,905 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-24 18:43:14,905 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2042928300] [2024-10-24 18:43:14,905 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 18:43:14,905 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-24 18:43:14,905 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-24 18:43:14,906 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-24 18:43:14,906 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-24 18:43:14,906 INFO L87 Difference]: Start difference. First operand 3246 states and 4904 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-24 18:43:16,078 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 18:43:16,078 INFO L93 Difference]: Finished difference Result 3132 states and 4664 transitions. [2024-10-24 18:43:16,080 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-24 18:43:16,080 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-24 18:43:16,080 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 18:43:16,090 INFO L225 Difference]: With dead ends: 3132 [2024-10-24 18:43:16,091 INFO L226 Difference]: Without dead ends: 3132 [2024-10-24 18:43:16,091 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-24 18:43:16,091 INFO L432 NwaCegarLoop]: 1747 mSDtfsCounter, 61 mSDsluCounter, 1705 mSDsCounter, 0 mSdLazyCounter, 410 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 61 SdHoareTripleChecker+Valid, 3452 SdHoareTripleChecker+Invalid, 410 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 410 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2024-10-24 18:43:16,092 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [61 Valid, 3452 Invalid, 410 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 410 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2024-10-24 18:43:16,095 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3132 states. [2024-10-24 18:43:16,129 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3132 to 3132. [2024-10-24 18:43:16,134 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3132 states, 2219 states have (on average 2.079315006759802) internal successors, (4614), 3107 states have internal predecessors, (4614), 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-24 18:43:16,139 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3132 states to 3132 states and 4664 transitions. [2024-10-24 18:43:16,140 INFO L78 Accepts]: Start accepts. Automaton has 3132 states and 4664 transitions. Word has length 17 [2024-10-24 18:43:16,140 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 18:43:16,141 INFO L471 AbstractCegarLoop]: Abstraction has 3132 states and 4664 transitions. [2024-10-24 18:43:16,141 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-24 18:43:16,141 INFO L276 IsEmpty]: Start isEmpty. Operand 3132 states and 4664 transitions. [2024-10-24 18:43:16,142 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2024-10-24 18:43:16,142 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 18:43:16,142 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 18:43:16,149 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Ended with exit code 0 [2024-10-24 18:43:16,345 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-24 18:43:16,346 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr16REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 1088 more)] === [2024-10-24 18:43:16,346 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 18:43:16,346 INFO L85 PathProgramCache]: Analyzing trace with hash -2141973639, now seen corresponding path program 1 times [2024-10-24 18:43:16,347 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 18:43:16,347 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1284377865] [2024-10-24 18:43:16,347 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 18:43:16,347 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-24 18:43:16,347 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 18:43:16,348 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-24 18:43:16,349 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Waiting until timeout for monitored process [2024-10-24 18:43:16,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 18:43:16,535 INFO L255 TraceCheckSpWp]: Trace formula consists of 137 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-24 18:43:16,537 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 18:43:16,549 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-24 18:43:16,549 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-24 18:43:16,549 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-24 18:43:16,549 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1284377865] [2024-10-24 18:43:16,550 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1284377865] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 18:43:16,550 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 18:43:16,550 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-24 18:43:16,550 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [159212460] [2024-10-24 18:43:16,550 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 18:43:16,550 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-24 18:43:16,550 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-24 18:43:16,551 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-24 18:43:16,551 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-24 18:43:16,551 INFO L87 Difference]: Start difference. First operand 3132 states and 4664 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-24 18:43:17,577 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 18:43:17,578 INFO L93 Difference]: Finished difference Result 3078 states and 4584 transitions. [2024-10-24 18:43:17,579 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-24 18:43:17,579 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-24 18:43:17,580 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 18:43:17,586 INFO L225 Difference]: With dead ends: 3078 [2024-10-24 18:43:17,586 INFO L226 Difference]: Without dead ends: 3078 [2024-10-24 18:43:17,586 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-24 18:43:17,587 INFO L432 NwaCegarLoop]: 1710 mSDtfsCounter, 61 mSDsluCounter, 1668 mSDsCounter, 0 mSdLazyCounter, 404 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 61 SdHoareTripleChecker+Valid, 3378 SdHoareTripleChecker+Invalid, 404 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 404 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2024-10-24 18:43:17,587 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [61 Valid, 3378 Invalid, 404 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 404 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2024-10-24 18:43:17,590 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3078 states. [2024-10-24 18:43:17,617 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3078 to 3078. [2024-10-24 18:43:17,626 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3078 states, 2189 states have (on average 2.0712654179990864) internal successors, (4534), 3053 states have internal predecessors, (4534), 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-24 18:43:17,635 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3078 states to 3078 states and 4584 transitions. [2024-10-24 18:43:17,636 INFO L78 Accepts]: Start accepts. Automaton has 3078 states and 4584 transitions. Word has length 17 [2024-10-24 18:43:17,636 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 18:43:17,636 INFO L471 AbstractCegarLoop]: Abstraction has 3078 states and 4584 transitions. [2024-10-24 18:43:17,636 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-24 18:43:17,637 INFO L276 IsEmpty]: Start isEmpty. Operand 3078 states and 4584 transitions. [2024-10-24 18:43:17,637 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2024-10-24 18:43:17,638 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 18:43:17,638 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-24 18:43:17,644 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Ended with exit code 0 [2024-10-24 18:43:17,838 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-24 18:43:17,838 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr348REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 1088 more)] === [2024-10-24 18:43:17,839 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 18:43:17,839 INFO L85 PathProgramCache]: Analyzing trace with hash -1828249453, now seen corresponding path program 1 times [2024-10-24 18:43:17,839 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 18:43:17,839 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [797258263] [2024-10-24 18:43:17,839 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 18:43:17,840 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-24 18:43:17,840 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 18:43:17,843 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-24 18:43:17,844 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Waiting until timeout for monitored process [2024-10-24 18:43:18,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 18:43:18,037 INFO L255 TraceCheckSpWp]: Trace formula consists of 140 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-24 18:43:18,039 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 18:43:18,053 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-24 18:43:18,053 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-24 18:43:18,053 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-24 18:43:18,053 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [797258263] [2024-10-24 18:43:18,053 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [797258263] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 18:43:18,053 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 18:43:18,054 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-24 18:43:18,054 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [145552759] [2024-10-24 18:43:18,054 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 18:43:18,054 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-24 18:43:18,054 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-24 18:43:18,054 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-24 18:43:18,055 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-24 18:43:18,055 INFO L87 Difference]: Start difference. First operand 3078 states and 4584 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-24 18:43:19,268 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 18:43:19,269 INFO L93 Difference]: Finished difference Result 3058 states and 4452 transitions. [2024-10-24 18:43:19,270 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-24 18:43:19,270 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-24 18:43:19,271 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 18:43:19,276 INFO L225 Difference]: With dead ends: 3058 [2024-10-24 18:43:19,276 INFO L226 Difference]: Without dead ends: 3058 [2024-10-24 18:43:19,276 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-24 18:43:19,277 INFO L432 NwaCegarLoop]: 1679 mSDtfsCounter, 45 mSDsluCounter, 3340 mSDsCounter, 0 mSdLazyCounter, 612 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 45 SdHoareTripleChecker+Valid, 5019 SdHoareTripleChecker+Invalid, 633 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 612 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2024-10-24 18:43:19,277 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [45 Valid, 5019 Invalid, 633 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 612 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2024-10-24 18:43:19,280 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3058 states. [2024-10-24 18:43:19,308 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3058 to 3058. [2024-10-24 18:43:19,316 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3058 states, 2183 states have (on average 2.016491067338525) internal successors, (4402), 3033 states have internal predecessors, (4402), 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-24 18:43:19,325 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3058 states to 3058 states and 4452 transitions. [2024-10-24 18:43:19,325 INFO L78 Accepts]: Start accepts. Automaton has 3058 states and 4452 transitions. Word has length 19 [2024-10-24 18:43:19,325 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 18:43:19,325 INFO L471 AbstractCegarLoop]: Abstraction has 3058 states and 4452 transitions. [2024-10-24 18:43:19,326 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-24 18:43:19,326 INFO L276 IsEmpty]: Start isEmpty. Operand 3058 states and 4452 transitions. [2024-10-24 18:43:19,326 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2024-10-24 18:43:19,326 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 18:43:19,327 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-24 18:43:19,334 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Ended with exit code 0 [2024-10-24 18:43:19,527 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-24 18:43:19,528 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr40REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 1088 more)] === [2024-10-24 18:43:19,528 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 18:43:19,529 INFO L85 PathProgramCache]: Analyzing trace with hash -1147334253, now seen corresponding path program 1 times [2024-10-24 18:43:19,529 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 18:43:19,529 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1890252983] [2024-10-24 18:43:19,529 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 18:43:19,529 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-24 18:43:19,530 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 18:43:19,533 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-24 18:43:19,534 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (12)] Waiting until timeout for monitored process [2024-10-24 18:43:19,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 18:43:19,739 INFO L255 TraceCheckSpWp]: Trace formula consists of 140 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-24 18:43:19,741 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 18:43:19,758 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-24 18:43:19,758 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-24 18:43:19,758 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-24 18:43:19,758 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1890252983] [2024-10-24 18:43:19,758 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1890252983] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 18:43:19,759 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 18:43:19,759 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-24 18:43:19,759 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1284661992] [2024-10-24 18:43:19,759 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 18:43:19,759 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-24 18:43:19,759 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-24 18:43:19,759 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-24 18:43:19,760 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-24 18:43:19,760 INFO L87 Difference]: Start difference. First operand 3058 states and 4452 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-24 18:43:20,886 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 18:43:20,887 INFO L93 Difference]: Finished difference Result 3042 states and 4408 transitions. [2024-10-24 18:43:20,888 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-24 18:43:20,888 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-24 18:43:20,888 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 18:43:20,892 INFO L225 Difference]: With dead ends: 3042 [2024-10-24 18:43:20,893 INFO L226 Difference]: Without dead ends: 3042 [2024-10-24 18:43:20,893 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-24 18:43:20,893 INFO L432 NwaCegarLoop]: 1658 mSDtfsCounter, 45 mSDsluCounter, 3298 mSDsCounter, 0 mSdLazyCounter, 591 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 45 SdHoareTripleChecker+Valid, 4956 SdHoareTripleChecker+Invalid, 612 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 591 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2024-10-24 18:43:20,893 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [45 Valid, 4956 Invalid, 612 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 591 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2024-10-24 18:43:20,896 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3042 states. [2024-10-24 18:43:20,917 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3042 to 3042. [2024-10-24 18:43:20,919 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3042 states, 2181 states have (on average 1.9981659789087574) internal successors, (4358), 3017 states have internal predecessors, (4358), 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-24 18:43:20,924 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3042 states to 3042 states and 4408 transitions. [2024-10-24 18:43:20,924 INFO L78 Accepts]: Start accepts. Automaton has 3042 states and 4408 transitions. Word has length 19 [2024-10-24 18:43:20,925 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 18:43:20,925 INFO L471 AbstractCegarLoop]: Abstraction has 3042 states and 4408 transitions. [2024-10-24 18:43:20,925 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-24 18:43:20,925 INFO L276 IsEmpty]: Start isEmpty. Operand 3042 states and 4408 transitions. [2024-10-24 18:43:20,926 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2024-10-24 18:43:20,926 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 18:43:20,926 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-24 18:43:20,933 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (12)] Ended with exit code 0 [2024-10-24 18:43:21,126 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-24 18:43:21,127 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr676REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 1088 more)] === [2024-10-24 18:43:21,127 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 18:43:21,127 INFO L85 PathProgramCache]: Analyzing trace with hash 303308928, now seen corresponding path program 1 times [2024-10-24 18:43:21,128 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 18:43:21,128 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [412813156] [2024-10-24 18:43:21,128 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 18:43:21,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-24 18:43:21,128 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 18:43:21,131 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-24 18:43:21,132 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (13)] Waiting until timeout for monitored process [2024-10-24 18:43:21,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 18:43:21,291 INFO L255 TraceCheckSpWp]: Trace formula consists of 102 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-10-24 18:43:21,294 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 18:43:21,299 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-24 18:43:21,359 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-24 18:43:21,359 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-24 18:43:21,359 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-24 18:43:21,360 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [412813156] [2024-10-24 18:43:21,360 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [412813156] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 18:43:21,360 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 18:43:21,360 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-24 18:43:21,360 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1997270373] [2024-10-24 18:43:21,360 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 18:43:21,360 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-24 18:43:21,360 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-24 18:43:21,361 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-24 18:43:21,361 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-24 18:43:21,361 INFO L87 Difference]: Start difference. First operand 3042 states and 4408 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-24 18:43:24,331 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 18:43:24,331 INFO L93 Difference]: Finished difference Result 3460 states and 4733 transitions. [2024-10-24 18:43:24,332 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-24 18:43:24,332 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-24 18:43:24,332 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 18:43:24,339 INFO L225 Difference]: With dead ends: 3460 [2024-10-24 18:43:24,340 INFO L226 Difference]: Without dead ends: 3460 [2024-10-24 18:43:24,340 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-24 18:43:24,341 INFO L432 NwaCegarLoop]: 1048 mSDtfsCounter, 1666 mSDsluCounter, 1306 mSDsCounter, 0 mSdLazyCounter, 2106 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1676 SdHoareTripleChecker+Valid, 2354 SdHoareTripleChecker+Invalid, 2117 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 2106 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.9s IncrementalHoareTripleChecker+Time [2024-10-24 18:43:24,341 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1676 Valid, 2354 Invalid, 2117 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 2106 Invalid, 0 Unknown, 0 Unchecked, 2.9s Time] [2024-10-24 18:43:24,345 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3460 states. [2024-10-24 18:43:24,374 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3460 to 3038. [2024-10-24 18:43:24,378 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3038 states, 2181 states have (on average 1.9944979367262723) internal successors, (4350), 3013 states have internal predecessors, (4350), 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-24 18:43:24,383 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3038 states to 3038 states and 4400 transitions. [2024-10-24 18:43:24,383 INFO L78 Accepts]: Start accepts. Automaton has 3038 states and 4400 transitions. Word has length 26 [2024-10-24 18:43:24,383 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 18:43:24,383 INFO L471 AbstractCegarLoop]: Abstraction has 3038 states and 4400 transitions. [2024-10-24 18:43:24,384 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-24 18:43:24,384 INFO L276 IsEmpty]: Start isEmpty. Operand 3038 states and 4400 transitions. [2024-10-24 18:43:24,384 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2024-10-24 18:43:24,385 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 18:43:24,385 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-24 18:43:24,389 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (13)] Ended with exit code 0 [2024-10-24 18:43:24,585 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-24 18:43:24,586 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr677REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 1088 more)] === [2024-10-24 18:43:24,586 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 18:43:24,586 INFO L85 PathProgramCache]: Analyzing trace with hash 303308929, now seen corresponding path program 1 times [2024-10-24 18:43:24,586 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 18:43:24,587 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [586304334] [2024-10-24 18:43:24,587 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 18:43:24,587 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-24 18:43:24,587 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 18:43:24,588 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-24 18:43:24,589 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (14)] Waiting until timeout for monitored process [2024-10-24 18:43:24,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 18:43:24,760 INFO L255 TraceCheckSpWp]: Trace formula consists of 102 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-10-24 18:43:24,762 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 18:43:24,768 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-24 18:43:24,907 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-24 18:43:24,908 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-24 18:43:24,908 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-24 18:43:24,908 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [586304334] [2024-10-24 18:43:24,908 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [586304334] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 18:43:24,908 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 18:43:24,908 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-24 18:43:24,908 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1508172273] [2024-10-24 18:43:24,908 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 18:43:24,908 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-24 18:43:24,908 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-24 18:43:24,909 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-24 18:43:24,909 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-24 18:43:24,909 INFO L87 Difference]: Start difference. First operand 3038 states and 4400 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-24 18:43:29,109 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 18:43:29,109 INFO L93 Difference]: Finished difference Result 3706 states and 5140 transitions. [2024-10-24 18:43:29,110 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-24 18:43:29,110 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-24 18:43:29,110 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 18:43:29,117 INFO L225 Difference]: With dead ends: 3706 [2024-10-24 18:43:29,117 INFO L226 Difference]: Without dead ends: 3706 [2024-10-24 18:43:29,117 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-24 18:43:29,118 INFO L432 NwaCegarLoop]: 1435 mSDtfsCounter, 737 mSDsluCounter, 1814 mSDsCounter, 0 mSdLazyCounter, 2335 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 740 SdHoareTripleChecker+Valid, 3249 SdHoareTripleChecker+Invalid, 2338 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 2335 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.1s IncrementalHoareTripleChecker+Time [2024-10-24 18:43:29,118 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [740 Valid, 3249 Invalid, 2338 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 2335 Invalid, 0 Unknown, 0 Unchecked, 4.1s Time] [2024-10-24 18:43:29,122 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3706 states. [2024-10-24 18:43:29,154 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3706 to 3071. [2024-10-24 18:43:29,157 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3071 states, 2214 states have (on average 1.98193315266486) internal successors, (4388), 3046 states have internal predecessors, (4388), 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-24 18:43:29,162 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3071 states to 3071 states and 4438 transitions. [2024-10-24 18:43:29,162 INFO L78 Accepts]: Start accepts. Automaton has 3071 states and 4438 transitions. Word has length 26 [2024-10-24 18:43:29,163 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 18:43:29,163 INFO L471 AbstractCegarLoop]: Abstraction has 3071 states and 4438 transitions. [2024-10-24 18:43:29,163 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-24 18:43:29,163 INFO L276 IsEmpty]: Start isEmpty. Operand 3071 states and 4438 transitions. [2024-10-24 18:43:29,164 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2024-10-24 18:43:29,164 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 18:43:29,164 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-24 18:43:29,169 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (14)] Ended with exit code 0 [2024-10-24 18:43:29,364 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-24 18:43:29,365 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr362REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 1088 more)] === [2024-10-24 18:43:29,366 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 18:43:29,366 INFO L85 PathProgramCache]: Analyzing trace with hash 575845249, now seen corresponding path program 1 times [2024-10-24 18:43:29,366 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 18:43:29,366 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [202953406] [2024-10-24 18:43:29,366 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 18:43:29,367 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-24 18:43:29,367 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 18:43:29,370 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-24 18:43:29,375 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (15)] Waiting until timeout for monitored process [2024-10-24 18:43:29,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 18:43:29,614 INFO L255 TraceCheckSpWp]: Trace formula consists of 154 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-10-24 18:43:29,616 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 18:43:29,621 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-24 18:43:29,713 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-24 18:43:29,713 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-24 18:43:29,713 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-24 18:43:29,714 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [202953406] [2024-10-24 18:43:29,714 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [202953406] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 18:43:29,714 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 18:43:29,714 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-24 18:43:29,714 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1705660042] [2024-10-24 18:43:29,714 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 18:43:29,715 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-24 18:43:29,715 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-24 18:43:29,715 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-24 18:43:29,715 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-24 18:43:29,716 INFO L87 Difference]: Start difference. First operand 3071 states and 4438 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-24 18:43:33,022 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 18:43:33,022 INFO L93 Difference]: Finished difference Result 3724 states and 5139 transitions. [2024-10-24 18:43:33,022 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-24 18:43:33,022 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-24 18:43:33,022 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 18:43:33,029 INFO L225 Difference]: With dead ends: 3724 [2024-10-24 18:43:33,029 INFO L226 Difference]: Without dead ends: 3724 [2024-10-24 18:43:33,029 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-24 18:43:33,030 INFO L432 NwaCegarLoop]: 1679 mSDtfsCounter, 1526 mSDsluCounter, 1852 mSDsCounter, 0 mSdLazyCounter, 2675 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1536 SdHoareTripleChecker+Valid, 3531 SdHoareTripleChecker+Invalid, 2686 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 2675 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.2s IncrementalHoareTripleChecker+Time [2024-10-24 18:43:33,030 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1536 Valid, 3531 Invalid, 2686 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 2675 Invalid, 0 Unknown, 0 Unchecked, 3.2s Time] [2024-10-24 18:43:33,034 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3724 states. [2024-10-24 18:43:33,064 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3724 to 3067. [2024-10-24 18:43:33,067 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3067 states, 2214 states have (on average 1.971093044263776) internal successors, (4364), 3042 states have internal predecessors, (4364), 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-24 18:43:33,071 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3067 states to 3067 states and 4414 transitions. [2024-10-24 18:43:33,071 INFO L78 Accepts]: Start accepts. Automaton has 3067 states and 4414 transitions. Word has length 33 [2024-10-24 18:43:33,072 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 18:43:33,072 INFO L471 AbstractCegarLoop]: Abstraction has 3067 states and 4414 transitions. [2024-10-24 18:43:33,072 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-24 18:43:33,072 INFO L276 IsEmpty]: Start isEmpty. Operand 3067 states and 4414 transitions. [2024-10-24 18:43:33,073 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2024-10-24 18:43:33,073 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 18:43:33,073 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-24 18:43:33,079 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (15)] Forceful destruction successful, exit code 0 [2024-10-24 18:43:33,273 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-24 18:43:33,274 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr363REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 1088 more)] === [2024-10-24 18:43:33,274 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 18:43:33,275 INFO L85 PathProgramCache]: Analyzing trace with hash 575845250, now seen corresponding path program 1 times [2024-10-24 18:43:33,275 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 18:43:33,275 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1196064632] [2024-10-24 18:43:33,275 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 18:43:33,275 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-24 18:43:33,276 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 18:43:33,279 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-24 18:43:33,280 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (16)] Waiting until timeout for monitored process [2024-10-24 18:43:33,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 18:43:33,526 INFO L255 TraceCheckSpWp]: Trace formula consists of 154 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-10-24 18:43:33,528 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 18:43:33,535 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-24 18:43:33,708 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-24 18:43:33,708 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-24 18:43:33,709 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-24 18:43:33,709 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1196064632] [2024-10-24 18:43:33,709 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1196064632] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 18:43:33,709 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 18:43:33,709 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-24 18:43:33,709 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2082304383] [2024-10-24 18:43:33,709 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 18:43:33,709 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-24 18:43:33,709 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-24 18:43:33,710 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-24 18:43:33,710 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-24 18:43:33,710 INFO L87 Difference]: Start difference. First operand 3067 states and 4414 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-24 18:43:38,259 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 18:43:38,259 INFO L93 Difference]: Finished difference Result 4256 states and 5942 transitions. [2024-10-24 18:43:38,259 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-24 18:43:38,260 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-24 18:43:38,260 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 18:43:38,265 INFO L225 Difference]: With dead ends: 4256 [2024-10-24 18:43:38,265 INFO L226 Difference]: Without dead ends: 4256 [2024-10-24 18:43:38,265 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-24 18:43:38,266 INFO L432 NwaCegarLoop]: 1975 mSDtfsCounter, 1081 mSDsluCounter, 2187 mSDsCounter, 0 mSdLazyCounter, 2796 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1085 SdHoareTripleChecker+Valid, 4162 SdHoareTripleChecker+Invalid, 2799 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 2796 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.5s IncrementalHoareTripleChecker+Time [2024-10-24 18:43:38,266 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1085 Valid, 4162 Invalid, 2799 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 2796 Invalid, 0 Unknown, 0 Unchecked, 4.5s Time] [2024-10-24 18:43:38,269 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4256 states. [2024-10-24 18:43:38,295 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4256 to 3067. [2024-10-24 18:43:38,298 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3067 states, 2214 states have (on average 1.967479674796748) internal successors, (4356), 3042 states have internal predecessors, (4356), 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-24 18:43:38,302 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3067 states to 3067 states and 4406 transitions. [2024-10-24 18:43:38,303 INFO L78 Accepts]: Start accepts. Automaton has 3067 states and 4406 transitions. Word has length 33 [2024-10-24 18:43:38,303 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 18:43:38,303 INFO L471 AbstractCegarLoop]: Abstraction has 3067 states and 4406 transitions. [2024-10-24 18:43:38,304 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-24 18:43:38,304 INFO L276 IsEmpty]: Start isEmpty. Operand 3067 states and 4406 transitions. [2024-10-24 18:43:38,304 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2024-10-24 18:43:38,304 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 18:43:38,304 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-24 18:43:38,311 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (16)] Forceful destruction successful, exit code 0 [2024-10-24 18:43:38,505 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-24 18:43:38,505 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr54REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 1088 more)] === [2024-10-24 18:43:38,506 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 18:43:38,506 INFO L85 PathProgramCache]: Analyzing trace with hash 601006657, now seen corresponding path program 1 times [2024-10-24 18:43:38,506 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 18:43:38,506 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [61805824] [2024-10-24 18:43:38,506 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 18:43:38,507 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-24 18:43:38,507 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 18:43:38,508 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-24 18:43:38,509 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (17)] Waiting until timeout for monitored process [2024-10-24 18:43:38,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 18:43:38,750 INFO L255 TraceCheckSpWp]: Trace formula consists of 154 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-10-24 18:43:38,755 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 18:43:38,763 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-24 18:43:38,840 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-24 18:43:38,840 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-24 18:43:38,840 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-24 18:43:38,840 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [61805824] [2024-10-24 18:43:38,840 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [61805824] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 18:43:38,840 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 18:43:38,840 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-24 18:43:38,841 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [608442870] [2024-10-24 18:43:38,841 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 18:43:38,841 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-24 18:43:38,841 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-24 18:43:38,842 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-24 18:43:38,842 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-24 18:43:38,842 INFO L87 Difference]: Start difference. First operand 3067 states and 4406 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-24 18:43:42,113 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 18:43:42,113 INFO L93 Difference]: Finished difference Result 3704 states and 5107 transitions. [2024-10-24 18:43:42,113 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-24 18:43:42,113 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-24 18:43:42,114 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 18:43:42,118 INFO L225 Difference]: With dead ends: 3704 [2024-10-24 18:43:42,119 INFO L226 Difference]: Without dead ends: 3704 [2024-10-24 18:43:42,119 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-24 18:43:42,120 INFO L432 NwaCegarLoop]: 1679 mSDtfsCounter, 1522 mSDsluCounter, 1852 mSDsCounter, 0 mSdLazyCounter, 2667 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1532 SdHoareTripleChecker+Valid, 3531 SdHoareTripleChecker+Invalid, 2678 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 2667 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.2s IncrementalHoareTripleChecker+Time [2024-10-24 18:43:42,120 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1532 Valid, 3531 Invalid, 2678 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 2667 Invalid, 0 Unknown, 0 Unchecked, 3.2s Time] [2024-10-24 18:43:42,123 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3704 states. [2024-10-24 18:43:42,151 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3704 to 3063. [2024-10-24 18:43:42,153 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3063 states, 2214 states have (on average 1.96386630532972) internal successors, (4348), 3038 states have internal predecessors, (4348), 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-24 18:43:42,158 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3063 states to 3063 states and 4398 transitions. [2024-10-24 18:43:42,158 INFO L78 Accepts]: Start accepts. Automaton has 3063 states and 4398 transitions. Word has length 33 [2024-10-24 18:43:42,158 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 18:43:42,159 INFO L471 AbstractCegarLoop]: Abstraction has 3063 states and 4398 transitions. [2024-10-24 18:43:42,159 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-24 18:43:42,159 INFO L276 IsEmpty]: Start isEmpty. Operand 3063 states and 4398 transitions. [2024-10-24 18:43:42,160 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2024-10-24 18:43:42,160 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 18:43:42,160 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-24 18:43:42,166 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (17)] Ended with exit code 0 [2024-10-24 18:43:42,363 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-24 18:43:42,364 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr55REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 1088 more)] === [2024-10-24 18:43:42,364 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 18:43:42,364 INFO L85 PathProgramCache]: Analyzing trace with hash 601006658, now seen corresponding path program 1 times [2024-10-24 18:43:42,364 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 18:43:42,365 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1691110751] [2024-10-24 18:43:42,365 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 18:43:42,365 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-24 18:43:42,365 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 18:43:42,368 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-24 18:43:42,369 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (18)] Waiting until timeout for monitored process [2024-10-24 18:43:42,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 18:43:42,586 INFO L255 TraceCheckSpWp]: Trace formula consists of 154 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-10-24 18:43:42,587 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 18:43:42,597 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-24 18:43:42,753 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-24 18:43:42,753 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-24 18:43:42,753 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-24 18:43:42,753 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1691110751] [2024-10-24 18:43:42,753 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1691110751] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 18:43:42,753 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 18:43:42,753 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-24 18:43:42,753 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [34305554] [2024-10-24 18:43:42,754 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 18:43:42,754 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-24 18:43:42,754 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-24 18:43:42,754 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-24 18:43:42,754 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-24 18:43:42,755 INFO L87 Difference]: Start difference. First operand 3063 states and 4398 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)