./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_FNV_test10-2.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 84cfde4a Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_FNV_test10-2.i -s /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 3f1ddce0da39afb2e81d3f6974a6168ade2d49435b1ce063903c0017c6d40b05 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-84cfde4 [2024-10-11 19:06:23,820 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-11 19:06:23,916 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2024-10-11 19:06:23,924 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-11 19:06:23,925 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-11 19:06:23,957 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-11 19:06:23,958 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-11 19:06:23,958 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-11 19:06:23,959 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-11 19:06:23,959 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-11 19:06:23,959 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-11 19:06:23,960 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-11 19:06:23,960 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-11 19:06:23,961 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-11 19:06:23,961 INFO L153 SettingsManager]: * Use SBE=true [2024-10-11 19:06:23,962 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-11 19:06:23,964 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-11 19:06:23,964 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-11 19:06:23,968 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-11 19:06:23,968 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-11 19:06:23,969 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-10-11 19:06:23,969 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-10-11 19:06:23,969 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-10-11 19:06:23,969 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-11 19:06:23,970 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-10-11 19:06:23,970 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-11 19:06:23,970 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-10-11 19:06:23,970 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-11 19:06:23,971 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-11 19:06:23,971 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-11 19:06:23,972 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-11 19:06:23,972 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-11 19:06:23,973 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-11 19:06:23,973 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 19:06:23,974 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-11 19:06:23,974 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-11 19:06:23,974 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-11 19:06:23,974 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-11 19:06:23,974 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-11 19:06:23,975 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-11 19:06:23,975 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-11 19:06:23,975 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-11 19:06:23,975 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 3f1ddce0da39afb2e81d3f6974a6168ade2d49435b1ce063903c0017c6d40b05 [2024-10-11 19:06:24,213 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-11 19:06:24,238 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-11 19:06:24,242 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-11 19:06:24,243 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-11 19:06:24,243 INFO L274 PluginConnector]: CDTParser initialized [2024-10-11 19:06:24,244 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_FNV_test10-2.i [2024-10-11 19:06:25,626 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-11 19:06:25,956 INFO L384 CDTParser]: Found 1 translation units. [2024-10-11 19:06:25,957 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_FNV_test10-2.i [2024-10-11 19:06:25,978 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/4eca526bf/0207e34d6d844c0587e8fa87a48812c0/FLAG9691f7288 [2024-10-11 19:06:26,200 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/4eca526bf/0207e34d6d844c0587e8fa87a48812c0 [2024-10-11 19:06:26,202 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-11 19:06:26,203 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-11 19:06:26,205 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-11 19:06:26,205 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-11 19:06:26,211 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-11 19:06:26,211 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 07:06:26" (1/1) ... [2024-10-11 19:06:26,212 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7789e29f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:06:26, skipping insertion in model container [2024-10-11 19:06:26,214 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 07:06:26" (1/1) ... [2024-10-11 19:06:26,272 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-11 19:06:26,916 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 19:06:26,928 ERROR L321 MainTranslator]: Unsupported Syntax: Found a cast between two array/pointer types of different sizes while using memory model HoenickeLindenmann_Original (while Not using bitvector translation) [2024-10-11 19:06:26,929 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver@4f9514cb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:06:26, skipping insertion in model container [2024-10-11 19:06:26,929 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-11 19:06:26,930 INFO L186 ToolchainWalker]: Toolchain execution was canceled (user or tool) before executing de.uni_freiburg.informatik.ultimate.boogie.procedureinliner [2024-10-11 19:06:26,932 INFO L158 Benchmark]: Toolchain (without parser) took 727.51ms. Allocated memory is still 163.6MB. Free memory was 113.5MB in the beginning and 81.6MB in the end (delta: 31.9MB). Peak memory consumption was 31.5MB. Max. memory is 16.1GB. [2024-10-11 19:06:26,933 INFO L158 Benchmark]: CDTParser took 0.19ms. Allocated memory is still 163.6MB. Free memory is still 124.4MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-11 19:06:26,933 INFO L158 Benchmark]: CACSL2BoogieTranslator took 724.32ms. Allocated memory is still 163.6MB. Free memory was 113.5MB in the beginning and 81.6MB in the end (delta: 31.9MB). Peak memory consumption was 31.5MB. Max. memory is 16.1GB. [2024-10-11 19:06:26,935 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.19ms. Allocated memory is still 163.6MB. Free memory is still 124.4MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 724.32ms. Allocated memory is still 163.6MB. Free memory was 113.5MB in the beginning and 81.6MB in the end (delta: 31.9MB). Peak memory consumption was 31.5MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - UnsupportedSyntaxResult [Line: 734]: Unsupported Syntax Found a cast between two array/pointer types of different sizes while using memory model HoenickeLindenmann_Original (while Not using bitvector translation) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_FNV_test10-2.i -s /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 3f1ddce0da39afb2e81d3f6974a6168ade2d49435b1ce063903c0017c6d40b05 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-84cfde4 [2024-10-11 19:06:28,868 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-11 19:06:28,941 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf [2024-10-11 19:06:28,947 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-11 19:06:28,947 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-11 19:06:28,977 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-11 19:06:28,978 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-11 19:06:28,978 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-11 19:06:28,978 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-11 19:06:28,979 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-11 19:06:28,979 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-11 19:06:28,979 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-11 19:06:28,980 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-11 19:06:28,980 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-11 19:06:28,981 INFO L153 SettingsManager]: * Use SBE=true [2024-10-11 19:06:28,981 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-11 19:06:28,982 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-11 19:06:28,984 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-11 19:06:28,984 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-11 19:06:28,984 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-11 19:06:28,985 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-10-11 19:06:28,988 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-10-11 19:06:28,988 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-10-11 19:06:28,988 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-11 19:06:28,988 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-10-11 19:06:28,989 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-10-11 19:06:28,989 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-11 19:06:28,989 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-10-11 19:06:28,989 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-10-11 19:06:28,990 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-11 19:06:28,990 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-11 19:06:28,991 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-11 19:06:28,991 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-11 19:06:28,991 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-11 19:06:28,991 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-11 19:06:28,992 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 19:06:28,992 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-11 19:06:28,993 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-11 19:06:28,993 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-10-11 19:06:28,993 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-10-11 19:06:28,993 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-11 19:06:28,994 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-11 19:06:28,994 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-11 19:06:28,994 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-11 19:06:28,994 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2024-10-11 19:06:28,994 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 3f1ddce0da39afb2e81d3f6974a6168ade2d49435b1ce063903c0017c6d40b05 [2024-10-11 19:06:29,276 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-11 19:06:29,299 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-11 19:06:29,303 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-11 19:06:29,304 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-11 19:06:29,305 INFO L274 PluginConnector]: CDTParser initialized [2024-10-11 19:06:29,307 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_FNV_test10-2.i [2024-10-11 19:06:30,815 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-11 19:06:31,154 INFO L384 CDTParser]: Found 1 translation units. [2024-10-11 19:06:31,155 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_FNV_test10-2.i [2024-10-11 19:06:31,171 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/a7cea45a5/08561dfaf0064280b43a17d357eebc92/FLAG09e90b44b [2024-10-11 19:06:31,381 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/a7cea45a5/08561dfaf0064280b43a17d357eebc92 [2024-10-11 19:06:31,383 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-11 19:06:31,384 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-11 19:06:31,385 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-11 19:06:31,386 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-11 19:06:31,390 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-11 19:06:31,391 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 07:06:31" (1/1) ... [2024-10-11 19:06:31,392 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1d690b61 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:06:31, skipping insertion in model container [2024-10-11 19:06:31,392 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 07:06:31" (1/1) ... [2024-10-11 19:06:31,457 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-11 19:06:32,177 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 19:06:32,195 INFO L197 MainTranslator]: Restarting translation with changed settings: SettingsChange [mNewPreferredMemoryModel=HoenickeLindenmann_1ByteResolution] [2024-10-11 19:06:32,213 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-11 19:06:32,359 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 19:06:32,363 INFO L200 MainTranslator]: Completed pre-run [2024-10-11 19:06:32,482 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 19:06:32,523 INFO L204 MainTranslator]: Completed translation [2024-10-11 19:06:32,523 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:06:32 WrapperNode [2024-10-11 19:06:32,524 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-11 19:06:32,525 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-11 19:06:32,525 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-11 19:06:32,525 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-11 19:06:32,531 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:06:32" (1/1) ... [2024-10-11 19:06:32,589 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:06:32" (1/1) ... [2024-10-11 19:06:32,681 INFO L138 Inliner]: procedures = 180, calls = 558, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 2439 [2024-10-11 19:06:32,681 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-11 19:06:32,683 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-11 19:06:32,683 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-11 19:06:32,683 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-11 19:06:32,694 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:06:32" (1/1) ... [2024-10-11 19:06:32,694 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:06:32" (1/1) ... [2024-10-11 19:06:32,712 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:06:32" (1/1) ... [2024-10-11 19:06:32,875 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-11 19:06:32,875 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:06:32" (1/1) ... [2024-10-11 19:06:32,875 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:06:32" (1/1) ... [2024-10-11 19:06:32,935 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:06:32" (1/1) ... [2024-10-11 19:06:32,950 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:06:32" (1/1) ... [2024-10-11 19:06:32,958 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:06:32" (1/1) ... [2024-10-11 19:06:32,968 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:06:32" (1/1) ... [2024-10-11 19:06:32,981 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-11 19:06:32,982 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-11 19:06:32,982 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-11 19:06:32,982 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-11 19:06:32,984 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:06:32" (1/1) ... [2024-10-11 19:06:32,989 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 19:06:32,999 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 19:06:33,015 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-11 19:06:33,018 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-11 19:06:33,062 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#0 [2024-10-11 19:06:33,063 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#1 [2024-10-11 19:06:33,063 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#2 [2024-10-11 19:06:33,063 INFO L130 BoogieDeclarations]: Found specification of procedure test_int_int [2024-10-11 19:06:33,063 INFO L138 BoogieDeclarations]: Found implementation of procedure test_int_int [2024-10-11 19:06:33,064 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#0 [2024-10-11 19:06:33,064 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#1 [2024-10-11 19:06:33,065 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#2 [2024-10-11 19:06:33,065 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2024-10-11 19:06:33,065 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2024-10-11 19:06:33,065 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#0 [2024-10-11 19:06:33,066 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#1 [2024-10-11 19:06:33,066 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#2 [2024-10-11 19:06:33,066 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#0 [2024-10-11 19:06:33,066 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#1 [2024-10-11 19:06:33,067 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#2 [2024-10-11 19:06:33,067 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-10-11 19:06:33,067 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-11 19:06:33,067 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2024-10-11 19:06:33,067 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2024-10-11 19:06:33,067 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2024-10-11 19:06:33,067 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-10-11 19:06:33,067 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2024-10-11 19:06:33,067 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2024-10-11 19:06:33,068 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2024-10-11 19:06:33,068 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-10-11 19:06:33,068 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#0 [2024-10-11 19:06:33,068 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#1 [2024-10-11 19:06:33,068 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#2 [2024-10-11 19:06:33,069 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-10-11 19:06:33,069 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2024-10-11 19:06:33,070 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#2 [2024-10-11 19:06:33,070 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-11 19:06:33,070 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-11 19:06:33,369 INFO L238 CfgBuilder]: Building ICFG [2024-10-11 19:06:33,371 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-11 19:06:33,434 WARN L779 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2024-10-11 19:06:33,470 WARN L779 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2024-10-11 19:06:33,494 WARN L779 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2024-10-11 19:06:39,962 INFO L? ?]: Removed 2232 outVars from TransFormulas that were not future-live. [2024-10-11 19:06:39,962 INFO L287 CfgBuilder]: Performing block encoding [2024-10-11 19:06:40,259 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-11 19:06:40,259 INFO L314 CfgBuilder]: Removed 160 assume(true) statements. [2024-10-11 19:06:40,260 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 07:06:40 BoogieIcfgContainer [2024-10-11 19:06:40,260 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-11 19:06:40,262 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-11 19:06:40,262 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-11 19:06:40,265 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-11 19:06:40,265 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.10 07:06:31" (1/3) ... [2024-10-11 19:06:40,266 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7592913d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 07:06:40, skipping insertion in model container [2024-10-11 19:06:40,266 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:06:32" (2/3) ... [2024-10-11 19:06:40,267 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7592913d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 07:06:40, skipping insertion in model container [2024-10-11 19:06:40,267 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 07:06:40" (3/3) ... [2024-10-11 19:06:40,268 INFO L112 eAbstractionObserver]: Analyzing ICFG uthash_FNV_test10-2.i [2024-10-11 19:06:40,287 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-11 19:06:40,287 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1091 error locations. [2024-10-11 19:06:40,365 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-11 19:06:40,372 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;@398be40, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-11 19:06:40,372 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1091 error locations. [2024-10-11 19:06:40,383 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-11 19:06:40,389 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 3 [2024-10-11 19:06:40,390 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 19:06:40,391 INFO L215 NwaCegarLoop]: trace histogram [1, 1] [2024-10-11 19:06:40,391 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-11 19:06:40,396 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 19:06:40,396 INFO L85 PathProgramCache]: Analyzing trace with hash 119657, now seen corresponding path program 1 times [2024-10-11 19:06:40,407 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 19:06:40,407 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [681183921] [2024-10-11 19:06:40,407 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 19:06:40,408 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 19:06:40,408 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 19:06:40,411 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-11 19:06:40,412 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2024-10-11 19:06:40,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 19:06:40,610 INFO L255 TraceCheckSpWp]: Trace formula consists of 26 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-11 19:06:40,617 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 19:06:40,654 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2024-10-11 19:06:40,669 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 19:06:40,670 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 19:06:40,670 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 19:06:40,670 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [681183921] [2024-10-11 19:06:40,671 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [681183921] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 19:06:40,671 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 19:06:40,671 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-10-11 19:06:40,674 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1262097956] [2024-10-11 19:06:40,675 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 19:06:40,679 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 19:06:40,680 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 19:06:40,755 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 19:06:40,759 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 19:06:40,768 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-11 19:06:44,013 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 19:06:44,013 INFO L93 Difference]: Finished difference Result 2659 states and 2843 transitions. [2024-10-11 19:06:44,017 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 19:06:44,018 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 2 [2024-10-11 19:06:44,019 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 19:06:44,057 INFO L225 Difference]: With dead ends: 2659 [2024-10-11 19:06:44,057 INFO L226 Difference]: Without dead ends: 2658 [2024-10-11 19:06:44,059 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 19:06:44,062 INFO L432 NwaCegarLoop]: 1167 mSDtfsCounter, 1946 mSDsluCounter, 394 mSDsCounter, 0 mSdLazyCounter, 1492 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.6s 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, 3.1s IncrementalHoareTripleChecker+Time [2024-10-11 19:06:44,064 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1956 Valid, 1561 Invalid, 1517 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 1492 Invalid, 0 Unknown, 0 Unchecked, 3.1s Time] [2024-10-11 19:06:44,090 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2658 states. [2024-10-11 19:06:44,196 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2658 to 2169. [2024-10-11 19:06:44,200 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-11 19:06:44,209 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2169 states to 2169 states and 2502 transitions. [2024-10-11 19:06:44,211 INFO L78 Accepts]: Start accepts. Automaton has 2169 states and 2502 transitions. Word has length 2 [2024-10-11 19:06:44,211 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 19:06:44,211 INFO L471 AbstractCegarLoop]: Abstraction has 2169 states and 2502 transitions. [2024-10-11 19:06:44,211 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 19:06:44,213 INFO L276 IsEmpty]: Start isEmpty. Operand 2169 states and 2502 transitions. [2024-10-11 19:06:44,213 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 3 [2024-10-11 19:06:44,213 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 19:06:44,213 INFO L215 NwaCegarLoop]: trace histogram [1, 1] [2024-10-11 19:06:44,219 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2024-10-11 19:06:44,417 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 19:06:44,417 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-11 19:06:44,418 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 19:06:44,418 INFO L85 PathProgramCache]: Analyzing trace with hash 119658, now seen corresponding path program 1 times [2024-10-11 19:06:44,418 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 19:06:44,419 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1278606337] [2024-10-11 19:06:44,419 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 19:06:44,419 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 19:06:44,419 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 19:06:44,420 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-11 19:06:44,422 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2024-10-11 19:06:44,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 19:06:44,604 INFO L255 TraceCheckSpWp]: Trace formula consists of 26 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-10-11 19:06:44,607 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 19:06:44,618 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-10-11 19:06:44,632 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 19:06:44,633 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 19:06:44,633 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 19:06:44,634 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1278606337] [2024-10-11 19:06:44,634 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1278606337] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 19:06:44,634 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 19:06:44,634 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-10-11 19:06:44,634 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1533865340] [2024-10-11 19:06:44,634 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 19:06:44,635 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 19:06:44,635 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 19:06:44,636 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 19:06:44,636 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 19:06:44,636 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-11 19:06:49,046 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 19:06:49,047 INFO L93 Difference]: Finished difference Result 2894 states and 3307 transitions. [2024-10-11 19:06:49,047 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 19:06:49,047 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 2 [2024-10-11 19:06:49,048 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 19:06:49,058 INFO L225 Difference]: With dead ends: 2894 [2024-10-11 19:06:49,059 INFO L226 Difference]: Without dead ends: 2894 [2024-10-11 19:06:49,059 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 19:06:49,060 INFO L432 NwaCegarLoop]: 1683 mSDtfsCounter, 799 mSDsluCounter, 1094 mSDsCounter, 0 mSdLazyCounter, 1565 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.7s 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, 4.3s IncrementalHoareTripleChecker+Time [2024-10-11 19:06:49,061 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [802 Valid, 2777 Invalid, 1576 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 1565 Invalid, 0 Unknown, 0 Unchecked, 4.3s Time] [2024-10-11 19:06:49,065 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2894 states. [2024-10-11 19:06:49,104 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2894 to 2566. [2024-10-11 19:06:49,107 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-11 19:06:49,116 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2566 states to 2566 states and 3307 transitions. [2024-10-11 19:06:49,117 INFO L78 Accepts]: Start accepts. Automaton has 2566 states and 3307 transitions. Word has length 2 [2024-10-11 19:06:49,117 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 19:06:49,117 INFO L471 AbstractCegarLoop]: Abstraction has 2566 states and 3307 transitions. [2024-10-11 19:06:49,117 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 19:06:49,118 INFO L276 IsEmpty]: Start isEmpty. Operand 2566 states and 3307 transitions. [2024-10-11 19:06:49,118 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2024-10-11 19:06:49,118 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 19:06:49,118 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2024-10-11 19:06:49,122 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2024-10-11 19:06:49,320 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 19:06:49,321 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-11 19:06:49,321 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 19:06:49,322 INFO L85 PathProgramCache]: Analyzing trace with hash -1162343629, now seen corresponding path program 1 times [2024-10-11 19:06:49,322 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 19:06:49,322 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1935647967] [2024-10-11 19:06:49,322 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 19:06:49,323 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 19:06:49,323 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 19:06:49,326 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-11 19:06:49,327 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2024-10-11 19:06:49,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 19:06:49,500 INFO L255 TraceCheckSpWp]: Trace formula consists of 63 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-10-11 19:06:49,503 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 19:06:49,517 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-10-11 19:06:49,529 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2024-10-11 19:06:49,599 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-11 19:06:49,601 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 9 [2024-10-11 19:06:49,619 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2024-10-11 19:06:49,620 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 13 [2024-10-11 19:06:49,643 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 19:06:49,644 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 19:06:49,644 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 19:06:49,644 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1935647967] [2024-10-11 19:06:49,645 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1935647967] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 19:06:49,645 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 19:06:49,645 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 19:06:49,645 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [116045370] [2024-10-11 19:06:49,645 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 19:06:49,646 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 19:06:49,646 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 19:06:49,646 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 19:06:49,648 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-11 19:06:49,649 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-11 19:06:55,674 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 19:06:55,674 INFO L93 Difference]: Finished difference Result 4608 states and 5499 transitions. [2024-10-11 19:06:55,675 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 19:06:55,675 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2024-10-11 19:06:55,675 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 19:06:55,691 INFO L225 Difference]: With dead ends: 4608 [2024-10-11 19:06:55,691 INFO L226 Difference]: Without dead ends: 4608 [2024-10-11 19:06:55,692 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-11 19:06:55,695 INFO L432 NwaCegarLoop]: 760 mSDtfsCounter, 3927 mSDsluCounter, 1173 mSDsCounter, 0 mSdLazyCounter, 2804 mSolverCounterSat, 40 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.1s 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, 5.9s IncrementalHoareTripleChecker+Time [2024-10-11 19:06:55,695 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [3936 Valid, 1933 Invalid, 2844 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [40 Valid, 2804 Invalid, 0 Unknown, 0 Unchecked, 5.9s Time] [2024-10-11 19:06:55,706 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4608 states. [2024-10-11 19:06:55,756 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4608 to 3140. [2024-10-11 19:06:55,761 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-11 19:06:55,771 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3140 states to 3140 states and 4679 transitions. [2024-10-11 19:06:55,771 INFO L78 Accepts]: Start accepts. Automaton has 3140 states and 4679 transitions. Word has length 6 [2024-10-11 19:06:55,771 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 19:06:55,772 INFO L471 AbstractCegarLoop]: Abstraction has 3140 states and 4679 transitions. [2024-10-11 19:06:55,772 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 19:06:55,772 INFO L276 IsEmpty]: Start isEmpty. Operand 3140 states and 4679 transitions. [2024-10-11 19:06:55,772 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2024-10-11 19:06:55,773 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 19:06:55,773 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2024-10-11 19:06:55,779 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Ended with exit code 0 [2024-10-11 19:06:55,973 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 19:06:55,974 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-11 19:06:55,975 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 19:06:55,975 INFO L85 PathProgramCache]: Analyzing trace with hash -1672914111, now seen corresponding path program 1 times [2024-10-11 19:06:55,976 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 19:06:55,977 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [767781339] [2024-10-11 19:06:55,978 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 19:06:55,978 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 19:06:55,978 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 19:06:55,981 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-11 19:06:55,982 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2024-10-11 19:06:56,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 19:06:56,182 INFO L255 TraceCheckSpWp]: Trace formula consists of 68 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-11 19:06:56,185 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 19:06:56,193 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2024-10-11 19:06:56,206 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 19:06:56,206 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 19:06:56,207 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 19:06:56,207 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [767781339] [2024-10-11 19:06:56,207 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [767781339] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 19:06:56,207 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 19:06:56,207 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 19:06:56,207 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2045550275] [2024-10-11 19:06:56,207 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 19:06:56,207 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 19:06:56,208 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 19:06:56,208 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 19:06:56,208 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 19:06:56,208 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-11 19:06:59,140 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 19:06:59,140 INFO L93 Difference]: Finished difference Result 3776 states and 5273 transitions. [2024-10-11 19:06:59,141 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 19:06:59,141 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2024-10-11 19:06:59,141 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 19:06:59,152 INFO L225 Difference]: With dead ends: 3776 [2024-10-11 19:06:59,152 INFO L226 Difference]: Without dead ends: 3776 [2024-10-11 19:06:59,153 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 19:06:59,153 INFO L432 NwaCegarLoop]: 1839 mSDtfsCounter, 1726 mSDsluCounter, 578 mSDsCounter, 0 mSdLazyCounter, 1613 mSolverCounterSat, 99 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s 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, 2.9s IncrementalHoareTripleChecker+Time [2024-10-11 19:06:59,154 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1736 Valid, 2417 Invalid, 1712 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [99 Valid, 1613 Invalid, 0 Unknown, 0 Unchecked, 2.9s Time] [2024-10-11 19:06:59,159 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3776 states. [2024-10-11 19:06:59,227 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3776 to 3048. [2024-10-11 19:06:59,232 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-11 19:06:59,241 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3048 states to 3048 states and 4464 transitions. [2024-10-11 19:06:59,242 INFO L78 Accepts]: Start accepts. Automaton has 3048 states and 4464 transitions. Word has length 7 [2024-10-11 19:06:59,242 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 19:06:59,242 INFO L471 AbstractCegarLoop]: Abstraction has 3048 states and 4464 transitions. [2024-10-11 19:06:59,242 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 19:06:59,243 INFO L276 IsEmpty]: Start isEmpty. Operand 3048 states and 4464 transitions. [2024-10-11 19:06:59,243 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2024-10-11 19:06:59,243 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 19:06:59,243 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2024-10-11 19:06:59,249 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Forceful destruction successful, exit code 0 [2024-10-11 19:06:59,444 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 19:06:59,445 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-11 19:06:59,445 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 19:06:59,446 INFO L85 PathProgramCache]: Analyzing trace with hash -1672914110, now seen corresponding path program 1 times [2024-10-11 19:06:59,446 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 19:06:59,446 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1677477042] [2024-10-11 19:06:59,446 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 19:06:59,446 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 19:06:59,447 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 19:06:59,452 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-11 19:06:59,454 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2024-10-11 19:06:59,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 19:06:59,642 INFO L255 TraceCheckSpWp]: Trace formula consists of 68 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-10-11 19:06:59,645 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 19:06:59,653 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-10-11 19:06:59,679 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 19:06:59,680 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 19:06:59,680 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 19:06:59,680 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1677477042] [2024-10-11 19:06:59,680 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1677477042] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 19:06:59,680 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 19:06:59,680 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 19:06:59,680 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1502616236] [2024-10-11 19:06:59,681 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 19:06:59,681 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 19:06:59,681 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 19:06:59,681 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 19:06:59,682 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 19:06:59,682 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-11 19:07:03,285 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 19:07:03,285 INFO L93 Difference]: Finished difference Result 4617 states and 6688 transitions. [2024-10-11 19:07:03,286 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 19:07:03,286 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2024-10-11 19:07:03,286 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 19:07:03,298 INFO L225 Difference]: With dead ends: 4617 [2024-10-11 19:07:03,298 INFO L226 Difference]: Without dead ends: 4617 [2024-10-11 19:07:03,298 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 19:07:03,299 INFO L432 NwaCegarLoop]: 2133 mSDtfsCounter, 1285 mSDsluCounter, 915 mSDsCounter, 0 mSdLazyCounter, 1741 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.1s 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, 3.5s IncrementalHoareTripleChecker+Time [2024-10-11 19:07:03,299 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1289 Valid, 3048 Invalid, 1766 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 1741 Invalid, 0 Unknown, 0 Unchecked, 3.5s Time] [2024-10-11 19:07:03,304 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4617 states. [2024-10-11 19:07:03,347 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4617 to 3316. [2024-10-11 19:07:03,351 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-11 19:07:03,366 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3316 states to 3316 states and 5028 transitions. [2024-10-11 19:07:03,366 INFO L78 Accepts]: Start accepts. Automaton has 3316 states and 5028 transitions. Word has length 7 [2024-10-11 19:07:03,366 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 19:07:03,366 INFO L471 AbstractCegarLoop]: Abstraction has 3316 states and 5028 transitions. [2024-10-11 19:07:03,367 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 19:07:03,367 INFO L276 IsEmpty]: Start isEmpty. Operand 3316 states and 5028 transitions. [2024-10-11 19:07:03,367 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2024-10-11 19:07:03,367 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 19:07:03,367 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 19:07:03,373 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Ended with exit code 0 [2024-10-11 19:07:03,570 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 19:07:03,571 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-11 19:07:03,571 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 19:07:03,571 INFO L85 PathProgramCache]: Analyzing trace with hash -286775368, now seen corresponding path program 1 times [2024-10-11 19:07:03,571 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 19:07:03,572 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1493341681] [2024-10-11 19:07:03,572 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 19:07:03,572 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 19:07:03,572 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 19:07:03,573 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-11 19:07:03,575 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2024-10-11 19:07:03,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 19:07:03,739 INFO L255 TraceCheckSpWp]: Trace formula consists of 85 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-11 19:07:03,742 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 19:07:03,749 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 19:07:03,749 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 19:07:03,750 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 19:07:03,750 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1493341681] [2024-10-11 19:07:03,750 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1493341681] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 19:07:03,750 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 19:07:03,750 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 19:07:03,750 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1936211698] [2024-10-11 19:07:03,750 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 19:07:03,750 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 19:07:03,750 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 19:07:03,751 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 19:07:03,751 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 19:07:03,751 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-11 19:07:04,815 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 19:07:04,815 INFO L93 Difference]: Finished difference Result 3262 states and 4948 transitions. [2024-10-11 19:07:04,819 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 19:07:04,819 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2024-10-11 19:07:04,819 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 19:07:04,830 INFO L225 Difference]: With dead ends: 3262 [2024-10-11 19:07:04,831 INFO L226 Difference]: Without dead ends: 3262 [2024-10-11 19:07:04,831 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 19:07:04,832 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-11 19:07:04,833 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-11 19:07:04,838 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3262 states. [2024-10-11 19:07:04,880 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3262 to 3262. [2024-10-11 19:07:04,885 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-11 19:07:04,892 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3262 states to 3262 states and 4948 transitions. [2024-10-11 19:07:04,893 INFO L78 Accepts]: Start accepts. Automaton has 3262 states and 4948 transitions. Word has length 10 [2024-10-11 19:07:04,893 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 19:07:04,893 INFO L471 AbstractCegarLoop]: Abstraction has 3262 states and 4948 transitions. [2024-10-11 19:07:04,893 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 19:07:04,894 INFO L276 IsEmpty]: Start isEmpty. Operand 3262 states and 4948 transitions. [2024-10-11 19:07:04,894 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2024-10-11 19:07:04,894 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 19:07:04,894 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 19:07:04,899 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Forceful destruction successful, exit code 0 [2024-10-11 19:07:05,094 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 19:07:05,095 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-11 19:07:05,096 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 19:07:05,096 INFO L85 PathProgramCache]: Analyzing trace with hash -713168110, now seen corresponding path program 1 times [2024-10-11 19:07:05,096 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 19:07:05,096 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [773725186] [2024-10-11 19:07:05,096 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 19:07:05,096 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 19:07:05,096 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 19:07:05,097 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-11 19:07:05,098 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Waiting until timeout for monitored process [2024-10-11 19:07:05,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 19:07:05,253 INFO L255 TraceCheckSpWp]: Trace formula consists of 88 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-11 19:07:05,255 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 19:07:05,276 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 19:07:05,277 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 19:07:05,277 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 19:07:05,277 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [773725186] [2024-10-11 19:07:05,277 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [773725186] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 19:07:05,278 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 19:07:05,278 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 19:07:05,278 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1713149874] [2024-10-11 19:07:05,278 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 19:07:05,278 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 19:07:05,278 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 19:07:05,279 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 19:07:05,279 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 19:07:05,279 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-11 19:07:06,583 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 19:07:06,583 INFO L93 Difference]: Finished difference Result 3246 states and 4904 transitions. [2024-10-11 19:07:06,584 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-11 19:07:06,585 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 12 [2024-10-11 19:07:06,585 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 19:07:06,593 INFO L225 Difference]: With dead ends: 3246 [2024-10-11 19:07:06,593 INFO L226 Difference]: Without dead ends: 3246 [2024-10-11 19:07:06,594 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-11 19:07:06,594 INFO L432 NwaCegarLoop]: 1774 mSDtfsCounter, 45 mSDsluCounter, 3530 mSDsCounter, 0 mSdLazyCounter, 651 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s 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.3s IncrementalHoareTripleChecker+Time [2024-10-11 19:07:06,594 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.3s Time] [2024-10-11 19:07:06,598 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3246 states. [2024-10-11 19:07:06,632 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3246 to 3246. [2024-10-11 19:07:06,636 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-11 19:07:06,641 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3246 states to 3246 states and 4904 transitions. [2024-10-11 19:07:06,642 INFO L78 Accepts]: Start accepts. Automaton has 3246 states and 4904 transitions. Word has length 12 [2024-10-11 19:07:06,642 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 19:07:06,642 INFO L471 AbstractCegarLoop]: Abstraction has 3246 states and 4904 transitions. [2024-10-11 19:07:06,642 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 19:07:06,642 INFO L276 IsEmpty]: Start isEmpty. Operand 3246 states and 4904 transitions. [2024-10-11 19:07:06,643 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2024-10-11 19:07:06,643 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 19:07:06,643 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 19:07:06,647 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Ended with exit code 0 [2024-10-11 19:07:06,843 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 19:07:06,844 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-11 19:07:06,845 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 19:07:06,846 INFO L85 PathProgramCache]: Analyzing trace with hash 1884128953, now seen corresponding path program 1 times [2024-10-11 19:07:06,846 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 19:07:06,846 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1401936343] [2024-10-11 19:07:06,846 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 19:07:06,846 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 19:07:06,846 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 19:07:06,849 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-11 19:07:06,850 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Waiting until timeout for monitored process [2024-10-11 19:07:07,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 19:07:07,057 INFO L255 TraceCheckSpWp]: Trace formula consists of 137 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-11 19:07:07,059 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 19:07:07,070 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 19:07:07,070 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 19:07:07,071 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 19:07:07,071 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1401936343] [2024-10-11 19:07:07,071 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1401936343] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 19:07:07,071 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 19:07:07,071 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 19:07:07,071 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1877374641] [2024-10-11 19:07:07,071 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 19:07:07,071 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 19:07:07,071 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 19:07:07,072 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 19:07:07,072 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 19:07:07,072 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-11 19:07:07,905 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 19:07:07,906 INFO L93 Difference]: Finished difference Result 3132 states and 4664 transitions. [2024-10-11 19:07:07,907 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 19:07:07,907 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2024-10-11 19:07:07,907 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 19:07:07,916 INFO L225 Difference]: With dead ends: 3132 [2024-10-11 19:07:07,916 INFO L226 Difference]: Without dead ends: 3132 [2024-10-11 19:07:07,916 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 19:07:07,917 INFO L432 NwaCegarLoop]: 1747 mSDtfsCounter, 61 mSDsluCounter, 1705 mSDsCounter, 0 mSdLazyCounter, 410 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s 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, 0.8s IncrementalHoareTripleChecker+Time [2024-10-11 19:07:07,917 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [61 Valid, 3452 Invalid, 410 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 410 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-10-11 19:07:07,920 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3132 states. [2024-10-11 19:07:07,958 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3132 to 3132. [2024-10-11 19:07:07,962 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-11 19:07:07,968 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3132 states to 3132 states and 4664 transitions. [2024-10-11 19:07:07,968 INFO L78 Accepts]: Start accepts. Automaton has 3132 states and 4664 transitions. Word has length 17 [2024-10-11 19:07:07,968 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 19:07:07,968 INFO L471 AbstractCegarLoop]: Abstraction has 3132 states and 4664 transitions. [2024-10-11 19:07:07,969 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 19:07:07,969 INFO L276 IsEmpty]: Start isEmpty. Operand 3132 states and 4664 transitions. [2024-10-11 19:07:07,969 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2024-10-11 19:07:07,969 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 19:07:07,970 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 19:07:07,975 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Forceful destruction successful, exit code 0 [2024-10-11 19:07:08,170 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 19:07:08,171 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-11 19:07:08,171 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 19:07:08,171 INFO L85 PathProgramCache]: Analyzing trace with hash -2141973639, now seen corresponding path program 1 times [2024-10-11 19:07:08,171 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 19:07:08,171 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [335081775] [2024-10-11 19:07:08,171 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 19:07:08,171 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 19:07:08,172 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 19:07:08,173 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-11 19:07:08,174 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Waiting until timeout for monitored process [2024-10-11 19:07:08,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 19:07:08,362 INFO L255 TraceCheckSpWp]: Trace formula consists of 137 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-11 19:07:08,364 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 19:07:08,374 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 19:07:08,375 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 19:07:08,375 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 19:07:08,375 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [335081775] [2024-10-11 19:07:08,375 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [335081775] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 19:07:08,375 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 19:07:08,376 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 19:07:08,376 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [610835534] [2024-10-11 19:07:08,376 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 19:07:08,377 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 19:07:08,377 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 19:07:08,377 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 19:07:08,377 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 19:07:08,377 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-11 19:07:09,278 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 19:07:09,278 INFO L93 Difference]: Finished difference Result 3078 states and 4584 transitions. [2024-10-11 19:07:09,280 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 19:07:09,280 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2024-10-11 19:07:09,280 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 19:07:09,285 INFO L225 Difference]: With dead ends: 3078 [2024-10-11 19:07:09,285 INFO L226 Difference]: Without dead ends: 3078 [2024-10-11 19:07:09,286 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 19:07:09,286 INFO L432 NwaCegarLoop]: 1710 mSDtfsCounter, 61 mSDsluCounter, 1668 mSDsCounter, 0 mSdLazyCounter, 404 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s 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, 0.9s IncrementalHoareTripleChecker+Time [2024-10-11 19:07:09,287 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [61 Valid, 3378 Invalid, 404 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 404 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-10-11 19:07:09,291 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3078 states. [2024-10-11 19:07:09,330 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3078 to 3078. [2024-10-11 19:07:09,335 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-11 19:07:09,348 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3078 states to 3078 states and 4584 transitions. [2024-10-11 19:07:09,348 INFO L78 Accepts]: Start accepts. Automaton has 3078 states and 4584 transitions. Word has length 17 [2024-10-11 19:07:09,349 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 19:07:09,349 INFO L471 AbstractCegarLoop]: Abstraction has 3078 states and 4584 transitions. [2024-10-11 19:07:09,349 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 19:07:09,349 INFO L276 IsEmpty]: Start isEmpty. Operand 3078 states and 4584 transitions. [2024-10-11 19:07:09,350 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2024-10-11 19:07:09,350 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 19:07:09,351 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 19:07:09,357 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Forceful destruction successful, exit code 0 [2024-10-11 19:07:09,551 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 19:07:09,552 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-11 19:07:09,552 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 19:07:09,552 INFO L85 PathProgramCache]: Analyzing trace with hash -1828249453, now seen corresponding path program 1 times [2024-10-11 19:07:09,553 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 19:07:09,556 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [536718746] [2024-10-11 19:07:09,556 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 19:07:09,556 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 19:07:09,557 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 19:07:09,560 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-11 19:07:09,562 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Waiting until timeout for monitored process [2024-10-11 19:07:09,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 19:07:09,768 INFO L255 TraceCheckSpWp]: Trace formula consists of 140 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-11 19:07:09,770 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 19:07:09,784 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 19:07:09,784 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 19:07:09,785 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 19:07:09,785 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [536718746] [2024-10-11 19:07:09,785 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [536718746] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 19:07:09,785 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 19:07:09,785 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 19:07:09,785 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [275260640] [2024-10-11 19:07:09,785 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 19:07:09,785 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 19:07:09,785 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 19:07:09,786 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 19:07:09,786 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 19:07:09,786 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-11 19:07:10,863 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 19:07:10,863 INFO L93 Difference]: Finished difference Result 3058 states and 4452 transitions. [2024-10-11 19:07:10,864 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-11 19:07:10,864 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2024-10-11 19:07:10,864 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 19:07:10,869 INFO L225 Difference]: With dead ends: 3058 [2024-10-11 19:07:10,869 INFO L226 Difference]: Without dead ends: 3058 [2024-10-11 19:07:10,869 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-11 19:07:10,869 INFO L432 NwaCegarLoop]: 1679 mSDtfsCounter, 45 mSDsluCounter, 3340 mSDsCounter, 0 mSdLazyCounter, 612 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s 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.0s IncrementalHoareTripleChecker+Time [2024-10-11 19:07:10,870 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.0s Time] [2024-10-11 19:07:10,872 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3058 states. [2024-10-11 19:07:10,899 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3058 to 3058. [2024-10-11 19:07:10,904 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-11 19:07:10,909 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3058 states to 3058 states and 4452 transitions. [2024-10-11 19:07:10,909 INFO L78 Accepts]: Start accepts. Automaton has 3058 states and 4452 transitions. Word has length 19 [2024-10-11 19:07:10,909 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 19:07:10,910 INFO L471 AbstractCegarLoop]: Abstraction has 3058 states and 4452 transitions. [2024-10-11 19:07:10,910 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 19:07:10,910 INFO L276 IsEmpty]: Start isEmpty. Operand 3058 states and 4452 transitions. [2024-10-11 19:07:10,910 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2024-10-11 19:07:10,911 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 19:07:10,911 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 19:07:10,917 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Forceful destruction successful, exit code 0 [2024-10-11 19:07:11,111 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 19:07:11,111 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-11 19:07:11,112 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 19:07:11,112 INFO L85 PathProgramCache]: Analyzing trace with hash -1147334253, now seen corresponding path program 1 times [2024-10-11 19:07:11,112 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 19:07:11,112 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1119367485] [2024-10-11 19:07:11,112 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 19:07:11,113 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 19:07:11,113 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 19:07:11,114 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-11 19:07:11,115 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (12)] Waiting until timeout for monitored process [2024-10-11 19:07:11,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 19:07:11,330 INFO L255 TraceCheckSpWp]: Trace formula consists of 140 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-11 19:07:11,332 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 19:07:11,347 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 19:07:11,348 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 19:07:11,348 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 19:07:11,348 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1119367485] [2024-10-11 19:07:11,348 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1119367485] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 19:07:11,348 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 19:07:11,348 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 19:07:11,349 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [61416215] [2024-10-11 19:07:11,349 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 19:07:11,349 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 19:07:11,349 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 19:07:11,350 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 19:07:11,350 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 19:07:11,350 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-11 19:07:12,412 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 19:07:12,412 INFO L93 Difference]: Finished difference Result 3042 states and 4408 transitions. [2024-10-11 19:07:12,414 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-11 19:07:12,414 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2024-10-11 19:07:12,414 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 19:07:12,418 INFO L225 Difference]: With dead ends: 3042 [2024-10-11 19:07:12,419 INFO L226 Difference]: Without dead ends: 3042 [2024-10-11 19:07:12,419 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-11 19:07:12,419 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.0s IncrementalHoareTripleChecker+Time [2024-10-11 19:07:12,420 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.0s Time] [2024-10-11 19:07:12,423 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3042 states. [2024-10-11 19:07:12,452 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3042 to 3042. [2024-10-11 19:07:12,459 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-11 19:07:12,468 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3042 states to 3042 states and 4408 transitions. [2024-10-11 19:07:12,468 INFO L78 Accepts]: Start accepts. Automaton has 3042 states and 4408 transitions. Word has length 19 [2024-10-11 19:07:12,469 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 19:07:12,469 INFO L471 AbstractCegarLoop]: Abstraction has 3042 states and 4408 transitions. [2024-10-11 19:07:12,469 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 19:07:12,469 INFO L276 IsEmpty]: Start isEmpty. Operand 3042 states and 4408 transitions. [2024-10-11 19:07:12,472 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2024-10-11 19:07:12,472 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 19:07:12,472 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 19:07:12,478 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (12)] Forceful destruction successful, exit code 0 [2024-10-11 19:07:12,673 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 19:07:12,673 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-11 19:07:12,674 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 19:07:12,674 INFO L85 PathProgramCache]: Analyzing trace with hash 303308928, now seen corresponding path program 1 times [2024-10-11 19:07:12,674 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 19:07:12,674 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1252607718] [2024-10-11 19:07:12,674 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 19:07:12,674 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 19:07:12,675 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 19:07:12,677 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-11 19:07:12,678 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (13)] Waiting until timeout for monitored process [2024-10-11 19:07:12,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 19:07:12,857 INFO L255 TraceCheckSpWp]: Trace formula consists of 102 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-10-11 19:07:12,860 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 19:07:12,865 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2024-10-11 19:07:12,940 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 19:07:12,940 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 19:07:12,940 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 19:07:12,940 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1252607718] [2024-10-11 19:07:12,940 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1252607718] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 19:07:12,940 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 19:07:12,940 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 19:07:12,940 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [39326687] [2024-10-11 19:07:12,940 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 19:07:12,941 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 19:07:12,941 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 19:07:12,941 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 19:07:12,941 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 19:07:12,941 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-11 19:07:15,666 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 19:07:15,666 INFO L93 Difference]: Finished difference Result 3460 states and 4733 transitions. [2024-10-11 19:07:15,667 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 19:07:15,667 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 26 [2024-10-11 19:07:15,667 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 19:07:15,672 INFO L225 Difference]: With dead ends: 3460 [2024-10-11 19:07:15,673 INFO L226 Difference]: Without dead ends: 3460 [2024-10-11 19:07:15,673 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-11 19:07:15,674 INFO L432 NwaCegarLoop]: 1048 mSDtfsCounter, 1666 mSDsluCounter, 1306 mSDsCounter, 0 mSdLazyCounter, 2106 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s 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.7s IncrementalHoareTripleChecker+Time [2024-10-11 19:07:15,674 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.7s Time] [2024-10-11 19:07:15,677 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3460 states. [2024-10-11 19:07:15,701 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3460 to 3038. [2024-10-11 19:07:15,704 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-11 19:07:15,709 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3038 states to 3038 states and 4400 transitions. [2024-10-11 19:07:15,709 INFO L78 Accepts]: Start accepts. Automaton has 3038 states and 4400 transitions. Word has length 26 [2024-10-11 19:07:15,709 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 19:07:15,709 INFO L471 AbstractCegarLoop]: Abstraction has 3038 states and 4400 transitions. [2024-10-11 19:07:15,710 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 19:07:15,710 INFO L276 IsEmpty]: Start isEmpty. Operand 3038 states and 4400 transitions. [2024-10-11 19:07:15,710 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2024-10-11 19:07:15,710 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 19:07:15,711 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 19:07:15,715 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (13)] Ended with exit code 0 [2024-10-11 19:07:15,911 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 19:07:15,912 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-11 19:07:15,912 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 19:07:15,912 INFO L85 PathProgramCache]: Analyzing trace with hash 303308929, now seen corresponding path program 1 times [2024-10-11 19:07:15,913 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 19:07:15,913 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [808508695] [2024-10-11 19:07:15,913 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 19:07:15,913 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 19:07:15,913 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 19:07:15,916 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-11 19:07:15,917 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (14)] Waiting until timeout for monitored process [2024-10-11 19:07:16,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 19:07:16,117 INFO L255 TraceCheckSpWp]: Trace formula consists of 102 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-10-11 19:07:16,120 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 19:07:16,132 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-10-11 19:07:16,311 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 19:07:16,311 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 19:07:16,311 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 19:07:16,311 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [808508695] [2024-10-11 19:07:16,311 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [808508695] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 19:07:16,312 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 19:07:16,312 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 19:07:16,312 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [192535142] [2024-10-11 19:07:16,312 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 19:07:16,312 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 19:07:16,312 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 19:07:16,313 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 19:07:16,313 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 19:07:16,313 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-11 19:07:20,030 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 19:07:20,030 INFO L93 Difference]: Finished difference Result 3706 states and 5140 transitions. [2024-10-11 19:07:20,031 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 19:07:20,031 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 26 [2024-10-11 19:07:20,031 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 19:07:20,037 INFO L225 Difference]: With dead ends: 3706 [2024-10-11 19:07:20,037 INFO L226 Difference]: Without dead ends: 3706 [2024-10-11 19:07:20,037 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-11 19:07:20,037 INFO L432 NwaCegarLoop]: 1435 mSDtfsCounter, 737 mSDsluCounter, 1814 mSDsCounter, 0 mSdLazyCounter, 2335 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.2s 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, 3.6s IncrementalHoareTripleChecker+Time [2024-10-11 19:07:20,038 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [740 Valid, 3249 Invalid, 2338 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 2335 Invalid, 0 Unknown, 0 Unchecked, 3.6s Time] [2024-10-11 19:07:20,041 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3706 states. [2024-10-11 19:07:20,065 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3706 to 3071. [2024-10-11 19:07:20,067 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-11 19:07:20,071 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3071 states to 3071 states and 4438 transitions. [2024-10-11 19:07:20,071 INFO L78 Accepts]: Start accepts. Automaton has 3071 states and 4438 transitions. Word has length 26 [2024-10-11 19:07:20,071 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 19:07:20,072 INFO L471 AbstractCegarLoop]: Abstraction has 3071 states and 4438 transitions. [2024-10-11 19:07:20,072 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 19:07:20,072 INFO L276 IsEmpty]: Start isEmpty. Operand 3071 states and 4438 transitions. [2024-10-11 19:07:20,074 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2024-10-11 19:07:20,074 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 19:07:20,074 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 19:07:20,079 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (14)] Ended with exit code 0 [2024-10-11 19:07:20,278 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 19:07:20,279 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-11 19:07:20,279 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 19:07:20,279 INFO L85 PathProgramCache]: Analyzing trace with hash 575845249, now seen corresponding path program 1 times [2024-10-11 19:07:20,280 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 19:07:20,280 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1036657043] [2024-10-11 19:07:20,280 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 19:07:20,280 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 19:07:20,280 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 19:07:20,284 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-11 19:07:20,285 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (15)] Waiting until timeout for monitored process [2024-10-11 19:07:20,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 19:07:20,510 INFO L255 TraceCheckSpWp]: Trace formula consists of 154 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-10-11 19:07:20,512 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 19:07:20,518 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2024-10-11 19:07:20,585 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 19:07:20,585 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 19:07:20,585 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 19:07:20,585 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1036657043] [2024-10-11 19:07:20,585 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1036657043] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 19:07:20,585 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 19:07:20,585 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 19:07:20,585 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [325127346] [2024-10-11 19:07:20,585 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 19:07:20,586 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 19:07:20,586 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 19:07:20,586 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 19:07:20,586 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 19:07:20,586 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-11 19:07:23,519 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 19:07:23,519 INFO L93 Difference]: Finished difference Result 3724 states and 5139 transitions. [2024-10-11 19:07:23,520 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 19:07:23,520 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 11.0) internal successors, (33), 4 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 33 [2024-10-11 19:07:23,520 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 19:07:23,524 INFO L225 Difference]: With dead ends: 3724 [2024-10-11 19:07:23,524 INFO L226 Difference]: Without dead ends: 3724 [2024-10-11 19:07:23,525 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-11 19:07:23,525 INFO L432 NwaCegarLoop]: 1679 mSDtfsCounter, 1526 mSDsluCounter, 1852 mSDsCounter, 0 mSdLazyCounter, 2675 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s 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, 2.9s IncrementalHoareTripleChecker+Time [2024-10-11 19:07:23,525 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1536 Valid, 3531 Invalid, 2686 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 2675 Invalid, 0 Unknown, 0 Unchecked, 2.9s Time] [2024-10-11 19:07:23,528 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3724 states. [2024-10-11 19:07:23,553 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3724 to 3067. [2024-10-11 19:07:23,555 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-11 19:07:23,559 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3067 states to 3067 states and 4414 transitions. [2024-10-11 19:07:23,559 INFO L78 Accepts]: Start accepts. Automaton has 3067 states and 4414 transitions. Word has length 33 [2024-10-11 19:07:23,560 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 19:07:23,560 INFO L471 AbstractCegarLoop]: Abstraction has 3067 states and 4414 transitions. [2024-10-11 19:07:23,560 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 11.0) internal successors, (33), 4 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 19:07:23,560 INFO L276 IsEmpty]: Start isEmpty. Operand 3067 states and 4414 transitions. [2024-10-11 19:07:23,561 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2024-10-11 19:07:23,561 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 19:07:23,561 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 19:07:23,567 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (15)] Ended with exit code 0 [2024-10-11 19:07:23,761 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 19:07:23,762 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-11 19:07:23,762 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 19:07:23,762 INFO L85 PathProgramCache]: Analyzing trace with hash 575845250, now seen corresponding path program 1 times [2024-10-11 19:07:23,762 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 19:07:23,763 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1786928881] [2024-10-11 19:07:23,763 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 19:07:23,763 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 19:07:23,763 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 19:07:23,766 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-11 19:07:23,767 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (16)] Waiting until timeout for monitored process [2024-10-11 19:07:23,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 19:07:23,961 INFO L255 TraceCheckSpWp]: Trace formula consists of 154 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-10-11 19:07:23,964 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 19:07:23,973 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-10-11 19:07:24,122 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 19:07:24,123 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 19:07:24,123 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 19:07:24,123 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1786928881] [2024-10-11 19:07:24,123 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1786928881] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 19:07:24,123 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 19:07:24,123 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 19:07:24,123 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1896957059] [2024-10-11 19:07:24,124 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 19:07:24,124 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 19:07:24,124 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 19:07:24,124 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 19:07:24,124 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 19:07:24,125 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-11 19:07:28,302 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 19:07:28,302 INFO L93 Difference]: Finished difference Result 4256 states and 5942 transitions. [2024-10-11 19:07:28,303 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 19:07:28,303 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 11.0) internal successors, (33), 4 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 33 [2024-10-11 19:07:28,303 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 19:07:28,309 INFO L225 Difference]: With dead ends: 4256 [2024-10-11 19:07:28,309 INFO L226 Difference]: Without dead ends: 4256 [2024-10-11 19:07:28,309 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-11 19:07:28,310 INFO L432 NwaCegarLoop]: 1975 mSDtfsCounter, 1081 mSDsluCounter, 2187 mSDsCounter, 0 mSdLazyCounter, 2796 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.6s 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.1s IncrementalHoareTripleChecker+Time [2024-10-11 19:07:28,310 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.1s Time] [2024-10-11 19:07:28,313 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4256 states. [2024-10-11 19:07:28,356 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4256 to 3067. [2024-10-11 19:07:28,358 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-11 19:07:28,364 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3067 states to 3067 states and 4406 transitions. [2024-10-11 19:07:28,364 INFO L78 Accepts]: Start accepts. Automaton has 3067 states and 4406 transitions. Word has length 33 [2024-10-11 19:07:28,365 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 19:07:28,365 INFO L471 AbstractCegarLoop]: Abstraction has 3067 states and 4406 transitions. [2024-10-11 19:07:28,365 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 11.0) internal successors, (33), 4 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 19:07:28,365 INFO L276 IsEmpty]: Start isEmpty. Operand 3067 states and 4406 transitions. [2024-10-11 19:07:28,366 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2024-10-11 19:07:28,366 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 19:07:28,367 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 19:07:28,374 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (16)] Ended with exit code 0 [2024-10-11 19:07:28,568 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 19:07:28,568 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-11 19:07:28,569 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 19:07:28,569 INFO L85 PathProgramCache]: Analyzing trace with hash 601006657, now seen corresponding path program 1 times [2024-10-11 19:07:28,569 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 19:07:28,570 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1375832198] [2024-10-11 19:07:28,570 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 19:07:28,570 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 19:07:28,570 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 19:07:28,571 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-11 19:07:28,573 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (17)] Waiting until timeout for monitored process [2024-10-11 19:07:28,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 19:07:28,765 INFO L255 TraceCheckSpWp]: Trace formula consists of 154 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-10-11 19:07:28,767 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 19:07:28,772 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2024-10-11 19:07:28,831 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 19:07:28,832 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 19:07:28,832 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 19:07:28,832 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1375832198] [2024-10-11 19:07:28,832 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1375832198] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 19:07:28,832 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 19:07:28,832 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 19:07:28,832 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [653245965] [2024-10-11 19:07:28,832 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 19:07:28,833 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 19:07:28,833 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 19:07:28,833 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 19:07:28,833 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 19:07:28,833 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-11 19:07:31,714 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 19:07:31,714 INFO L93 Difference]: Finished difference Result 3704 states and 5107 transitions. [2024-10-11 19:07:31,714 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 19:07:31,714 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 11.0) internal successors, (33), 4 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 33 [2024-10-11 19:07:31,714 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 19:07:31,718 INFO L225 Difference]: With dead ends: 3704 [2024-10-11 19:07:31,718 INFO L226 Difference]: Without dead ends: 3704 [2024-10-11 19:07:31,718 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-11 19:07:31,718 INFO L432 NwaCegarLoop]: 1679 mSDtfsCounter, 1522 mSDsluCounter, 1852 mSDsCounter, 0 mSdLazyCounter, 2667 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s 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, 2.8s IncrementalHoareTripleChecker+Time [2024-10-11 19:07:31,719 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1532 Valid, 3531 Invalid, 2678 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 2667 Invalid, 0 Unknown, 0 Unchecked, 2.8s Time] [2024-10-11 19:07:31,721 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3704 states. [2024-10-11 19:07:31,740 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3704 to 3063. [2024-10-11 19:07:31,742 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-11 19:07:31,746 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3063 states to 3063 states and 4398 transitions. [2024-10-11 19:07:31,746 INFO L78 Accepts]: Start accepts. Automaton has 3063 states and 4398 transitions. Word has length 33 [2024-10-11 19:07:31,746 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 19:07:31,746 INFO L471 AbstractCegarLoop]: Abstraction has 3063 states and 4398 transitions. [2024-10-11 19:07:31,746 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 11.0) internal successors, (33), 4 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 19:07:31,747 INFO L276 IsEmpty]: Start isEmpty. Operand 3063 states and 4398 transitions. [2024-10-11 19:07:31,747 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2024-10-11 19:07:31,747 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 19:07:31,747 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 19:07:31,753 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (17)] Ended with exit code 0 [2024-10-11 19:07:31,948 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 19:07:31,948 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-11 19:07:31,949 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 19:07:31,949 INFO L85 PathProgramCache]: Analyzing trace with hash 601006658, now seen corresponding path program 1 times [2024-10-11 19:07:31,949 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 19:07:31,949 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1913877450] [2024-10-11 19:07:31,949 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 19:07:31,950 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 19:07:31,950 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 19:07:31,952 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-11 19:07:31,953 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (18)] Waiting until timeout for monitored process [2024-10-11 19:07:32,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 19:07:32,182 INFO L255 TraceCheckSpWp]: Trace formula consists of 154 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-10-11 19:07:32,184 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 19:07:32,191 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-10-11 19:07:32,319 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 19:07:32,319 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 19:07:32,321 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 19:07:32,321 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1913877450] [2024-10-11 19:07:32,321 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1913877450] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 19:07:32,321 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 19:07:32,322 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 19:07:32,322 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1026537638] [2024-10-11 19:07:32,322 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 19:07:32,322 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 19:07:32,322 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 19:07:32,322 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 19:07:32,322 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 19:07:32,323 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) [2024-10-11 19:07:36,529 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 19:07:36,529 INFO L93 Difference]: Finished difference Result 4248 states and 5926 transitions. [2024-10-11 19:07:36,530 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 19:07:36,530 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 11.0) internal successors, (33), 4 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 33 [2024-10-11 19:07:36,530 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 19:07:36,534 INFO L225 Difference]: With dead ends: 4248 [2024-10-11 19:07:36,534 INFO L226 Difference]: Without dead ends: 4248 [2024-10-11 19:07:36,534 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-11 19:07:36,535 INFO L432 NwaCegarLoop]: 1971 mSDtfsCounter, 1073 mSDsluCounter, 2156 mSDsCounter, 0 mSdLazyCounter, 2784 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1077 SdHoareTripleChecker+Valid, 4127 SdHoareTripleChecker+Invalid, 2787 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 2784 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.1s IncrementalHoareTripleChecker+Time [2024-10-11 19:07:36,535 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1077 Valid, 4127 Invalid, 2787 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 2784 Invalid, 0 Unknown, 0 Unchecked, 4.1s Time] [2024-10-11 19:07:36,537 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4248 states. [2024-10-11 19:07:36,561 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4248 to 3059. [2024-10-11 19:07:36,563 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3059 states, 2214 states have (on average 1.960252935862692) internal successors, (4340), 3034 states have internal predecessors, (4340), 25 states have call successors, (25), 3 states have call predecessors, (25), 3 states have return successors, (25), 22 states have call predecessors, (25), 25 states have call successors, (25) [2024-10-11 19:07:36,567 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3059 states to 3059 states and 4390 transitions. [2024-10-11 19:07:36,568 INFO L78 Accepts]: Start accepts. Automaton has 3059 states and 4390 transitions. Word has length 33 [2024-10-11 19:07:36,568 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 19:07:36,568 INFO L471 AbstractCegarLoop]: Abstraction has 3059 states and 4390 transitions. [2024-10-11 19:07:36,568 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 11.0) internal successors, (33), 4 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 19:07:36,568 INFO L276 IsEmpty]: Start isEmpty. Operand 3059 states and 4390 transitions. [2024-10-11 19:07:36,569 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2024-10-11 19:07:36,569 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 19:07:36,569 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 19:07:36,575 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (18)] Ended with exit code 0 [2024-10-11 19:07:36,773 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 19:07:36,774 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr684REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 1088 more)] === [2024-10-11 19:07:36,775 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 19:07:36,775 INFO L85 PathProgramCache]: Analyzing trace with hash 1877036666, now seen corresponding path program 1 times [2024-10-11 19:07:36,775 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 19:07:36,775 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1055057362] [2024-10-11 19:07:36,775 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 19:07:36,777 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 19:07:36,777 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 19:07:36,781 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-11 19:07:36,782 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (19)] Waiting until timeout for monitored process [2024-10-11 19:07:36,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 19:07:36,997 INFO L255 TraceCheckSpWp]: Trace formula consists of 119 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-11 19:07:36,999 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 19:07:37,046 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 19:07:37,047 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 19:07:37,047 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 19:07:37,047 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1055057362] [2024-10-11 19:07:37,047 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1055057362] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 19:07:37,047 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 19:07:37,047 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 19:07:37,047 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1836211627] [2024-10-11 19:07:37,048 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 19:07:37,048 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 19:07:37,048 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 19:07:37,048 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 19:07:37,048 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 19:07:37,048 INFO L87 Difference]: Start difference. First operand 3059 states and 4390 transitions. Second operand has 4 states, 4 states have (on average 10.0) internal successors, (40), 4 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 19:07:38,164 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 19:07:38,164 INFO L93 Difference]: Finished difference Result 3047 states and 4366 transitions. [2024-10-11 19:07:38,165 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-11 19:07:38,166 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 10.0) internal successors, (40), 4 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 40 [2024-10-11 19:07:38,166 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 19:07:38,168 INFO L225 Difference]: With dead ends: 3047 [2024-10-11 19:07:38,168 INFO L226 Difference]: Without dead ends: 3047 [2024-10-11 19:07:38,168 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-11 19:07:38,169 INFO L432 NwaCegarLoop]: 1644 mSDtfsCounter, 21 mSDsluCounter, 3265 mSDsCounter, 0 mSdLazyCounter, 588 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 4909 SdHoareTripleChecker+Invalid, 594 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 588 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2024-10-11 19:07:38,169 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 4909 Invalid, 594 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 588 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2024-10-11 19:07:38,171 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3047 states. [2024-10-11 19:07:38,192 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3047 to 3047. [2024-10-11 19:07:38,195 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3047 states, 2202 states have (on average 1.9600363306085378) internal successors, (4316), 3022 states have internal predecessors, (4316), 25 states have call successors, (25), 3 states have call predecessors, (25), 3 states have return successors, (25), 22 states have call predecessors, (25), 25 states have call successors, (25) [2024-10-11 19:07:38,201 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3047 states to 3047 states and 4366 transitions. [2024-10-11 19:07:38,201 INFO L78 Accepts]: Start accepts. Automaton has 3047 states and 4366 transitions. Word has length 40 [2024-10-11 19:07:38,202 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 19:07:38,202 INFO L471 AbstractCegarLoop]: Abstraction has 3047 states and 4366 transitions. [2024-10-11 19:07:38,202 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.0) internal successors, (40), 4 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 19:07:38,202 INFO L276 IsEmpty]: Start isEmpty. Operand 3047 states and 4366 transitions. [2024-10-11 19:07:38,203 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2024-10-11 19:07:38,203 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 19:07:38,203 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 19:07:38,209 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (19)] Ended with exit code 0 [2024-10-11 19:07:38,403 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 19:07:38,404 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr684REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 1088 more)] === [2024-10-11 19:07:38,405 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 19:07:38,405 INFO L85 PathProgramCache]: Analyzing trace with hash -1228682057, now seen corresponding path program 1 times [2024-10-11 19:07:38,405 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 19:07:38,405 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1834745280] [2024-10-11 19:07:38,405 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 19:07:38,405 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 19:07:38,405 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 19:07:38,408 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-11 19:07:38,410 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (20)] Waiting until timeout for monitored process [2024-10-11 19:07:38,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 19:07:38,642 INFO L255 TraceCheckSpWp]: Trace formula consists of 139 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-11 19:07:38,644 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 19:07:38,808 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 19:07:38,809 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 19:07:38,809 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 19:07:38,809 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1834745280] [2024-10-11 19:07:38,809 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1834745280] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 19:07:38,809 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 19:07:38,809 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 19:07:38,809 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [980533516] [2024-10-11 19:07:38,810 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 19:07:38,810 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 19:07:38,810 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 19:07:38,811 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 19:07:38,811 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 19:07:38,811 INFO L87 Difference]: Start difference. First operand 3047 states and 4366 transitions. Second operand has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 2 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 19:07:40,110 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 19:07:40,111 INFO L93 Difference]: Finished difference Result 4508 states and 6234 transitions. [2024-10-11 19:07:40,111 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 19:07:40,112 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 2 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 44 [2024-10-11 19:07:40,112 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 19:07:40,116 INFO L225 Difference]: With dead ends: 4508 [2024-10-11 19:07:40,116 INFO L226 Difference]: Without dead ends: 4508 [2024-10-11 19:07:40,116 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 19:07:40,117 INFO L432 NwaCegarLoop]: 1712 mSDtfsCounter, 1175 mSDsluCounter, 1562 mSDsCounter, 0 mSdLazyCounter, 517 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1182 SdHoareTripleChecker+Valid, 3274 SdHoareTripleChecker+Invalid, 524 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 517 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2024-10-11 19:07:40,117 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1182 Valid, 3274 Invalid, 524 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 517 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2024-10-11 19:07:40,119 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4508 states. [2024-10-11 19:07:40,158 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4508 to 3928. [2024-10-11 19:07:40,161 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3928 states, 3076 states have (on average 1.944408322496749) internal successors, (5981), 3893 states have internal predecessors, (5981), 35 states have call successors, (35), 3 states have call predecessors, (35), 3 states have return successors, (35), 32 states have call predecessors, (35), 35 states have call successors, (35) [2024-10-11 19:07:40,196 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3928 states to 3928 states and 6051 transitions. [2024-10-11 19:07:40,197 INFO L78 Accepts]: Start accepts. Automaton has 3928 states and 6051 transitions. Word has length 44 [2024-10-11 19:07:40,197 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 19:07:40,198 INFO L471 AbstractCegarLoop]: Abstraction has 3928 states and 6051 transitions. [2024-10-11 19:07:40,198 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 2 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 19:07:40,198 INFO L276 IsEmpty]: Start isEmpty. Operand 3928 states and 6051 transitions. [2024-10-11 19:07:40,199 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2024-10-11 19:07:40,199 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 19:07:40,199 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 19:07:40,206 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (20)] Ended with exit code 0 [2024-10-11 19:07:40,400 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 20 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 19:07:40,400 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr427REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 1088 more)] === [2024-10-11 19:07:40,401 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 19:07:40,401 INFO L85 PathProgramCache]: Analyzing trace with hash 1257793787, now seen corresponding path program 1 times [2024-10-11 19:07:40,401 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 19:07:40,401 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1802953707] [2024-10-11 19:07:40,401 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 19:07:40,401 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 19:07:40,401 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 19:07:40,402 INFO L229 MonitoredProcess]: Starting monitored process 21 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-11 19:07:40,403 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (21)] Waiting until timeout for monitored process [2024-10-11 19:07:40,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 19:07:40,639 INFO L255 TraceCheckSpWp]: Trace formula consists of 226 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-11 19:07:40,641 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 19:07:40,680 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 19:07:40,680 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 19:07:40,680 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 19:07:40,680 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1802953707] [2024-10-11 19:07:40,680 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1802953707] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 19:07:40,680 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 19:07:40,680 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 19:07:40,681 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1485201828] [2024-10-11 19:07:40,681 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 19:07:40,681 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 19:07:40,681 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 19:07:40,681 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 19:07:40,682 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 19:07:40,682 INFO L87 Difference]: Start difference. First operand 3928 states and 6051 transitions. Second operand has 4 states, 4 states have (on average 12.25) internal successors, (49), 4 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 19:07:41,753 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 19:07:41,754 INFO L93 Difference]: Finished difference Result 3886 states and 5981 transitions. [2024-10-11 19:07:41,754 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-11 19:07:41,754 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.25) internal successors, (49), 4 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 49 [2024-10-11 19:07:41,754 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 19:07:41,759 INFO L225 Difference]: With dead ends: 3886 [2024-10-11 19:07:41,759 INFO L226 Difference]: Without dead ends: 3886 [2024-10-11 19:07:41,760 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 46 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-11 19:07:41,760 INFO L432 NwaCegarLoop]: 1640 mSDtfsCounter, 21 mSDsluCounter, 3257 mSDsCounter, 0 mSdLazyCounter, 588 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 4897 SdHoareTripleChecker+Invalid, 594 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 588 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2024-10-11 19:07:41,760 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 4897 Invalid, 594 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 588 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2024-10-11 19:07:41,763 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3886 states. [2024-10-11 19:07:41,793 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3886 to 3886. [2024-10-11 19:07:41,796 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3886 states, 3034 states have (on average 1.9482531311799605) internal successors, (5911), 3851 states have internal predecessors, (5911), 35 states have call successors, (35), 3 states have call predecessors, (35), 3 states have return successors, (35), 32 states have call predecessors, (35), 35 states have call successors, (35) [2024-10-11 19:07:41,801 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3886 states to 3886 states and 5981 transitions. [2024-10-11 19:07:41,801 INFO L78 Accepts]: Start accepts. Automaton has 3886 states and 5981 transitions. Word has length 49 [2024-10-11 19:07:41,801 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 19:07:41,801 INFO L471 AbstractCegarLoop]: Abstraction has 3886 states and 5981 transitions. [2024-10-11 19:07:41,801 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.25) internal successors, (49), 4 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 19:07:41,801 INFO L276 IsEmpty]: Start isEmpty. Operand 3886 states and 5981 transitions. [2024-10-11 19:07:41,802 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2024-10-11 19:07:41,802 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 19:07:41,802 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 19:07:41,810 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (21)] Forceful destruction successful, exit code 0 [2024-10-11 19:07:42,006 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 19:07:42,007 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr73REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 1088 more)] === [2024-10-11 19:07:42,007 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 19:07:42,007 INFO L85 PathProgramCache]: Analyzing trace with hash -1745245856, now seen corresponding path program 1 times [2024-10-11 19:07:42,008 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 19:07:42,008 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2061170732] [2024-10-11 19:07:42,008 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 19:07:42,008 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 19:07:42,008 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 19:07:42,009 INFO L229 MonitoredProcess]: Starting monitored process 22 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-11 19:07:42,011 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (22)] Waiting until timeout for monitored process [2024-10-11 19:07:42,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 19:07:42,261 INFO L255 TraceCheckSpWp]: Trace formula consists of 261 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-11 19:07:42,263 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 19:07:42,294 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 19:07:42,294 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 19:07:42,294 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 19:07:42,294 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2061170732] [2024-10-11 19:07:42,294 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2061170732] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 19:07:42,294 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 19:07:42,295 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 19:07:42,295 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1610055086] [2024-10-11 19:07:42,295 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 19:07:42,295 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 19:07:42,295 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 19:07:42,296 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 19:07:42,296 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 19:07:42,296 INFO L87 Difference]: Start difference. First operand 3886 states and 5981 transitions. Second operand has 4 states, 4 states have (on average 13.0) internal successors, (52), 4 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 19:07:43,318 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 19:07:43,318 INFO L93 Difference]: Finished difference Result 3868 states and 5951 transitions. [2024-10-11 19:07:43,319 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-11 19:07:43,319 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 13.0) internal successors, (52), 4 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 52 [2024-10-11 19:07:43,319 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 19:07:43,323 INFO L225 Difference]: With dead ends: 3868 [2024-10-11 19:07:43,323 INFO L226 Difference]: Without dead ends: 3868 [2024-10-11 19:07:43,323 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 49 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-11 19:07:43,324 INFO L432 NwaCegarLoop]: 1636 mSDtfsCounter, 15 mSDsluCounter, 3255 mSDsCounter, 0 mSdLazyCounter, 588 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 4891 SdHoareTripleChecker+Invalid, 594 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 588 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2024-10-11 19:07:43,324 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 4891 Invalid, 594 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 588 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2024-10-11 19:07:43,327 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3868 states. [2024-10-11 19:07:43,347 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3868 to 3868. [2024-10-11 19:07:43,349 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3868 states, 3016 states have (on average 1.9499336870026525) internal successors, (5881), 3833 states have internal predecessors, (5881), 35 states have call successors, (35), 3 states have call predecessors, (35), 3 states have return successors, (35), 32 states have call predecessors, (35), 35 states have call successors, (35) [2024-10-11 19:07:43,352 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3868 states to 3868 states and 5951 transitions. [2024-10-11 19:07:43,353 INFO L78 Accepts]: Start accepts. Automaton has 3868 states and 5951 transitions. Word has length 52 [2024-10-11 19:07:43,353 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 19:07:43,353 INFO L471 AbstractCegarLoop]: Abstraction has 3868 states and 5951 transitions. [2024-10-11 19:07:43,353 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.0) internal successors, (52), 4 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 19:07:43,353 INFO L276 IsEmpty]: Start isEmpty. Operand 3868 states and 5951 transitions. [2024-10-11 19:07:43,353 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2024-10-11 19:07:43,353 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 19:07:43,354 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 19:07:43,360 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (22)] Forceful destruction successful, exit code 0 [2024-10-11 19:07:43,554 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 22 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 19:07:43,554 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 1088 more)] === [2024-10-11 19:07:43,554 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 19:07:43,555 INFO L85 PathProgramCache]: Analyzing trace with hash -165141037, now seen corresponding path program 1 times [2024-10-11 19:07:43,555 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 19:07:43,555 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [262354868] [2024-10-11 19:07:43,555 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 19:07:43,555 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 19:07:43,555 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 19:07:43,558 INFO L229 MonitoredProcess]: Starting monitored process 23 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-11 19:07:43,560 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (23)] Waiting until timeout for monitored process [2024-10-11 19:07:43,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 19:07:43,836 INFO L255 TraceCheckSpWp]: Trace formula consists of 164 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-10-11 19:07:43,838 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 19:07:43,844 INFO L173 IndexEqualityManager]: detected equality via solver [2024-10-11 19:07:43,844 INFO L173 IndexEqualityManager]: detected equality via solver [2024-10-11 19:07:43,848 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 31 [2024-10-11 19:07:43,870 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-11 19:07:43,870 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 62 treesize of output 22 [2024-10-11 19:07:43,894 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 19:07:43,895 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 19:07:43,895 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 19:07:43,895 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [262354868] [2024-10-11 19:07:43,895 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [262354868] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 19:07:43,895 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 19:07:43,895 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 19:07:43,895 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1697001310] [2024-10-11 19:07:43,895 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 19:07:43,896 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 19:07:43,896 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 19:07:43,896 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 19:07:43,896 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 19:07:43,896 INFO L87 Difference]: Start difference. First operand 3868 states and 5951 transitions. Second operand has 4 states, 4 states have (on average 13.25) internal successors, (53), 4 states have internal predecessors, (53), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)