./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_BER_test4-3.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version fca748b1 Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_BER_test4-3.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 2dcad53e9f7fd6e0b6384d19db4719ec6aa2601fd94c6ce0d3c746f1ec6b3601 --- Real Ultimate output --- This is Ultimate 0.2.5-wip.dd.update-z3-fca748b-m [2024-11-20 16:53:56,976 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-20 16:53:57,044 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2024-11-20 16:53:57,048 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-20 16:53:57,049 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-20 16:53:57,072 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-20 16:53:57,073 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-20 16:53:57,073 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-20 16:53:57,074 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-20 16:53:57,075 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-20 16:53:57,076 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-20 16:53:57,076 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-20 16:53:57,077 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-20 16:53:57,078 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-20 16:53:57,079 INFO L153 SettingsManager]: * Use SBE=true [2024-11-20 16:53:57,079 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-20 16:53:57,079 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-20 16:53:57,082 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-20 16:53:57,082 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-20 16:53:57,083 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-20 16:53:57,083 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-11-20 16:53:57,084 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-11-20 16:53:57,085 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-11-20 16:53:57,085 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-20 16:53:57,086 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-20 16:53:57,086 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-20 16:53:57,086 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-20 16:53:57,087 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-20 16:53:57,087 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-20 16:53:57,087 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-20 16:53:57,087 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-20 16:53:57,088 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-20 16:53:57,088 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-20 16:53:57,089 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-20 16:53:57,089 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-20 16:53:57,090 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-20 16:53:57,090 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-20 16:53:57,090 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-20 16:53:57,091 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-20 16:53:57,091 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-20 16:53:57,091 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-20 16:53:57,091 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-20 16:53:57,092 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 2dcad53e9f7fd6e0b6384d19db4719ec6aa2601fd94c6ce0d3c746f1ec6b3601 [2024-11-20 16:53:57,339 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-20 16:53:57,361 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-20 16:53:57,364 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-20 16:53:57,365 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-20 16:53:57,365 INFO L274 PluginConnector]: CDTParser initialized [2024-11-20 16:53:57,366 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_BER_test4-3.i [2024-11-20 16:53:58,901 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-20 16:53:59,237 INFO L384 CDTParser]: Found 1 translation units. [2024-11-20 16:53:59,238 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_BER_test4-3.i [2024-11-20 16:53:59,262 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cc76fd422/385f73b76a2f4e5ab6af6f90dcac69f1/FLAG55d289cd6 [2024-11-20 16:53:59,279 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cc76fd422/385f73b76a2f4e5ab6af6f90dcac69f1 [2024-11-20 16:53:59,282 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-20 16:53:59,283 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-20 16:53:59,284 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-20 16:53:59,284 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-20 16:53:59,291 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-20 16:53:59,292 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 04:53:59" (1/1) ... [2024-11-20 16:53:59,293 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@26ec0a2b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 04:53:59, skipping insertion in model container [2024-11-20 16:53:59,293 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 04:53:59" (1/1) ... [2024-11-20 16:53:59,363 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-20 16:53:59,783 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-20 16:53:59,823 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-20 16:53:59,828 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-20 16:53:59,835 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-20 16:53:59,842 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-20 16:53:59,902 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-20 16:53:59,918 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-20 16:53:59,924 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-20 16:53:59,928 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-20 16:53:59,938 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-20 16:53:59,939 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-20 16:53:59,941 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-20 16:53:59,943 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-20 16:53:59,943 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-20 16:53:59,944 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-20 16:53:59,948 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-20 16:53:59,950 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-20 16:53:59,951 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-20 16:53:59,951 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-20 16:53:59,955 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-20 16:53:59,963 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-20 16:53:59,977 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-11-20 16:53:59,978 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver@56649ff8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 04:53:59, skipping insertion in model container [2024-11-20 16:53:59,978 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-20 16:53:59,978 INFO L186 ToolchainWalker]: Toolchain execution was canceled (user or tool) before executing de.uni_freiburg.informatik.ultimate.boogie.procedureinliner [2024-11-20 16:53:59,983 INFO L158 Benchmark]: Toolchain (without parser) took 696.06ms. Allocated memory was 155.2MB in the beginning and 211.8MB in the end (delta: 56.6MB). Free memory was 79.4MB in the beginning and 175.3MB in the end (delta: -95.9MB). Peak memory consumption was 35.2MB. Max. memory is 16.1GB. [2024-11-20 16:53:59,984 INFO L158 Benchmark]: CDTParser took 0.18ms. Allocated memory is still 155.2MB. Free memory is still 105.8MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-20 16:53:59,984 INFO L158 Benchmark]: CACSL2BoogieTranslator took 694.01ms. Allocated memory was 155.2MB in the beginning and 211.8MB in the end (delta: 56.6MB). Free memory was 79.2MB in the beginning and 175.3MB in the end (delta: -96.1MB). Peak memory consumption was 33.1MB. Max. memory is 16.1GB. [2024-11-20 16:53:59,986 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.18ms. Allocated memory is still 155.2MB. Free memory is still 105.8MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 694.01ms. Allocated memory was 155.2MB in the beginning and 211.8MB in the end (delta: 56.6MB). Free memory was 79.2MB in the beginning and 175.3MB in the end (delta: -96.1MB). Peak memory consumption was 33.1MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - UnsupportedSyntaxResult [Line: 769]: Unsupported Syntax Found a cast between two array/pointer types of different sizes while using memory model HoenickeLindenmann_Original (while Not using bitvector translation) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_BER_test4-3.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 2dcad53e9f7fd6e0b6384d19db4719ec6aa2601fd94c6ce0d3c746f1ec6b3601 --- Real Ultimate output --- This is Ultimate 0.2.5-wip.dd.update-z3-fca748b-m [2024-11-20 16:54:01,951 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-20 16:54:02,031 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf [2024-11-20 16:54:02,037 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-20 16:54:02,038 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-20 16:54:02,085 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-20 16:54:02,085 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-20 16:54:02,085 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-20 16:54:02,086 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-20 16:54:02,086 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-20 16:54:02,087 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-20 16:54:02,087 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-20 16:54:02,088 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-20 16:54:02,092 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-20 16:54:02,092 INFO L153 SettingsManager]: * Use SBE=true [2024-11-20 16:54:02,093 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-20 16:54:02,093 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-20 16:54:02,093 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-20 16:54:02,093 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-20 16:54:02,094 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-20 16:54:02,094 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-11-20 16:54:02,095 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-11-20 16:54:02,096 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-11-20 16:54:02,096 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-20 16:54:02,096 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-20 16:54:02,096 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-20 16:54:02,097 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-20 16:54:02,097 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-20 16:54:02,097 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-20 16:54:02,097 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-20 16:54:02,097 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-20 16:54:02,098 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-20 16:54:02,098 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-20 16:54:02,098 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-20 16:54:02,098 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-20 16:54:02,098 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-20 16:54:02,099 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-20 16:54:02,099 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-20 16:54:02,101 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-20 16:54:02,101 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-20 16:54:02,101 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-20 16:54:02,101 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-20 16:54:02,102 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-20 16:54:02,102 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-20 16:54:02,102 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 2dcad53e9f7fd6e0b6384d19db4719ec6aa2601fd94c6ce0d3c746f1ec6b3601 [2024-11-20 16:54:02,382 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-20 16:54:02,401 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-20 16:54:02,404 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-20 16:54:02,405 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-20 16:54:02,405 INFO L274 PluginConnector]: CDTParser initialized [2024-11-20 16:54:02,406 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_BER_test4-3.i [2024-11-20 16:54:03,961 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-20 16:54:04,315 INFO L384 CDTParser]: Found 1 translation units. [2024-11-20 16:54:04,317 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_BER_test4-3.i [2024-11-20 16:54:04,341 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/aee0607cf/0f8c98e422c74617a1eef4a676ad367c/FLAG571ccebbb [2024-11-20 16:54:04,359 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/aee0607cf/0f8c98e422c74617a1eef4a676ad367c [2024-11-20 16:54:04,362 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-20 16:54:04,363 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-20 16:54:04,366 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-20 16:54:04,366 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-20 16:54:04,371 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-20 16:54:04,372 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 04:54:04" (1/1) ... [2024-11-20 16:54:04,373 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2d958fba and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 04:54:04, skipping insertion in model container [2024-11-20 16:54:04,374 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 04:54:04" (1/1) ... [2024-11-20 16:54:04,430 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-20 16:54:04,864 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-20 16:54:04,893 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-20 16:54:04,901 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-20 16:54:04,909 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-20 16:54:04,916 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-20 16:54:04,960 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-20 16:54:04,966 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-20 16:54:04,973 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-20 16:54:04,984 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-20 16:54:05,001 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-20 16:54:05,006 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-20 16:54:05,008 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-20 16:54:05,013 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-20 16:54:05,014 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-20 16:54:05,014 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-20 16:54:05,022 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-20 16:54:05,027 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-20 16:54:05,028 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-20 16:54:05,029 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-20 16:54:05,033 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-20 16:54:05,049 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-20 16:54:05,070 INFO L197 MainTranslator]: Restarting translation with changed settings: SettingsChange [mNewPreferredMemoryModel=HoenickeLindenmann_1ByteResolution] [2024-11-20 16:54:05,088 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-20 16:54:05,122 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-20 16:54:05,144 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-20 16:54:05,145 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-20 16:54:05,147 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-20 16:54:05,151 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-20 16:54:05,181 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-20 16:54:05,182 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-20 16:54:05,184 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-20 16:54:05,187 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-20 16:54:05,192 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-20 16:54:05,193 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-20 16:54:05,195 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-20 16:54:05,195 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-20 16:54:05,196 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-20 16:54:05,197 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-20 16:54:05,199 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-20 16:54:05,200 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-20 16:54:05,201 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-20 16:54:05,201 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-20 16:54:05,205 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-20 16:54:05,212 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-20 16:54:05,218 INFO L200 MainTranslator]: Completed pre-run [2024-11-20 16:54:05,299 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-20 16:54:05,368 INFO L204 MainTranslator]: Completed translation [2024-11-20 16:54:05,368 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 04:54:05 WrapperNode [2024-11-20 16:54:05,369 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-20 16:54:05,370 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-20 16:54:05,370 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-20 16:54:05,370 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-20 16:54:05,377 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 04:54:05" (1/1) ... [2024-11-20 16:54:05,427 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 04:54:05" (1/1) ... [2024-11-20 16:54:05,512 INFO L138 Inliner]: procedures = 179, calls = 435, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 1498 [2024-11-20 16:54:05,513 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-20 16:54:05,513 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-20 16:54:05,515 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-20 16:54:05,515 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-20 16:54:05,525 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 04:54:05" (1/1) ... [2024-11-20 16:54:05,526 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 04:54:05" (1/1) ... [2024-11-20 16:54:05,543 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 04:54:05" (1/1) ... [2024-11-20 16:54:05,701 INFO L175 MemorySlicer]: Split 403 memory accesses to 2 slices as follows [2, 401]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0]. The 98 writes are split as follows [0, 98]. [2024-11-20 16:54:05,703 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 04:54:05" (1/1) ... [2024-11-20 16:54:05,704 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 04:54:05" (1/1) ... [2024-11-20 16:54:05,757 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 04:54:05" (1/1) ... [2024-11-20 16:54:05,773 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 04:54:05" (1/1) ... [2024-11-20 16:54:05,783 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 04:54:05" (1/1) ... [2024-11-20 16:54:05,799 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 04:54:05" (1/1) ... [2024-11-20 16:54:05,812 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-20 16:54:05,815 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-20 16:54:05,816 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-20 16:54:05,816 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-20 16:54:05,816 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 04:54:05" (1/1) ... [2024-11-20 16:54:05,822 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-20 16:54:05,833 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 16:54:05,850 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-20 16:54:05,853 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-20 16:54:05,888 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#0 [2024-11-20 16:54:05,889 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#1 [2024-11-20 16:54:05,889 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#0 [2024-11-20 16:54:05,889 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#1 [2024-11-20 16:54:05,889 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2024-11-20 16:54:05,890 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2024-11-20 16:54:05,890 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#0 [2024-11-20 16:54:05,890 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#1 [2024-11-20 16:54:05,890 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#0 [2024-11-20 16:54:05,890 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#1 [2024-11-20 16:54:05,890 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-11-20 16:54:05,891 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-20 16:54:05,891 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2024-11-20 16:54:05,891 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2024-11-20 16:54:05,892 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2024-11-20 16:54:05,892 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2024-11-20 16:54:05,892 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-20 16:54:05,892 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#0 [2024-11-20 16:54:05,893 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#1 [2024-11-20 16:54:05,893 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-20 16:54:05,894 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2024-11-20 16:54:05,894 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-20 16:54:05,894 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-20 16:54:06,154 INFO L238 CfgBuilder]: Building ICFG [2024-11-20 16:54:06,156 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-20 16:54:06,160 WARN L781 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2024-11-20 16:54:06,213 WARN L781 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2024-11-20 16:54:11,043 INFO L? ?]: Removed 1749 outVars from TransFormulas that were not future-live. [2024-11-20 16:54:11,044 INFO L287 CfgBuilder]: Performing block encoding [2024-11-20 16:54:11,082 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-20 16:54:11,082 INFO L316 CfgBuilder]: Removed 77 assume(true) statements. [2024-11-20 16:54:11,083 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 04:54:11 BoogieIcfgContainer [2024-11-20 16:54:11,083 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-20 16:54:11,085 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-20 16:54:11,085 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-20 16:54:11,088 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-20 16:54:11,088 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.11 04:54:04" (1/3) ... [2024-11-20 16:54:11,089 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@70f4bc37 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 04:54:11, skipping insertion in model container [2024-11-20 16:54:11,089 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 04:54:05" (2/3) ... [2024-11-20 16:54:11,089 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@70f4bc37 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 04:54:11, skipping insertion in model container [2024-11-20 16:54:11,089 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 04:54:11" (3/3) ... [2024-11-20 16:54:11,090 INFO L112 eAbstractionObserver]: Analyzing ICFG uthash_BER_test4-3.i [2024-11-20 16:54:11,107 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-20 16:54:11,108 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 831 error locations. [2024-11-20 16:54:11,188 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-20 16:54:11,195 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;@25e8d62b, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-20 16:54:11,196 INFO L334 AbstractCegarLoop]: Starting to check reachability of 831 error locations. [2024-11-20 16:54:11,206 INFO L276 IsEmpty]: Start isEmpty. Operand has 1631 states, 787 states have (on average 2.2566709021601015) internal successors, (1776), 1622 states have internal predecessors, (1776), 16 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 7 states have call predecessors, (16), 16 states have call successors, (16) [2024-11-20 16:54:11,211 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2024-11-20 16:54:11,211 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 16:54:11,212 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2024-11-20 16:54:11,213 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 828 more)] === [2024-11-20 16:54:11,218 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 16:54:11,218 INFO L85 PathProgramCache]: Analyzing trace with hash 45876316, now seen corresponding path program 1 times [2024-11-20 16:54:11,229 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-20 16:54:11,229 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1381290192] [2024-11-20 16:54:11,230 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 16:54:11,230 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-11-20 16:54:11,230 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-20 16:54:11,232 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-20 16:54:11,244 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2024-11-20 16:54:11,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 16:54:11,435 INFO L255 TraceCheckSpWp]: Trace formula consists of 29 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-20 16:54:11,444 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 16:54:11,493 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-11-20 16:54:11,508 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-20 16:54:11,509 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-20 16:54:11,509 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-20 16:54:11,510 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1381290192] [2024-11-20 16:54:11,510 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1381290192] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 16:54:11,511 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 16:54:11,511 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-20 16:54:11,512 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [387413796] [2024-11-20 16:54:11,513 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 16:54:11,517 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-20 16:54:11,517 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-20 16:54:11,572 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-20 16:54:11,577 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-20 16:54:11,585 INFO L87 Difference]: Start difference. First operand has 1631 states, 787 states have (on average 2.2566709021601015) internal successors, (1776), 1622 states have internal predecessors, (1776), 16 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 7 states have call predecessors, (16), 16 states have call successors, (16) Second operand has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 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-11-20 16:54:13,761 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 16:54:13,761 INFO L93 Difference]: Finished difference Result 1520 states and 1612 transitions. [2024-11-20 16:54:13,763 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-20 16:54:13,764 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 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 5 [2024-11-20 16:54:13,764 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 16:54:13,781 INFO L225 Difference]: With dead ends: 1520 [2024-11-20 16:54:13,781 INFO L226 Difference]: Without dead ends: 1518 [2024-11-20 16:54:13,783 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 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-11-20 16:54:13,785 INFO L432 NwaCegarLoop]: 998 mSDtfsCounter, 1042 mSDsluCounter, 208 mSDsCounter, 0 mSdLazyCounter, 948 mSolverCounterSat, 102 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1058 SdHoareTripleChecker+Valid, 1206 SdHoareTripleChecker+Invalid, 1050 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 102 IncrementalHoareTripleChecker+Valid, 948 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2024-11-20 16:54:13,786 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1058 Valid, 1206 Invalid, 1050 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [102 Valid, 948 Invalid, 0 Unknown, 0 Unchecked, 2.1s Time] [2024-11-20 16:54:13,806 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1518 states. [2024-11-20 16:54:13,874 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1518 to 1516. [2024-11-20 16:54:13,878 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1516 states, 777 states have (on average 2.027027027027027) internal successors, (1575), 1507 states have internal predecessors, (1575), 16 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 7 states have call predecessors, (16), 16 states have call successors, (16) [2024-11-20 16:54:13,883 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1516 states to 1516 states and 1607 transitions. [2024-11-20 16:54:13,885 INFO L78 Accepts]: Start accepts. Automaton has 1516 states and 1607 transitions. Word has length 5 [2024-11-20 16:54:13,885 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 16:54:13,885 INFO L471 AbstractCegarLoop]: Abstraction has 1516 states and 1607 transitions. [2024-11-20 16:54:13,885 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 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-11-20 16:54:13,886 INFO L276 IsEmpty]: Start isEmpty. Operand 1516 states and 1607 transitions. [2024-11-20 16:54:13,886 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2024-11-20 16:54:13,886 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 16:54:13,886 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2024-11-20 16:54:13,890 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2024-11-20 16:54:14,089 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-20 16:54:14,089 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 828 more)] === [2024-11-20 16:54:14,090 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 16:54:14,090 INFO L85 PathProgramCache]: Analyzing trace with hash 45876317, now seen corresponding path program 1 times [2024-11-20 16:54:14,091 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-20 16:54:14,091 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1503272046] [2024-11-20 16:54:14,091 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 16:54:14,091 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-11-20 16:54:14,091 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-20 16:54:14,093 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-20 16:54:14,094 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2024-11-20 16:54:14,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 16:54:14,226 INFO L255 TraceCheckSpWp]: Trace formula consists of 29 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-20 16:54:14,228 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 16:54:14,240 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-11-20 16:54:14,264 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-20 16:54:14,264 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-20 16:54:14,264 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-20 16:54:14,264 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1503272046] [2024-11-20 16:54:14,265 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1503272046] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 16:54:14,265 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 16:54:14,265 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-20 16:54:14,265 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [574915497] [2024-11-20 16:54:14,265 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 16:54:14,266 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-20 16:54:14,266 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-20 16:54:14,267 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-20 16:54:14,267 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-20 16:54:14,267 INFO L87 Difference]: Start difference. First operand 1516 states and 1607 transitions. Second operand has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 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-11-20 16:54:16,710 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 16:54:16,710 INFO L93 Difference]: Finished difference Result 1836 states and 1947 transitions. [2024-11-20 16:54:16,710 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-20 16:54:16,710 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 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 5 [2024-11-20 16:54:16,710 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 16:54:16,716 INFO L225 Difference]: With dead ends: 1836 [2024-11-20 16:54:16,717 INFO L226 Difference]: Without dead ends: 1836 [2024-11-20 16:54:16,717 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 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-11-20 16:54:16,718 INFO L432 NwaCegarLoop]: 1362 mSDtfsCounter, 522 mSDsluCounter, 682 mSDsCounter, 0 mSdLazyCounter, 975 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 522 SdHoareTripleChecker+Valid, 2044 SdHoareTripleChecker+Invalid, 1000 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 975 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2024-11-20 16:54:16,719 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [522 Valid, 2044 Invalid, 1000 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 975 Invalid, 0 Unknown, 0 Unchecked, 2.4s Time] [2024-11-20 16:54:16,722 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1836 states. [2024-11-20 16:54:16,760 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1836 to 1683. [2024-11-20 16:54:16,762 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1683 states, 954 states have (on average 1.9863731656184487) internal successors, (1895), 1674 states have internal predecessors, (1895), 16 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 7 states have call predecessors, (16), 16 states have call successors, (16) [2024-11-20 16:54:16,770 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1683 states to 1683 states and 1927 transitions. [2024-11-20 16:54:16,771 INFO L78 Accepts]: Start accepts. Automaton has 1683 states and 1927 transitions. Word has length 5 [2024-11-20 16:54:16,771 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 16:54:16,771 INFO L471 AbstractCegarLoop]: Abstraction has 1683 states and 1927 transitions. [2024-11-20 16:54:16,771 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 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-11-20 16:54:16,771 INFO L276 IsEmpty]: Start isEmpty. Operand 1683 states and 1927 transitions. [2024-11-20 16:54:16,772 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2024-11-20 16:54:16,772 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 16:54:16,772 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2024-11-20 16:54:16,776 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Ended with exit code 0 [2024-11-20 16:54:16,975 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-20 16:54:16,975 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr620REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 828 more)] === [2024-11-20 16:54:16,976 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 16:54:16,980 INFO L85 PathProgramCache]: Analyzing trace with hash 1423825295, now seen corresponding path program 1 times [2024-11-20 16:54:16,980 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-20 16:54:16,981 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2119642374] [2024-11-20 16:54:16,981 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 16:54:16,981 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-20 16:54:16,981 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-20 16:54:16,984 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-20 16:54:16,986 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2024-11-20 16:54:17,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 16:54:17,119 INFO L255 TraceCheckSpWp]: Trace formula consists of 23 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-20 16:54:17,121 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 16:54:17,136 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-20 16:54:17,136 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-20 16:54:17,136 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-20 16:54:17,136 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2119642374] [2024-11-20 16:54:17,136 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2119642374] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 16:54:17,136 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 16:54:17,137 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-20 16:54:17,137 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [635758704] [2024-11-20 16:54:17,137 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 16:54:17,137 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-20 16:54:17,137 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-20 16:54:17,138 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-20 16:54:17,138 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-20 16:54:17,138 INFO L87 Difference]: Start difference. First operand 1683 states and 1927 transitions. Second operand has 3 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-11-20 16:54:17,216 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 16:54:17,216 INFO L93 Difference]: Finished difference Result 2935 states and 3384 transitions. [2024-11-20 16:54:17,220 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-20 16:54:17,220 INFO L78 Accepts]: Start accepts. Automaton has has 3 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-11-20 16:54:17,221 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 16:54:17,231 INFO L225 Difference]: With dead ends: 2935 [2024-11-20 16:54:17,231 INFO L226 Difference]: Without dead ends: 2935 [2024-11-20 16:54:17,231 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 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-11-20 16:54:17,235 INFO L432 NwaCegarLoop]: 2080 mSDtfsCounter, 1114 mSDsluCounter, 1592 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1120 SdHoareTripleChecker+Valid, 3672 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-20 16:54:17,236 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1120 Valid, 3672 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-20 16:54:17,242 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2935 states. [2024-11-20 16:54:17,277 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2935 to 1684. [2024-11-20 16:54:17,279 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1684 states, 955 states have (on average 1.9853403141361257) internal successors, (1896), 1675 states have internal predecessors, (1896), 16 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 7 states have call predecessors, (16), 16 states have call successors, (16) [2024-11-20 16:54:17,285 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1684 states to 1684 states and 1928 transitions. [2024-11-20 16:54:17,286 INFO L78 Accepts]: Start accepts. Automaton has 1684 states and 1928 transitions. Word has length 6 [2024-11-20 16:54:17,286 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 16:54:17,286 INFO L471 AbstractCegarLoop]: Abstraction has 1684 states and 1928 transitions. [2024-11-20 16:54:17,286 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 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-11-20 16:54:17,286 INFO L276 IsEmpty]: Start isEmpty. Operand 1684 states and 1928 transitions. [2024-11-20 16:54:17,287 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2024-11-20 16:54:17,287 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 16:54:17,287 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 16:54:17,291 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Ended with exit code 0 [2024-11-20 16:54:17,488 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-20 16:54:17,489 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 828 more)] === [2024-11-20 16:54:17,489 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 16:54:17,490 INFO L85 PathProgramCache]: Analyzing trace with hash -1344610650, now seen corresponding path program 1 times [2024-11-20 16:54:17,491 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-20 16:54:17,491 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1299046398] [2024-11-20 16:54:17,493 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 16:54:17,493 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-11-20 16:54:17,493 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-20 16:54:17,496 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-20 16:54:17,499 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2024-11-20 16:54:17,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 16:54:17,661 INFO L255 TraceCheckSpWp]: Trace formula consists of 82 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-20 16:54:17,663 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 16:54:17,676 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-20 16:54:17,676 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-20 16:54:17,676 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-20 16:54:17,676 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1299046398] [2024-11-20 16:54:17,678 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1299046398] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 16:54:17,678 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 16:54:17,678 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-20 16:54:17,678 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1450943074] [2024-11-20 16:54:17,680 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 16:54:17,680 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-20 16:54:17,680 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-20 16:54:17,681 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-20 16:54:17,681 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-20 16:54:17,681 INFO L87 Difference]: Start difference. First operand 1684 states and 1928 transitions. Second operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-20 16:54:17,724 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 16:54:17,725 INFO L93 Difference]: Finished difference Result 1642 states and 1885 transitions. [2024-11-20 16:54:17,725 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-20 16:54:17,725 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2024-11-20 16:54:17,725 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 16:54:17,732 INFO L225 Difference]: With dead ends: 1642 [2024-11-20 16:54:17,732 INFO L226 Difference]: Without dead ends: 1642 [2024-11-20 16:54:17,732 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-20 16:54:17,734 INFO L432 NwaCegarLoop]: 1542 mSDtfsCounter, 71 mSDsluCounter, 1479 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 71 SdHoareTripleChecker+Valid, 3021 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-20 16:54:17,736 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [71 Valid, 3021 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-20 16:54:17,739 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1642 states. [2024-11-20 16:54:17,781 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1642 to 1642. [2024-11-20 16:54:17,784 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1642 states, 937 states have (on average 1.9775880469583778) internal successors, (1853), 1633 states have internal predecessors, (1853), 16 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 7 states have call predecessors, (16), 16 states have call successors, (16) [2024-11-20 16:54:17,790 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1642 states to 1642 states and 1885 transitions. [2024-11-20 16:54:17,790 INFO L78 Accepts]: Start accepts. Automaton has 1642 states and 1885 transitions. Word has length 11 [2024-11-20 16:54:17,791 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 16:54:17,791 INFO L471 AbstractCegarLoop]: Abstraction has 1642 states and 1885 transitions. [2024-11-20 16:54:17,791 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-20 16:54:17,791 INFO L276 IsEmpty]: Start isEmpty. Operand 1642 states and 1885 transitions. [2024-11-20 16:54:17,792 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2024-11-20 16:54:17,792 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 16:54:17,792 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 16:54:17,798 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Ended with exit code 0 [2024-11-20 16:54:17,992 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-20 16:54:17,993 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr28REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 828 more)] === [2024-11-20 16:54:17,993 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 16:54:17,993 INFO L85 PathProgramCache]: Analyzing trace with hash 614317568, now seen corresponding path program 1 times [2024-11-20 16:54:17,994 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-20 16:54:17,994 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1739864786] [2024-11-20 16:54:17,994 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 16:54:17,994 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-20 16:54:17,994 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-20 16:54:17,996 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-20 16:54:17,997 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2024-11-20 16:54:18,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 16:54:18,193 INFO L255 TraceCheckSpWp]: Trace formula consists of 85 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-20 16:54:18,195 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 16:54:18,221 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-20 16:54:18,221 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-20 16:54:18,222 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-20 16:54:18,222 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1739864786] [2024-11-20 16:54:18,223 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1739864786] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 16:54:18,223 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 16:54:18,223 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-20 16:54:18,224 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1699055282] [2024-11-20 16:54:18,224 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 16:54:18,224 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-20 16:54:18,224 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-20 16:54:18,225 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-20 16:54:18,225 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-20 16:54:18,225 INFO L87 Difference]: Start difference. First operand 1642 states and 1885 transitions. Second operand has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-20 16:54:18,338 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 16:54:18,338 INFO L93 Difference]: Finished difference Result 1620 states and 1856 transitions. [2024-11-20 16:54:18,340 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-20 16:54:18,341 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2024-11-20 16:54:18,342 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 16:54:18,349 INFO L225 Difference]: With dead ends: 1620 [2024-11-20 16:54:18,349 INFO L226 Difference]: Without dead ends: 1620 [2024-11-20 16:54:18,349 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 10 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-11-20 16:54:18,350 INFO L432 NwaCegarLoop]: 1497 mSDtfsCounter, 48 mSDsluCounter, 2968 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 48 SdHoareTripleChecker+Valid, 4465 SdHoareTripleChecker+Invalid, 59 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-20 16:54:18,350 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [48 Valid, 4465 Invalid, 59 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-20 16:54:18,353 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1620 states. [2024-11-20 16:54:18,375 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1620 to 1620. [2024-11-20 16:54:18,377 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1620 states, 929 states have (on average 1.9634015069967707) internal successors, (1824), 1611 states have internal predecessors, (1824), 16 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 7 states have call predecessors, (16), 16 states have call successors, (16) [2024-11-20 16:54:18,382 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1620 states to 1620 states and 1856 transitions. [2024-11-20 16:54:18,382 INFO L78 Accepts]: Start accepts. Automaton has 1620 states and 1856 transitions. Word has length 13 [2024-11-20 16:54:18,383 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 16:54:18,383 INFO L471 AbstractCegarLoop]: Abstraction has 1620 states and 1856 transitions. [2024-11-20 16:54:18,383 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-20 16:54:18,383 INFO L276 IsEmpty]: Start isEmpty. Operand 1620 states and 1856 transitions. [2024-11-20 16:54:18,384 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2024-11-20 16:54:18,384 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 16:54:18,384 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] [2024-11-20 16:54:18,390 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Forceful destruction successful, exit code 0 [2024-11-20 16:54:18,584 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-20 16:54:18,585 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr42REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 828 more)] === [2024-11-20 16:54:18,585 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 16:54:18,585 INFO L85 PathProgramCache]: Analyzing trace with hash -957630610, now seen corresponding path program 1 times [2024-11-20 16:54:18,586 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-20 16:54:18,586 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [143738528] [2024-11-20 16:54:18,586 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 16:54:18,586 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-11-20 16:54:18,586 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-20 16:54:18,587 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-20 16:54:18,588 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2024-11-20 16:54:18,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 16:54:18,748 INFO L255 TraceCheckSpWp]: Trace formula consists of 99 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-20 16:54:18,750 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 16:54:18,754 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-11-20 16:54:18,820 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-20 16:54:18,821 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-20 16:54:18,821 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-20 16:54:18,821 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [143738528] [2024-11-20 16:54:18,821 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [143738528] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 16:54:18,821 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 16:54:18,821 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-20 16:54:18,821 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1901860687] [2024-11-20 16:54:18,821 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 16:54:18,822 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-20 16:54:18,822 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-20 16:54:18,822 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-20 16:54:18,822 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-20 16:54:18,822 INFO L87 Difference]: Start difference. First operand 1620 states and 1856 transitions. Second operand has 4 states, 3 states have (on average 9.0) internal successors, (27), 4 states have internal predecessors, (27), 0 states have call successors, (0), 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-11-20 16:54:20,973 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 16:54:20,973 INFO L93 Difference]: Finished difference Result 1620 states and 1856 transitions. [2024-11-20 16:54:20,973 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-20 16:54:20,973 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 9.0) internal successors, (27), 4 states have internal predecessors, (27), 0 states have call successors, (0), 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 27 [2024-11-20 16:54:20,974 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 16:54:20,979 INFO L225 Difference]: With dead ends: 1620 [2024-11-20 16:54:20,979 INFO L226 Difference]: Without dead ends: 1620 [2024-11-20 16:54:20,979 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 24 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-11-20 16:54:20,980 INFO L432 NwaCegarLoop]: 950 mSDtfsCounter, 979 mSDsluCounter, 884 mSDsCounter, 0 mSdLazyCounter, 1692 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 995 SdHoareTripleChecker+Valid, 1834 SdHoareTripleChecker+Invalid, 1704 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 1692 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2024-11-20 16:54:20,982 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [995 Valid, 1834 Invalid, 1704 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 1692 Invalid, 0 Unknown, 0 Unchecked, 2.1s Time] [2024-11-20 16:54:20,985 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1620 states. [2024-11-20 16:54:21,003 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1620 to 1616. [2024-11-20 16:54:21,005 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1616 states, 929 states have (on average 1.9590958019375673) internal successors, (1820), 1607 states have internal predecessors, (1820), 16 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 7 states have call predecessors, (16), 16 states have call successors, (16) [2024-11-20 16:54:21,009 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1616 states to 1616 states and 1852 transitions. [2024-11-20 16:54:21,009 INFO L78 Accepts]: Start accepts. Automaton has 1616 states and 1852 transitions. Word has length 27 [2024-11-20 16:54:21,010 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 16:54:21,010 INFO L471 AbstractCegarLoop]: Abstraction has 1616 states and 1852 transitions. [2024-11-20 16:54:21,010 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 9.0) internal successors, (27), 4 states have internal predecessors, (27), 0 states have call successors, (0), 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-11-20 16:54:21,010 INFO L276 IsEmpty]: Start isEmpty. Operand 1616 states and 1852 transitions. [2024-11-20 16:54:21,011 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2024-11-20 16:54:21,011 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 16:54:21,012 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] [2024-11-20 16:54:21,016 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Ended with exit code 0 [2024-11-20 16:54:21,212 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-20 16:54:21,212 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr43REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 828 more)] === [2024-11-20 16:54:21,213 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 16:54:21,213 INFO L85 PathProgramCache]: Analyzing trace with hash -957630609, now seen corresponding path program 1 times [2024-11-20 16:54:21,214 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-20 16:54:21,214 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1724446699] [2024-11-20 16:54:21,214 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 16:54:21,214 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-11-20 16:54:21,214 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-20 16:54:21,217 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-20 16:54:21,218 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Waiting until timeout for monitored process [2024-11-20 16:54:21,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 16:54:21,382 INFO L255 TraceCheckSpWp]: Trace formula consists of 99 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-20 16:54:21,386 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 16:54:21,397 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-11-20 16:54:21,588 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-20 16:54:21,588 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-20 16:54:21,589 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-20 16:54:21,589 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1724446699] [2024-11-20 16:54:21,589 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1724446699] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 16:54:21,589 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 16:54:21,589 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-20 16:54:21,589 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [823561883] [2024-11-20 16:54:21,589 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 16:54:21,589 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-20 16:54:21,589 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-20 16:54:21,590 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-20 16:54:21,590 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-20 16:54:21,590 INFO L87 Difference]: Start difference. First operand 1616 states and 1852 transitions. Second operand has 4 states, 3 states have (on average 9.0) internal successors, (27), 4 states have internal predecessors, (27), 0 states have call successors, (0), 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-11-20 16:54:24,540 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 16:54:24,540 INFO L93 Difference]: Finished difference Result 1769 states and 1872 transitions. [2024-11-20 16:54:24,540 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-20 16:54:24,540 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 9.0) internal successors, (27), 4 states have internal predecessors, (27), 0 states have call successors, (0), 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 27 [2024-11-20 16:54:24,540 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 16:54:24,545 INFO L225 Difference]: With dead ends: 1769 [2024-11-20 16:54:24,545 INFO L226 Difference]: Without dead ends: 1769 [2024-11-20 16:54:24,546 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 24 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-11-20 16:54:24,546 INFO L432 NwaCegarLoop]: 1316 mSDtfsCounter, 455 mSDsluCounter, 1409 mSDsCounter, 0 mSdLazyCounter, 1683 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 455 SdHoareTripleChecker+Valid, 2725 SdHoareTripleChecker+Invalid, 1686 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 1683 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.9s IncrementalHoareTripleChecker+Time [2024-11-20 16:54:24,546 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [455 Valid, 2725 Invalid, 1686 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 1683 Invalid, 0 Unknown, 0 Unchecked, 2.9s Time] [2024-11-20 16:54:24,549 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1769 states. [2024-11-20 16:54:24,567 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1769 to 1612. [2024-11-20 16:54:24,569 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1612 states, 929 states have (on average 1.9547900968783638) internal successors, (1816), 1603 states have internal predecessors, (1816), 16 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 7 states have call predecessors, (16), 16 states have call successors, (16) [2024-11-20 16:54:24,573 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1612 states to 1612 states and 1848 transitions. [2024-11-20 16:54:24,573 INFO L78 Accepts]: Start accepts. Automaton has 1612 states and 1848 transitions. Word has length 27 [2024-11-20 16:54:24,573 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 16:54:24,574 INFO L471 AbstractCegarLoop]: Abstraction has 1612 states and 1848 transitions. [2024-11-20 16:54:24,574 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 9.0) internal successors, (27), 4 states have internal predecessors, (27), 0 states have call successors, (0), 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-11-20 16:54:24,574 INFO L276 IsEmpty]: Start isEmpty. Operand 1612 states and 1848 transitions. [2024-11-20 16:54:24,575 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2024-11-20 16:54:24,575 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 16:54:24,575 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] [2024-11-20 16:54:24,581 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Forceful destruction successful, exit code 0 [2024-11-20 16:54:24,775 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-20 16:54:24,776 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr107REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 828 more)] === [2024-11-20 16:54:24,776 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 16:54:24,777 INFO L85 PathProgramCache]: Analyzing trace with hash -3860248, now seen corresponding path program 1 times [2024-11-20 16:54:24,777 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-20 16:54:24,777 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2129667500] [2024-11-20 16:54:24,777 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 16:54:24,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-11-20 16:54:24,777 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-20 16:54:24,778 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-20 16:54:24,779 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Waiting until timeout for monitored process [2024-11-20 16:54:24,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 16:54:24,982 INFO L255 TraceCheckSpWp]: Trace formula consists of 171 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-20 16:54:24,984 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 16:54:25,018 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-20 16:54:25,019 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-20 16:54:25,019 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-20 16:54:25,019 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2129667500] [2024-11-20 16:54:25,019 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2129667500] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 16:54:25,020 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 16:54:25,020 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-20 16:54:25,020 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [119577490] [2024-11-20 16:54:25,020 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 16:54:25,020 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-20 16:54:25,020 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-20 16:54:25,021 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-20 16:54:25,021 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-20 16:54:25,021 INFO L87 Difference]: Start difference. First operand 1612 states and 1848 transitions. Second operand has 4 states, 4 states have (on average 10.75) internal successors, (43), 4 states have internal predecessors, (43), 0 states have call successors, (0), 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-11-20 16:54:25,082 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 16:54:25,082 INFO L93 Difference]: Finished difference Result 1606 states and 1838 transitions. [2024-11-20 16:54:25,083 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-20 16:54:25,083 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 10.75) internal successors, (43), 4 states have internal predecessors, (43), 0 states have call successors, (0), 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 43 [2024-11-20 16:54:25,086 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 16:54:25,090 INFO L225 Difference]: With dead ends: 1606 [2024-11-20 16:54:25,090 INFO L226 Difference]: Without dead ends: 1606 [2024-11-20 16:54:25,090 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 40 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-11-20 16:54:25,091 INFO L432 NwaCegarLoop]: 1491 mSDtfsCounter, 21 mSDsluCounter, 2951 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 4442 SdHoareTripleChecker+Invalid, 44 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-20 16:54:25,091 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 4442 Invalid, 44 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-20 16:54:25,094 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1606 states. [2024-11-20 16:54:25,110 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1606 to 1606. [2024-11-20 16:54:25,112 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1606 states, 923 states have (on average 1.9566630552546045) internal successors, (1806), 1597 states have internal predecessors, (1806), 16 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 7 states have call predecessors, (16), 16 states have call successors, (16) [2024-11-20 16:54:25,117 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1606 states to 1606 states and 1838 transitions. [2024-11-20 16:54:25,117 INFO L78 Accepts]: Start accepts. Automaton has 1606 states and 1838 transitions. Word has length 43 [2024-11-20 16:54:25,117 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 16:54:25,118 INFO L471 AbstractCegarLoop]: Abstraction has 1606 states and 1838 transitions. [2024-11-20 16:54:25,118 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.75) internal successors, (43), 4 states have internal predecessors, (43), 0 states have call successors, (0), 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-11-20 16:54:25,118 INFO L276 IsEmpty]: Start isEmpty. Operand 1606 states and 1838 transitions. [2024-11-20 16:54:25,119 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2024-11-20 16:54:25,120 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 16:54:25,120 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 16:54:25,127 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Ended with exit code 0 [2024-11-20 16:54:25,320 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-20 16:54:25,321 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr107REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 828 more)] === [2024-11-20 16:54:25,321 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 16:54:25,322 INFO L85 PathProgramCache]: Analyzing trace with hash 168131124, now seen corresponding path program 1 times [2024-11-20 16:54:25,322 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-20 16:54:25,322 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1587872439] [2024-11-20 16:54:25,322 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 16:54:25,322 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-11-20 16:54:25,322 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-20 16:54:25,323 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-20 16:54:25,325 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Waiting until timeout for monitored process [2024-11-20 16:54:25,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 16:54:25,539 INFO L255 TraceCheckSpWp]: Trace formula consists of 195 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-20 16:54:25,542 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 16:54:25,791 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-20 16:54:25,791 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-20 16:54:25,791 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-20 16:54:25,792 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1587872439] [2024-11-20 16:54:25,792 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1587872439] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 16:54:25,792 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 16:54:25,792 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-20 16:54:25,792 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [297084308] [2024-11-20 16:54:25,792 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 16:54:25,793 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-20 16:54:25,793 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-20 16:54:25,794 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-20 16:54:25,794 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-20 16:54:25,795 INFO L87 Difference]: Start difference. First operand 1606 states and 1838 transitions. Second operand has 3 states, 3 states have (on average 17.0) internal successors, (51), 3 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-20 16:54:25,935 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 16:54:25,935 INFO L93 Difference]: Finished difference Result 2004 states and 2273 transitions. [2024-11-20 16:54:25,936 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-20 16:54:25,936 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 17.0) internal successors, (51), 3 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 51 [2024-11-20 16:54:25,936 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 16:54:25,941 INFO L225 Difference]: With dead ends: 2004 [2024-11-20 16:54:25,941 INFO L226 Difference]: Without dead ends: 2004 [2024-11-20 16:54:25,941 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 49 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-20 16:54:25,942 INFO L432 NwaCegarLoop]: 1577 mSDtfsCounter, 366 mSDsluCounter, 1440 mSDsCounter, 0 mSdLazyCounter, 104 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 366 SdHoareTripleChecker+Valid, 3017 SdHoareTripleChecker+Invalid, 106 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 104 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-20 16:54:25,942 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [366 Valid, 3017 Invalid, 106 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 104 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-20 16:54:25,944 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2004 states. [2024-11-20 16:54:25,971 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2004 to 1653. [2024-11-20 16:54:25,973 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1653 states, 970 states have (on average 1.9103092783505156) internal successors, (1853), 1644 states have internal predecessors, (1853), 16 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 7 states have call predecessors, (16), 16 states have call successors, (16) [2024-11-20 16:54:25,977 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1653 states to 1653 states and 1885 transitions. [2024-11-20 16:54:25,977 INFO L78 Accepts]: Start accepts. Automaton has 1653 states and 1885 transitions. Word has length 51 [2024-11-20 16:54:25,978 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 16:54:25,978 INFO L471 AbstractCegarLoop]: Abstraction has 1653 states and 1885 transitions. [2024-11-20 16:54:25,978 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 17.0) internal successors, (51), 3 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-20 16:54:25,978 INFO L276 IsEmpty]: Start isEmpty. Operand 1653 states and 1885 transitions. [2024-11-20 16:54:25,979 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2024-11-20 16:54:25,979 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 16:54:25,979 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 16:54:25,987 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Ended with exit code 0 [2024-11-20 16:54:26,179 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-20 16:54:26,180 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr61REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 828 more)] === [2024-11-20 16:54:26,180 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 16:54:26,180 INFO L85 PathProgramCache]: Analyzing trace with hash 754975115, now seen corresponding path program 1 times [2024-11-20 16:54:26,181 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-20 16:54:26,181 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [773599332] [2024-11-20 16:54:26,181 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 16:54:26,181 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-11-20 16:54:26,181 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-20 16:54:26,184 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-20 16:54:26,185 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Waiting until timeout for monitored process [2024-11-20 16:54:26,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 16:54:26,473 INFO L255 TraceCheckSpWp]: Trace formula consists of 230 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-20 16:54:26,477 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 16:54:26,490 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-11-20 16:54:26,500 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-11-20 16:54:27,009 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-20 16:54:27,010 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-11-20 16:54:27,027 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2024-11-20 16:54:27,028 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-11-20 16:54:27,042 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-20 16:54:27,043 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-20 16:54:27,043 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-20 16:54:27,043 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [773599332] [2024-11-20 16:54:27,043 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [773599332] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 16:54:27,043 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 16:54:27,043 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-20 16:54:27,044 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [94516484] [2024-11-20 16:54:27,044 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 16:54:27,044 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-20 16:54:27,044 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-20 16:54:27,045 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-20 16:54:27,045 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-20 16:54:27,045 INFO L87 Difference]: Start difference. First operand 1653 states and 1885 transitions. Second operand has 4 states, 3 states have (on average 18.0) internal successors, (54), 4 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-20 16:54:29,177 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 16:54:29,178 INFO L93 Difference]: Finished difference Result 1569 states and 1801 transitions. [2024-11-20 16:54:29,178 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-20 16:54:29,178 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 18.0) internal successors, (54), 4 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 54 [2024-11-20 16:54:29,178 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 16:54:29,181 INFO L225 Difference]: With dead ends: 1569 [2024-11-20 16:54:29,181 INFO L226 Difference]: Without dead ends: 1569 [2024-11-20 16:54:29,182 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 51 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-20 16:54:29,182 INFO L432 NwaCegarLoop]: 759 mSDtfsCounter, 882 mSDsluCounter, 409 mSDsCounter, 0 mSdLazyCounter, 1212 mSolverCounterSat, 91 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 888 SdHoareTripleChecker+Valid, 1168 SdHoareTripleChecker+Invalid, 1303 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 91 IncrementalHoareTripleChecker+Valid, 1212 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2024-11-20 16:54:29,182 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [888 Valid, 1168 Invalid, 1303 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [91 Valid, 1212 Invalid, 0 Unknown, 0 Unchecked, 2.1s Time] [2024-11-20 16:54:29,184 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1569 states. [2024-11-20 16:54:29,196 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1569 to 1392. [2024-11-20 16:54:29,198 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1392 states, 793 states have (on average 1.814627994955864) internal successors, (1439), 1383 states have internal predecessors, (1439), 16 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 7 states have call predecessors, (16), 16 states have call successors, (16) [2024-11-20 16:54:29,201 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1392 states to 1392 states and 1471 transitions. [2024-11-20 16:54:29,201 INFO L78 Accepts]: Start accepts. Automaton has 1392 states and 1471 transitions. Word has length 54 [2024-11-20 16:54:29,201 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 16:54:29,201 INFO L471 AbstractCegarLoop]: Abstraction has 1392 states and 1471 transitions. [2024-11-20 16:54:29,201 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 18.0) internal successors, (54), 4 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-20 16:54:29,202 INFO L276 IsEmpty]: Start isEmpty. Operand 1392 states and 1471 transitions. [2024-11-20 16:54:29,202 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2024-11-20 16:54:29,202 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 16:54:29,202 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 16:54:29,213 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Forceful destruction successful, exit code 0 [2024-11-20 16:54:29,403 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-20 16:54:29,403 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr66REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 828 more)] === [2024-11-20 16:54:29,403 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 16:54:29,404 INFO L85 PathProgramCache]: Analyzing trace with hash -1572100217, now seen corresponding path program 1 times [2024-11-20 16:54:29,404 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-20 16:54:29,404 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2021391738] [2024-11-20 16:54:29,404 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 16:54:29,404 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-11-20 16:54:29,404 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-20 16:54:29,406 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-20 16:54:29,407 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (12)] Waiting until timeout for monitored process [2024-11-20 16:54:29,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 16:54:29,634 INFO L255 TraceCheckSpWp]: Trace formula consists of 257 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-20 16:54:29,637 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 16:54:29,648 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-11-20 16:54:29,663 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2024-11-20 16:54:29,684 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2024-11-20 16:54:29,694 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-20 16:54:29,694 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-20 16:54:29,694 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-20 16:54:29,695 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2021391738] [2024-11-20 16:54:29,695 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2021391738] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 16:54:29,695 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 16:54:29,695 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-20 16:54:29,695 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2147321406] [2024-11-20 16:54:29,695 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 16:54:29,696 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-20 16:54:29,696 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-20 16:54:29,696 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-20 16:54:29,696 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-20 16:54:29,697 INFO L87 Difference]: Start difference. First operand 1392 states and 1471 transitions. Second operand has 5 states, 4 states have (on average 14.75) internal successors, (59), 5 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-20 16:54:31,961 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 16:54:31,961 INFO L93 Difference]: Finished difference Result 1391 states and 1470 transitions. [2024-11-20 16:54:31,961 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-20 16:54:31,961 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 14.75) internal successors, (59), 5 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 59 [2024-11-20 16:54:31,961 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 16:54:31,965 INFO L225 Difference]: With dead ends: 1391 [2024-11-20 16:54:31,965 INFO L226 Difference]: Without dead ends: 1391 [2024-11-20 16:54:31,965 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 55 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-20 16:54:31,966 INFO L432 NwaCegarLoop]: 1418 mSDtfsCounter, 2 mSDsluCounter, 2191 mSDsCounter, 0 mSdLazyCounter, 2070 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 3609 SdHoareTripleChecker+Invalid, 2071 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 2070 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2024-11-20 16:54:31,966 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 3609 Invalid, 2071 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 2070 Invalid, 0 Unknown, 0 Unchecked, 2.2s Time] [2024-11-20 16:54:31,968 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1391 states. [2024-11-20 16:54:31,980 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1391 to 1391. [2024-11-20 16:54:31,981 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1391 states, 793 states have (on average 1.8133669609079446) internal successors, (1438), 1382 states have internal predecessors, (1438), 16 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 7 states have call predecessors, (16), 16 states have call successors, (16) [2024-11-20 16:54:31,983 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1391 states to 1391 states and 1470 transitions. [2024-11-20 16:54:31,983 INFO L78 Accepts]: Start accepts. Automaton has 1391 states and 1470 transitions. Word has length 59 [2024-11-20 16:54:31,984 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 16:54:31,984 INFO L471 AbstractCegarLoop]: Abstraction has 1391 states and 1470 transitions. [2024-11-20 16:54:31,984 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 14.75) internal successors, (59), 5 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-20 16:54:31,984 INFO L276 IsEmpty]: Start isEmpty. Operand 1391 states and 1470 transitions. [2024-11-20 16:54:31,984 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2024-11-20 16:54:31,985 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 16:54:31,985 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 16:54:31,992 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (12)] Ended with exit code 0 [2024-11-20 16:54:32,185 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-20 16:54:32,186 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr67REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 828 more)] === [2024-11-20 16:54:32,186 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 16:54:32,186 INFO L85 PathProgramCache]: Analyzing trace with hash -1572100216, now seen corresponding path program 1 times [2024-11-20 16:54:32,187 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-20 16:54:32,187 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [468813270] [2024-11-20 16:54:32,188 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 16:54:32,188 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-11-20 16:54:32,188 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-20 16:54:32,190 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-20 16:54:32,191 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (13)] Waiting until timeout for monitored process [2024-11-20 16:54:32,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 16:54:32,443 INFO L255 TraceCheckSpWp]: Trace formula consists of 257 conjuncts, 11 conjuncts are in the unsatisfiable core [2024-11-20 16:54:32,445 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 16:54:32,454 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-11-20 16:54:32,470 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2024-11-20 16:54:32,477 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2024-11-20 16:54:32,530 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 9 [2024-11-20 16:54:32,548 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-20 16:54:32,549 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-20 16:54:32,549 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-20 16:54:32,549 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [468813270] [2024-11-20 16:54:32,549 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [468813270] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 16:54:32,549 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 16:54:32,549 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-20 16:54:32,549 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2113779838] [2024-11-20 16:54:32,549 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 16:54:32,550 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-20 16:54:32,550 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-20 16:54:32,550 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-20 16:54:32,550 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-20 16:54:32,550 INFO L87 Difference]: Start difference. First operand 1391 states and 1470 transitions. Second operand has 5 states, 4 states have (on average 14.75) internal successors, (59), 5 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-20 16:54:35,319 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 16:54:35,319 INFO L93 Difference]: Finished difference Result 1390 states and 1469 transitions. [2024-11-20 16:54:35,319 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-20 16:54:35,320 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 14.75) internal successors, (59), 5 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 59 [2024-11-20 16:54:35,320 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 16:54:35,325 INFO L225 Difference]: With dead ends: 1390 [2024-11-20 16:54:35,326 INFO L226 Difference]: Without dead ends: 1390 [2024-11-20 16:54:35,326 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 55 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-20 16:54:35,327 INFO L432 NwaCegarLoop]: 1418 mSDtfsCounter, 1 mSDsluCounter, 2234 mSDsCounter, 0 mSdLazyCounter, 2024 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 3652 SdHoareTripleChecker+Invalid, 2025 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 2024 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.7s IncrementalHoareTripleChecker+Time [2024-11-20 16:54:35,328 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 3652 Invalid, 2025 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 2024 Invalid, 0 Unknown, 0 Unchecked, 2.7s Time] [2024-11-20 16:54:35,330 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1390 states. [2024-11-20 16:54:35,343 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1390 to 1390. [2024-11-20 16:54:35,344 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1390 states, 792 states have (on average 1.8143939393939394) internal successors, (1437), 1381 states have internal predecessors, (1437), 16 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 7 states have call predecessors, (16), 16 states have call successors, (16) [2024-11-20 16:54:35,347 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1390 states to 1390 states and 1469 transitions. [2024-11-20 16:54:35,347 INFO L78 Accepts]: Start accepts. Automaton has 1390 states and 1469 transitions. Word has length 59 [2024-11-20 16:54:35,348 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 16:54:35,348 INFO L471 AbstractCegarLoop]: Abstraction has 1390 states and 1469 transitions. [2024-11-20 16:54:35,348 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 14.75) internal successors, (59), 5 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-20 16:54:35,348 INFO L276 IsEmpty]: Start isEmpty. Operand 1390 states and 1469 transitions. [2024-11-20 16:54:35,349 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2024-11-20 16:54:35,350 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 16:54:35,350 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 16:54:35,358 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (13)] Ended with exit code 0 [2024-11-20 16:54:35,551 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-20 16:54:35,552 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr70REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 828 more)] === [2024-11-20 16:54:35,552 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 16:54:35,552 INFO L85 PathProgramCache]: Analyzing trace with hash -722605554, now seen corresponding path program 1 times [2024-11-20 16:54:35,553 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-20 16:54:35,553 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1498348078] [2024-11-20 16:54:35,553 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 16:54:35,554 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-11-20 16:54:35,554 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-20 16:54:35,556 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-20 16:54:35,557 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (14)] Waiting until timeout for monitored process [2024-11-20 16:54:35,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 16:54:35,807 INFO L255 TraceCheckSpWp]: Trace formula consists of 283 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-20 16:54:35,809 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 16:54:35,829 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-20 16:54:35,829 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-20 16:54:35,829 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-20 16:54:35,829 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1498348078] [2024-11-20 16:54:35,829 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1498348078] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 16:54:35,829 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 16:54:35,829 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-20 16:54:35,829 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [494026242] [2024-11-20 16:54:35,829 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 16:54:35,830 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-20 16:54:35,830 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-20 16:54:35,830 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-20 16:54:35,831 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-20 16:54:35,831 INFO L87 Difference]: Start difference. First operand 1390 states and 1469 transitions. Second operand has 4 states, 4 states have (on average 16.25) internal successors, (65), 4 states have internal predecessors, (65), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-20 16:54:35,869 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 16:54:35,869 INFO L93 Difference]: Finished difference Result 1393 states and 1474 transitions. [2024-11-20 16:54:35,869 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-20 16:54:35,870 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 16.25) internal successors, (65), 4 states have internal predecessors, (65), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 67 [2024-11-20 16:54:35,870 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 16:54:35,874 INFO L225 Difference]: With dead ends: 1393 [2024-11-20 16:54:35,874 INFO L226 Difference]: Without dead ends: 1393 [2024-11-20 16:54:35,874 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 64 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-20 16:54:35,875 INFO L432 NwaCegarLoop]: 1417 mSDtfsCounter, 0 mSDsluCounter, 2826 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 4243 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-20 16:54:35,875 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 4243 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-20 16:54:35,877 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1393 states. [2024-11-20 16:54:35,891 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1393 to 1393. [2024-11-20 16:54:35,893 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1393 states, 794 states have (on average 1.81360201511335) internal successors, (1440), 1384 states have internal predecessors, (1440), 16 states have call successors, (16), 2 states have call predecessors, (16), 3 states have return successors, (18), 7 states have call predecessors, (18), 16 states have call successors, (18) [2024-11-20 16:54:35,895 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1393 states to 1393 states and 1474 transitions. [2024-11-20 16:54:35,895 INFO L78 Accepts]: Start accepts. Automaton has 1393 states and 1474 transitions. Word has length 67 [2024-11-20 16:54:35,896 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 16:54:35,896 INFO L471 AbstractCegarLoop]: Abstraction has 1393 states and 1474 transitions. [2024-11-20 16:54:35,896 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 16.25) internal successors, (65), 4 states have internal predecessors, (65), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-20 16:54:35,896 INFO L276 IsEmpty]: Start isEmpty. Operand 1393 states and 1474 transitions. [2024-11-20 16:54:35,897 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2024-11-20 16:54:35,897 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 16:54:35,897 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 16:54:35,905 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (14)] Ended with exit code 0 [2024-11-20 16:54:36,097 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-20 16:54:36,098 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr70REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 828 more)] === [2024-11-20 16:54:36,098 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 16:54:36,099 INFO L85 PathProgramCache]: Analyzing trace with hash -608157043, now seen corresponding path program 1 times [2024-11-20 16:54:36,099 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-20 16:54:36,099 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [964772075] [2024-11-20 16:54:36,099 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 16:54:36,100 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-11-20 16:54:36,100 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-20 16:54:36,102 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-20 16:54:36,103 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (15)] Waiting until timeout for monitored process [2024-11-20 16:54:36,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 16:54:36,385 INFO L255 TraceCheckSpWp]: Trace formula consists of 294 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-20 16:54:36,387 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 16:54:36,413 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-20 16:54:36,413 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-20 16:54:36,476 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-20 16:54:36,477 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-20 16:54:36,477 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [964772075] [2024-11-20 16:54:36,477 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [964772075] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-20 16:54:36,477 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-20 16:54:36,477 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 8 [2024-11-20 16:54:36,478 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1007546492] [2024-11-20 16:54:36,478 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-20 16:54:36,478 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-20 16:54:36,478 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-20 16:54:36,479 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-20 16:54:36,479 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2024-11-20 16:54:36,479 INFO L87 Difference]: Start difference. First operand 1393 states and 1474 transitions. Second operand has 8 states, 8 states have (on average 8.75) internal successors, (70), 8 states have internal predecessors, (70), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-20 16:54:36,618 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 16:54:36,619 INFO L93 Difference]: Finished difference Result 1405 states and 1492 transitions. [2024-11-20 16:54:36,619 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-20 16:54:36,620 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 8.75) internal successors, (70), 8 states have internal predecessors, (70), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 68 [2024-11-20 16:54:36,620 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 16:54:36,624 INFO L225 Difference]: With dead ends: 1405 [2024-11-20 16:54:36,624 INFO L226 Difference]: Without dead ends: 1405 [2024-11-20 16:54:36,624 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 137 GetRequests, 128 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=44, Invalid=66, Unknown=0, NotChecked=0, Total=110 [2024-11-20 16:54:36,625 INFO L432 NwaCegarLoop]: 1416 mSDtfsCounter, 8 mSDsluCounter, 4234 mSDsCounter, 0 mSdLazyCounter, 69 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 5650 SdHoareTripleChecker+Invalid, 87 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 69 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-20 16:54:36,626 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 5650 Invalid, 87 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 69 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-20 16:54:36,628 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1405 states. [2024-11-20 16:54:36,640 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1405 to 1403. [2024-11-20 16:54:36,641 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1403 states, 803 states have (on average 1.8119551681195516) internal successors, (1455), 1393 states have internal predecessors, (1455), 16 states have call successors, (16), 3 states have call predecessors, (16), 4 states have return successors, (18), 7 states have call predecessors, (18), 16 states have call successors, (18) [2024-11-20 16:54:36,644 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1403 states to 1403 states and 1489 transitions. [2024-11-20 16:54:36,644 INFO L78 Accepts]: Start accepts. Automaton has 1403 states and 1489 transitions. Word has length 68 [2024-11-20 16:54:36,644 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 16:54:36,644 INFO L471 AbstractCegarLoop]: Abstraction has 1403 states and 1489 transitions. [2024-11-20 16:54:36,644 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 8.75) internal successors, (70), 8 states have internal predecessors, (70), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-20 16:54:36,645 INFO L276 IsEmpty]: Start isEmpty. Operand 1403 states and 1489 transitions. [2024-11-20 16:54:36,645 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2024-11-20 16:54:36,645 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 16:54:36,645 INFO L215 NwaCegarLoop]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 16:54:36,653 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (15)] Ended with exit code 0 [2024-11-20 16:54:36,846 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-20 16:54:36,846 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr70REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 828 more)] === [2024-11-20 16:54:36,846 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 16:54:36,846 INFO L85 PathProgramCache]: Analyzing trace with hash 587174350, now seen corresponding path program 2 times [2024-11-20 16:54:36,847 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-20 16:54:36,847 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1435320682] [2024-11-20 16:54:36,847 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-20 16:54:36,847 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-11-20 16:54:36,847 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-20 16:54:36,850 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-20 16:54:36,852 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (16)] Waiting until timeout for monitored process [2024-11-20 16:54:37,220 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-20 16:54:37,221 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-20 16:54:37,230 INFO L255 TraceCheckSpWp]: Trace formula consists of 327 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-20 16:54:37,232 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 16:54:37,280 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-20 16:54:37,281 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-20 16:54:37,438 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-20 16:54:37,439 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-20 16:54:37,439 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1435320682] [2024-11-20 16:54:37,439 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1435320682] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-20 16:54:37,439 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-20 16:54:37,439 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 14 [2024-11-20 16:54:37,439 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1678935567] [2024-11-20 16:54:37,439 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-20 16:54:37,440 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-11-20 16:54:37,440 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-20 16:54:37,441 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-11-20 16:54:37,441 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=121, Unknown=0, NotChecked=0, Total=182 [2024-11-20 16:54:37,441 INFO L87 Difference]: Start difference. First operand 1403 states and 1489 transitions. Second operand has 14 states, 14 states have (on average 5.428571428571429) internal successors, (76), 14 states have internal predecessors, (76), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-20 16:54:37,851 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 16:54:37,851 INFO L93 Difference]: Finished difference Result 1418 states and 1510 transitions. [2024-11-20 16:54:37,852 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2024-11-20 16:54:37,852 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 5.428571428571429) internal successors, (76), 14 states have internal predecessors, (76), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 71 [2024-11-20 16:54:37,852 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 16:54:37,856 INFO L225 Difference]: With dead ends: 1418 [2024-11-20 16:54:37,856 INFO L226 Difference]: Without dead ends: 1412 [2024-11-20 16:54:37,857 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 149 GetRequests, 128 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=182, Invalid=324, Unknown=0, NotChecked=0, Total=506 [2024-11-20 16:54:37,857 INFO L432 NwaCegarLoop]: 1417 mSDtfsCounter, 13 mSDsluCounter, 8474 mSDsCounter, 0 mSdLazyCounter, 211 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 9891 SdHoareTripleChecker+Invalid, 238 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 211 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-20 16:54:37,857 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 9891 Invalid, 238 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 211 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-20 16:54:37,859 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1412 states. [2024-11-20 16:54:37,871 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1412 to 1412. [2024-11-20 16:54:37,873 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1412 states, 812 states have (on average 1.8054187192118227) internal successors, (1466), 1402 states have internal predecessors, (1466), 16 states have call successors, (16), 3 states have call predecessors, (16), 4 states have return successors, (18), 7 states have call predecessors, (18), 16 states have call successors, (18) [2024-11-20 16:54:37,875 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1412 states to 1412 states and 1500 transitions. [2024-11-20 16:54:37,875 INFO L78 Accepts]: Start accepts. Automaton has 1412 states and 1500 transitions. Word has length 71 [2024-11-20 16:54:37,875 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 16:54:37,876 INFO L471 AbstractCegarLoop]: Abstraction has 1412 states and 1500 transitions. [2024-11-20 16:54:37,876 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 5.428571428571429) internal successors, (76), 14 states have internal predecessors, (76), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-20 16:54:37,876 INFO L276 IsEmpty]: Start isEmpty. Operand 1412 states and 1500 transitions. [2024-11-20 16:54:37,876 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2024-11-20 16:54:37,877 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 16:54:37,877 INFO L215 NwaCegarLoop]: trace histogram [10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 16:54:37,887 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (16)] Ended with exit code 0 [2024-11-20 16:54:38,077 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-20 16:54:38,078 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr70REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 828 more)] === [2024-11-20 16:54:38,078 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 16:54:38,078 INFO L85 PathProgramCache]: Analyzing trace with hash 1512343918, now seen corresponding path program 3 times [2024-11-20 16:54:38,078 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-20 16:54:38,079 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1221751049] [2024-11-20 16:54:38,079 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-20 16:54:38,079 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-11-20 16:54:38,079 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-20 16:54:38,080 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-20 16:54:38,081 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (17)] Waiting until timeout for monitored process [2024-11-20 16:54:38,559 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2024-11-20 16:54:38,559 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-20 16:54:38,569 INFO L255 TraceCheckSpWp]: Trace formula consists of 393 conjuncts, 14 conjuncts are in the unsatisfiable core [2024-11-20 16:54:38,571 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 16:54:38,692 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-20 16:54:38,693 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-20 16:54:39,127 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-20 16:54:39,127 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-20 16:54:39,127 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1221751049] [2024-11-20 16:54:39,127 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1221751049] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-20 16:54:39,128 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-20 16:54:39,128 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 26 [2024-11-20 16:54:39,128 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [528939326] [2024-11-20 16:54:39,128 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-20 16:54:39,129 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2024-11-20 16:54:39,129 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-20 16:54:39,130 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2024-11-20 16:54:39,130 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=193, Invalid=457, Unknown=0, NotChecked=0, Total=650 [2024-11-20 16:54:39,130 INFO L87 Difference]: Start difference. First operand 1412 states and 1500 transitions. Second operand has 26 states, 26 states have (on average 3.3846153846153846) internal successors, (88), 26 states have internal predecessors, (88), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-20 16:54:40,360 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 16:54:40,361 INFO L93 Difference]: Finished difference Result 1436 states and 1539 transitions. [2024-11-20 16:54:40,361 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2024-11-20 16:54:40,361 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 26 states have (on average 3.3846153846153846) internal successors, (88), 26 states have internal predecessors, (88), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 77 [2024-11-20 16:54:40,361 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 16:54:40,365 INFO L225 Difference]: With dead ends: 1436 [2024-11-20 16:54:40,365 INFO L226 Difference]: Without dead ends: 1430 [2024-11-20 16:54:40,366 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 173 GetRequests, 128 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 100 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=728, Invalid=1434, Unknown=0, NotChecked=0, Total=2162 [2024-11-20 16:54:40,366 INFO L432 NwaCegarLoop]: 1417 mSDtfsCounter, 16 mSDsluCounter, 16951 mSDsCounter, 0 mSdLazyCounter, 607 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 18368 SdHoareTripleChecker+Invalid, 626 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 607 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-20 16:54:40,367 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 18368 Invalid, 626 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 607 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-20 16:54:40,368 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1430 states. [2024-11-20 16:54:40,380 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1430 to 1430. [2024-11-20 16:54:40,381 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1430 states, 830 states have (on average 1.7939759036144578) internal successors, (1489), 1420 states have internal predecessors, (1489), 16 states have call successors, (16), 3 states have call predecessors, (16), 4 states have return successors, (18), 7 states have call predecessors, (18), 16 states have call successors, (18) [2024-11-20 16:54:40,383 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1430 states to 1430 states and 1523 transitions. [2024-11-20 16:54:40,383 INFO L78 Accepts]: Start accepts. Automaton has 1430 states and 1523 transitions. Word has length 77 [2024-11-20 16:54:40,384 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 16:54:40,384 INFO L471 AbstractCegarLoop]: Abstraction has 1430 states and 1523 transitions. [2024-11-20 16:54:40,384 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 26 states have (on average 3.3846153846153846) internal successors, (88), 26 states have internal predecessors, (88), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-20 16:54:40,384 INFO L276 IsEmpty]: Start isEmpty. Operand 1430 states and 1523 transitions. [2024-11-20 16:54:40,385 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2024-11-20 16:54:40,385 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 16:54:40,385 INFO L215 NwaCegarLoop]: trace histogram [22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 16:54:40,397 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (17)] Forceful destruction successful, exit code 0 [2024-11-20 16:54:40,585 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-20 16:54:40,586 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr70REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 828 more)] === [2024-11-20 16:54:40,586 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 16:54:40,586 INFO L85 PathProgramCache]: Analyzing trace with hash -139997010, now seen corresponding path program 4 times [2024-11-20 16:54:40,587 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-20 16:54:40,587 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1911702630] [2024-11-20 16:54:40,587 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2024-11-20 16:54:40,587 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-20 16:54:40,587 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-20 16:54:40,588 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-20 16:54:40,589 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (18)] Waiting until timeout for monitored process [2024-11-20 16:54:40,996 INFO L227 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2024-11-20 16:54:40,996 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-20 16:54:41,010 INFO L255 TraceCheckSpWp]: Trace formula consists of 525 conjuncts, 25 conjuncts are in the unsatisfiable core [2024-11-20 16:54:41,012 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 16:54:41,324 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 0 proven. 253 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-20 16:54:41,324 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-20 16:54:42,515 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 0 proven. 253 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-20 16:54:42,515 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-20 16:54:42,515 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1911702630] [2024-11-20 16:54:42,515 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1911702630] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-20 16:54:42,515 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-20 16:54:42,516 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 26] total 50 [2024-11-20 16:54:42,516 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1915786516] [2024-11-20 16:54:42,516 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-20 16:54:42,516 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 50 states [2024-11-20 16:54:42,516 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-20 16:54:42,517 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2024-11-20 16:54:42,518 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=672, Invalid=1778, Unknown=0, NotChecked=0, Total=2450 [2024-11-20 16:54:42,518 INFO L87 Difference]: Start difference. First operand 1430 states and 1523 transitions. Second operand has 50 states, 50 states have (on average 2.24) internal successors, (112), 50 states have internal predecessors, (112), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-20 16:54:46,691 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 16:54:46,691 INFO L93 Difference]: Finished difference Result 1470 states and 1596 transitions. [2024-11-20 16:54:46,692 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 71 states. [2024-11-20 16:54:46,692 INFO L78 Accepts]: Start accepts. Automaton has has 50 states, 50 states have (on average 2.24) internal successors, (112), 50 states have internal predecessors, (112), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 89 [2024-11-20 16:54:46,692 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 16:54:46,696 INFO L225 Difference]: With dead ends: 1470 [2024-11-20 16:54:46,696 INFO L226 Difference]: Without dead ends: 1466 [2024-11-20 16:54:46,697 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 219 GetRequests, 128 SyntacticMatches, 0 SemanticMatches, 91 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 465 ImplicationChecksByTransitivity, 3.6s TimeCoverageRelationStatistics Valid=2713, Invalid=5843, Unknown=0, NotChecked=0, Total=8556 [2024-11-20 16:54:46,698 INFO L432 NwaCegarLoop]: 1416 mSDtfsCounter, 28 mSDsluCounter, 35297 mSDsCounter, 0 mSdLazyCounter, 2002 mSolverCounterSat, 36 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 36713 SdHoareTripleChecker+Invalid, 2038 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 36 IncrementalHoareTripleChecker+Valid, 2002 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2024-11-20 16:54:46,698 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [28 Valid, 36713 Invalid, 2038 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [36 Valid, 2002 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2024-11-20 16:54:46,700 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1466 states. [2024-11-20 16:54:46,712 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1466 to 1464. [2024-11-20 16:54:46,714 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1464 states, 864 states have (on average 1.7766203703703705) internal successors, (1535), 1454 states have internal predecessors, (1535), 16 states have call successors, (16), 3 states have call predecessors, (16), 4 states have return successors, (18), 7 states have call predecessors, (18), 16 states have call successors, (18) [2024-11-20 16:54:46,716 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1464 states to 1464 states and 1569 transitions. [2024-11-20 16:54:46,716 INFO L78 Accepts]: Start accepts. Automaton has 1464 states and 1569 transitions. Word has length 89 [2024-11-20 16:54:46,717 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 16:54:46,717 INFO L471 AbstractCegarLoop]: Abstraction has 1464 states and 1569 transitions. [2024-11-20 16:54:46,717 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 50 states, 50 states have (on average 2.24) internal successors, (112), 50 states have internal predecessors, (112), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-20 16:54:46,717 INFO L276 IsEmpty]: Start isEmpty. Operand 1464 states and 1569 transitions. [2024-11-20 16:54:46,718 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2024-11-20 16:54:46,718 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 16:54:46,718 INFO L215 NwaCegarLoop]: trace histogram [44, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 16:54:46,731 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (18)] Ended with exit code 0 [2024-11-20 16:54:46,918 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-20 16:54:46,919 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr70REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 828 more)] === [2024-11-20 16:54:46,919 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 16:54:46,920 INFO L85 PathProgramCache]: Analyzing trace with hash 1213267790, now seen corresponding path program 5 times [2024-11-20 16:54:46,920 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-20 16:54:46,920 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [180625631] [2024-11-20 16:54:46,920 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2024-11-20 16:54:46,920 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-11-20 16:54:46,920 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-20 16:54:46,921 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-20 16:54:46,923 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (19)] Waiting until timeout for monitored process [2024-11-20 16:54:48,014 INFO L227 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 23 check-sat command(s) [2024-11-20 16:54:48,014 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-20 16:54:48,033 INFO L255 TraceCheckSpWp]: Trace formula consists of 767 conjuncts, 58 conjuncts are in the unsatisfiable core [2024-11-20 16:54:48,052 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 16:54:48,069 INFO L349 Elim1Store]: treesize reduction 13, result has 45.8 percent of original size [2024-11-20 16:54:48,070 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 22 [2024-11-20 16:54:48,418 INFO L349 Elim1Store]: treesize reduction 54, result has 29.9 percent of original size [2024-11-20 16:54:48,418 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 28 treesize of output 45 [2024-11-20 16:54:48,490 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2024-11-20 16:54:48,600 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 24 [2024-11-20 16:54:50,897 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-20 16:54:50,898 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 62 treesize of output 59 [2024-11-20 16:54:50,977 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 27 [2024-11-20 16:54:51,023 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 44 refuted. 0 times theorem prover too weak. 946 trivial. 0 not checked. [2024-11-20 16:54:51,024 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-20 16:54:51,306 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1646 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 1) (bvadd (_ bv1 1) (select |c_#valid| (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem32#1.base| v_ArrVal_1646) |c_ULTIMATE.start_main_~user~0#1.base|) (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|)))))) is different from false [2024-11-20 16:54:51,308 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-20 16:54:51,308 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [180625631] [2024-11-20 16:54:51,308 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [180625631] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-20 16:54:51,308 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [439195011] [2024-11-20 16:54:51,308 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2024-11-20 16:54:51,308 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-11-20 16:54:51,308 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2024-11-20 16:54:51,310 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-11-20 16:54:51,320 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (20)] Waiting until timeout for monitored process