./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/uthash-2.0.2/uthash_OAT_nondet_test3-1.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version c7c6ca5d Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/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 ../sv-benchmarks/c/uthash-2.0.2/uthash_OAT_nondet_test3-1.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 6fd297418200393a9bb890e84311a80b6eacd7d5d7cdd65efb1397f8b8ab870f --- Real Ultimate output --- This is Ultimate 0.2.5-?-c7c6ca5-m [2024-11-09 10:09:00,973 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-09 10:09:01,036 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2024-11-09 10:09:01,041 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-09 10:09:01,042 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-09 10:09:01,065 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-09 10:09:01,065 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-09 10:09:01,066 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-09 10:09:01,066 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-09 10:09:01,067 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-09 10:09:01,067 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-09 10:09:01,067 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-09 10:09:01,068 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-09 10:09:01,068 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-09 10:09:01,070 INFO L153 SettingsManager]: * Use SBE=true [2024-11-09 10:09:01,070 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-09 10:09:01,070 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-09 10:09:01,070 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-09 10:09:01,070 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-09 10:09:01,071 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-09 10:09:01,071 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-11-09 10:09:01,073 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-11-09 10:09:01,074 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-11-09 10:09:01,074 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-09 10:09:01,074 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-09 10:09:01,074 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-09 10:09:01,074 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-09 10:09:01,075 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-09 10:09:01,075 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-09 10:09:01,075 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-09 10:09:01,075 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-09 10:09:01,075 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-09 10:09:01,075 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-09 10:09:01,075 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-09 10:09:01,076 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-09 10:09:01,076 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-09 10:09:01,076 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-09 10:09:01,076 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-09 10:09:01,076 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-09 10:09:01,076 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-09 10:09:01,076 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-09 10:09:01,077 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-09 10:09:01,077 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 -> 6fd297418200393a9bb890e84311a80b6eacd7d5d7cdd65efb1397f8b8ab870f [2024-11-09 10:09:01,252 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-09 10:09:01,270 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-09 10:09:01,274 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-09 10:09:01,275 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-09 10:09:01,275 INFO L274 PluginConnector]: CDTParser initialized [2024-11-09 10:09:01,276 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/uthash-2.0.2/uthash_OAT_nondet_test3-1.i [2024-11-09 10:09:02,505 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-09 10:09:02,724 INFO L384 CDTParser]: Found 1 translation units. [2024-11-09 10:09:02,725 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_OAT_nondet_test3-1.i [2024-11-09 10:09:02,744 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5c5f3029f/f2ad335b45994f4fbc8bf32f4bfdde81/FLAGdea1ebc05 [2024-11-09 10:09:03,061 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5c5f3029f/f2ad335b45994f4fbc8bf32f4bfdde81 [2024-11-09 10:09:03,063 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-09 10:09:03,064 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-09 10:09:03,069 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-09 10:09:03,069 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-09 10:09:03,074 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-09 10:09:03,074 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 10:09:03" (1/1) ... [2024-11-09 10:09:03,075 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@35a9eae3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:09:03, skipping insertion in model container [2024-11-09 10:09:03,075 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 10:09:03" (1/1) ... [2024-11-09 10:09:03,123 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-09 10:09:03,429 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-09 10:09:03,480 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-09 10:09:03,485 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-09 10:09:03,490 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-09 10:09:03,512 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-09 10:09:03,532 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-09 10:09:03,532 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-09 10:09:03,534 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-09 10:09:03,538 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-09 10:09:03,540 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-09 10:09:03,541 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-09 10:09:03,541 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-09 10:09:03,542 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-09 10:09:03,545 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-09 10:09:03,559 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 10:09:03,568 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-09 10:09:03,569 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver@41bb346 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:09:03, skipping insertion in model container [2024-11-09 10:09:03,569 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-09 10:09:03,569 INFO L186 ToolchainWalker]: Toolchain execution was canceled (user or tool) before executing de.uni_freiburg.informatik.ultimate.boogie.procedureinliner [2024-11-09 10:09:03,571 INFO L158 Benchmark]: Toolchain (without parser) took 505.68ms. Allocated memory was 142.6MB in the beginning and 184.5MB in the end (delta: 41.9MB). Free memory was 68.9MB in the beginning and 146.7MB in the end (delta: -77.8MB). Peak memory consumption was 30.4MB. Max. memory is 16.1GB. [2024-11-09 10:09:03,571 INFO L158 Benchmark]: CDTParser took 0.14ms. Allocated memory is still 142.6MB. Free memory is still 105.4MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-09 10:09:03,572 INFO L158 Benchmark]: CACSL2BoogieTranslator took 499.84ms. Allocated memory was 142.6MB in the beginning and 184.5MB in the end (delta: 41.9MB). Free memory was 68.7MB in the beginning and 146.7MB in the end (delta: -78.0MB). Peak memory consumption was 30.4MB. Max. memory is 16.1GB. [2024-11-09 10:09:03,573 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.14ms. Allocated memory is still 142.6MB. Free memory is still 105.4MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 499.84ms. Allocated memory was 142.6MB in the beginning and 184.5MB in the end (delta: 41.9MB). Free memory was 68.7MB in the beginning and 146.7MB in the end (delta: -78.0MB). Peak memory consumption was 30.4MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - UnsupportedSyntaxResult [Line: 750]: 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/11.0.12-open/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 ../sv-benchmarks/c/uthash-2.0.2/uthash_OAT_nondet_test3-1.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 6fd297418200393a9bb890e84311a80b6eacd7d5d7cdd65efb1397f8b8ab870f --- Real Ultimate output --- This is Ultimate 0.2.5-?-c7c6ca5-m [2024-11-09 10:09:05,186 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-09 10:09:05,253 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf [2024-11-09 10:09:05,256 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-09 10:09:05,257 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-09 10:09:05,283 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-09 10:09:05,284 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-09 10:09:05,285 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-09 10:09:05,286 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-09 10:09:05,286 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-09 10:09:05,287 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-09 10:09:05,288 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-09 10:09:05,289 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-09 10:09:05,289 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-09 10:09:05,289 INFO L153 SettingsManager]: * Use SBE=true [2024-11-09 10:09:05,290 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-09 10:09:05,290 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-09 10:09:05,290 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-09 10:09:05,292 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-09 10:09:05,292 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-09 10:09:05,292 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-11-09 10:09:05,293 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-11-09 10:09:05,293 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-11-09 10:09:05,293 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-09 10:09:05,295 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-09 10:09:05,296 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-09 10:09:05,296 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-09 10:09:05,296 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-09 10:09:05,296 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-09 10:09:05,296 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-09 10:09:05,297 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-09 10:09:05,297 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-09 10:09:05,297 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-09 10:09:05,297 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-09 10:09:05,297 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-09 10:09:05,297 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-09 10:09:05,298 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-09 10:09:05,298 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-09 10:09:05,298 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-09 10:09:05,298 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-09 10:09:05,299 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-09 10:09:05,299 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-09 10:09:05,299 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-09 10:09:05,299 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-09 10:09:05,300 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 -> 6fd297418200393a9bb890e84311a80b6eacd7d5d7cdd65efb1397f8b8ab870f [2024-11-09 10:09:05,567 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-09 10:09:05,587 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-09 10:09:05,590 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-09 10:09:05,591 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-09 10:09:05,591 INFO L274 PluginConnector]: CDTParser initialized [2024-11-09 10:09:05,592 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/uthash-2.0.2/uthash_OAT_nondet_test3-1.i [2024-11-09 10:09:06,856 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-09 10:09:07,094 INFO L384 CDTParser]: Found 1 translation units. [2024-11-09 10:09:07,094 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_OAT_nondet_test3-1.i [2024-11-09 10:09:07,109 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c9194f5e6/f7b926a4c8504d868979f247377d4f87/FLAG36f4bf187 [2024-11-09 10:09:07,123 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c9194f5e6/f7b926a4c8504d868979f247377d4f87 [2024-11-09 10:09:07,126 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-09 10:09:07,127 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-09 10:09:07,128 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-09 10:09:07,129 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-09 10:09:07,147 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-09 10:09:07,148 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 10:09:07" (1/1) ... [2024-11-09 10:09:07,148 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6e4a1b1d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:09:07, skipping insertion in model container [2024-11-09 10:09:07,149 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 10:09:07" (1/1) ... [2024-11-09 10:09:07,196 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-09 10:09:07,505 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-09 10:09:07,534 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-09 10:09:07,537 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-09 10:09:07,541 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-09 10:09:07,548 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-09 10:09:07,578 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-09 10:09:07,578 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-09 10:09:07,580 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-09 10:09:07,580 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-09 10:09:07,586 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-09 10:09:07,587 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-09 10:09:07,587 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-09 10:09:07,588 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-09 10:09:07,597 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-09 10:09:07,606 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 10:09:07,629 INFO L197 MainTranslator]: Restarting translation with changed settings: SettingsChange [mNewPreferredMemoryModel=HoenickeLindenmann_1ByteResolution] [2024-11-09 10:09:07,638 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-09 10:09:07,665 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-09 10:09:07,678 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-09 10:09:07,680 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-09 10:09:07,682 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-09 10:09:07,685 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-09 10:09:07,699 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-09 10:09:07,700 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-09 10:09:07,701 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-09 10:09:07,702 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-09 10:09:07,703 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-09 10:09:07,704 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-09 10:09:07,705 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-09 10:09:07,705 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-09 10:09:07,708 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-09 10:09:07,710 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 10:09:07,717 INFO L200 MainTranslator]: Completed pre-run [2024-11-09 10:09:07,791 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 10:09:07,828 INFO L204 MainTranslator]: Completed translation [2024-11-09 10:09:07,829 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:09:07 WrapperNode [2024-11-09 10:09:07,829 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-09 10:09:07,830 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-09 10:09:07,830 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-09 10:09:07,831 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-09 10:09:07,836 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:09:07" (1/1) ... [2024-11-09 10:09:07,867 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:09:07" (1/1) ... [2024-11-09 10:09:07,930 INFO L138 Inliner]: procedures = 180, calls = 274, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 1050 [2024-11-09 10:09:07,931 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-09 10:09:07,932 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-09 10:09:07,932 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-09 10:09:07,932 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-09 10:09:07,940 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:09:07" (1/1) ... [2024-11-09 10:09:07,940 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:09:07" (1/1) ... [2024-11-09 10:09:07,969 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:09:07" (1/1) ... [2024-11-09 10:09:08,031 INFO L175 MemorySlicer]: Split 254 memory accesses to 3 slices as follows [2, 34, 218]. 86 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0, 0]. The 54 writes are split as follows [0, 4, 50]. [2024-11-09 10:09:08,031 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:09:07" (1/1) ... [2024-11-09 10:09:08,032 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:09:07" (1/1) ... [2024-11-09 10:09:08,056 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:09:07" (1/1) ... [2024-11-09 10:09:08,062 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:09:07" (1/1) ... [2024-11-09 10:09:08,065 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:09:07" (1/1) ... [2024-11-09 10:09:08,069 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:09:07" (1/1) ... [2024-11-09 10:09:08,075 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-09 10:09:08,076 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-09 10:09:08,076 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-09 10:09:08,076 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-09 10:09:08,080 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:09:07" (1/1) ... [2024-11-09 10:09:08,087 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-09 10:09:08,096 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 10:09:08,111 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-09 10:09:08,113 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-09 10:09:08,146 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#0 [2024-11-09 10:09:08,146 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#1 [2024-11-09 10:09:08,146 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#2 [2024-11-09 10:09:08,146 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#0 [2024-11-09 10:09:08,146 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#1 [2024-11-09 10:09:08,146 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#2 [2024-11-09 10:09:08,147 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2024-11-09 10:09:08,147 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2024-11-09 10:09:08,147 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#0 [2024-11-09 10:09:08,147 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#1 [2024-11-09 10:09:08,147 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#2 [2024-11-09 10:09:08,147 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#0 [2024-11-09 10:09:08,147 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#1 [2024-11-09 10:09:08,147 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#2 [2024-11-09 10:09:08,147 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-11-09 10:09:08,147 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-09 10:09:08,148 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2024-11-09 10:09:08,148 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2024-11-09 10:09:08,148 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2024-11-09 10:09:08,148 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-11-09 10:09:08,148 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2024-11-09 10:09:08,148 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2024-11-09 10:09:08,148 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2024-11-09 10:09:08,148 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#0 [2024-11-09 10:09:08,148 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#1 [2024-11-09 10:09:08,149 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#2 [2024-11-09 10:09:08,149 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-09 10:09:08,149 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-09 10:09:08,149 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2024-11-09 10:09:08,149 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#2 [2024-11-09 10:09:08,149 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-09 10:09:08,149 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-09 10:09:08,341 INFO L238 CfgBuilder]: Building ICFG [2024-11-09 10:09:08,343 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-09 10:09:08,345 WARN L781 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2024-11-09 10:09:08,385 WARN L781 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2024-11-09 10:09:08,404 WARN L781 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2024-11-09 10:09:10,826 INFO L? ?]: Removed 1080 outVars from TransFormulas that were not future-live. [2024-11-09 10:09:10,826 INFO L287 CfgBuilder]: Performing block encoding [2024-11-09 10:09:10,849 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-09 10:09:10,849 INFO L316 CfgBuilder]: Removed 63 assume(true) statements. [2024-11-09 10:09:10,850 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 10:09:10 BoogieIcfgContainer [2024-11-09 10:09:10,850 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-09 10:09:10,851 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-09 10:09:10,852 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-09 10:09:10,856 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-09 10:09:10,856 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.11 10:09:07" (1/3) ... [2024-11-09 10:09:10,857 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5cc1dad9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 10:09:10, skipping insertion in model container [2024-11-09 10:09:10,857 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:09:07" (2/3) ... [2024-11-09 10:09:10,857 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5cc1dad9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 10:09:10, skipping insertion in model container [2024-11-09 10:09:10,858 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 10:09:10" (3/3) ... [2024-11-09 10:09:10,859 INFO L112 eAbstractionObserver]: Analyzing ICFG uthash_OAT_nondet_test3-1.i [2024-11-09 10:09:10,870 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-09 10:09:10,871 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 525 error locations. [2024-11-09 10:09:10,924 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-09 10:09:10,929 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;@4155a5e3, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-09 10:09:10,930 INFO L334 AbstractCegarLoop]: Starting to check reachability of 525 error locations. [2024-11-09 10:09:10,935 INFO L276 IsEmpty]: Start isEmpty. Operand has 1059 states, 529 states have (on average 2.223062381852552) internal successors, (1176), 1052 states have internal predecessors, (1176), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2024-11-09 10:09:10,940 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2024-11-09 10:09:10,940 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 10:09:10,941 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2024-11-09 10:09:10,941 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr523ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 522 more)] === [2024-11-09 10:09:10,945 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 10:09:10,946 INFO L85 PathProgramCache]: Analyzing trace with hash 1758403, now seen corresponding path program 1 times [2024-11-09 10:09:10,954 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 10:09:10,954 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1164688836] [2024-11-09 10:09:10,955 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 10:09:10,955 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-09 10:09:10,955 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 10:09:10,958 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-09 10:09:10,961 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-09 10:09:11,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:09:11,070 INFO L255 TraceCheckSpWp]: Trace formula consists of 27 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-09 10:09:11,074 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 10:09:11,142 WARN L873 $PredicateComparison]: unable to prove that (exists ((|v_ULTIMATE.start_main_~#i~0#1.base_46| (_ BitVec 32))) (and (= (_ bv0 1) (select |c_ULTIMATE.start_main_old_#valid#1| |v_ULTIMATE.start_main_~#i~0#1.base_46|)) (= (store |c_ULTIMATE.start_main_old_#valid#1| |v_ULTIMATE.start_main_~#i~0#1.base_46| (_ bv0 1)) |c_#valid|))) is different from true [2024-11-09 10:09:11,144 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-09 10:09:11,144 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 10:09:11,144 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 10:09:11,144 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1164688836] [2024-11-09 10:09:11,145 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1164688836] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 10:09:11,145 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 10:09:11,145 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 10:09:11,146 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1538428878] [2024-11-09 10:09:11,147 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 10:09:11,150 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-09 10:09:11,150 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 10:09:11,187 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 10:09:11,188 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=4, Unknown=1, NotChecked=2, Total=12 [2024-11-09 10:09:11,194 INFO L87 Difference]: Start difference. First operand has 1059 states, 529 states have (on average 2.223062381852552) internal successors, (1176), 1052 states have internal predecessors, (1176), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) Second operand has 4 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 4 states have internal predecessors, (4), 0 states have call successors, (0), 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-09 10:09:12,756 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 10:09:12,756 INFO L93 Difference]: Finished difference Result 1446 states and 1549 transitions. [2024-11-09 10:09:12,757 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-09 10:09:12,758 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 4 states have internal predecessors, (4), 0 states have call successors, (0), 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 4 [2024-11-09 10:09:12,759 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 10:09:12,772 INFO L225 Difference]: With dead ends: 1446 [2024-11-09 10:09:12,772 INFO L226 Difference]: Without dead ends: 1443 [2024-11-09 10:09:12,773 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=4, Unknown=1, NotChecked=2, Total=12 [2024-11-09 10:09:12,775 INFO L432 NwaCegarLoop]: 916 mSDtfsCounter, 423 mSDsluCounter, 568 mSDsCounter, 0 mSdLazyCounter, 747 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 425 SdHoareTripleChecker+Valid, 1484 SdHoareTripleChecker+Invalid, 2297 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 747 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 1550 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2024-11-09 10:09:12,776 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [425 Valid, 1484 Invalid, 2297 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 747 Invalid, 0 Unknown, 1550 Unchecked, 1.5s Time] [2024-11-09 10:09:12,791 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1443 states. [2024-11-09 10:09:12,855 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1443 to 1047. [2024-11-09 10:09:12,856 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1047 states, 523 states have (on average 2.0917782026768643) internal successors, (1094), 1040 states have internal predecessors, (1094), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2024-11-09 10:09:12,859 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1047 states to 1047 states and 1104 transitions. [2024-11-09 10:09:12,860 INFO L78 Accepts]: Start accepts. Automaton has 1047 states and 1104 transitions. Word has length 4 [2024-11-09 10:09:12,860 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 10:09:12,860 INFO L471 AbstractCegarLoop]: Abstraction has 1047 states and 1104 transitions. [2024-11-09 10:09:12,860 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 4 states have internal predecessors, (4), 0 states have call successors, (0), 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-09 10:09:12,860 INFO L276 IsEmpty]: Start isEmpty. Operand 1047 states and 1104 transitions. [2024-11-09 10:09:12,861 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2024-11-09 10:09:12,861 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 10:09:12,861 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2024-11-09 10:09:12,865 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-09 10:09:13,061 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-09 10:09:13,062 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 522 more)] === [2024-11-09 10:09:13,063 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 10:09:13,063 INFO L85 PathProgramCache]: Analyzing trace with hash 1756837, now seen corresponding path program 1 times [2024-11-09 10:09:13,063 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 10:09:13,063 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [50123721] [2024-11-09 10:09:13,063 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 10:09:13,063 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-09 10:09:13,063 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 10:09:13,066 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-09 10:09:13,067 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-09 10:09:13,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:09:13,140 INFO L255 TraceCheckSpWp]: Trace formula consists of 24 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-09 10:09:13,141 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 10:09:13,151 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-09 10:09:13,157 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-09 10:09:13,157 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 10:09:13,157 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 10:09:13,158 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [50123721] [2024-11-09 10:09:13,158 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [50123721] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 10:09:13,158 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 10:09:13,158 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 10:09:13,158 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [278514879] [2024-11-09 10:09:13,158 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 10:09:13,159 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 10:09:13,159 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 10:09:13,159 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 10:09:13,160 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 10:09:13,160 INFO L87 Difference]: Start difference. First operand 1047 states and 1104 transitions. Second operand has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 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-09 10:09:13,993 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 10:09:13,994 INFO L93 Difference]: Finished difference Result 1054 states and 1113 transitions. [2024-11-09 10:09:13,994 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 10:09:13,994 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 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 4 [2024-11-09 10:09:13,994 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 10:09:13,997 INFO L225 Difference]: With dead ends: 1054 [2024-11-09 10:09:13,997 INFO L226 Difference]: Without dead ends: 1054 [2024-11-09 10:09:13,997 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 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-09 10:09:13,998 INFO L432 NwaCegarLoop]: 630 mSDtfsCounter, 964 mSDsluCounter, 61 mSDsCounter, 0 mSdLazyCounter, 547 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 969 SdHoareTripleChecker+Valid, 691 SdHoareTripleChecker+Invalid, 564 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 547 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-11-09 10:09:13,998 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [969 Valid, 691 Invalid, 564 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 547 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-11-09 10:09:14,000 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1054 states. [2024-11-09 10:09:14,009 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1054 to 1046. [2024-11-09 10:09:14,010 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1046 states, 532 states have (on average 2.058270676691729) internal successors, (1095), 1038 states have internal predecessors, (1095), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2024-11-09 10:09:14,013 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1046 states to 1046 states and 1105 transitions. [2024-11-09 10:09:14,013 INFO L78 Accepts]: Start accepts. Automaton has 1046 states and 1105 transitions. Word has length 4 [2024-11-09 10:09:14,013 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 10:09:14,013 INFO L471 AbstractCegarLoop]: Abstraction has 1046 states and 1105 transitions. [2024-11-09 10:09:14,013 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 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-09 10:09:14,013 INFO L276 IsEmpty]: Start isEmpty. Operand 1046 states and 1105 transitions. [2024-11-09 10:09:14,014 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2024-11-09 10:09:14,014 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 10:09:14,014 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2024-11-09 10:09:14,017 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-09 10:09:14,216 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-09 10:09:14,216 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 522 more)] === [2024-11-09 10:09:14,217 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 10:09:14,217 INFO L85 PathProgramCache]: Analyzing trace with hash 1756838, now seen corresponding path program 1 times [2024-11-09 10:09:14,217 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 10:09:14,217 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1495184063] [2024-11-09 10:09:14,217 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 10:09:14,217 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-09 10:09:14,218 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 10:09:14,219 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-09 10:09:14,220 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-09 10:09:14,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:09:14,302 INFO L255 TraceCheckSpWp]: Trace formula consists of 24 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-09 10:09:14,304 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 10:09:14,311 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-09 10:09:14,327 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-09 10:09:14,327 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 10:09:14,327 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 10:09:14,327 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1495184063] [2024-11-09 10:09:14,328 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1495184063] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 10:09:14,328 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 10:09:14,328 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 10:09:14,328 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1363088516] [2024-11-09 10:09:14,340 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 10:09:14,340 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 10:09:14,340 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 10:09:14,340 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 10:09:14,341 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 10:09:14,341 INFO L87 Difference]: Start difference. First operand 1046 states and 1105 transitions. Second operand has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 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-09 10:09:15,918 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 10:09:15,918 INFO L93 Difference]: Finished difference Result 1451 states and 1544 transitions. [2024-11-09 10:09:15,919 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 10:09:15,919 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 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 4 [2024-11-09 10:09:15,919 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 10:09:15,923 INFO L225 Difference]: With dead ends: 1451 [2024-11-09 10:09:15,923 INFO L226 Difference]: Without dead ends: 1451 [2024-11-09 10:09:15,923 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 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-09 10:09:15,924 INFO L432 NwaCegarLoop]: 903 mSDtfsCounter, 433 mSDsluCounter, 576 mSDsCounter, 0 mSdLazyCounter, 704 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 435 SdHoareTripleChecker+Valid, 1479 SdHoareTripleChecker+Invalid, 710 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 704 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2024-11-09 10:09:15,924 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [435 Valid, 1479 Invalid, 710 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 704 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2024-11-09 10:09:15,928 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1451 states. [2024-11-09 10:09:15,941 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1451 to 1256. [2024-11-09 10:09:15,942 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1256 states, 742 states have (on average 2.045822102425876) internal successors, (1518), 1247 states have internal predecessors, (1518), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-11-09 10:09:15,946 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1256 states to 1256 states and 1530 transitions. [2024-11-09 10:09:15,946 INFO L78 Accepts]: Start accepts. Automaton has 1256 states and 1530 transitions. Word has length 4 [2024-11-09 10:09:15,946 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 10:09:15,947 INFO L471 AbstractCegarLoop]: Abstraction has 1256 states and 1530 transitions. [2024-11-09 10:09:15,947 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 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-09 10:09:15,947 INFO L276 IsEmpty]: Start isEmpty. Operand 1256 states and 1530 transitions. [2024-11-09 10:09:15,947 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2024-11-09 10:09:15,947 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 10:09:15,947 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 10:09:15,954 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-09 10:09:16,148 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-09 10:09:16,148 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 522 more)] === [2024-11-09 10:09:16,148 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 10:09:16,149 INFO L85 PathProgramCache]: Analyzing trace with hash -1021429073, now seen corresponding path program 1 times [2024-11-09 10:09:16,149 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 10:09:16,149 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [435363399] [2024-11-09 10:09:16,149 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 10:09:16,149 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-09 10:09:16,149 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 10:09:16,152 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-09 10:09:16,153 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-09 10:09:16,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:09:16,248 INFO L255 TraceCheckSpWp]: Trace formula consists of 61 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-09 10:09:16,250 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 10:09:16,257 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-09 10:09:16,264 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-09 10:09:16,335 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 10:09:16,336 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-09 10:09:16,349 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2024-11-09 10:09:16,350 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-09 10:09:16,369 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-09 10:09:16,369 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 10:09:16,369 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 10:09:16,369 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [435363399] [2024-11-09 10:09:16,370 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [435363399] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 10:09:16,370 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 10:09:16,370 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 10:09:16,370 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1909158216] [2024-11-09 10:09:16,370 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 10:09:16,370 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-09 10:09:16,370 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 10:09:16,370 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 10:09:16,370 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-09 10:09:16,371 INFO L87 Difference]: Start difference. First operand 1256 states and 1530 transitions. Second operand has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 4 states have internal predecessors, (8), 0 states have call successors, (0), 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-09 10:09:17,801 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 10:09:17,801 INFO L93 Difference]: Finished difference Result 1258 states and 1533 transitions. [2024-11-09 10:09:17,802 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-09 10:09:17,802 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 4 states have internal predecessors, (8), 0 states have call successors, (0), 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 8 [2024-11-09 10:09:17,802 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 10:09:17,809 INFO L225 Difference]: With dead ends: 1258 [2024-11-09 10:09:17,809 INFO L226 Difference]: Without dead ends: 1258 [2024-11-09 10:09:17,809 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 5 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-09 10:09:17,810 INFO L432 NwaCegarLoop]: 363 mSDtfsCounter, 2017 mSDsluCounter, 41 mSDsCounter, 0 mSdLazyCounter, 808 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2022 SdHoareTripleChecker+Valid, 404 SdHoareTripleChecker+Invalid, 833 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 808 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2024-11-09 10:09:17,810 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2022 Valid, 404 Invalid, 833 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 808 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2024-11-09 10:09:17,812 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1258 states. [2024-11-09 10:09:17,822 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1258 to 1034. [2024-11-09 10:09:17,823 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1034 states, 532 states have (on average 2.031954887218045) internal successors, (1081), 1026 states have internal predecessors, (1081), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2024-11-09 10:09:17,825 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1034 states to 1034 states and 1091 transitions. [2024-11-09 10:09:17,826 INFO L78 Accepts]: Start accepts. Automaton has 1034 states and 1091 transitions. Word has length 8 [2024-11-09 10:09:17,826 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 10:09:17,826 INFO L471 AbstractCegarLoop]: Abstraction has 1034 states and 1091 transitions. [2024-11-09 10:09:17,826 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 4 states have internal predecessors, (8), 0 states have call successors, (0), 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-09 10:09:17,827 INFO L276 IsEmpty]: Start isEmpty. Operand 1034 states and 1091 transitions. [2024-11-09 10:09:17,827 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2024-11-09 10:09:17,827 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 10:09:17,827 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 10:09:17,838 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 (5)] Forceful destruction successful, exit code 0 [2024-11-09 10:09:18,028 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-09 10:09:18,028 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 522 more)] === [2024-11-09 10:09:18,028 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 10:09:18,029 INFO L85 PathProgramCache]: Analyzing trace with hash -1599530194, now seen corresponding path program 1 times [2024-11-09 10:09:18,029 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 10:09:18,029 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1792107127] [2024-11-09 10:09:18,029 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 10:09:18,029 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-09 10:09:18,029 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 10:09:18,030 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-09 10:09:18,031 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-09 10:09:18,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:09:18,114 INFO L255 TraceCheckSpWp]: Trace formula consists of 66 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-09 10:09:18,116 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 10:09:18,120 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-09 10:09:18,126 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-09 10:09:18,127 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 10:09:18,127 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 10:09:18,127 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1792107127] [2024-11-09 10:09:18,127 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1792107127] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 10:09:18,127 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 10:09:18,127 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 10:09:18,127 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1757938897] [2024-11-09 10:09:18,127 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 10:09:18,127 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 10:09:18,127 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 10:09:18,128 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 10:09:18,128 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 10:09:18,128 INFO L87 Difference]: Start difference. First operand 1034 states and 1091 transitions. Second operand has 3 states, 2 states have (on average 4.5) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 10:09:19,183 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 10:09:19,183 INFO L93 Difference]: Finished difference Result 1371 states and 1459 transitions. [2024-11-09 10:09:19,183 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 10:09:19,183 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 4.5) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2024-11-09 10:09:19,184 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 10:09:19,187 INFO L225 Difference]: With dead ends: 1371 [2024-11-09 10:09:19,187 INFO L226 Difference]: Without dead ends: 1371 [2024-11-09 10:09:19,187 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 7 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-09 10:09:19,188 INFO L432 NwaCegarLoop]: 951 mSDtfsCounter, 929 mSDsluCounter, 248 mSDsCounter, 0 mSdLazyCounter, 757 mSolverCounterSat, 52 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 934 SdHoareTripleChecker+Valid, 1199 SdHoareTripleChecker+Invalid, 809 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 52 IncrementalHoareTripleChecker+Valid, 757 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2024-11-09 10:09:19,188 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [934 Valid, 1199 Invalid, 809 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [52 Valid, 757 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2024-11-09 10:09:19,189 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1371 states. [2024-11-09 10:09:19,198 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1371 to 986. [2024-11-09 10:09:19,199 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 986 states, 532 states have (on average 1.9417293233082706) internal successors, (1033), 978 states have internal predecessors, (1033), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2024-11-09 10:09:19,200 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 986 states to 986 states and 1043 transitions. [2024-11-09 10:09:19,200 INFO L78 Accepts]: Start accepts. Automaton has 986 states and 1043 transitions. Word has length 9 [2024-11-09 10:09:19,201 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 10:09:19,201 INFO L471 AbstractCegarLoop]: Abstraction has 986 states and 1043 transitions. [2024-11-09 10:09:19,201 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 4.5) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 10:09:19,201 INFO L276 IsEmpty]: Start isEmpty. Operand 986 states and 1043 transitions. [2024-11-09 10:09:19,201 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2024-11-09 10:09:19,201 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 10:09:19,201 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 10:09:19,208 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Ended with exit code 0 [2024-11-09 10:09:19,402 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-09 10:09:19,402 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 522 more)] === [2024-11-09 10:09:19,403 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 10:09:19,403 INFO L85 PathProgramCache]: Analyzing trace with hash -1599530193, now seen corresponding path program 1 times [2024-11-09 10:09:19,403 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 10:09:19,403 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [197901670] [2024-11-09 10:09:19,403 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 10:09:19,403 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-09 10:09:19,403 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 10:09:19,404 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-09 10:09:19,406 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-09 10:09:19,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:09:19,486 INFO L255 TraceCheckSpWp]: Trace formula consists of 66 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-09 10:09:19,488 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 10:09:19,498 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-09 10:09:19,514 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-09 10:09:19,515 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 10:09:19,515 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 10:09:19,515 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [197901670] [2024-11-09 10:09:19,515 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [197901670] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 10:09:19,515 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 10:09:19,515 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 10:09:19,515 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1284938430] [2024-11-09 10:09:19,515 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 10:09:19,516 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 10:09:19,516 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 10:09:19,516 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 10:09:19,516 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 10:09:19,516 INFO L87 Difference]: Start difference. First operand 986 states and 1043 transitions. Second operand has 3 states, 2 states have (on average 4.5) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 10:09:20,926 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 10:09:20,926 INFO L93 Difference]: Finished difference Result 1458 states and 1549 transitions. [2024-11-09 10:09:20,926 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 10:09:20,927 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 4.5) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2024-11-09 10:09:20,927 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 10:09:20,930 INFO L225 Difference]: With dead ends: 1458 [2024-11-09 10:09:20,930 INFO L226 Difference]: Without dead ends: 1458 [2024-11-09 10:09:20,930 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 7 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-09 10:09:20,932 INFO L432 NwaCegarLoop]: 1143 mSDtfsCounter, 691 mSDsluCounter, 425 mSDsCounter, 0 mSdLazyCounter, 723 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 692 SdHoareTripleChecker+Valid, 1568 SdHoareTripleChecker+Invalid, 736 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 723 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2024-11-09 10:09:20,932 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [692 Valid, 1568 Invalid, 736 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 723 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2024-11-09 10:09:20,935 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1458 states. [2024-11-09 10:09:20,947 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1458 to 1013. [2024-11-09 10:09:20,948 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1013 states, 569 states have (on average 1.9279437609841827) internal successors, (1097), 1005 states have internal predecessors, (1097), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2024-11-09 10:09:20,950 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1013 states to 1013 states and 1107 transitions. [2024-11-09 10:09:20,950 INFO L78 Accepts]: Start accepts. Automaton has 1013 states and 1107 transitions. Word has length 9 [2024-11-09 10:09:20,950 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 10:09:20,950 INFO L471 AbstractCegarLoop]: Abstraction has 1013 states and 1107 transitions. [2024-11-09 10:09:20,950 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 4.5) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 10:09:20,950 INFO L276 IsEmpty]: Start isEmpty. Operand 1013 states and 1107 transitions. [2024-11-09 10:09:20,952 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2024-11-09 10:09:20,952 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 10:09:20,952 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 10:09:20,956 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-09 10:09:21,155 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-09 10:09:21,156 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr519REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 522 more)] === [2024-11-09 10:09:21,156 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 10:09:21,156 INFO L85 PathProgramCache]: Analyzing trace with hash -152807585, now seen corresponding path program 1 times [2024-11-09 10:09:21,156 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 10:09:21,156 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [772936259] [2024-11-09 10:09:21,156 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 10:09:21,156 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-09 10:09:21,157 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 10:09:21,163 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-09 10:09:21,164 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-09 10:09:21,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:09:21,259 INFO L255 TraceCheckSpWp]: Trace formula consists of 83 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-09 10:09:21,260 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 10:09:21,326 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-09 10:09:21,326 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 10:09:21,326 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 10:09:21,326 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [772936259] [2024-11-09 10:09:21,326 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [772936259] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 10:09:21,326 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 10:09:21,327 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-09 10:09:21,327 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [636555900] [2024-11-09 10:09:21,327 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 10:09:21,327 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-09 10:09:21,327 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 10:09:21,327 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 10:09:21,327 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-09 10:09:21,327 INFO L87 Difference]: Start difference. First operand 1013 states and 1107 transitions. Second operand has 4 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 10:09:21,703 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 10:09:21,703 INFO L93 Difference]: Finished difference Result 1439 states and 1589 transitions. [2024-11-09 10:09:21,703 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-09 10:09:21,703 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 12 [2024-11-09 10:09:21,704 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 10:09:21,707 INFO L225 Difference]: With dead ends: 1439 [2024-11-09 10:09:21,707 INFO L226 Difference]: Without dead ends: 1439 [2024-11-09 10:09:21,707 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 9 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-09 10:09:21,707 INFO L432 NwaCegarLoop]: 1092 mSDtfsCounter, 449 mSDsluCounter, 1930 mSDsCounter, 0 mSdLazyCounter, 257 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 450 SdHoareTripleChecker+Valid, 3022 SdHoareTripleChecker+Invalid, 261 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 257 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-09 10:09:21,707 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [450 Valid, 3022 Invalid, 261 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 257 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-09 10:09:21,709 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1439 states. [2024-11-09 10:09:21,719 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1439 to 1260. [2024-11-09 10:09:21,720 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1260 states, 815 states have (on average 1.9116564417177915) internal successors, (1558), 1251 states have internal predecessors, (1558), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-11-09 10:09:21,722 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1260 states to 1260 states and 1570 transitions. [2024-11-09 10:09:21,722 INFO L78 Accepts]: Start accepts. Automaton has 1260 states and 1570 transitions. Word has length 12 [2024-11-09 10:09:21,722 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 10:09:21,722 INFO L471 AbstractCegarLoop]: Abstraction has 1260 states and 1570 transitions. [2024-11-09 10:09:21,723 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 10:09:21,723 INFO L276 IsEmpty]: Start isEmpty. Operand 1260 states and 1570 transitions. [2024-11-09 10:09:21,723 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2024-11-09 10:09:21,723 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 10:09:21,723 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 10:09:21,727 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 (8)] Ended with exit code 0 [2024-11-09 10:09:21,923 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-09 10:09:21,924 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr523ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 522 more)] === [2024-11-09 10:09:21,924 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 10:09:21,925 INFO L85 PathProgramCache]: Analyzing trace with hash -442067725, now seen corresponding path program 1 times [2024-11-09 10:09:21,925 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 10:09:21,925 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [705676216] [2024-11-09 10:09:21,925 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 10:09:21,925 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-09 10:09:21,925 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 10:09:21,926 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-09 10:09:21,927 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-09 10:09:22,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:09:22,043 INFO L255 TraceCheckSpWp]: Trace formula consists of 87 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-09 10:09:22,044 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 10:09:22,105 WARN L873 $PredicateComparison]: unable to prove that (exists ((|v_ULTIMATE.start_main_~#i~0#1.base_47| (_ BitVec 32))) (and (= |c_#valid| (store |c_ULTIMATE.start_main_old_#valid#1| |v_ULTIMATE.start_main_~#i~0#1.base_47| (_ bv0 1))) (= (_ bv0 1) (select |c_ULTIMATE.start_main_old_#valid#1| |v_ULTIMATE.start_main_~#i~0#1.base_47|)))) is different from true [2024-11-09 10:09:22,105 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-09 10:09:22,105 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 10:09:22,106 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 10:09:22,106 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [705676216] [2024-11-09 10:09:22,106 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [705676216] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 10:09:22,106 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 10:09:22,106 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 10:09:22,106 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1081098595] [2024-11-09 10:09:22,106 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 10:09:22,106 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-09 10:09:22,106 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 10:09:22,106 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 10:09:22,106 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=4, Unknown=1, NotChecked=2, Total=12 [2024-11-09 10:09:22,107 INFO L87 Difference]: Start difference. First operand 1260 states and 1570 transitions. Second operand has 4 states, 3 states have (on average 4.333333333333333) 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-09 10:09:23,111 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 10:09:23,111 INFO L93 Difference]: Finished difference Result 1620 states and 2013 transitions. [2024-11-09 10:09:23,112 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-09 10:09:23,112 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 4.333333333333333) 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-09 10:09:23,112 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 10:09:23,115 INFO L225 Difference]: With dead ends: 1620 [2024-11-09 10:09:23,115 INFO L226 Difference]: Without dead ends: 1616 [2024-11-09 10:09:23,115 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=4, Unknown=1, NotChecked=2, Total=12 [2024-11-09 10:09:23,116 INFO L432 NwaCegarLoop]: 883 mSDtfsCounter, 324 mSDsluCounter, 558 mSDsCounter, 0 mSdLazyCounter, 613 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 325 SdHoareTripleChecker+Valid, 1441 SdHoareTripleChecker+Invalid, 1973 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 613 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 1360 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2024-11-09 10:09:23,116 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [325 Valid, 1441 Invalid, 1973 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 613 Invalid, 0 Unknown, 1360 Unchecked, 1.0s Time] [2024-11-09 10:09:23,118 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1616 states. [2024-11-09 10:09:23,127 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1616 to 1344. [2024-11-09 10:09:23,128 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1344 states, 898 states have (on average 1.8930957683741647) internal successors, (1700), 1334 states have internal predecessors, (1700), 7 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2024-11-09 10:09:23,130 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1344 states to 1344 states and 1714 transitions. [2024-11-09 10:09:23,130 INFO L78 Accepts]: Start accepts. Automaton has 1344 states and 1714 transitions. Word has length 13 [2024-11-09 10:09:23,131 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 10:09:23,131 INFO L471 AbstractCegarLoop]: Abstraction has 1344 states and 1714 transitions. [2024-11-09 10:09:23,131 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 4.333333333333333) 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-09 10:09:23,131 INFO L276 IsEmpty]: Start isEmpty. Operand 1344 states and 1714 transitions. [2024-11-09 10:09:23,131 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2024-11-09 10:09:23,131 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 10:09:23,131 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 10:09:23,136 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-09 10:09:23,332 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-09 10:09:23,332 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr330REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 522 more)] === [2024-11-09 10:09:23,333 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 10:09:23,333 INFO L85 PathProgramCache]: Analyzing trace with hash -1410939272, now seen corresponding path program 1 times [2024-11-09 10:09:23,333 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 10:09:23,333 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [942576977] [2024-11-09 10:09:23,333 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 10:09:23,333 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 10:09:23,333 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 10:09:23,336 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-09 10:09:23,338 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-09 10:09:23,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:09:23,424 INFO L255 TraceCheckSpWp]: Trace formula consists of 89 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-09 10:09:23,425 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 10:09:23,431 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-09 10:09:23,431 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 10:09:23,431 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 10:09:23,431 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [942576977] [2024-11-09 10:09:23,431 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [942576977] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 10:09:23,431 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 10:09:23,431 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 10:09:23,431 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [245170938] [2024-11-09 10:09:23,432 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 10:09:23,432 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 10:09:23,432 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 10:09:23,432 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 10:09:23,432 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 10:09:23,432 INFO L87 Difference]: Start difference. First operand 1344 states and 1714 transitions. Second operand has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 0 states have call successors, (0), 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-09 10:09:23,456 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 10:09:23,457 INFO L93 Difference]: Finished difference Result 1266 states and 1585 transitions. [2024-11-09 10:09:23,457 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 10:09:23,457 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 0 states have call successors, (0), 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 14 [2024-11-09 10:09:23,457 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 10:09:23,460 INFO L225 Difference]: With dead ends: 1266 [2024-11-09 10:09:23,460 INFO L226 Difference]: Without dead ends: 1266 [2024-11-09 10:09:23,460 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 12 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-09 10:09:23,460 INFO L432 NwaCegarLoop]: 969 mSDtfsCounter, 71 mSDsluCounter, 906 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 71 SdHoareTripleChecker+Valid, 1875 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-09 10:09:23,461 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [71 Valid, 1875 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 10:09:23,462 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1266 states. [2024-11-09 10:09:23,469 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1266 to 1266. [2024-11-09 10:09:23,471 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1266 states, 844 states have (on average 1.8613744075829384) internal successors, (1571), 1256 states have internal predecessors, (1571), 7 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2024-11-09 10:09:23,473 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1266 states to 1266 states and 1585 transitions. [2024-11-09 10:09:23,473 INFO L78 Accepts]: Start accepts. Automaton has 1266 states and 1585 transitions. Word has length 14 [2024-11-09 10:09:23,473 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 10:09:23,473 INFO L471 AbstractCegarLoop]: Abstraction has 1266 states and 1585 transitions. [2024-11-09 10:09:23,473 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 0 states have call successors, (0), 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-09 10:09:23,474 INFO L276 IsEmpty]: Start isEmpty. Operand 1266 states and 1585 transitions. [2024-11-09 10:09:23,474 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2024-11-09 10:09:23,474 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 10:09:23,474 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 10:09:23,479 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 (10)] Forceful destruction successful, exit code 0 [2024-11-09 10:09:23,675 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-09 10:09:23,675 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr354REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 522 more)] === [2024-11-09 10:09:23,675 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 10:09:23,675 INFO L85 PathProgramCache]: Analyzing trace with hash 1297050578, now seen corresponding path program 1 times [2024-11-09 10:09:23,676 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 10:09:23,676 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1940313896] [2024-11-09 10:09:23,676 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 10:09:23,676 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-09 10:09:23,676 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 10:09:23,677 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-09 10:09:23,678 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-09 10:09:23,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:09:23,763 INFO L255 TraceCheckSpWp]: Trace formula consists of 92 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-09 10:09:23,764 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 10:09:23,783 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-09 10:09:23,783 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 10:09:23,783 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 10:09:23,783 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1940313896] [2024-11-09 10:09:23,783 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1940313896] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 10:09:23,783 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 10:09:23,783 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-09 10:09:23,784 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1808699466] [2024-11-09 10:09:23,784 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 10:09:23,784 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-09 10:09:23,784 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 10:09:23,784 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 10:09:23,784 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-09 10:09:23,784 INFO L87 Difference]: Start difference. First operand 1266 states and 1585 transitions. Second operand has 4 states, 4 states have (on average 4.0) internal successors, (16), 4 states have internal predecessors, (16), 0 states have call successors, (0), 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-09 10:09:23,838 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 10:09:23,838 INFO L93 Difference]: Finished difference Result 1228 states and 1498 transitions. [2024-11-09 10:09:23,838 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-09 10:09:23,838 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.0) internal successors, (16), 4 states have internal predecessors, (16), 0 states have call successors, (0), 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 16 [2024-11-09 10:09:23,838 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 10:09:23,841 INFO L225 Difference]: With dead ends: 1228 [2024-11-09 10:09:23,841 INFO L226 Difference]: Without dead ends: 1228 [2024-11-09 10:09:23,841 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 13 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-09 10:09:23,841 INFO L432 NwaCegarLoop]: 924 mSDtfsCounter, 48 mSDsluCounter, 1822 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 48 SdHoareTripleChecker+Valid, 2746 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.0s IncrementalHoareTripleChecker+Time [2024-11-09 10:09:23,842 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [48 Valid, 2746 Invalid, 59 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 10:09:23,843 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1228 states. [2024-11-09 10:09:23,850 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1228 to 1228. [2024-11-09 10:09:23,851 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1228 states, 820 states have (on average 1.8097560975609757) internal successors, (1484), 1218 states have internal predecessors, (1484), 7 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2024-11-09 10:09:23,853 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1228 states to 1228 states and 1498 transitions. [2024-11-09 10:09:23,853 INFO L78 Accepts]: Start accepts. Automaton has 1228 states and 1498 transitions. Word has length 16 [2024-11-09 10:09:23,853 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 10:09:23,853 INFO L471 AbstractCegarLoop]: Abstraction has 1228 states and 1498 transitions. [2024-11-09 10:09:23,853 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.0) internal successors, (16), 4 states have internal predecessors, (16), 0 states have call successors, (0), 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-09 10:09:23,854 INFO L276 IsEmpty]: Start isEmpty. Operand 1228 states and 1498 transitions. [2024-11-09 10:09:23,854 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2024-11-09 10:09:23,854 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 10:09:23,854 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 10:09:23,857 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Ended with exit code 0 [2024-11-09 10:09:24,054 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-09 10:09:24,055 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 522 more)] === [2024-11-09 10:09:24,056 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 10:09:24,056 INFO L85 PathProgramCache]: Analyzing trace with hash -179577126, now seen corresponding path program 1 times [2024-11-09 10:09:24,056 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 10:09:24,056 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [506336639] [2024-11-09 10:09:24,056 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 10:09:24,056 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-09 10:09:24,057 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 10:09:24,059 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-09 10:09:24,060 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-09 10:09:24,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:09:24,171 INFO L255 TraceCheckSpWp]: Trace formula consists of 131 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-09 10:09:24,173 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 10:09:24,178 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-09 10:09:24,179 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 10:09:24,179 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 10:09:24,179 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [506336639] [2024-11-09 10:09:24,179 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [506336639] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 10:09:24,179 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 10:09:24,179 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 10:09:24,179 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [365406410] [2024-11-09 10:09:24,179 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 10:09:24,179 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 10:09:24,179 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 10:09:24,180 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 10:09:24,180 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 10:09:24,180 INFO L87 Difference]: Start difference. First operand 1228 states and 1498 transitions. Second operand has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 10:09:24,197 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 10:09:24,197 INFO L93 Difference]: Finished difference Result 1168 states and 1412 transitions. [2024-11-09 10:09:24,197 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 10:09:24,197 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2024-11-09 10:09:24,198 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 10:09:24,200 INFO L225 Difference]: With dead ends: 1168 [2024-11-09 10:09:24,200 INFO L226 Difference]: Without dead ends: 1168 [2024-11-09 10:09:24,200 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 17 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-09 10:09:24,201 INFO L432 NwaCegarLoop]: 891 mSDtfsCounter, 71 mSDsluCounter, 828 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 71 SdHoareTripleChecker+Valid, 1719 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-09 10:09:24,201 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [71 Valid, 1719 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 10:09:24,202 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1168 states. [2024-11-09 10:09:24,208 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1168 to 1168. [2024-11-09 10:09:24,210 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1168 states, 784 states have (on average 1.7831632653061225) internal successors, (1398), 1158 states have internal predecessors, (1398), 7 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2024-11-09 10:09:24,211 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1168 states to 1168 states and 1412 transitions. [2024-11-09 10:09:24,212 INFO L78 Accepts]: Start accepts. Automaton has 1168 states and 1412 transitions. Word has length 19 [2024-11-09 10:09:24,212 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 10:09:24,212 INFO L471 AbstractCegarLoop]: Abstraction has 1168 states and 1412 transitions. [2024-11-09 10:09:24,212 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 10:09:24,212 INFO L276 IsEmpty]: Start isEmpty. Operand 1168 states and 1412 transitions. [2024-11-09 10:09:24,212 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2024-11-09 10:09:24,213 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 10:09:24,213 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] [2024-11-09 10:09:24,218 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 (12)] Forceful destruction successful, exit code 0 [2024-11-09 10:09:24,413 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-09 10:09:24,414 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr38REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 522 more)] === [2024-11-09 10:09:24,414 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 10:09:24,414 INFO L85 PathProgramCache]: Analyzing trace with hash -774929132, now seen corresponding path program 1 times [2024-11-09 10:09:24,414 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 10:09:24,415 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [410687686] [2024-11-09 10:09:24,415 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 10:09:24,415 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-09 10:09:24,415 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 10:09:24,417 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-09 10:09:24,418 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-09 10:09:24,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:09:24,562 INFO L255 TraceCheckSpWp]: Trace formula consists of 134 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-09 10:09:24,563 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 10:09:24,578 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-09 10:09:24,578 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 10:09:24,578 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 10:09:24,578 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [410687686] [2024-11-09 10:09:24,578 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [410687686] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 10:09:24,578 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 10:09:24,578 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-09 10:09:24,578 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [864826247] [2024-11-09 10:09:24,579 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 10:09:24,579 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-09 10:09:24,579 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 10:09:24,579 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 10:09:24,579 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-09 10:09:24,579 INFO L87 Difference]: Start difference. First operand 1168 states and 1412 transitions. Second operand has 4 states, 4 states have (on average 5.25) internal successors, (21), 4 states have internal predecessors, (21), 0 states have call successors, (0), 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-09 10:09:24,633 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 10:09:24,634 INFO L93 Difference]: Finished difference Result 1138 states and 1354 transitions. [2024-11-09 10:09:24,634 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-09 10:09:24,634 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.25) internal successors, (21), 4 states have internal predecessors, (21), 0 states have call successors, (0), 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 21 [2024-11-09 10:09:24,634 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 10:09:24,637 INFO L225 Difference]: With dead ends: 1138 [2024-11-09 10:09:24,637 INFO L226 Difference]: Without dead ends: 1138 [2024-11-09 10:09:24,637 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 18 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-09 10:09:24,637 INFO L432 NwaCegarLoop]: 846 mSDtfsCounter, 48 mSDsluCounter, 1666 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 48 SdHoareTripleChecker+Valid, 2512 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.0s IncrementalHoareTripleChecker+Time [2024-11-09 10:09:24,637 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [48 Valid, 2512 Invalid, 59 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 10:09:24,638 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1138 states. [2024-11-09 10:09:24,644 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1138 to 1138. [2024-11-09 10:09:24,645 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1138 states, 768 states have (on average 1.7447916666666667) internal successors, (1340), 1128 states have internal predecessors, (1340), 7 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2024-11-09 10:09:24,647 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1138 states to 1138 states and 1354 transitions. [2024-11-09 10:09:24,648 INFO L78 Accepts]: Start accepts. Automaton has 1138 states and 1354 transitions. Word has length 21 [2024-11-09 10:09:24,648 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 10:09:24,649 INFO L471 AbstractCegarLoop]: Abstraction has 1138 states and 1354 transitions. [2024-11-09 10:09:24,649 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.25) internal successors, (21), 4 states have internal predecessors, (21), 0 states have call successors, (0), 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-09 10:09:24,649 INFO L276 IsEmpty]: Start isEmpty. Operand 1138 states and 1354 transitions. [2024-11-09 10:09:24,651 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2024-11-09 10:09:24,651 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 10:09:24,651 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] [2024-11-09 10:09:24,656 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 (13)] Forceful destruction successful, exit code 0 [2024-11-09 10:09:24,852 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-09 10:09:24,852 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr368REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 522 more)] === [2024-11-09 10:09:24,852 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 10:09:24,853 INFO L85 PathProgramCache]: Analyzing trace with hash 727437120, now seen corresponding path program 1 times [2024-11-09 10:09:24,853 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 10:09:24,853 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1429759638] [2024-11-09 10:09:24,853 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 10:09:24,853 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-09 10:09:24,853 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 10:09:24,854 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-09 10:09:24,855 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-09 10:09:24,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:09:24,948 INFO L255 TraceCheckSpWp]: Trace formula consists of 106 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-09 10:09:24,949 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 10:09:24,956 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-09 10:09: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-09 10:09:25,018 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 10:09:25,018 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 10:09:25,018 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1429759638] [2024-11-09 10:09:25,018 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1429759638] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 10:09:25,018 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 10:09:25,018 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 10:09:25,018 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1108469220] [2024-11-09 10:09:25,018 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 10:09:25,018 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-09 10:09:25,019 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 10:09:25,019 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 10:09:25,019 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-09 10:09:25,019 INFO L87 Difference]: Start difference. First operand 1138 states and 1354 transitions. Second operand has 4 states, 3 states have (on average 10.0) internal successors, (30), 4 states have internal predecessors, (30), 0 states have call successors, (0), 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-09 10:09:25,947 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 10:09:25,947 INFO L93 Difference]: Finished difference Result 1154 states and 1362 transitions. [2024-11-09 10:09:25,947 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-09 10:09:25,948 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 10.0) internal successors, (30), 4 states have internal predecessors, (30), 0 states have call successors, (0), 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 30 [2024-11-09 10:09:25,948 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 10:09:25,950 INFO L225 Difference]: With dead ends: 1154 [2024-11-09 10:09:25,951 INFO L226 Difference]: Without dead ends: 1154 [2024-11-09 10:09:25,951 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 27 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-09 10:09:25,951 INFO L432 NwaCegarLoop]: 526 mSDtfsCounter, 770 mSDsluCounter, 502 mSDsCounter, 0 mSdLazyCounter, 795 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 775 SdHoareTripleChecker+Valid, 1028 SdHoareTripleChecker+Invalid, 804 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 795 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-11-09 10:09:25,951 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [775 Valid, 1028 Invalid, 804 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 795 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-11-09 10:09:25,962 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1154 states. [2024-11-09 10:09:25,969 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1154 to 1134. [2024-11-09 10:09:25,971 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1134 states, 768 states have (on average 1.7291666666666667) internal successors, (1328), 1124 states have internal predecessors, (1328), 7 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2024-11-09 10:09:25,973 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1134 states to 1134 states and 1342 transitions. [2024-11-09 10:09:25,973 INFO L78 Accepts]: Start accepts. Automaton has 1134 states and 1342 transitions. Word has length 30 [2024-11-09 10:09:25,973 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 10:09:25,973 INFO L471 AbstractCegarLoop]: Abstraction has 1134 states and 1342 transitions. [2024-11-09 10:09:25,973 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 10.0) internal successors, (30), 4 states have internal predecessors, (30), 0 states have call successors, (0), 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-09 10:09:25,973 INFO L276 IsEmpty]: Start isEmpty. Operand 1134 states and 1342 transitions. [2024-11-09 10:09:25,973 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2024-11-09 10:09:25,973 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 10:09:25,973 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] [2024-11-09 10:09:25,982 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-09 10:09:26,174 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-09 10:09:26,174 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr369REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 522 more)] === [2024-11-09 10:09:26,175 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 10:09:26,175 INFO L85 PathProgramCache]: Analyzing trace with hash 727437121, now seen corresponding path program 1 times [2024-11-09 10:09:26,175 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 10:09:26,175 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1435734799] [2024-11-09 10:09:26,175 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 10:09:26,175 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-09 10:09:26,175 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 10:09:26,178 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-09 10:09:26,178 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-09 10:09:26,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:09:26,271 INFO L255 TraceCheckSpWp]: Trace formula consists of 106 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-09 10:09:26,273 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 10:09:26,279 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-09 10:09:26,384 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-09 10:09:26,384 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 10:09:26,384 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 10:09:26,384 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1435734799] [2024-11-09 10:09:26,384 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1435734799] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 10:09:26,384 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 10:09:26,384 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 10:09:26,384 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1781962174] [2024-11-09 10:09:26,384 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 10:09:26,385 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-09 10:09:26,385 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 10:09:26,385 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 10:09:26,385 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-09 10:09:26,385 INFO L87 Difference]: Start difference. First operand 1134 states and 1342 transitions. Second operand has 4 states, 3 states have (on average 10.0) internal successors, (30), 4 states have internal predecessors, (30), 0 states have call successors, (0), 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-09 10:09:27,834 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 10:09:27,834 INFO L93 Difference]: Finished difference Result 1610 states and 1942 transitions. [2024-11-09 10:09:27,835 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-09 10:09:27,835 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 10.0) internal successors, (30), 4 states have internal predecessors, (30), 0 states have call successors, (0), 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 30 [2024-11-09 10:09:27,835 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 10:09:27,838 INFO L225 Difference]: With dead ends: 1610 [2024-11-09 10:09:27,838 INFO L226 Difference]: Without dead ends: 1610 [2024-11-09 10:09:27,839 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 27 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-09 10:09:27,839 INFO L432 NwaCegarLoop]: 716 mSDtfsCounter, 361 mSDsluCounter, 887 mSDsCounter, 0 mSdLazyCounter, 986 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 363 SdHoareTripleChecker+Valid, 1603 SdHoareTripleChecker+Invalid, 989 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 986 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2024-11-09 10:09:27,839 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [363 Valid, 1603 Invalid, 989 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 986 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2024-11-09 10:09:27,840 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1610 states. [2024-11-09 10:09:27,849 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1610 to 1448. [2024-11-09 10:09:27,850 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1448 states, 1080 states have (on average 1.7564814814814815) internal successors, (1897), 1436 states have internal predecessors, (1897), 9 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2024-11-09 10:09:27,852 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1448 states to 1448 states and 1915 transitions. [2024-11-09 10:09:27,852 INFO L78 Accepts]: Start accepts. Automaton has 1448 states and 1915 transitions. Word has length 30 [2024-11-09 10:09:27,852 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 10:09:27,852 INFO L471 AbstractCegarLoop]: Abstraction has 1448 states and 1915 transitions. [2024-11-09 10:09:27,852 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 10.0) internal successors, (30), 4 states have internal predecessors, (30), 0 states have call successors, (0), 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-09 10:09:27,852 INFO L276 IsEmpty]: Start isEmpty. Operand 1448 states and 1915 transitions. [2024-11-09 10:09:27,852 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2024-11-09 10:09:27,852 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 10:09:27,853 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] [2024-11-09 10:09:27,856 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-09 10:09:28,053 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-09 10:09:28,053 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr52REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 522 more)] === [2024-11-09 10:09:28,053 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 10:09:28,054 INFO L85 PathProgramCache]: Analyzing trace with hash -1929064798, now seen corresponding path program 1 times [2024-11-09 10:09:28,054 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 10:09:28,054 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [521151069] [2024-11-09 10:09:28,054 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 10:09:28,054 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-09 10:09:28,054 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 10:09:28,055 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-09 10:09:28,056 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-09 10:09:28,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:09:28,176 INFO L255 TraceCheckSpWp]: Trace formula consists of 148 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-09 10:09:28,177 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 10:09:28,181 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2024-11-09 10:09:28,232 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-09 10:09:28,232 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 10:09:28,232 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 10:09:28,232 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [521151069] [2024-11-09 10:09:28,233 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [521151069] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 10:09:28,233 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 10:09:28,233 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 10:09:28,233 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [487767747] [2024-11-09 10:09:28,233 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 10:09:28,233 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-09 10:09:28,233 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 10:09:28,233 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 10:09:28,233 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-09 10:09:28,233 INFO L87 Difference]: Start difference. First operand 1448 states and 1915 transitions. Second operand has 4 states, 3 states have (on average 11.666666666666666) internal successors, (35), 4 states have internal predecessors, (35), 0 states have call successors, (0), 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-09 10:09:29,465 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 10:09:29,465 INFO L93 Difference]: Finished difference Result 1898 states and 2489 transitions. [2024-11-09 10:09:29,466 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-09 10:09:29,466 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 11.666666666666666) internal successors, (35), 4 states have internal predecessors, (35), 0 states have call successors, (0), 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 35 [2024-11-09 10:09:29,466 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 10:09:29,470 INFO L225 Difference]: With dead ends: 1898 [2024-11-09 10:09:29,470 INFO L226 Difference]: Without dead ends: 1898 [2024-11-09 10:09:29,471 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 32 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-09 10:09:29,471 INFO L432 NwaCegarLoop]: 782 mSDtfsCounter, 780 mSDsluCounter, 793 mSDsCounter, 0 mSdLazyCounter, 1186 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 785 SdHoareTripleChecker+Valid, 1575 SdHoareTripleChecker+Invalid, 1194 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 1186 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2024-11-09 10:09:29,471 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [785 Valid, 1575 Invalid, 1194 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 1186 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2024-11-09 10:09:29,473 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1898 states. [2024-11-09 10:09:29,482 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1898 to 1444. [2024-11-09 10:09:29,484 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1444 states, 1080 states have (on average 1.749074074074074) internal successors, (1889), 1432 states have internal predecessors, (1889), 9 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2024-11-09 10:09:29,486 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1444 states to 1444 states and 1907 transitions. [2024-11-09 10:09:29,486 INFO L78 Accepts]: Start accepts. Automaton has 1444 states and 1907 transitions. Word has length 35 [2024-11-09 10:09:29,486 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 10:09:29,486 INFO L471 AbstractCegarLoop]: Abstraction has 1444 states and 1907 transitions. [2024-11-09 10:09:29,486 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 11.666666666666666) internal successors, (35), 4 states have internal predecessors, (35), 0 states have call successors, (0), 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-09 10:09:29,486 INFO L276 IsEmpty]: Start isEmpty. Operand 1444 states and 1907 transitions. [2024-11-09 10:09:29,487 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2024-11-09 10:09:29,487 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 10:09:29,487 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] [2024-11-09 10:09:29,492 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-09 10:09:29,687 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-09 10:09:29,688 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr53REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 522 more)] === [2024-11-09 10:09:29,688 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 10:09:29,688 INFO L85 PathProgramCache]: Analyzing trace with hash -1929064797, now seen corresponding path program 1 times [2024-11-09 10:09:29,689 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 10:09:29,689 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1648910347] [2024-11-09 10:09:29,689 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 10:09:29,689 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-09 10:09:29,689 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 10:09:29,690 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-09 10:09:29,691 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-09 10:09:29,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:09:29,821 INFO L255 TraceCheckSpWp]: Trace formula consists of 148 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-09 10:09:29,823 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 10:09:29,833 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-09 10:09:29,944 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-09 10:09:29,944 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 10:09:29,944 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 10:09:29,944 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1648910347] [2024-11-09 10:09:29,944 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1648910347] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 10:09:29,944 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 10:09:29,944 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 10:09:29,944 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1376472976] [2024-11-09 10:09:29,944 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 10:09:29,944 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-09 10:09:29,945 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 10:09:29,945 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 10:09:29,945 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-09 10:09:29,945 INFO L87 Difference]: Start difference. First operand 1444 states and 1907 transitions. Second operand has 4 states, 3 states have (on average 11.666666666666666) internal successors, (35), 4 states have internal predecessors, (35), 0 states have call successors, (0), 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-09 10:09:31,515 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 10:09:31,515 INFO L93 Difference]: Finished difference Result 1958 states and 2513 transitions. [2024-11-09 10:09:31,515 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-09 10:09:31,516 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 11.666666666666666) internal successors, (35), 4 states have internal predecessors, (35), 0 states have call successors, (0), 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 35 [2024-11-09 10:09:31,516 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 10:09:31,520 INFO L225 Difference]: With dead ends: 1958 [2024-11-09 10:09:31,521 INFO L226 Difference]: Without dead ends: 1958 [2024-11-09 10:09:31,521 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 32 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-09 10:09:31,521 INFO L432 NwaCegarLoop]: 1063 mSDtfsCounter, 538 mSDsluCounter, 1041 mSDsCounter, 0 mSdLazyCounter, 1201 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 539 SdHoareTripleChecker+Valid, 2104 SdHoareTripleChecker+Invalid, 1204 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 1201 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2024-11-09 10:09:31,521 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [539 Valid, 2104 Invalid, 1204 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 1201 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2024-11-09 10:09:31,523 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1958 states. [2024-11-09 10:09:31,533 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1958 to 1440. [2024-11-09 10:09:31,534 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1440 states, 1080 states have (on average 1.7416666666666667) internal successors, (1881), 1428 states have internal predecessors, (1881), 9 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2024-11-09 10:09:31,535 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1440 states to 1440 states and 1899 transitions. [2024-11-09 10:09:31,535 INFO L78 Accepts]: Start accepts. Automaton has 1440 states and 1899 transitions. Word has length 35 [2024-11-09 10:09:31,536 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 10:09:31,536 INFO L471 AbstractCegarLoop]: Abstraction has 1440 states and 1899 transitions. [2024-11-09 10:09:31,536 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 11.666666666666666) internal successors, (35), 4 states have internal predecessors, (35), 0 states have call successors, (0), 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-09 10:09:31,536 INFO L276 IsEmpty]: Start isEmpty. Operand 1440 states and 1899 transitions. [2024-11-09 10:09:31,536 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2024-11-09 10:09:31,536 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 10:09:31,536 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 10:09:31,542 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-09 10:09:31,737 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-09 10:09:31,737 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr414REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 522 more)] === [2024-11-09 10:09:31,737 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 10:09:31,737 INFO L85 PathProgramCache]: Analyzing trace with hash 188750135, now seen corresponding path program 1 times [2024-11-09 10:09:31,738 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 10:09:31,738 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1423318689] [2024-11-09 10:09:31,738 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 10:09:31,738 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-09 10:09:31,738 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 10:09:31,739 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-09 10:09:31,740 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-09 10:09:31,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:09:31,855 INFO L255 TraceCheckSpWp]: Trace formula consists of 130 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-09 10:09:31,857 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 10:09:31,885 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-09 10:09:31,886 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 10:09:31,886 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 10:09:31,886 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1423318689] [2024-11-09 10:09:31,886 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1423318689] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 10:09:31,886 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 10:09:31,886 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-09 10:09:31,886 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1582271709] [2024-11-09 10:09:31,886 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 10:09:31,887 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-09 10:09:31,887 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 10:09:31,888 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 10:09:31,888 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-09 10:09:31,888 INFO L87 Difference]: Start difference. First operand 1440 states and 1899 transitions. Second operand has 4 states, 4 states have (on average 12.25) internal successors, (49), 4 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 10:09:31,927 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 10:09:31,927 INFO L93 Difference]: Finished difference Result 1410 states and 1849 transitions. [2024-11-09 10:09:31,927 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-09 10:09:31,927 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.25) internal successors, (49), 4 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 49 [2024-11-09 10:09:31,927 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 10:09:31,930 INFO L225 Difference]: With dead ends: 1410 [2024-11-09 10:09:31,930 INFO L226 Difference]: Without dead ends: 1410 [2024-11-09 10:09:31,931 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 46 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-09 10:09:31,931 INFO L432 NwaCegarLoop]: 836 mSDtfsCounter, 27 mSDsluCounter, 1635 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 2471 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-09 10:09:31,934 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [27 Valid, 2471 Invalid, 44 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 10:09:31,935 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1410 states. [2024-11-09 10:09:31,943 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1410 to 1410. [2024-11-09 10:09:31,944 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1410 states, 1050 states have (on average 1.743809523809524) internal successors, (1831), 1398 states have internal predecessors, (1831), 9 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2024-11-09 10:09:31,946 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1410 states to 1410 states and 1849 transitions. [2024-11-09 10:09:31,946 INFO L78 Accepts]: Start accepts. Automaton has 1410 states and 1849 transitions. Word has length 49 [2024-11-09 10:09:31,946 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 10:09:31,946 INFO L471 AbstractCegarLoop]: Abstraction has 1410 states and 1849 transitions. [2024-11-09 10:09:31,946 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.25) internal successors, (49), 4 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 10:09:31,946 INFO L276 IsEmpty]: Start isEmpty. Operand 1410 states and 1849 transitions. [2024-11-09 10:09:31,946 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2024-11-09 10:09:31,946 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 10:09:31,946 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-09 10:09:31,953 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-09 10:09:32,147 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-09 10:09:32,147 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr71REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 522 more)] === [2024-11-09 10:09:32,148 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 10:09:32,148 INFO L85 PathProgramCache]: Analyzing trace with hash -848059422, now seen corresponding path program 1 times [2024-11-09 10:09:32,148 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 10:09:32,148 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1345297631] [2024-11-09 10:09:32,148 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 10:09:32,148 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-09 10:09:32,148 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 10:09:32,151 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-09 10:09:32,161 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-09 10:09:32,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:09:32,324 INFO L255 TraceCheckSpWp]: Trace formula consists of 255 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-09 10:09:32,325 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 10:09:32,346 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-09 10:09:32,346 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 10:09:32,346 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 10:09:32,347 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1345297631] [2024-11-09 10:09:32,347 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1345297631] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 10:09:32,347 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 10:09:32,347 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-09 10:09:32,347 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [51484155] [2024-11-09 10:09:32,347 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 10:09:32,347 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-09 10:09:32,347 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 10:09:32,347 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 10:09:32,347 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-09 10:09:32,348 INFO L87 Difference]: Start difference. First operand 1410 states and 1849 transitions. Second operand has 4 states, 4 states have (on average 13.5) 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-09 10:09:32,379 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 10:09:32,379 INFO L93 Difference]: Finished difference Result 1398 states and 1829 transitions. [2024-11-09 10:09:32,380 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-09 10:09:32,380 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 13.5) 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-09 10:09:32,380 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 10:09:32,383 INFO L225 Difference]: With dead ends: 1398 [2024-11-09 10:09:32,383 INFO L226 Difference]: Without dead ends: 1398 [2024-11-09 10:09:32,383 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 51 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-09 10:09:32,383 INFO L432 NwaCegarLoop]: 832 mSDtfsCounter, 21 mSDsluCounter, 1633 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 2465 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-09 10:09:32,383 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 2465 Invalid, 44 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 10:09:32,385 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1398 states. [2024-11-09 10:09:32,392 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1398 to 1398. [2024-11-09 10:09:32,393 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1398 states, 1038 states have (on average 1.7447013487475915) internal successors, (1811), 1386 states have internal predecessors, (1811), 9 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2024-11-09 10:09:32,396 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1398 states to 1398 states and 1829 transitions. [2024-11-09 10:09:32,396 INFO L78 Accepts]: Start accepts. Automaton has 1398 states and 1829 transitions. Word has length 54 [2024-11-09 10:09:32,396 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 10:09:32,396 INFO L471 AbstractCegarLoop]: Abstraction has 1398 states and 1829 transitions. [2024-11-09 10:09:32,397 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.5) 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-09 10:09:32,397 INFO L276 IsEmpty]: Start isEmpty. Operand 1398 states and 1829 transitions. [2024-11-09 10:09:32,397 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2024-11-09 10:09:32,398 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 10:09:32,398 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] [2024-11-09 10:09:32,403 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 (19)] Ended with exit code 0 [2024-11-09 10:09:32,598 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 /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-09 10:09:32,598 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr414REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 522 more)] === [2024-11-09 10:09:32,599 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 10:09:32,599 INFO L85 PathProgramCache]: Analyzing trace with hash 1405455467, now seen corresponding path program 1 times [2024-11-09 10:09:32,599 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 10:09:32,599 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2084659579] [2024-11-09 10:09:32,599 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 10:09:32,599 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-09 10:09:32,599 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 10:09:32,600 INFO L229 MonitoredProcess]: Starting monitored process 20 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-09 10:09:32,601 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 (20)] Waiting until timeout for monitored process [2024-11-09 10:09:32,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:09:32,727 INFO L255 TraceCheckSpWp]: Trace formula consists of 154 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-09 10:09:32,728 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 10:09:32,754 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-09 10:09:32,755 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 10:09:32,755 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 10:09:32,755 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2084659579] [2024-11-09 10:09:32,755 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2084659579] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 10:09:32,755 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 10:09:32,755 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 10:09:32,755 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [557769983] [2024-11-09 10:09:32,755 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 10:09:32,756 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 10:09:32,756 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 10:09:32,756 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 10:09:32,756 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 10:09:32,756 INFO L87 Difference]: Start difference. First operand 1398 states and 1829 transitions. Second operand has 3 states, 3 states have (on average 19.0) internal successors, (57), 3 states have internal predecessors, (57), 0 states have call successors, (0), 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-09 10:09:32,813 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 10:09:32,813 INFO L93 Difference]: Finished difference Result 1187 states and 1276 transitions. [2024-11-09 10:09:32,814 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 10:09:32,814 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 19.0) internal successors, (57), 3 states have internal predecessors, (57), 0 states have call successors, (0), 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 57 [2024-11-09 10:09:32,814 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 10:09:32,816 INFO L225 Difference]: With dead ends: 1187 [2024-11-09 10:09:32,816 INFO L226 Difference]: Without dead ends: 1187 [2024-11-09 10:09:32,817 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 55 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-09 10:09:32,817 INFO L432 NwaCegarLoop]: 908 mSDtfsCounter, 101 mSDsluCounter, 780 mSDsCounter, 0 mSdLazyCounter, 29 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 103 SdHoareTripleChecker+Valid, 1688 SdHoareTripleChecker+Invalid, 34 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 29 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 10:09:32,817 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [103 Valid, 1688 Invalid, 34 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 29 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 10:09:32,818 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1187 states. [2024-11-09 10:09:32,824 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1187 to 1035. [2024-11-09 10:09:32,825 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1035 states, 677 states have (on average 1.6292466765140325) internal successors, (1103), 1025 states have internal predecessors, (1103), 7 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2024-11-09 10:09:32,826 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1035 states to 1035 states and 1117 transitions. [2024-11-09 10:09:32,826 INFO L78 Accepts]: Start accepts. Automaton has 1035 states and 1117 transitions. Word has length 57 [2024-11-09 10:09:32,826 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 10:09:32,826 INFO L471 AbstractCegarLoop]: Abstraction has 1035 states and 1117 transitions. [2024-11-09 10:09:32,826 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 19.0) internal successors, (57), 3 states have internal predecessors, (57), 0 states have call successors, (0), 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-09 10:09:32,826 INFO L276 IsEmpty]: Start isEmpty. Operand 1035 states and 1117 transitions. [2024-11-09 10:09:32,827 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2024-11-09 10:09:32,827 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 10:09:32,827 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] [2024-11-09 10:09:32,832 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 (20)] Ended with exit code 0 [2024-11-09 10:09:33,027 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 20 /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-09 10:09:33,028 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 522 more)] === [2024-11-09 10:09:33,028 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 10:09:33,028 INFO L85 PathProgramCache]: Analyzing trace with hash 1889193196, now seen corresponding path program 1 times [2024-11-09 10:09:33,028 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 10:09:33,028 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [166731439] [2024-11-09 10:09:33,028 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 10:09:33,029 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-09 10:09:33,029 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 10:09:33,030 INFO L229 MonitoredProcess]: Starting monitored process 21 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-09 10:09:33,030 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 (21)] Waiting until timeout for monitored process [2024-11-09 10:09:33,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:09:33,183 INFO L255 TraceCheckSpWp]: Trace formula consists of 159 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-11-09 10:09:33,185 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 10:09:33,199 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-09 10:09:33,199 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-09 10:09:33,200 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-09 10:09:33,202 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 39 [2024-11-09 10:09:33,255 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 10:09:33,256 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 70 treesize of output 26 [2024-11-09 10:09:33,292 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-09 10:09:33,292 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 10:09:33,292 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 10:09:33,292 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [166731439] [2024-11-09 10:09:33,292 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [166731439] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 10:09:33,292 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 10:09:33,292 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-09 10:09:33,292 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [141352064] [2024-11-09 10:09:33,292 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 10:09:33,293 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-09 10:09:33,293 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 10:09:33,293 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-09 10:09:33,293 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2024-11-09 10:09:33,293 INFO L87 Difference]: Start difference. First operand 1035 states and 1117 transitions. Second operand has 6 states, 6 states have (on average 9.833333333333334) internal successors, (59), 6 states have internal predecessors, (59), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 10:09:33,521 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 10:09:33,522 INFO L93 Difference]: Finished difference Result 1703 states and 1821 transitions. [2024-11-09 10:09:33,522 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-09 10:09:33,522 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.833333333333334) internal successors, (59), 6 states have internal predecessors, (59), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 60 [2024-11-09 10:09:33,522 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 10:09:33,525 INFO L225 Difference]: With dead ends: 1703 [2024-11-09 10:09:33,525 INFO L226 Difference]: Without dead ends: 1700 [2024-11-09 10:09:33,525 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 55 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2024-11-09 10:09:33,525 INFO L432 NwaCegarLoop]: 1041 mSDtfsCounter, 1577 mSDsluCounter, 2912 mSDsCounter, 0 mSdLazyCounter, 118 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1585 SdHoareTripleChecker+Valid, 3953 SdHoareTripleChecker+Invalid, 120 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 118 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-09 10:09:33,525 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1585 Valid, 3953 Invalid, 120 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 118 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-09 10:09:33,527 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1700 states. [2024-11-09 10:09:33,532 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1700 to 982. [2024-11-09 10:09:33,533 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 982 states, 625 states have (on average 1.68) internal successors, (1050), 973 states have internal predecessors, (1050), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-11-09 10:09:33,534 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 982 states to 982 states and 1062 transitions. [2024-11-09 10:09:33,534 INFO L78 Accepts]: Start accepts. Automaton has 982 states and 1062 transitions. Word has length 60 [2024-11-09 10:09:33,534 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 10:09:33,534 INFO L471 AbstractCegarLoop]: Abstraction has 982 states and 1062 transitions. [2024-11-09 10:09:33,534 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.833333333333334) internal successors, (59), 6 states have internal predecessors, (59), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 10:09:33,534 INFO L276 IsEmpty]: Start isEmpty. Operand 982 states and 1062 transitions. [2024-11-09 10:09:33,535 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2024-11-09 10:09:33,535 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 10:09:33,535 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] [2024-11-09 10:09:33,541 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 (21)] Ended with exit code 0 [2024-11-09 10:09:33,735 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 /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-09 10:09:33,735 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr71REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 522 more)] === [2024-11-09 10:09:33,736 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 10:09:33,736 INFO L85 PathProgramCache]: Analyzing trace with hash 887665558, now seen corresponding path program 1 times [2024-11-09 10:09:33,736 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 10:09:33,736 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1438512216] [2024-11-09 10:09:33,736 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 10:09:33,736 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-09 10:09:33,737 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 10:09:33,737 INFO L229 MonitoredProcess]: Starting monitored process 22 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-09 10:09:33,738 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 (22)] Waiting until timeout for monitored process [2024-11-09 10:09:33,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:09:33,966 INFO L255 TraceCheckSpWp]: Trace formula consists of 279 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-11-09 10:09:33,968 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 10:09:33,973 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2024-11-09 10:09:33,977 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-09 10:09:34,314 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 10:09:34,315 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-09 10:09:34,325 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2024-11-09 10:09:34,325 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-09 10:09:34,335 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-09 10:09:34,335 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 10:09:34,335 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 10:09:34,335 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1438512216] [2024-11-09 10:09:34,335 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1438512216] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 10:09:34,335 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 10:09:34,335 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 10:09:34,335 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [108777898] [2024-11-09 10:09:34,336 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 10:09:34,336 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-09 10:09:34,336 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 10:09:34,336 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 10:09:34,337 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-09 10:09:34,337 INFO L87 Difference]: Start difference. First operand 982 states and 1062 transitions. Second operand has 4 states, 3 states have (on average 20.666666666666668) internal successors, (62), 4 states have internal predecessors, (62), 0 states have call successors, (0), 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-09 10:09:35,585 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 10:09:35,585 INFO L93 Difference]: Finished difference Result 1312 states and 1416 transitions. [2024-11-09 10:09:35,585 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-09 10:09:35,585 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 20.666666666666668) internal successors, (62), 4 states have internal predecessors, (62), 0 states have call successors, (0), 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 62 [2024-11-09 10:09:35,586 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 10:09:35,588 INFO L225 Difference]: With dead ends: 1312 [2024-11-09 10:09:35,588 INFO L226 Difference]: Without dead ends: 1312 [2024-11-09 10:09:35,588 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 59 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-09 10:09:35,589 INFO L432 NwaCegarLoop]: 303 mSDtfsCounter, 1726 mSDsluCounter, 136 mSDsCounter, 0 mSdLazyCounter, 756 mSolverCounterSat, 46 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1731 SdHoareTripleChecker+Valid, 439 SdHoareTripleChecker+Invalid, 802 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 46 IncrementalHoareTripleChecker+Valid, 756 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2024-11-09 10:09:35,589 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1731 Valid, 439 Invalid, 802 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [46 Valid, 756 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2024-11-09 10:09:35,590 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1312 states. [2024-11-09 10:09:35,596 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1312 to 907. [2024-11-09 10:09:35,597 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 907 states, 588 states have (on average 1.5952380952380953) internal successors, (938), 898 states have internal predecessors, (938), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-11-09 10:09:35,598 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 907 states to 907 states and 950 transitions. [2024-11-09 10:09:35,598 INFO L78 Accepts]: Start accepts. Automaton has 907 states and 950 transitions. Word has length 62 [2024-11-09 10:09:35,598 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 10:09:35,598 INFO L471 AbstractCegarLoop]: Abstraction has 907 states and 950 transitions. [2024-11-09 10:09:35,598 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 20.666666666666668) internal successors, (62), 4 states have internal predecessors, (62), 0 states have call successors, (0), 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-09 10:09:35,598 INFO L276 IsEmpty]: Start isEmpty. Operand 907 states and 950 transitions. [2024-11-09 10:09:35,599 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2024-11-09 10:09:35,599 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 10:09:35,599 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-09 10:09:35,607 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 (22)] Ended with exit code 0 [2024-11-09 10:09:35,799 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 22 /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-09 10:09:35,799 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr76REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 522 more)] === [2024-11-09 10:09:35,800 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 10:09:35,800 INFO L85 PathProgramCache]: Analyzing trace with hash 512421051, now seen corresponding path program 1 times [2024-11-09 10:09:35,800 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 10:09:35,800 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1835356436] [2024-11-09 10:09:35,800 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 10:09:35,800 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-09 10:09:35,800 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 10:09:35,801 INFO L229 MonitoredProcess]: Starting monitored process 23 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-09 10:09:35,803 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 (23)] Waiting until timeout for monitored process [2024-11-09 10:09:35,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:09:35,998 INFO L255 TraceCheckSpWp]: Trace formula consists of 306 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-09 10:09:36,000 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 10:09:36,006 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-09 10:09:36,019 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-09 10:09:36,041 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-09 10:09:36,049 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-09 10:09:36,049 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 10:09:36,049 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 10:09:36,049 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1835356436] [2024-11-09 10:09:36,049 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1835356436] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 10:09:36,049 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 10:09:36,049 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-09 10:09:36,049 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1533939936] [2024-11-09 10:09:36,049 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 10:09:36,049 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-09 10:09:36,049 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 10:09:36,050 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-09 10:09:36,050 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-09 10:09:36,050 INFO L87 Difference]: Start difference. First operand 907 states and 950 transitions. Second operand has 5 states, 4 states have (on average 16.75) internal successors, (67), 5 states have internal predecessors, (67), 0 states have call successors, (0), 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-09 10:09:37,159 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 10:09:37,160 INFO L93 Difference]: Finished difference Result 906 states and 949 transitions. [2024-11-09 10:09:37,160 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-09 10:09:37,161 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 16.75) internal successors, (67), 5 states have internal predecessors, (67), 0 states have call successors, (0), 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 67 [2024-11-09 10:09:37,161 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 10:09:37,162 INFO L225 Difference]: With dead ends: 906 [2024-11-09 10:09:37,162 INFO L226 Difference]: Without dead ends: 906 [2024-11-09 10:09:37,162 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 63 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-09 10:09:37,163 INFO L432 NwaCegarLoop]: 805 mSDtfsCounter, 2 mSDsluCounter, 1273 mSDsCounter, 0 mSdLazyCounter, 1149 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 2078 SdHoareTripleChecker+Invalid, 1150 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 1149 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2024-11-09 10:09:37,163 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 2078 Invalid, 1150 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 1149 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2024-11-09 10:09:37,164 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 906 states. [2024-11-09 10:09:37,168 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 906 to 906. [2024-11-09 10:09:37,169 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 906 states, 588 states have (on average 1.5935374149659864) internal successors, (937), 897 states have internal predecessors, (937), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-11-09 10:09:37,170 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 906 states to 906 states and 949 transitions. [2024-11-09 10:09:37,170 INFO L78 Accepts]: Start accepts. Automaton has 906 states and 949 transitions. Word has length 67 [2024-11-09 10:09:37,170 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 10:09:37,170 INFO L471 AbstractCegarLoop]: Abstraction has 906 states and 949 transitions. [2024-11-09 10:09:37,170 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 16.75) internal successors, (67), 5 states have internal predecessors, (67), 0 states have call successors, (0), 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-09 10:09:37,170 INFO L276 IsEmpty]: Start isEmpty. Operand 906 states and 949 transitions. [2024-11-09 10:09:37,170 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2024-11-09 10:09:37,170 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 10:09:37,170 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-09 10:09:37,178 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 (23)] Forceful destruction successful, exit code 0 [2024-11-09 10:09:37,371 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 23 /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-09 10:09:37,371 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr77REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 522 more)] === [2024-11-09 10:09:37,371 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 10:09:37,371 INFO L85 PathProgramCache]: Analyzing trace with hash 512421052, now seen corresponding path program 1 times [2024-11-09 10:09:37,372 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 10:09:37,372 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1508407270] [2024-11-09 10:09:37,372 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 10:09:37,372 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-09 10:09:37,372 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 10:09:37,375 INFO L229 MonitoredProcess]: Starting monitored process 24 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-09 10:09:37,376 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 (24)] Waiting until timeout for monitored process [2024-11-09 10:09:37,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:09:37,568 INFO L255 TraceCheckSpWp]: Trace formula consists of 306 conjuncts, 11 conjuncts are in the unsatisfiable core [2024-11-09 10:09:37,570 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 10:09:37,576 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-09 10:09:37,589 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-09 10:09:37,593 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-09 10:09:37,621 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-09 10:09:37,633 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-09 10:09:37,633 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 10:09:37,633 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 10:09:37,633 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1508407270] [2024-11-09 10:09:37,633 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1508407270] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 10:09:37,633 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 10:09:37,633 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-09 10:09:37,633 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1973874351] [2024-11-09 10:09:37,633 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 10:09:37,634 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-09 10:09:37,634 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 10:09:37,634 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-09 10:09:37,634 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-09 10:09:37,634 INFO L87 Difference]: Start difference. First operand 906 states and 949 transitions. Second operand has 5 states, 4 states have (on average 16.75) internal successors, (67), 5 states have internal predecessors, (67), 0 states have call successors, (0), 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-09 10:09:39,021 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 10:09:39,021 INFO L93 Difference]: Finished difference Result 905 states and 948 transitions. [2024-11-09 10:09:39,022 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-09 10:09:39,022 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 16.75) internal successors, (67), 5 states have internal predecessors, (67), 0 states have call successors, (0), 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 67 [2024-11-09 10:09:39,022 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 10:09:39,023 INFO L225 Difference]: With dead ends: 905 [2024-11-09 10:09:39,023 INFO L226 Difference]: Without dead ends: 905 [2024-11-09 10:09:39,024 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 63 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-09 10:09:39,024 INFO L432 NwaCegarLoop]: 805 mSDtfsCounter, 1 mSDsluCounter, 1297 mSDsCounter, 0 mSdLazyCounter, 1122 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 2102 SdHoareTripleChecker+Invalid, 1123 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 1122 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2024-11-09 10:09:39,024 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 2102 Invalid, 1123 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 1122 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2024-11-09 10:09:39,025 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 905 states. [2024-11-09 10:09:39,030 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 905 to 905. [2024-11-09 10:09:39,030 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 905 states, 587 states have (on average 1.594548551959114) internal successors, (936), 896 states have internal predecessors, (936), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-11-09 10:09:39,031 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 905 states to 905 states and 948 transitions. [2024-11-09 10:09:39,031 INFO L78 Accepts]: Start accepts. Automaton has 905 states and 948 transitions. Word has length 67 [2024-11-09 10:09:39,031 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 10:09:39,032 INFO L471 AbstractCegarLoop]: Abstraction has 905 states and 948 transitions. [2024-11-09 10:09:39,032 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 16.75) internal successors, (67), 5 states have internal predecessors, (67), 0 states have call successors, (0), 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-09 10:09:39,032 INFO L276 IsEmpty]: Start isEmpty. Operand 905 states and 948 transitions. [2024-11-09 10:09:39,032 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2024-11-09 10:09:39,032 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 10:09:39,032 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, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 10:09:39,041 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 (24)] Forceful destruction successful, exit code 0 [2024-11-09 10:09:39,233 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 24 /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-09 10:09:39,233 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr80REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 522 more)] === [2024-11-09 10:09:39,233 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 10:09:39,234 INFO L85 PathProgramCache]: Analyzing trace with hash -420068222, now seen corresponding path program 1 times [2024-11-09 10:09:39,234 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 10:09:39,234 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [278499208] [2024-11-09 10:09:39,234 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 10:09:39,234 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-09 10:09:39,234 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 10:09:39,235 INFO L229 MonitoredProcess]: Starting monitored process 25 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-09 10:09:39,236 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 (25)] Waiting until timeout for monitored process [2024-11-09 10:09:39,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:09:39,442 INFO L255 TraceCheckSpWp]: Trace formula consists of 332 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-09 10:09:39,444 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 10:09:39,460 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-09 10:09:39,460 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 10:09:39,460 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 10:09:39,460 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [278499208] [2024-11-09 10:09:39,461 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [278499208] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 10:09:39,461 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 10:09:39,461 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-09 10:09:39,461 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1022422861] [2024-11-09 10:09:39,461 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 10:09:39,461 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-09 10:09:39,461 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 10:09:39,462 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 10:09:39,462 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-09 10:09:39,462 INFO L87 Difference]: Start difference. First operand 905 states and 948 transitions. Second operand has 4 states, 4 states have (on average 18.25) internal successors, (73), 4 states have internal predecessors, (73), 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-09 10:09:39,492 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 10:09:39,492 INFO L93 Difference]: Finished difference Result 908 states and 952 transitions. [2024-11-09 10:09:39,493 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-09 10:09:39,493 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 18.25) internal successors, (73), 4 states have internal predecessors, (73), 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 75 [2024-11-09 10:09:39,493 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 10:09:39,496 INFO L225 Difference]: With dead ends: 908 [2024-11-09 10:09:39,496 INFO L226 Difference]: Without dead ends: 908 [2024-11-09 10:09:39,496 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 72 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-09 10:09:39,497 INFO L432 NwaCegarLoop]: 805 mSDtfsCounter, 0 mSDsluCounter, 1605 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 2410 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 10:09:39,497 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 2410 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 10:09:39,498 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 908 states. [2024-11-09 10:09:39,517 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 908 to 908. [2024-11-09 10:09:39,522 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 908 states, 589 states have (on average 1.5942275042444822) internal successors, (939), 899 states have internal predecessors, (939), 6 states have call successors, (6), 2 states have call predecessors, (6), 3 states have return successors, (7), 6 states have call predecessors, (7), 6 states have call successors, (7) [2024-11-09 10:09:39,527 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 908 states to 908 states and 952 transitions. [2024-11-09 10:09:39,527 INFO L78 Accepts]: Start accepts. Automaton has 908 states and 952 transitions. Word has length 75 [2024-11-09 10:09:39,527 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 10:09:39,527 INFO L471 AbstractCegarLoop]: Abstraction has 908 states and 952 transitions. [2024-11-09 10:09:39,527 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 18.25) internal successors, (73), 4 states have internal predecessors, (73), 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-09 10:09:39,527 INFO L276 IsEmpty]: Start isEmpty. Operand 908 states and 952 transitions. [2024-11-09 10:09:39,533 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2024-11-09 10:09:39,533 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 10:09:39,533 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, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 10:09:39,540 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 (25)] Ended with exit code 0 [2024-11-09 10:09:39,734 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 25 /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-09 10:09:39,734 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr80REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 522 more)] === [2024-11-09 10:09:39,735 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 10:09:39,735 INFO L85 PathProgramCache]: Analyzing trace with hash 862094395, now seen corresponding path program 1 times [2024-11-09 10:09:39,735 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 10:09:39,735 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [821109371] [2024-11-09 10:09:39,735 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 10:09:39,735 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-09 10:09:39,735 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 10:09:39,736 INFO L229 MonitoredProcess]: Starting monitored process 26 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-09 10:09:39,737 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 (26)] Waiting until timeout for monitored process [2024-11-09 10:09:39,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:09:39,938 INFO L255 TraceCheckSpWp]: Trace formula consists of 343 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-09 10:09:39,940 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 10:09:39,955 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-09 10:09:39,955 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 10:09:39,996 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-09 10:09:39,996 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 10:09:39,996 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [821109371] [2024-11-09 10:09:39,996 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [821109371] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 10:09:39,996 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-09 10:09:39,996 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 8 [2024-11-09 10:09:39,997 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [989851504] [2024-11-09 10:09:39,997 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-09 10:09:39,997 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-09 10:09:39,997 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 10:09:39,998 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-09 10:09:39,998 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2024-11-09 10:09:39,998 INFO L87 Difference]: Start difference. First operand 908 states and 952 transitions. Second operand has 8 states, 8 states have (on average 9.75) internal successors, (78), 8 states have internal predecessors, (78), 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-09 10:09:40,117 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 10:09:40,117 INFO L93 Difference]: Finished difference Result 920 states and 969 transitions. [2024-11-09 10:09:40,118 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-09 10:09:40,118 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 9.75) internal successors, (78), 8 states have internal predecessors, (78), 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 76 [2024-11-09 10:09:40,118 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 10:09:40,121 INFO L225 Difference]: With dead ends: 920 [2024-11-09 10:09:40,121 INFO L226 Difference]: Without dead ends: 920 [2024-11-09 10:09:40,121 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 153 GetRequests, 144 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=44, Invalid=66, Unknown=0, NotChecked=0, Total=110 [2024-11-09 10:09:40,122 INFO L432 NwaCegarLoop]: 805 mSDtfsCounter, 8 mSDsluCounter, 2406 mSDsCounter, 0 mSdLazyCounter, 56 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 3211 SdHoareTripleChecker+Invalid, 65 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 56 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 10:09:40,122 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 3211 Invalid, 65 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 56 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 10:09:40,123 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 920 states. [2024-11-09 10:09:40,130 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 920 to 918. [2024-11-09 10:09:40,135 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 918 states, 598 states have (on average 1.5953177257525084) internal successors, (954), 908 states have internal predecessors, (954), 6 states have call successors, (6), 3 states have call predecessors, (6), 4 states have return successors, (7), 6 states have call predecessors, (7), 6 states have call successors, (7) [2024-11-09 10:09:40,136 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 918 states to 918 states and 967 transitions. [2024-11-09 10:09:40,136 INFO L78 Accepts]: Start accepts. Automaton has 918 states and 967 transitions. Word has length 76 [2024-11-09 10:09:40,136 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 10:09:40,136 INFO L471 AbstractCegarLoop]: Abstraction has 918 states and 967 transitions. [2024-11-09 10:09:40,136 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 9.75) internal successors, (78), 8 states have internal predecessors, (78), 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-09 10:09:40,136 INFO L276 IsEmpty]: Start isEmpty. Operand 918 states and 967 transitions. [2024-11-09 10:09:40,137 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2024-11-09 10:09:40,137 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 10:09:40,137 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, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 10:09:40,144 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 (26)] Ended with exit code 0 [2024-11-09 10:09:40,337 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 26 /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-09 10:09:40,337 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr80REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 522 more)] === [2024-11-09 10:09:40,338 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 10:09:40,338 INFO L85 PathProgramCache]: Analyzing trace with hash -1075516734, now seen corresponding path program 2 times [2024-11-09 10:09:40,338 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 10:09:40,338 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1987771054] [2024-11-09 10:09:40,338 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-09 10:09:40,338 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-09 10:09:40,338 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 10:09:40,339 INFO L229 MonitoredProcess]: Starting monitored process 27 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-09 10:09:40,341 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 (27)] Waiting until timeout for monitored process [2024-11-09 10:09:40,723 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-09 10:09:40,723 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-09 10:09:40,732 INFO L255 TraceCheckSpWp]: Trace formula consists of 376 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-11-09 10:09:40,734 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 10:09:40,774 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-09 10:09:40,774 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 10:09:40,876 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-09 10:09:40,876 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 10:09:40,877 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1987771054] [2024-11-09 10:09:40,877 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1987771054] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 10:09:40,877 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-09 10:09:40,877 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 14 [2024-11-09 10:09:40,877 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [736113672] [2024-11-09 10:09:40,877 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-09 10:09:40,877 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-11-09 10:09:40,877 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 10:09:40,878 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-11-09 10:09:40,878 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=121, Unknown=0, NotChecked=0, Total=182 [2024-11-09 10:09:40,879 INFO L87 Difference]: Start difference. First operand 918 states and 967 transitions. Second operand has 14 states, 14 states have (on average 6.0) internal successors, (84), 14 states have internal predecessors, (84), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-09 10:09:41,186 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 10:09:41,186 INFO L93 Difference]: Finished difference Result 933 states and 989 transitions. [2024-11-09 10:09:41,187 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2024-11-09 10:09:41,187 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 6.0) internal successors, (84), 14 states have internal predecessors, (84), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 79 [2024-11-09 10:09:41,187 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 10:09:41,188 INFO L225 Difference]: With dead ends: 933 [2024-11-09 10:09:41,189 INFO L226 Difference]: Without dead ends: 929 [2024-11-09 10:09:41,189 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 165 GetRequests, 144 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=182, Invalid=324, Unknown=0, NotChecked=0, Total=506 [2024-11-09 10:09:41,189 INFO L432 NwaCegarLoop]: 805 mSDtfsCounter, 13 mSDsluCounter, 5614 mSDsCounter, 0 mSdLazyCounter, 182 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 6419 SdHoareTripleChecker+Invalid, 198 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 182 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-09 10:09:41,191 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 6419 Invalid, 198 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 182 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-09 10:09:41,192 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 929 states. [2024-11-09 10:09:41,200 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 929 to 927. [2024-11-09 10:09:41,201 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 927 states, 607 states have (on average 1.5914332784184515) internal successors, (966), 917 states have internal predecessors, (966), 6 states have call successors, (6), 3 states have call predecessors, (6), 4 states have return successors, (7), 6 states have call predecessors, (7), 6 states have call successors, (7) [2024-11-09 10:09:41,202 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 927 states to 927 states and 979 transitions. [2024-11-09 10:09:41,202 INFO L78 Accepts]: Start accepts. Automaton has 927 states and 979 transitions. Word has length 79 [2024-11-09 10:09:41,202 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 10:09:41,202 INFO L471 AbstractCegarLoop]: Abstraction has 927 states and 979 transitions. [2024-11-09 10:09:41,202 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 6.0) internal successors, (84), 14 states have internal predecessors, (84), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-09 10:09:41,202 INFO L276 IsEmpty]: Start isEmpty. Operand 927 states and 979 transitions. [2024-11-09 10:09:41,203 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2024-11-09 10:09:41,203 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 10:09:41,203 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, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 10:09:41,212 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 (27)] Forceful destruction successful, exit code 0 [2024-11-09 10:09:41,403 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 27 /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-09 10:09:41,404 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr80REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 522 more)] === [2024-11-09 10:09:41,405 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 10:09:41,405 INFO L85 PathProgramCache]: Analyzing trace with hash 1053116450, now seen corresponding path program 3 times [2024-11-09 10:09:41,405 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 10:09:41,405 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2027756494] [2024-11-09 10:09:41,405 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-09 10:09:41,405 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 10:09:41,406 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 10:09:41,406 INFO L229 MonitoredProcess]: Starting monitored process 28 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-09 10:09:41,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 (28)] Waiting until timeout for monitored process [2024-11-09 10:09:41,935 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2024-11-09 10:09:41,935 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-09 10:09:41,945 INFO L255 TraceCheckSpWp]: Trace formula consists of 442 conjuncts, 14 conjuncts are in the unsatisfiable core [2024-11-09 10:09:41,947 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 10:09:42,045 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-09 10:09:42,045 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 10:09:42,421 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-09 10:09:42,421 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 10:09:42,421 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2027756494] [2024-11-09 10:09:42,421 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2027756494] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 10:09:42,421 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-09 10:09:42,421 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 26 [2024-11-09 10:09:42,421 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1058754129] [2024-11-09 10:09:42,421 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-09 10:09:42,421 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2024-11-09 10:09:42,421 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 10:09:42,422 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2024-11-09 10:09:42,422 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=193, Invalid=457, Unknown=0, NotChecked=0, Total=650 [2024-11-09 10:09:42,423 INFO L87 Difference]: Start difference. First operand 927 states and 979 transitions. Second operand has 26 states, 26 states have (on average 3.6923076923076925) internal successors, (96), 26 states have internal predecessors, (96), 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-09 10:09:43,579 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 10:09:43,579 INFO L93 Difference]: Finished difference Result 951 states and 1018 transitions. [2024-11-09 10:09:43,580 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2024-11-09 10:09:43,580 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 26 states have (on average 3.6923076923076925) internal successors, (96), 26 states have internal predecessors, (96), 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 85 [2024-11-09 10:09:43,580 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 10:09:43,581 INFO L225 Difference]: With dead ends: 951 [2024-11-09 10:09:43,581 INFO L226 Difference]: Without dead ends: 945 [2024-11-09 10:09:43,582 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 189 GetRequests, 144 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-09 10:09:43,582 INFO L432 NwaCegarLoop]: 806 mSDtfsCounter, 15 mSDsluCounter, 8834 mSDsCounter, 0 mSdLazyCounter, 577 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 9640 SdHoareTripleChecker+Invalid, 584 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 577 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-09 10:09:43,582 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 9640 Invalid, 584 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 577 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-09 10:09:43,583 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 945 states. [2024-11-09 10:09:43,588 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 945 to 945. [2024-11-09 10:09:43,589 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 945 states, 625 states have (on average 1.5824) internal successors, (989), 935 states have internal predecessors, (989), 6 states have call successors, (6), 3 states have call predecessors, (6), 4 states have return successors, (7), 6 states have call predecessors, (7), 6 states have call successors, (7) [2024-11-09 10:09:43,590 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 945 states to 945 states and 1002 transitions. [2024-11-09 10:09:43,590 INFO L78 Accepts]: Start accepts. Automaton has 945 states and 1002 transitions. Word has length 85 [2024-11-09 10:09:43,590 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 10:09:43,590 INFO L471 AbstractCegarLoop]: Abstraction has 945 states and 1002 transitions. [2024-11-09 10:09:43,590 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 26 states have (on average 3.6923076923076925) internal successors, (96), 26 states have internal predecessors, (96), 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-09 10:09:43,590 INFO L276 IsEmpty]: Start isEmpty. Operand 945 states and 1002 transitions. [2024-11-09 10:09:43,591 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2024-11-09 10:09:43,591 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 10:09:43,591 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, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 10:09:43,599 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 (28)] Forceful destruction successful, exit code 0 [2024-11-09 10:09:43,791 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 28 /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-09 10:09:43,792 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr80REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 522 more)] === [2024-11-09 10:09:43,792 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 10:09:43,792 INFO L85 PathProgramCache]: Analyzing trace with hash -924751134, now seen corresponding path program 4 times [2024-11-09 10:09:43,793 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 10:09:43,793 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1083398736] [2024-11-09 10:09:43,793 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2024-11-09 10:09:43,793 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-09 10:09:43,793 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 10:09:43,794 INFO L229 MonitoredProcess]: Starting monitored process 29 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-09 10:09:43,794 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 (29)] Waiting until timeout for monitored process [2024-11-09 10:09:44,166 INFO L227 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2024-11-09 10:09:44,167 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-09 10:09:44,180 INFO L255 TraceCheckSpWp]: Trace formula consists of 574 conjuncts, 25 conjuncts are in the unsatisfiable core [2024-11-09 10:09:44,182 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 10:09:44,438 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-09 10:09:44,438 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 10:09:45,362 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-09 10:09:45,362 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 10:09:45,362 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1083398736] [2024-11-09 10:09:45,362 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1083398736] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 10:09:45,362 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-09 10:09:45,362 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 26] total 50 [2024-11-09 10:09:45,362 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2031556438] [2024-11-09 10:09:45,362 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-09 10:09:45,363 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 50 states [2024-11-09 10:09:45,363 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 10:09:45,363 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2024-11-09 10:09:45,364 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=672, Invalid=1778, Unknown=0, NotChecked=0, Total=2450 [2024-11-09 10:09:45,364 INFO L87 Difference]: Start difference. First operand 945 states and 1002 transitions. Second operand has 50 states, 50 states have (on average 2.4) internal successors, (120), 50 states have internal predecessors, (120), 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-09 10:09:49,143 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 10:09:49,143 INFO L93 Difference]: Finished difference Result 985 states and 1074 transitions. [2024-11-09 10:09:49,144 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 71 states. [2024-11-09 10:09:49,144 INFO L78 Accepts]: Start accepts. Automaton has has 50 states, 50 states have (on average 2.4) internal successors, (120), 50 states have internal predecessors, (120), 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 97 [2024-11-09 10:09:49,144 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 10:09:49,145 INFO L225 Difference]: With dead ends: 985 [2024-11-09 10:09:49,146 INFO L226 Difference]: Without dead ends: 981 [2024-11-09 10:09:49,147 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 235 GetRequests, 144 SyntacticMatches, 0 SemanticMatches, 91 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 465 ImplicationChecksByTransitivity, 3.2s TimeCoverageRelationStatistics Valid=2713, Invalid=5843, Unknown=0, NotChecked=0, Total=8556 [2024-11-09 10:09:49,147 INFO L432 NwaCegarLoop]: 805 mSDtfsCounter, 27 mSDsluCounter, 18449 mSDsCounter, 0 mSdLazyCounter, 1929 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 19254 SdHoareTripleChecker+Invalid, 1955 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 1929 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2024-11-09 10:09:49,148 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [27 Valid, 19254 Invalid, 1955 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 1929 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2024-11-09 10:09:49,149 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 981 states. [2024-11-09 10:09:49,154 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 981 to 979. [2024-11-09 10:09:49,155 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 979 states, 659 states have (on average 1.5705614567526556) internal successors, (1035), 969 states have internal predecessors, (1035), 6 states have call successors, (6), 3 states have call predecessors, (6), 4 states have return successors, (7), 6 states have call predecessors, (7), 6 states have call successors, (7) [2024-11-09 10:09:49,155 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 979 states to 979 states and 1048 transitions. [2024-11-09 10:09:49,155 INFO L78 Accepts]: Start accepts. Automaton has 979 states and 1048 transitions. Word has length 97 [2024-11-09 10:09:49,156 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 10:09:49,156 INFO L471 AbstractCegarLoop]: Abstraction has 979 states and 1048 transitions. [2024-11-09 10:09:49,156 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 50 states, 50 states have (on average 2.4) internal successors, (120), 50 states have internal predecessors, (120), 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-09 10:09:49,156 INFO L276 IsEmpty]: Start isEmpty. Operand 979 states and 1048 transitions. [2024-11-09 10:09:49,156 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2024-11-09 10:09:49,156 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 10:09:49,156 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, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 10:09:49,169 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 (29)] Forceful destruction successful, exit code 0 [2024-11-09 10:09:49,357 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 29 /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-09 10:09:49,357 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr80REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 522 more)] === [2024-11-09 10:09:49,357 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 10:09:49,357 INFO L85 PathProgramCache]: Analyzing trace with hash -941258430, now seen corresponding path program 5 times [2024-11-09 10:09:49,358 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 10:09:49,358 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1892238402] [2024-11-09 10:09:49,358 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2024-11-09 10:09:49,358 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-09 10:09:49,358 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 10:09:49,361 INFO L229 MonitoredProcess]: Starting monitored process 30 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-09 10:09:49,361 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 (30)] Waiting until timeout for monitored process [2024-11-09 10:09:50,383 INFO L227 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 23 check-sat command(s) [2024-11-09 10:09:50,383 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-09 10:09:50,405 INFO L255 TraceCheckSpWp]: Trace formula consists of 816 conjuncts, 58 conjuncts are in the unsatisfiable core [2024-11-09 10:09:50,411 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 10:09:50,417 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-09 10:09:50,516 INFO L349 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2024-11-09 10:09:50,517 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 27 [2024-11-09 10:09:50,538 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-09 10:09:50,607 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 12 [2024-11-09 10:09:51,265 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-09 10:09:51,265 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 44 treesize of output 43 [2024-11-09 10:09:51,295 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 15 [2024-11-09 10:09:51,319 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-09 10:09:51,319 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 10:09:51,555 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2194 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 1) (bvadd (_ bv1 1) (select |c_#valid| (select (select (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_#t~mem36#1.base| v_ArrVal_2194) |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-09 10:09:51,556 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 10:09:51,557 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1892238402] [2024-11-09 10:09:51,557 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1892238402] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 10:09:51,557 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1529090036] [2024-11-09 10:09:51,557 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2024-11-09 10:09:51,557 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-11-09 10:09:51,557 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2024-11-09 10:09:51,558 INFO L229 MonitoredProcess]: Starting monitored process 31 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-11-09 10:09:51,559 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (31)] Waiting until timeout for monitored process