./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/valid-memsafety.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_SFH_test4-3.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 84cfde4a Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_SFH_test4-3.i -s /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash c24ad121bcc9573550d02da9627a07166858762ae4177dec26b10c884148a83b --- Real Ultimate output --- This is Ultimate 0.2.5-dev-84cfde4 [2024-10-11 19:21:28,489 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-11 19:21:28,558 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2024-10-11 19:21:28,566 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-11 19:21:28,566 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-11 19:21:28,598 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-11 19:21:28,599 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-11 19:21:28,599 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-11 19:21:28,600 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-11 19:21:28,602 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-11 19:21:28,602 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-11 19:21:28,603 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-11 19:21:28,603 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-11 19:21:28,604 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-11 19:21:28,605 INFO L153 SettingsManager]: * Use SBE=true [2024-10-11 19:21:28,606 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-11 19:21:28,606 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-11 19:21:28,606 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-11 19:21:28,607 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-11 19:21:28,607 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-11 19:21:28,607 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-10-11 19:21:28,610 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-10-11 19:21:28,610 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-10-11 19:21:28,611 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-11 19:21:28,611 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-10-11 19:21:28,612 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-11 19:21:28,612 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-10-11 19:21:28,613 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-11 19:21:28,613 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-11 19:21:28,613 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-11 19:21:28,613 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-11 19:21:28,614 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-11 19:21:28,614 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-11 19:21:28,614 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 19:21:28,615 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-11 19:21:28,615 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-11 19:21:28,616 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-11 19:21:28,616 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-11 19:21:28,616 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-11 19:21:28,617 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-11 19:21:28,617 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-11 19:21:28,617 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-11 19:21:28,617 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> c24ad121bcc9573550d02da9627a07166858762ae4177dec26b10c884148a83b [2024-10-11 19:21:28,881 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-11 19:21:28,908 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-11 19:21:28,911 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-11 19:21:28,912 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-11 19:21:28,913 INFO L274 PluginConnector]: CDTParser initialized [2024-10-11 19:21:28,914 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_SFH_test4-3.i [2024-10-11 19:21:29,576 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-11 19:21:31,314 INFO L384 CDTParser]: Found 1 translation units. [2024-10-11 19:21:31,315 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_SFH_test4-3.i [2024-10-11 19:21:31,340 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/c589de6e2/44f4d959a8f14017881a03b1cbc66647/FLAG54c26b785 [2024-10-11 19:21:31,579 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/c589de6e2/44f4d959a8f14017881a03b1cbc66647 [2024-10-11 19:21:31,582 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-11 19:21:31,584 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-11 19:21:31,587 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-11 19:21:31,588 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-11 19:21:31,593 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-11 19:21:31,594 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 07:21:31" (1/1) ... [2024-10-11 19:21:31,595 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@61b47490 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:21:31, skipping insertion in model container [2024-10-11 19:21:31,596 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 07:21:31" (1/1) ... [2024-10-11 19:21:31,671 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-11 19:21:32,244 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 19:21:32,254 ERROR L321 MainTranslator]: Unsupported Syntax: Found a cast between two array/pointer types of different sizes while using memory model HoenickeLindenmann_Original (while Not using bitvector translation) [2024-10-11 19:21:32,255 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver@781db5ec and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:21:32, skipping insertion in model container [2024-10-11 19:21:32,255 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-11 19:21:32,256 INFO L186 ToolchainWalker]: Toolchain execution was canceled (user or tool) before executing de.uni_freiburg.informatik.ultimate.boogie.procedureinliner [2024-10-11 19:21:32,257 INFO L158 Benchmark]: Toolchain (without parser) took 672.91ms. Allocated memory was 151.0MB in the beginning and 186.6MB in the end (delta: 35.7MB). Free memory was 68.8MB in the beginning and 148.7MB in the end (delta: -79.9MB). Peak memory consumption was 27.6MB. Max. memory is 16.1GB. [2024-10-11 19:21:32,258 INFO L158 Benchmark]: CDTParser took 0.21ms. Allocated memory is still 151.0MB. Free memory is still 102.1MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-11 19:21:32,258 INFO L158 Benchmark]: CACSL2BoogieTranslator took 668.47ms. Allocated memory was 151.0MB in the beginning and 186.6MB in the end (delta: 35.7MB). Free memory was 68.5MB in the beginning and 148.7MB in the end (delta: -80.2MB). Peak memory consumption was 27.6MB. Max. memory is 16.1GB. [2024-10-11 19:21:32,260 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.21ms. Allocated memory is still 151.0MB. Free memory is still 102.1MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 668.47ms. Allocated memory was 151.0MB in the beginning and 186.6MB in the end (delta: 35.7MB). Free memory was 68.5MB in the beginning and 148.7MB in the end (delta: -80.2MB). Peak memory consumption was 27.6MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - UnsupportedSyntaxResult [Line: 752]: Unsupported Syntax Found a cast between two array/pointer types of different sizes while using memory model HoenickeLindenmann_Original (while Not using bitvector translation) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_SFH_test4-3.i -s /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash c24ad121bcc9573550d02da9627a07166858762ae4177dec26b10c884148a83b --- Real Ultimate output --- This is Ultimate 0.2.5-dev-84cfde4 [2024-10-11 19:21:34,258 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-11 19:21:34,338 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf [2024-10-11 19:21:34,344 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-11 19:21:34,344 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-11 19:21:34,379 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-11 19:21:34,381 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-11 19:21:34,381 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-11 19:21:34,382 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-11 19:21:34,383 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-11 19:21:34,383 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-11 19:21:34,384 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-11 19:21:34,384 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-11 19:21:34,385 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-11 19:21:34,386 INFO L153 SettingsManager]: * Use SBE=true [2024-10-11 19:21:34,387 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-11 19:21:34,387 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-11 19:21:34,387 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-11 19:21:34,388 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-11 19:21:34,388 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-11 19:21:34,388 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-10-11 19:21:34,392 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-10-11 19:21:34,392 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-10-11 19:21:34,393 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-11 19:21:34,393 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-10-11 19:21:34,393 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-10-11 19:21:34,394 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-11 19:21:34,394 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-10-11 19:21:34,395 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-10-11 19:21:34,395 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-11 19:21:34,395 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-11 19:21:34,395 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-11 19:21:34,396 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-11 19:21:34,397 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-11 19:21:34,397 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-11 19:21:34,397 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 19:21:34,398 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-11 19:21:34,398 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-11 19:21:34,410 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-10-11 19:21:34,411 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-10-11 19:21:34,411 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-11 19:21:34,412 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-11 19:21:34,412 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-11 19:21:34,412 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-11 19:21:34,412 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2024-10-11 19:21:34,412 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> c24ad121bcc9573550d02da9627a07166858762ae4177dec26b10c884148a83b [2024-10-11 19:21:34,742 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-11 19:21:34,766 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-11 19:21:34,770 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-11 19:21:34,771 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-11 19:21:34,771 INFO L274 PluginConnector]: CDTParser initialized [2024-10-11 19:21:34,773 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_SFH_test4-3.i [2024-10-11 19:21:36,258 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-11 19:21:36,572 INFO L384 CDTParser]: Found 1 translation units. [2024-10-11 19:21:36,573 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_SFH_test4-3.i [2024-10-11 19:21:36,593 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/dcfd7f955/c4c070f20ee44ce7a37e654ca400c2a4/FLAG9e57b03d1 [2024-10-11 19:21:36,823 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/dcfd7f955/c4c070f20ee44ce7a37e654ca400c2a4 [2024-10-11 19:21:36,825 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-11 19:21:36,826 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-11 19:21:36,827 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-11 19:21:36,827 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-11 19:21:36,832 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-11 19:21:36,833 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 07:21:36" (1/1) ... [2024-10-11 19:21:36,833 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3e9c832b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:21:36, skipping insertion in model container [2024-10-11 19:21:36,833 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 07:21:36" (1/1) ... [2024-10-11 19:21:36,888 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-11 19:21:37,492 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 19:21:37,510 INFO L197 MainTranslator]: Restarting translation with changed settings: SettingsChange [mNewPreferredMemoryModel=HoenickeLindenmann_1ByteResolution] [2024-10-11 19:21:37,522 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-11 19:21:37,632 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 19:21:37,639 INFO L200 MainTranslator]: Completed pre-run [2024-10-11 19:21:37,767 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 19:21:37,813 INFO L204 MainTranslator]: Completed translation [2024-10-11 19:21:37,817 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:21:37 WrapperNode [2024-10-11 19:21:37,817 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-11 19:21:37,819 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-11 19:21:37,819 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-11 19:21:37,819 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-11 19:21:37,826 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:21:37" (1/1) ... [2024-10-11 19:21:37,883 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:21:37" (1/1) ... [2024-10-11 19:21:37,951 INFO L138 Inliner]: procedures = 179, calls = 435, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 1498 [2024-10-11 19:21:37,951 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-11 19:21:37,952 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-11 19:21:37,952 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-11 19:21:37,952 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-11 19:21:37,965 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:21:37" (1/1) ... [2024-10-11 19:21:37,965 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:21:37" (1/1) ... [2024-10-11 19:21:37,982 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:21:37" (1/1) ... [2024-10-11 19:21:38,141 INFO L175 MemorySlicer]: Split 403 memory accesses to 2 slices as follows [2, 401]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0]. The 98 writes are split as follows [0, 98]. [2024-10-11 19:21:38,141 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:21:37" (1/1) ... [2024-10-11 19:21:38,142 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:21:37" (1/1) ... [2024-10-11 19:21:38,200 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:21:37" (1/1) ... [2024-10-11 19:21:38,218 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:21:37" (1/1) ... [2024-10-11 19:21:38,227 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:21:37" (1/1) ... [2024-10-11 19:21:38,239 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:21:37" (1/1) ... [2024-10-11 19:21:38,251 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-11 19:21:38,252 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-11 19:21:38,252 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-11 19:21:38,252 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-11 19:21:38,257 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:21:37" (1/1) ... [2024-10-11 19:21:38,265 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 19:21:38,274 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 19:21:38,285 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-11 19:21:38,291 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-11 19:21:38,322 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#0 [2024-10-11 19:21:38,322 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#1 [2024-10-11 19:21:38,323 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#0 [2024-10-11 19:21:38,323 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#1 [2024-10-11 19:21:38,323 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2024-10-11 19:21:38,323 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2024-10-11 19:21:38,323 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#0 [2024-10-11 19:21:38,323 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#1 [2024-10-11 19:21:38,323 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#0 [2024-10-11 19:21:38,323 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#1 [2024-10-11 19:21:38,323 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-10-11 19:21:38,323 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-11 19:21:38,324 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2024-10-11 19:21:38,324 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2024-10-11 19:21:38,324 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2024-10-11 19:21:38,324 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2024-10-11 19:21:38,324 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-10-11 19:21:38,324 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#0 [2024-10-11 19:21:38,324 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#1 [2024-10-11 19:21:38,325 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-10-11 19:21:38,325 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2024-10-11 19:21:38,325 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-11 19:21:38,325 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-11 19:21:38,606 INFO L238 CfgBuilder]: Building ICFG [2024-10-11 19:21:38,608 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-11 19:21:38,612 WARN L779 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2024-10-11 19:21:38,668 WARN L779 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2024-10-11 19:21:43,651 INFO L? ?]: Removed 1749 outVars from TransFormulas that were not future-live. [2024-10-11 19:21:43,651 INFO L287 CfgBuilder]: Performing block encoding [2024-10-11 19:21:43,835 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-11 19:21:43,836 INFO L314 CfgBuilder]: Removed 77 assume(true) statements. [2024-10-11 19:21:43,836 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 07:21:43 BoogieIcfgContainer [2024-10-11 19:21:43,836 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-11 19:21:43,838 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-11 19:21:43,839 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-11 19:21:43,842 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-11 19:21:43,842 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.10 07:21:36" (1/3) ... [2024-10-11 19:21:43,843 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@e5f6521 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 07:21:43, skipping insertion in model container [2024-10-11 19:21:43,843 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:21:37" (2/3) ... [2024-10-11 19:21:43,843 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@e5f6521 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 07:21:43, skipping insertion in model container [2024-10-11 19:21:43,843 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 07:21:43" (3/3) ... [2024-10-11 19:21:43,844 INFO L112 eAbstractionObserver]: Analyzing ICFG uthash_SFH_test4-3.i [2024-10-11 19:21:43,861 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-11 19:21:43,862 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 831 error locations. [2024-10-11 19:21:43,938 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-11 19:21:43,944 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;@76035fb7, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-11 19:21:43,944 INFO L334 AbstractCegarLoop]: Starting to check reachability of 831 error locations. [2024-10-11 19:21:43,953 INFO L276 IsEmpty]: Start isEmpty. Operand has 1477 states, 633 states have (on average 2.5624012638230647) internal successors, (1622), 1468 states have internal predecessors, (1622), 16 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 7 states have call predecessors, (16), 16 states have call successors, (16) [2024-10-11 19:21:43,959 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2024-10-11 19:21:43,959 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 19:21:43,960 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2024-10-11 19:21:43,960 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 828 more)] === [2024-10-11 19:21:43,966 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 19:21:43,966 INFO L85 PathProgramCache]: Analyzing trace with hash 77782477, now seen corresponding path program 1 times [2024-10-11 19:21:43,976 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 19:21:43,976 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [261394976] [2024-10-11 19:21:43,976 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 19:21:43,976 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 19:21:43,977 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 19:21:43,978 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-11 19:21:43,979 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2024-10-11 19:21:44,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 19:21:44,139 INFO L255 TraceCheckSpWp]: Trace formula consists of 29 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-11 19:21:44,145 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 19:21:44,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-10-11 19:21:44,198 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 19:21:44,198 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 19:21:44,199 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 19:21:44,199 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [261394976] [2024-10-11 19:21:44,200 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [261394976] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 19:21:44,200 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 19:21:44,200 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 19:21:44,202 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1040774004] [2024-10-11 19:21:44,203 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 19:21:44,206 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 19:21:44,207 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 19:21:44,276 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 19:21:44,281 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 19:21:44,291 INFO L87 Difference]: Start difference. First operand has 1477 states, 633 states have (on average 2.5624012638230647) internal successors, (1622), 1468 states have internal predecessors, (1622), 16 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 7 states have call predecessors, (16), 16 states have call successors, (16) Second operand has 3 states, 2 states have (on average 2.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-10-11 19:21:46,591 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 19:21:46,592 INFO L93 Difference]: Finished difference Result 1366 states and 1458 transitions. [2024-10-11 19:21:46,596 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 19:21:46,598 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-10-11 19:21:46,600 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 19:21:46,644 INFO L225 Difference]: With dead ends: 1366 [2024-10-11 19:21:46,645 INFO L226 Difference]: Without dead ends: 1365 [2024-10-11 19:21:46,647 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-10-11 19:21:46,655 INFO L432 NwaCegarLoop]: 810 mSDtfsCounter, 926 mSDsluCounter, 172 mSDsCounter, 0 mSdLazyCounter, 980 mSolverCounterSat, 102 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 942 SdHoareTripleChecker+Valid, 982 SdHoareTripleChecker+Invalid, 1082 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 102 IncrementalHoareTripleChecker+Valid, 980 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2024-10-11 19:21:46,657 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [942 Valid, 982 Invalid, 1082 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [102 Valid, 980 Invalid, 0 Unknown, 0 Unchecked, 2.2s Time] [2024-10-11 19:21:46,676 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1365 states. [2024-10-11 19:21:46,742 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1365 to 1363. [2024-10-11 19:21:46,745 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1363 states, 624 states have (on average 2.2788461538461537) internal successors, (1422), 1354 states have internal predecessors, (1422), 16 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 7 states have call predecessors, (16), 16 states have call successors, (16) [2024-10-11 19:21:46,751 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1363 states to 1363 states and 1454 transitions. [2024-10-11 19:21:46,753 INFO L78 Accepts]: Start accepts. Automaton has 1363 states and 1454 transitions. Word has length 4 [2024-10-11 19:21:46,753 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 19:21:46,753 INFO L471 AbstractCegarLoop]: Abstraction has 1363 states and 1454 transitions. [2024-10-11 19:21:46,754 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-10-11 19:21:46,754 INFO L276 IsEmpty]: Start isEmpty. Operand 1363 states and 1454 transitions. [2024-10-11 19:21:46,754 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2024-10-11 19:21:46,754 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 19:21:46,755 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2024-10-11 19:21:46,760 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2024-10-11 19:21:46,957 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 19:21:46,958 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 828 more)] === [2024-10-11 19:21:46,958 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 19:21:46,958 INFO L85 PathProgramCache]: Analyzing trace with hash 77782478, now seen corresponding path program 1 times [2024-10-11 19:21:46,959 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 19:21:46,959 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1772545133] [2024-10-11 19:21:46,959 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 19:21:46,959 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 19:21:46,959 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 19:21:46,962 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-11 19:21:46,963 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2024-10-11 19:21:47,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 19:21:47,108 INFO L255 TraceCheckSpWp]: Trace formula consists of 29 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-10-11 19:21:47,110 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 19:21:47,117 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-10-11 19:21:47,137 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 19:21:47,138 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 19:21:47,138 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 19:21:47,138 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1772545133] [2024-10-11 19:21:47,138 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1772545133] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 19:21:47,138 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 19:21:47,138 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 19:21:47,138 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [649044544] [2024-10-11 19:21:47,139 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 19:21:47,139 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 19:21:47,140 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 19:21:47,142 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 19:21:47,142 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 19:21:47,142 INFO L87 Difference]: Start difference. First operand 1363 states and 1454 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-10-11 19:21:50,004 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 19:21:50,005 INFO L93 Difference]: Finished difference Result 1643 states and 1754 transitions. [2024-10-11 19:21:50,005 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 19:21:50,005 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-10-11 19:21:50,006 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 19:21:50,011 INFO L225 Difference]: With dead ends: 1643 [2024-10-11 19:21:50,011 INFO L226 Difference]: Without dead ends: 1643 [2024-10-11 19:21:50,012 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-10-11 19:21:50,013 INFO L432 NwaCegarLoop]: 1116 mSDtfsCounter, 464 mSDsluCounter, 552 mSDsCounter, 0 mSdLazyCounter, 1063 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 464 SdHoareTripleChecker+Valid, 1668 SdHoareTripleChecker+Invalid, 1088 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 1063 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.8s IncrementalHoareTripleChecker+Time [2024-10-11 19:21:50,013 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [464 Valid, 1668 Invalid, 1088 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 1063 Invalid, 0 Unknown, 0 Unchecked, 2.8s Time] [2024-10-11 19:21:50,016 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1643 states. [2024-10-11 19:21:50,040 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1643 to 1492. [2024-10-11 19:21:50,042 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1492 states, 763 states have (on average 2.2332896461336826) internal successors, (1704), 1483 states have internal predecessors, (1704), 16 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 7 states have call predecessors, (16), 16 states have call successors, (16) [2024-10-11 19:21:50,047 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1492 states to 1492 states and 1736 transitions. [2024-10-11 19:21:50,047 INFO L78 Accepts]: Start accepts. Automaton has 1492 states and 1736 transitions. Word has length 4 [2024-10-11 19:21:50,048 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 19:21:50,048 INFO L471 AbstractCegarLoop]: Abstraction has 1492 states and 1736 transitions. [2024-10-11 19:21:50,048 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-10-11 19:21:50,048 INFO L276 IsEmpty]: Start isEmpty. Operand 1492 states and 1736 transitions. [2024-10-11 19:21:50,048 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2024-10-11 19:21:50,049 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 19:21:50,049 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2024-10-11 19:21:50,052 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2024-10-11 19:21:50,249 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 19:21:50,250 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr620REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 828 more)] === [2024-10-11 19:21:50,250 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 19:21:50,250 INFO L85 PathProgramCache]: Analyzing trace with hash -1882051010, now seen corresponding path program 1 times [2024-10-11 19:21:50,251 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 19:21:50,251 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1288231417] [2024-10-11 19:21:50,251 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 19:21:50,251 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 19:21:50,251 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 19:21:50,254 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-11 19:21:50,257 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2024-10-11 19:21:50,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 19:21:50,387 INFO L255 TraceCheckSpWp]: Trace formula consists of 23 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-11 19:21:50,389 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 19:21:50,400 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 19:21:50,400 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 19:21:50,400 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 19:21:50,400 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1288231417] [2024-10-11 19:21:50,401 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1288231417] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 19:21:50,401 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 19:21:50,401 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 19:21:50,401 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [592077575] [2024-10-11 19:21:50,401 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 19:21:50,402 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 19:21:50,403 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 19:21:50,404 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 19:21:50,404 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 19:21:50,405 INFO L87 Difference]: Start difference. First operand 1492 states and 1736 transitions. Second operand has 3 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 2 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 19:21:51,682 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 19:21:51,683 INFO L93 Difference]: Finished difference Result 2592 states and 3041 transitions. [2024-10-11 19:21:51,685 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 19:21:51,685 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 2 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 5 [2024-10-11 19:21:51,685 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 19:21:51,694 INFO L225 Difference]: With dead ends: 2592 [2024-10-11 19:21:51,694 INFO L226 Difference]: Without dead ends: 2592 [2024-10-11 19:21:51,695 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 19:21:51,697 INFO L432 NwaCegarLoop]: 1680 mSDtfsCounter, 1000 mSDsluCounter, 1287 mSDsCounter, 0 mSdLazyCounter, 361 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1006 SdHoareTripleChecker+Valid, 2967 SdHoareTripleChecker+Invalid, 361 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 361 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2024-10-11 19:21:51,698 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1006 Valid, 2967 Invalid, 361 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 361 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2024-10-11 19:21:51,703 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2592 states. [2024-10-11 19:21:51,768 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2592 to 1493. [2024-10-11 19:21:51,770 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1493 states, 764 states have (on average 2.231675392670157) internal successors, (1705), 1484 states have internal predecessors, (1705), 16 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 7 states have call predecessors, (16), 16 states have call successors, (16) [2024-10-11 19:21:51,774 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1493 states to 1493 states and 1737 transitions. [2024-10-11 19:21:51,775 INFO L78 Accepts]: Start accepts. Automaton has 1493 states and 1737 transitions. Word has length 5 [2024-10-11 19:21:51,775 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 19:21:51,775 INFO L471 AbstractCegarLoop]: Abstraction has 1493 states and 1737 transitions. [2024-10-11 19:21:51,775 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 2 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 19:21:51,775 INFO L276 IsEmpty]: Start isEmpty. Operand 1493 states and 1737 transitions. [2024-10-11 19:21:51,775 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2024-10-11 19:21:51,775 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 19:21:51,775 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 19:21:51,779 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Ended with exit code 0 [2024-10-11 19:21:51,976 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 19:21:51,976 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 828 more)] === [2024-10-11 19:21:51,977 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 19:21:51,977 INFO L85 PathProgramCache]: Analyzing trace with hash -1357177001, now seen corresponding path program 1 times [2024-10-11 19:21:51,977 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 19:21:51,978 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1570751768] [2024-10-11 19:21:51,978 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 19:21:51,978 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 19:21:51,978 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 19:21:51,981 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-11 19:21:51,985 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2024-10-11 19:21:52,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 19:21:52,149 INFO L255 TraceCheckSpWp]: Trace formula consists of 82 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-11 19:21:52,151 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 19:21:52,164 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 19:21:52,166 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 19:21:52,166 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 19:21:52,167 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1570751768] [2024-10-11 19:21:52,167 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1570751768] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 19:21:52,167 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 19:21:52,167 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 19:21:52,167 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [333920593] [2024-10-11 19:21:52,167 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 19:21:52,168 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 19:21:52,168 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 19:21:52,168 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 19:21:52,170 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 19:21:52,171 INFO L87 Difference]: Start difference. First operand 1493 states and 1737 transitions. Second operand has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 19:21:52,916 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 19:21:52,916 INFO L93 Difference]: Finished difference Result 1454 states and 1697 transitions. [2024-10-11 19:21:52,917 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 19:21:52,918 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2024-10-11 19:21:52,918 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 19:21:52,923 INFO L225 Difference]: With dead ends: 1454 [2024-10-11 19:21:52,923 INFO L226 Difference]: Without dead ends: 1454 [2024-10-11 19:21:52,924 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 19:21:52,926 INFO L432 NwaCegarLoop]: 1242 mSDtfsCounter, 61 mSDsluCounter, 1200 mSDsCounter, 0 mSdLazyCounter, 304 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 61 SdHoareTripleChecker+Valid, 2442 SdHoareTripleChecker+Invalid, 304 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 304 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-10-11 19:21:52,927 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [61 Valid, 2442 Invalid, 304 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 304 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-10-11 19:21:52,931 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1454 states. [2024-10-11 19:21:52,948 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1454 to 1454. [2024-10-11 19:21:52,950 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1454 states, 749 states have (on average 2.2229639519359146) internal successors, (1665), 1445 states have internal predecessors, (1665), 16 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 7 states have call predecessors, (16), 16 states have call successors, (16) [2024-10-11 19:21:52,954 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1454 states to 1454 states and 1697 transitions. [2024-10-11 19:21:52,954 INFO L78 Accepts]: Start accepts. Automaton has 1454 states and 1697 transitions. Word has length 10 [2024-10-11 19:21:52,954 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 19:21:52,955 INFO L471 AbstractCegarLoop]: Abstraction has 1454 states and 1697 transitions. [2024-10-11 19:21:52,955 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 19:21:52,955 INFO L276 IsEmpty]: Start isEmpty. Operand 1454 states and 1697 transitions. [2024-10-11 19:21:52,955 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2024-10-11 19:21:52,955 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 19:21:52,956 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 19:21:52,962 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Forceful destruction successful, exit code 0 [2024-10-11 19:21:53,156 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 19:21:53,157 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr28REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 828 more)] === [2024-10-11 19:21:53,157 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 19:21:53,158 INFO L85 PathProgramCache]: Analyzing trace with hash 1422956145, now seen corresponding path program 1 times [2024-10-11 19:21:53,158 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 19:21:53,158 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1409667209] [2024-10-11 19:21:53,158 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 19:21:53,158 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 19:21:53,159 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 19:21:53,162 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-11 19:21:53,163 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2024-10-11 19:21:53,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 19:21:53,320 INFO L255 TraceCheckSpWp]: Trace formula consists of 85 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-11 19:21:53,321 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 19:21:53,337 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 19:21:53,337 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 19:21:53,337 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 19:21:53,337 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1409667209] [2024-10-11 19:21:53,337 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1409667209] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 19:21:53,337 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 19:21:53,337 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 19:21:53,338 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1116737714] [2024-10-11 19:21:53,338 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 19:21:53,338 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 19:21:53,338 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 19:21:53,338 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 19:21:53,339 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 19:21:53,339 INFO L87 Difference]: Start difference. First operand 1454 states and 1697 transitions. Second operand has 4 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 19:21:54,480 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 19:21:54,481 INFO L93 Difference]: Finished difference Result 1439 states and 1675 transitions. [2024-10-11 19:21:54,483 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-11 19:21:54,483 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 12 [2024-10-11 19:21:54,483 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 19:21:54,489 INFO L225 Difference]: With dead ends: 1439 [2024-10-11 19:21:54,490 INFO L226 Difference]: Without dead ends: 1439 [2024-10-11 19:21:54,490 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-11 19:21:54,491 INFO L432 NwaCegarLoop]: 1211 mSDtfsCounter, 45 mSDsluCounter, 2404 mSDsCounter, 0 mSdLazyCounter, 462 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 45 SdHoareTripleChecker+Valid, 3615 SdHoareTripleChecker+Invalid, 483 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 462 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2024-10-11 19:21:54,491 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [45 Valid, 3615 Invalid, 483 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 462 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2024-10-11 19:21:54,494 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1439 states. [2024-10-11 19:21:54,514 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1439 to 1439. [2024-10-11 19:21:54,516 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1439 states, 748 states have (on average 2.196524064171123) internal successors, (1643), 1430 states have internal predecessors, (1643), 16 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 7 states have call predecessors, (16), 16 states have call successors, (16) [2024-10-11 19:21:54,521 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1439 states to 1439 states and 1675 transitions. [2024-10-11 19:21:54,522 INFO L78 Accepts]: Start accepts. Automaton has 1439 states and 1675 transitions. Word has length 12 [2024-10-11 19:21:54,522 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 19:21:54,522 INFO L471 AbstractCegarLoop]: Abstraction has 1439 states and 1675 transitions. [2024-10-11 19:21:54,522 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 19:21:54,523 INFO L276 IsEmpty]: Start isEmpty. Operand 1439 states and 1675 transitions. [2024-10-11 19:21:54,523 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2024-10-11 19:21:54,523 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 19:21:54,523 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 19:21:54,528 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Ended with exit code 0 [2024-10-11 19:21:54,724 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 19:21:54,725 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr42REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 828 more)] === [2024-10-11 19:21:54,725 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 19:21:54,725 INFO L85 PathProgramCache]: Analyzing trace with hash -2095155681, now seen corresponding path program 1 times [2024-10-11 19:21:54,726 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 19:21:54,726 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1385480858] [2024-10-11 19:21:54,726 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 19:21:54,726 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 19:21:54,726 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 19:21:54,727 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-11 19:21:54,730 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2024-10-11 19:21:54,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 19:21:54,906 INFO L255 TraceCheckSpWp]: Trace formula consists of 99 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-10-11 19:21:54,909 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 19:21:54,915 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2024-10-11 19:21:54,997 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 19:21:54,998 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 19:21:54,998 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 19:21:54,998 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1385480858] [2024-10-11 19:21:54,998 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1385480858] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 19:21:54,998 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 19:21:54,998 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 19:21:54,999 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [455279421] [2024-10-11 19:21:54,999 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 19:21:54,999 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 19:21:54,999 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 19:21:55,000 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 19:21:55,000 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 19:21:55,000 INFO L87 Difference]: Start difference. First operand 1439 states and 1675 transitions. Second operand has 4 states, 3 states have (on average 8.666666666666666) internal successors, (26), 4 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 19:21:57,214 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 19:21:57,214 INFO L93 Difference]: Finished difference Result 1439 states and 1675 transitions. [2024-10-11 19:21:57,214 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 19:21:57,215 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 8.666666666666666) internal successors, (26), 4 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 26 [2024-10-11 19:21:57,215 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 19:21:57,219 INFO L225 Difference]: With dead ends: 1439 [2024-10-11 19:21:57,219 INFO L226 Difference]: Without dead ends: 1439 [2024-10-11 19:21:57,220 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-11 19:21:57,220 INFO L432 NwaCegarLoop]: 774 mSDtfsCounter, 870 mSDsluCounter, 712 mSDsCounter, 0 mSdLazyCounter, 1720 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 886 SdHoareTripleChecker+Valid, 1486 SdHoareTripleChecker+Invalid, 1732 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 1720 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2024-10-11 19:21:57,220 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [886 Valid, 1486 Invalid, 1732 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 1720 Invalid, 0 Unknown, 0 Unchecked, 2.2s Time] [2024-10-11 19:21:57,223 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1439 states. [2024-10-11 19:21:57,235 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1439 to 1435. [2024-10-11 19:21:57,237 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1435 states, 748 states have (on average 2.1911764705882355) internal successors, (1639), 1426 states have internal predecessors, (1639), 16 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 7 states have call predecessors, (16), 16 states have call successors, (16) [2024-10-11 19:21:57,241 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1435 states to 1435 states and 1671 transitions. [2024-10-11 19:21:57,241 INFO L78 Accepts]: Start accepts. Automaton has 1435 states and 1671 transitions. Word has length 26 [2024-10-11 19:21:57,241 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 19:21:57,241 INFO L471 AbstractCegarLoop]: Abstraction has 1435 states and 1671 transitions. [2024-10-11 19:21:57,242 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 8.666666666666666) internal successors, (26), 4 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 19:21:57,242 INFO L276 IsEmpty]: Start isEmpty. Operand 1435 states and 1671 transitions. [2024-10-11 19:21:57,242 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2024-10-11 19:21:57,242 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 19:21:57,242 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 19:21:57,248 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Ended with exit code 0 [2024-10-11 19:21:57,443 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 19:21:57,443 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr43REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 828 more)] === [2024-10-11 19:21:57,444 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 19:21:57,444 INFO L85 PathProgramCache]: Analyzing trace with hash -2095155680, now seen corresponding path program 1 times [2024-10-11 19:21:57,444 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 19:21:57,444 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [223175452] [2024-10-11 19:21:57,444 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 19:21:57,444 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 19:21:57,445 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 19:21:57,446 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-11 19:21:57,447 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Waiting until timeout for monitored process [2024-10-11 19:21:57,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 19:21:57,587 INFO L255 TraceCheckSpWp]: Trace formula consists of 99 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-10-11 19:21:57,588 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 19:21:57,602 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-10-11 19:21:57,739 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 19:21:57,739 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 19:21:57,739 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 19:21:57,739 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [223175452] [2024-10-11 19:21:57,739 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [223175452] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 19:21:57,740 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 19:21:57,740 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 19:21:57,740 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [187354868] [2024-10-11 19:21:57,740 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 19:21:57,740 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 19:21:57,740 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 19:21:57,741 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 19:21:57,741 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 19:21:57,741 INFO L87 Difference]: Start difference. First operand 1435 states and 1671 transitions. Second operand has 4 states, 3 states have (on average 8.666666666666666) internal successors, (26), 4 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 19:22:00,956 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 19:22:00,956 INFO L93 Difference]: Finished difference Result 1586 states and 1689 transitions. [2024-10-11 19:22:00,956 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 19:22:00,956 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 8.666666666666666) internal successors, (26), 4 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 26 [2024-10-11 19:22:00,956 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 19:22:00,961 INFO L225 Difference]: With dead ends: 1586 [2024-10-11 19:22:00,961 INFO L226 Difference]: Without dead ends: 1586 [2024-10-11 19:22:00,961 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-11 19:22:00,962 INFO L432 NwaCegarLoop]: 1080 mSDtfsCounter, 404 mSDsluCounter, 1141 mSDsCounter, 0 mSdLazyCounter, 1769 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 404 SdHoareTripleChecker+Valid, 2221 SdHoareTripleChecker+Invalid, 1772 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 1769 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.2s IncrementalHoareTripleChecker+Time [2024-10-11 19:22:00,962 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [404 Valid, 2221 Invalid, 1772 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 1769 Invalid, 0 Unknown, 0 Unchecked, 3.2s Time] [2024-10-11 19:22:00,964 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1586 states. [2024-10-11 19:22:00,977 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1586 to 1431. [2024-10-11 19:22:00,981 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1431 states, 748 states have (on average 2.185828877005348) internal successors, (1635), 1422 states have internal predecessors, (1635), 16 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 7 states have call predecessors, (16), 16 states have call successors, (16) [2024-10-11 19:22:00,984 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1431 states to 1431 states and 1667 transitions. [2024-10-11 19:22:00,985 INFO L78 Accepts]: Start accepts. Automaton has 1431 states and 1667 transitions. Word has length 26 [2024-10-11 19:22:00,985 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 19:22:00,985 INFO L471 AbstractCegarLoop]: Abstraction has 1431 states and 1667 transitions. [2024-10-11 19:22:00,985 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 8.666666666666666) internal successors, (26), 4 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 19:22:00,986 INFO L276 IsEmpty]: Start isEmpty. Operand 1431 states and 1667 transitions. [2024-10-11 19:22:00,987 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2024-10-11 19:22:00,987 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 19:22:00,988 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] [2024-10-11 19:22:00,994 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Ended with exit code 0 [2024-10-11 19:22:01,188 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 19:22:01,189 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr107REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 828 more)] === [2024-10-11 19:22:01,189 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 19:22:01,189 INFO L85 PathProgramCache]: Analyzing trace with hash -265398887, now seen corresponding path program 1 times [2024-10-11 19:22:01,190 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 19:22:01,190 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [715363859] [2024-10-11 19:22:01,190 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 19:22:01,190 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 19:22:01,190 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 19:22:01,191 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-11 19:22:01,193 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Waiting until timeout for monitored process [2024-10-11 19:22:01,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 19:22:01,390 INFO L255 TraceCheckSpWp]: Trace formula consists of 171 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-11 19:22:01,393 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 19:22:01,446 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 19:22:01,447 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 19:22:01,447 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 19:22:01,447 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [715363859] [2024-10-11 19:22:01,447 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [715363859] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 19:22:01,447 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 19:22:01,447 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 19:22:01,447 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1979072099] [2024-10-11 19:22:01,447 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 19:22:01,448 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 19:22:01,448 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 19:22:01,448 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 19:22:01,448 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 19:22:01,448 INFO L87 Difference]: Start difference. First operand 1431 states and 1667 transitions. Second operand has 4 states, 4 states have (on average 10.5) internal successors, (42), 4 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 19:22:02,280 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 19:22:02,280 INFO L93 Difference]: Finished difference Result 1425 states and 1657 transitions. [2024-10-11 19:22:02,281 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-11 19:22:02,282 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 10.5) internal successors, (42), 4 states have internal predecessors, (42), 0 states have call successors, (0), 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 42 [2024-10-11 19:22:02,282 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 19:22:02,285 INFO L225 Difference]: With dead ends: 1425 [2024-10-11 19:22:02,286 INFO L226 Difference]: Without dead ends: 1425 [2024-10-11 19:22:02,286 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-11 19:22:02,286 INFO L432 NwaCegarLoop]: 1205 mSDtfsCounter, 15 mSDsluCounter, 2393 mSDsCounter, 0 mSdLazyCounter, 459 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 3598 SdHoareTripleChecker+Invalid, 465 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 459 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-10-11 19:22:02,286 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 3598 Invalid, 465 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 459 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-10-11 19:22:02,289 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1425 states. [2024-10-11 19:22:02,301 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1425 to 1425. [2024-10-11 19:22:02,303 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1425 states, 742 states have (on average 2.1900269541778976) internal successors, (1625), 1416 states have internal predecessors, (1625), 16 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 7 states have call predecessors, (16), 16 states have call successors, (16) [2024-10-11 19:22:02,306 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1425 states to 1425 states and 1657 transitions. [2024-10-11 19:22:02,306 INFO L78 Accepts]: Start accepts. Automaton has 1425 states and 1657 transitions. Word has length 42 [2024-10-11 19:22:02,307 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 19:22:02,307 INFO L471 AbstractCegarLoop]: Abstraction has 1425 states and 1657 transitions. [2024-10-11 19:22:02,307 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.5) internal successors, (42), 4 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 19:22:02,307 INFO L276 IsEmpty]: Start isEmpty. Operand 1425 states and 1657 transitions. [2024-10-11 19:22:02,308 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2024-10-11 19:22:02,308 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 19:22:02,308 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] [2024-10-11 19:22:02,316 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Ended with exit code 0 [2024-10-11 19:22:02,508 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 19:22:02,509 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr107REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 828 more)] === [2024-10-11 19:22:02,509 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 19:22:02,509 INFO L85 PathProgramCache]: Analyzing trace with hash 1779261689, now seen corresponding path program 1 times [2024-10-11 19:22:02,510 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 19:22:02,510 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [25825907] [2024-10-11 19:22:02,510 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 19:22:02,510 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 19:22:02,510 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 19:22:02,513 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-11 19:22:02,513 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Waiting until timeout for monitored process [2024-10-11 19:22:02,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 19:22:02,733 INFO L255 TraceCheckSpWp]: Trace formula consists of 191 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-11 19:22:02,735 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 19:22:02,991 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 19:22:02,991 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 19:22:02,991 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 19:22:02,992 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [25825907] [2024-10-11 19:22:02,992 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [25825907] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 19:22:02,992 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 19:22:02,992 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 19:22:02,992 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [308908163] [2024-10-11 19:22:02,992 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 19:22:02,993 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 19:22:02,993 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 19:22:02,994 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 19:22:02,994 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 19:22:02,994 INFO L87 Difference]: Start difference. First operand 1425 states and 1657 transitions. Second operand has 3 states, 3 states have (on average 15.333333333333334) internal successors, (46), 2 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 19:22:03,846 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 19:22:03,846 INFO L93 Difference]: Finished difference Result 1787 states and 2056 transitions. [2024-10-11 19:22:03,848 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 19:22:03,848 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 15.333333333333334) internal successors, (46), 2 states have internal predecessors, (46), 0 states have call successors, (0), 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 46 [2024-10-11 19:22:03,849 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 19:22:03,854 INFO L225 Difference]: With dead ends: 1787 [2024-10-11 19:22:03,854 INFO L226 Difference]: Without dead ends: 1787 [2024-10-11 19:22:03,854 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 19:22:03,855 INFO L432 NwaCegarLoop]: 1271 mSDtfsCounter, 334 mSDsluCounter, 1157 mSDsCounter, 0 mSdLazyCounter, 397 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 334 SdHoareTripleChecker+Valid, 2428 SdHoareTripleChecker+Invalid, 399 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 397 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-10-11 19:22:03,855 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [334 Valid, 2428 Invalid, 399 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 397 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-10-11 19:22:03,857 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1787 states. [2024-10-11 19:22:03,873 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1787 to 1468. [2024-10-11 19:22:03,875 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1468 states, 785 states have (on average 2.12484076433121) internal successors, (1668), 1459 states have internal predecessors, (1668), 16 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 7 states have call predecessors, (16), 16 states have call successors, (16) [2024-10-11 19:22:03,879 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1468 states to 1468 states and 1700 transitions. [2024-10-11 19:22:03,879 INFO L78 Accepts]: Start accepts. Automaton has 1468 states and 1700 transitions. Word has length 46 [2024-10-11 19:22:03,880 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 19:22:03,880 INFO L471 AbstractCegarLoop]: Abstraction has 1468 states and 1700 transitions. [2024-10-11 19:22:03,880 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 15.333333333333334) internal successors, (46), 2 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 19:22:03,880 INFO L276 IsEmpty]: Start isEmpty. Operand 1468 states and 1700 transitions. [2024-10-11 19:22:03,881 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2024-10-11 19:22:03,881 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 19:22:03,881 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 19:22:03,889 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Ended with exit code 0 [2024-10-11 19:22:04,082 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 19:22:04,082 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr61REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 828 more)] === [2024-10-11 19:22:04,083 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 19:22:04,083 INFO L85 PathProgramCache]: Analyzing trace with hash 1686104230, now seen corresponding path program 1 times [2024-10-11 19:22:04,084 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 19:22:04,084 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [627406225] [2024-10-11 19:22:04,084 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 19:22:04,084 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 19:22:04,084 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 19:22:04,086 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-11 19:22:04,087 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Waiting until timeout for monitored process [2024-10-11 19:22:04,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 19:22:04,360 INFO L255 TraceCheckSpWp]: Trace formula consists of 226 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-10-11 19:22:04,363 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 19:22:04,374 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-10-11 19:22:04,383 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2024-10-11 19:22:04,788 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-11 19:22:04,790 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 9 [2024-10-11 19:22:04,807 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2024-10-11 19:22:04,807 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 13 [2024-10-11 19:22:04,823 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 19:22:04,824 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 19:22:04,824 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 19:22:04,824 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [627406225] [2024-10-11 19:22:04,824 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [627406225] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 19:22:04,825 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 19:22:04,825 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 19:22:04,825 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2120026475] [2024-10-11 19:22:04,825 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 19:22:04,826 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 19:22:04,826 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 19:22:04,826 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 19:22:04,826 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-11 19:22:04,826 INFO L87 Difference]: Start difference. First operand 1468 states and 1700 transitions. Second operand has 4 states, 3 states have (on average 16.333333333333332) internal successors, (49), 4 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 19:22:06,970 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 19:22:06,971 INFO L93 Difference]: Finished difference Result 1384 states and 1616 transitions. [2024-10-11 19:22:06,971 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 19:22:06,971 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 16.333333333333332) internal successors, (49), 4 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 49 [2024-10-11 19:22:06,972 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 19:22:06,975 INFO L225 Difference]: With dead ends: 1384 [2024-10-11 19:22:06,975 INFO L226 Difference]: Without dead ends: 1384 [2024-10-11 19:22:06,975 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 46 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-11 19:22:06,975 INFO L432 NwaCegarLoop]: 581 mSDtfsCounter, 1564 mSDsluCounter, 218 mSDsCounter, 0 mSdLazyCounter, 922 mSolverCounterSat, 102 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1570 SdHoareTripleChecker+Valid, 799 SdHoareTripleChecker+Invalid, 1024 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 102 IncrementalHoareTripleChecker+Valid, 922 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2024-10-11 19:22:06,976 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1570 Valid, 799 Invalid, 1024 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [102 Valid, 922 Invalid, 0 Unknown, 0 Unchecked, 2.1s Time] [2024-10-11 19:22:06,977 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1384 states. [2024-10-11 19:22:06,989 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1384 to 1245. [2024-10-11 19:22:06,990 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1245 states, 646 states have (on average 2.0) internal successors, (1292), 1236 states have internal predecessors, (1292), 16 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 7 states have call predecessors, (16), 16 states have call successors, (16) [2024-10-11 19:22:06,993 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1245 states to 1245 states and 1324 transitions. [2024-10-11 19:22:06,993 INFO L78 Accepts]: Start accepts. Automaton has 1245 states and 1324 transitions. Word has length 49 [2024-10-11 19:22:06,993 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 19:22:06,993 INFO L471 AbstractCegarLoop]: Abstraction has 1245 states and 1324 transitions. [2024-10-11 19:22:06,993 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 16.333333333333332) internal successors, (49), 4 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 19:22:06,994 INFO L276 IsEmpty]: Start isEmpty. Operand 1245 states and 1324 transitions. [2024-10-11 19:22:06,994 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2024-10-11 19:22:06,994 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 19:22:06,994 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 19:22:07,003 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Ended with exit code 0 [2024-10-11 19:22:07,195 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 19:22:07,195 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr66REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 828 more)] === [2024-10-11 19:22:07,195 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 19:22:07,195 INFO L85 PathProgramCache]: Analyzing trace with hash 1533535740, now seen corresponding path program 1 times [2024-10-11 19:22:07,196 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 19:22:07,196 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [28709008] [2024-10-11 19:22:07,196 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 19:22:07,196 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 19:22:07,196 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 19:22:07,199 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-11 19:22:07,200 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (12)] Waiting until timeout for monitored process [2024-10-11 19:22:07,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 19:22:07,430 INFO L255 TraceCheckSpWp]: Trace formula consists of 252 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-10-11 19:22:07,433 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 19:22:07,439 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2024-10-11 19:22:07,452 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-10-11 19:22:07,465 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-10-11 19:22:07,475 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 19:22:07,475 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 19:22:07,475 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 19:22:07,475 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [28709008] [2024-10-11 19:22:07,475 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [28709008] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 19:22:07,475 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 19:22:07,475 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 19:22:07,476 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [935798816] [2024-10-11 19:22:07,476 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 19:22:07,476 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 19:22:07,476 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 19:22:07,476 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 19:22:07,477 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-11 19:22:07,477 INFO L87 Difference]: Start difference. First operand 1245 states and 1324 transitions. Second operand has 5 states, 4 states have (on average 13.25) internal successors, (53), 5 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 19:22:09,989 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 19:22:09,989 INFO L93 Difference]: Finished difference Result 1244 states and 1323 transitions. [2024-10-11 19:22:09,989 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-11 19:22:09,989 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 13.25) internal successors, (53), 5 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 53 [2024-10-11 19:22:09,990 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 19:22:09,992 INFO L225 Difference]: With dead ends: 1244 [2024-10-11 19:22:09,993 INFO L226 Difference]: Without dead ends: 1244 [2024-10-11 19:22:09,993 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 49 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-10-11 19:22:09,993 INFO L432 NwaCegarLoop]: 1133 mSDtfsCounter, 2 mSDsluCounter, 1775 mSDsCounter, 0 mSdLazyCounter, 2200 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 2908 SdHoareTripleChecker+Invalid, 2201 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 2200 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.5s IncrementalHoareTripleChecker+Time [2024-10-11 19:22:09,994 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 2908 Invalid, 2201 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 2200 Invalid, 0 Unknown, 0 Unchecked, 2.5s Time] [2024-10-11 19:22:09,995 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1244 states. [2024-10-11 19:22:10,007 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1244 to 1244. [2024-10-11 19:22:10,009 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1244 states, 646 states have (on average 1.998452012383901) internal successors, (1291), 1235 states have internal predecessors, (1291), 16 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 7 states have call predecessors, (16), 16 states have call successors, (16) [2024-10-11 19:22:10,011 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1244 states to 1244 states and 1323 transitions. [2024-10-11 19:22:10,011 INFO L78 Accepts]: Start accepts. Automaton has 1244 states and 1323 transitions. Word has length 53 [2024-10-11 19:22:10,012 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 19:22:10,012 INFO L471 AbstractCegarLoop]: Abstraction has 1244 states and 1323 transitions. [2024-10-11 19:22:10,012 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 13.25) internal successors, (53), 5 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 19:22:10,012 INFO L276 IsEmpty]: Start isEmpty. Operand 1244 states and 1323 transitions. [2024-10-11 19:22:10,013 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2024-10-11 19:22:10,013 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 19:22:10,013 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 19:22:10,023 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (12)] Ended with exit code 0 [2024-10-11 19:22:10,213 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 19:22:10,213 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr67REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 828 more)] === [2024-10-11 19:22:10,214 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 19:22:10,214 INFO L85 PathProgramCache]: Analyzing trace with hash 1533535741, now seen corresponding path program 1 times [2024-10-11 19:22:10,214 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 19:22:10,214 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [52445772] [2024-10-11 19:22:10,215 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 19:22:10,215 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 19:22:10,215 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 19:22:10,216 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-11 19:22:10,217 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (13)] Waiting until timeout for monitored process [2024-10-11 19:22:10,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 19:22:10,423 INFO L255 TraceCheckSpWp]: Trace formula consists of 252 conjuncts, 12 conjuncts are in the unsatisfiable core [2024-10-11 19:22:10,425 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 19:22:10,434 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-10-11 19:22:10,452 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-10-11 19:22:10,455 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-10-11 19:22:10,488 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-10-11 19:22:10,508 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 19:22:10,508 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 19:22:10,508 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 19:22:10,508 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [52445772] [2024-10-11 19:22:10,508 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [52445772] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 19:22:10,508 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 19:22:10,509 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 19:22:10,509 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [247562851] [2024-10-11 19:22:10,509 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 19:22:10,509 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 19:22:10,509 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 19:22:10,510 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 19:22:10,510 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-11 19:22:10,510 INFO L87 Difference]: Start difference. First operand 1244 states and 1323 transitions. Second operand has 5 states, 4 states have (on average 13.25) internal successors, (53), 5 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 19:22:13,399 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 19:22:13,399 INFO L93 Difference]: Finished difference Result 1243 states and 1322 transitions. [2024-10-11 19:22:13,399 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-11 19:22:13,399 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 13.25) internal successors, (53), 5 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 53 [2024-10-11 19:22:13,399 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 19:22:13,402 INFO L225 Difference]: With dead ends: 1243 [2024-10-11 19:22:13,402 INFO L226 Difference]: Without dead ends: 1243 [2024-10-11 19:22:13,402 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 49 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-10-11 19:22:13,403 INFO L432 NwaCegarLoop]: 1133 mSDtfsCounter, 1 mSDsluCounter, 1816 mSDsCounter, 0 mSdLazyCounter, 2156 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 2949 SdHoareTripleChecker+Invalid, 2157 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 2156 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.8s IncrementalHoareTripleChecker+Time [2024-10-11 19:22:13,403 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 2949 Invalid, 2157 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 2156 Invalid, 0 Unknown, 0 Unchecked, 2.8s Time] [2024-10-11 19:22:13,404 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1243 states. [2024-10-11 19:22:13,415 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1243 to 1243. [2024-10-11 19:22:13,416 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1243 states, 645 states have (on average 2.0) internal successors, (1290), 1234 states have internal predecessors, (1290), 16 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 7 states have call predecessors, (16), 16 states have call successors, (16) [2024-10-11 19:22:13,418 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1243 states to 1243 states and 1322 transitions. [2024-10-11 19:22:13,419 INFO L78 Accepts]: Start accepts. Automaton has 1243 states and 1322 transitions. Word has length 53 [2024-10-11 19:22:13,419 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 19:22:13,419 INFO L471 AbstractCegarLoop]: Abstraction has 1243 states and 1322 transitions. [2024-10-11 19:22:13,420 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 13.25) internal successors, (53), 5 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 19:22:13,420 INFO L276 IsEmpty]: Start isEmpty. Operand 1243 states and 1322 transitions. [2024-10-11 19:22:13,421 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2024-10-11 19:22:13,421 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 19:22:13,421 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 19:22:13,432 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (13)] Ended with exit code 0 [2024-10-11 19:22:13,623 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 19:22:13,624 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr70REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 828 more)] === [2024-10-11 19:22:13,624 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 19:22:13,625 INFO L85 PathProgramCache]: Analyzing trace with hash -1642044960, now seen corresponding path program 1 times [2024-10-11 19:22:13,625 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 19:22:13,625 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2072943235] [2024-10-11 19:22:13,625 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 19:22:13,626 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 19:22:13,626 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 19:22:13,629 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-11 19:22:13,630 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (14)] Waiting until timeout for monitored process [2024-10-11 19:22:13,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 19:22:13,867 INFO L255 TraceCheckSpWp]: Trace formula consists of 278 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-11 19:22:13,870 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 19:22:13,893 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 19:22:13,893 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 19:22:13,893 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 19:22:13,894 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2072943235] [2024-10-11 19:22:13,894 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2072943235] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 19:22:13,894 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 19:22:13,894 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 19:22:13,894 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [517532338] [2024-10-11 19:22:13,894 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 19:22:13,894 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 19:22:13,895 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 19:22:13,896 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 19:22:13,896 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 19:22:13,896 INFO L87 Difference]: Start difference. First operand 1243 states and 1322 transitions. Second operand has 4 states, 3 states have (on average 19.0) internal successors, (57), 4 states have internal predecessors, (57), 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-10-11 19:22:14,758 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 19:22:14,759 INFO L93 Difference]: Finished difference Result 1245 states and 1326 transitions. [2024-10-11 19:22:14,759 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 19:22:14,759 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 19.0) internal successors, (57), 4 states have internal predecessors, (57), 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 59 [2024-10-11 19:22:14,759 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 19:22:14,763 INFO L225 Difference]: With dead ends: 1245 [2024-10-11 19:22:14,763 INFO L226 Difference]: Without dead ends: 1245 [2024-10-11 19:22:14,763 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 56 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-10-11 19:22:14,764 INFO L432 NwaCegarLoop]: 1132 mSDtfsCounter, 0 mSDsluCounter, 2258 mSDsCounter, 0 mSdLazyCounter, 443 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 3390 SdHoareTripleChecker+Invalid, 446 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 443 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-10-11 19:22:14,764 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 3390 Invalid, 446 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 443 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-10-11 19:22:14,766 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1245 states. [2024-10-11 19:22:14,789 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1245 to 1245. [2024-10-11 19:22:14,791 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1245 states, 646 states have (on average 2.0) internal successors, (1292), 1236 states have internal predecessors, (1292), 16 states have call successors, (16), 2 states have call predecessors, (16), 3 states have return successors, (18), 7 states have call predecessors, (18), 16 states have call successors, (18) [2024-10-11 19:22:14,793 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1245 states to 1245 states and 1326 transitions. [2024-10-11 19:22:14,793 INFO L78 Accepts]: Start accepts. Automaton has 1245 states and 1326 transitions. Word has length 59 [2024-10-11 19:22:14,793 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 19:22:14,793 INFO L471 AbstractCegarLoop]: Abstraction has 1245 states and 1326 transitions. [2024-10-11 19:22:14,794 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 19.0) internal successors, (57), 4 states have internal predecessors, (57), 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-10-11 19:22:14,794 INFO L276 IsEmpty]: Start isEmpty. Operand 1245 states and 1326 transitions. [2024-10-11 19:22:14,794 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2024-10-11 19:22:14,794 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 19:22:14,795 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-10-11 19:22:14,803 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (14)] Ended with exit code 0 [2024-10-11 19:22:14,995 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 19:22:14,996 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr70REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 828 more)] === [2024-10-11 19:22:14,997 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 19:22:14,997 INFO L85 PathProgramCache]: Analyzing trace with hash -865659447, now seen corresponding path program 1 times [2024-10-11 19:22:14,997 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 19:22:14,998 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [4896728] [2024-10-11 19:22:14,998 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 19:22:14,998 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 19:22:14,998 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 19:22:15,001 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-11 19:22:15,003 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (15)] Waiting until timeout for monitored process [2024-10-11 19:22:15,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 19:22:15,301 INFO L255 TraceCheckSpWp]: Trace formula consists of 289 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-10-11 19:22:15,304 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 19:22:15,326 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 19:22:15,326 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 19:22:15,388 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 19:22:15,389 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 19:22:15,389 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [4896728] [2024-10-11 19:22:15,389 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [4896728] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 19:22:15,389 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-11 19:22:15,389 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 8 [2024-10-11 19:22:15,389 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1782108706] [2024-10-11 19:22:15,389 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-11 19:22:15,390 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-11 19:22:15,390 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 19:22:15,390 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-11 19:22:15,391 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2024-10-11 19:22:15,391 INFO L87 Difference]: Start difference. First operand 1245 states and 1326 transitions. Second operand has 8 states, 6 states have (on average 10.166666666666666) internal successors, (61), 8 states have internal predecessors, (61), 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-10-11 19:22:16,497 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 19:22:16,497 INFO L93 Difference]: Finished difference Result 1254 states and 1341 transitions. [2024-10-11 19:22:16,498 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-10-11 19:22:16,498 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 6 states have (on average 10.166666666666666) internal successors, (61), 8 states have internal predecessors, (61), 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 60 [2024-10-11 19:22:16,498 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 19:22:16,501 INFO L225 Difference]: With dead ends: 1254 [2024-10-11 19:22:16,501 INFO L226 Difference]: Without dead ends: 1254 [2024-10-11 19:22:16,502 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 121 GetRequests, 112 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=44, Invalid=66, Unknown=0, NotChecked=0, Total=110 [2024-10-11 19:22:16,502 INFO L432 NwaCegarLoop]: 1130 mSDtfsCounter, 5 mSDsluCounter, 3382 mSDsCounter, 0 mSdLazyCounter, 626 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 4512 SdHoareTripleChecker+Invalid, 644 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 626 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2024-10-11 19:22:16,502 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 4512 Invalid, 644 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 626 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2024-10-11 19:22:16,504 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1254 states. [2024-10-11 19:22:16,514 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1254 to 1253. [2024-10-11 19:22:16,516 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1253 states, 653 states have (on average 1.998468606431853) internal successors, (1305), 1243 states have internal predecessors, (1305), 16 states have call successors, (16), 3 states have call predecessors, (16), 4 states have return successors, (18), 7 states have call predecessors, (18), 16 states have call successors, (18) [2024-10-11 19:22:16,518 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1253 states to 1253 states and 1339 transitions. [2024-10-11 19:22:16,518 INFO L78 Accepts]: Start accepts. Automaton has 1253 states and 1339 transitions. Word has length 60 [2024-10-11 19:22:16,518 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 19:22:16,518 INFO L471 AbstractCegarLoop]: Abstraction has 1253 states and 1339 transitions. [2024-10-11 19:22:16,519 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 6 states have (on average 10.166666666666666) internal successors, (61), 8 states have internal predecessors, (61), 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-10-11 19:22:16,519 INFO L276 IsEmpty]: Start isEmpty. Operand 1253 states and 1339 transitions. [2024-10-11 19:22:16,519 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2024-10-11 19:22:16,519 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 19:22:16,520 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] [2024-10-11 19:22:16,528 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (15)] Forceful destruction successful, exit code 0 [2024-10-11 19:22:16,720 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 19:22:16,721 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr70REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 828 more)] === [2024-10-11 19:22:16,721 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 19:22:16,721 INFO L85 PathProgramCache]: Analyzing trace with hash 1411552288, now seen corresponding path program 2 times [2024-10-11 19:22:16,722 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 19:22:16,722 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1543874247] [2024-10-11 19:22:16,722 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-10-11 19:22:16,722 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 19:22:16,722 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 19:22:16,725 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-11 19:22:16,726 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (16)] Waiting until timeout for monitored process [2024-10-11 19:22:17,074 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-10-11 19:22:17,074 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-11 19:22:17,083 INFO L255 TraceCheckSpWp]: Trace formula consists of 322 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-10-11 19:22:17,085 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 19:22:17,135 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 19:22:17,135 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 19:22:17,303 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 19:22:17,303 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 19:22:17,303 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1543874247] [2024-10-11 19:22:17,303 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1543874247] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 19:22:17,304 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-11 19:22:17,304 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 14 [2024-10-11 19:22:17,304 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [764475857] [2024-10-11 19:22:17,304 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-11 19:22:17,307 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-10-11 19:22:17,307 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 19:22:17,308 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-10-11 19:22:17,308 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=121, Unknown=0, NotChecked=0, Total=182 [2024-10-11 19:22:17,308 INFO L87 Difference]: Start difference. First operand 1253 states and 1339 transitions. Second operand has 14 states, 12 states have (on average 5.583333333333333) internal successors, (67), 14 states have internal predecessors, (67), 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-10-11 19:22:19,075 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 19:22:19,075 INFO L93 Difference]: Finished difference Result 1265 states and 1359 transitions. [2024-10-11 19:22:19,075 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2024-10-11 19:22:19,076 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 12 states have (on average 5.583333333333333) internal successors, (67), 14 states have internal predecessors, (67), 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 63 [2024-10-11 19:22:19,076 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 19:22:19,079 INFO L225 Difference]: With dead ends: 1265 [2024-10-11 19:22:19,079 INFO L226 Difference]: Without dead ends: 1263 [2024-10-11 19:22:19,080 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 133 GetRequests, 112 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=182, Invalid=324, Unknown=0, NotChecked=0, Total=506 [2024-10-11 19:22:19,080 INFO L432 NwaCegarLoop]: 1130 mSDtfsCounter, 8 mSDsluCounter, 5640 mSDsCounter, 0 mSdLazyCounter, 1036 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 6770 SdHoareTripleChecker+Invalid, 1061 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 1036 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2024-10-11 19:22:19,080 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 6770 Invalid, 1061 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 1036 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2024-10-11 19:22:19,082 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1263 states. [2024-10-11 19:22:19,092 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1263 to 1262. [2024-10-11 19:22:19,094 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1262 states, 662 states have (on average 1.9894259818731117) internal successors, (1317), 1252 states have internal predecessors, (1317), 16 states have call successors, (16), 3 states have call predecessors, (16), 4 states have return successors, (18), 7 states have call predecessors, (18), 16 states have call successors, (18) [2024-10-11 19:22:19,095 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1262 states to 1262 states and 1351 transitions. [2024-10-11 19:22:19,096 INFO L78 Accepts]: Start accepts. Automaton has 1262 states and 1351 transitions. Word has length 63 [2024-10-11 19:22:19,096 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 19:22:19,096 INFO L471 AbstractCegarLoop]: Abstraction has 1262 states and 1351 transitions. [2024-10-11 19:22:19,096 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 12 states have (on average 5.583333333333333) internal successors, (67), 14 states have internal predecessors, (67), 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-10-11 19:22:19,096 INFO L276 IsEmpty]: Start isEmpty. Operand 1262 states and 1351 transitions. [2024-10-11 19:22:19,097 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2024-10-11 19:22:19,097 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 19:22:19,097 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] [2024-10-11 19:22:19,107 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (16)] Ended with exit code 0 [2024-10-11 19:22:19,297 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 19:22:19,298 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr70REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 828 more)] === [2024-10-11 19:22:19,298 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 19:22:19,298 INFO L85 PathProgramCache]: Analyzing trace with hash -2099707008, now seen corresponding path program 3 times [2024-10-11 19:22:19,298 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 19:22:19,299 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [52974156] [2024-10-11 19:22:19,299 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-10-11 19:22:19,299 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 19:22:19,299 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 19:22:19,300 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-11 19:22:19,301 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (17)] Waiting until timeout for monitored process [2024-10-11 19:22:19,844 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2024-10-11 19:22:19,844 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-11 19:22:19,855 INFO L255 TraceCheckSpWp]: Trace formula consists of 388 conjuncts, 14 conjuncts are in the unsatisfiable core [2024-10-11 19:22:19,857 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 19:22:19,979 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 19:22:19,979 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 19:22:20,415 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 19:22:20,416 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 19:22:20,416 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [52974156] [2024-10-11 19:22:20,416 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [52974156] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 19:22:20,416 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-11 19:22:20,416 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 26 [2024-10-11 19:22:20,416 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [315080478] [2024-10-11 19:22:20,417 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-11 19:22:20,417 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2024-10-11 19:22:20,417 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 19:22:20,418 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2024-10-11 19:22:20,418 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=193, Invalid=457, Unknown=0, NotChecked=0, Total=650 [2024-10-11 19:22:20,418 INFO L87 Difference]: Start difference. First operand 1262 states and 1351 transitions. Second operand has 26 states, 24 states have (on average 3.2916666666666665) internal successors, (79), 26 states have internal predecessors, (79), 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-10-11 19:22:24,915 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 19:22:24,915 INFO L93 Difference]: Finished difference Result 1283 states and 1387 transitions. [2024-10-11 19:22:24,916 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2024-10-11 19:22:24,916 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 24 states have (on average 3.2916666666666665) internal successors, (79), 26 states have internal predecessors, (79), 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 69 [2024-10-11 19:22:24,916 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 19:22:24,922 INFO L225 Difference]: With dead ends: 1283 [2024-10-11 19:22:24,922 INFO L226 Difference]: Without dead ends: 1280 [2024-10-11 19:22:24,923 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 157 GetRequests, 112 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 100 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=728, Invalid=1434, Unknown=0, NotChecked=0, Total=2162 [2024-10-11 19:22:24,924 INFO L432 NwaCegarLoop]: 1130 mSDtfsCounter, 13 mSDsluCounter, 14654 mSDsCounter, 0 mSdLazyCounter, 2581 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 15784 SdHoareTripleChecker+Invalid, 2592 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 2581 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.7s IncrementalHoareTripleChecker+Time [2024-10-11 19:22:24,925 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 15784 Invalid, 2592 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 2581 Invalid, 0 Unknown, 0 Unchecked, 3.7s Time] [2024-10-11 19:22:24,926 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1280 states. [2024-10-11 19:22:24,943 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1280 to 1280. [2024-10-11 19:22:24,946 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1280 states, 680 states have (on average 1.9705882352941178) internal successors, (1340), 1270 states have internal predecessors, (1340), 16 states have call successors, (16), 3 states have call predecessors, (16), 4 states have return successors, (18), 7 states have call predecessors, (18), 16 states have call successors, (18) [2024-10-11 19:22:24,966 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1280 states to 1280 states and 1374 transitions. [2024-10-11 19:22:24,967 INFO L78 Accepts]: Start accepts. Automaton has 1280 states and 1374 transitions. Word has length 69 [2024-10-11 19:22:24,967 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 19:22:24,968 INFO L471 AbstractCegarLoop]: Abstraction has 1280 states and 1374 transitions. [2024-10-11 19:22:24,968 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 24 states have (on average 3.2916666666666665) internal successors, (79), 26 states have internal predecessors, (79), 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-10-11 19:22:24,968 INFO L276 IsEmpty]: Start isEmpty. Operand 1280 states and 1374 transitions. [2024-10-11 19:22:24,969 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2024-10-11 19:22:24,970 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 19:22:24,970 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] [2024-10-11 19:22:24,983 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (17)] Ended with exit code 0 [2024-10-11 19:22:25,170 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 19:22:25,170 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr70REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 828 more)] === [2024-10-11 19:22:25,171 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 19:22:25,171 INFO L85 PathProgramCache]: Analyzing trace with hash 163629632, now seen corresponding path program 4 times [2024-10-11 19:22:25,171 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 19:22:25,171 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1269708551] [2024-10-11 19:22:25,172 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2024-10-11 19:22:25,172 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 19:22:25,172 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 19:22:25,173 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-11 19:22:25,174 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (18)] Waiting until timeout for monitored process [2024-10-11 19:22:25,590 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2024-10-11 19:22:25,590 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-11 19:22:25,603 INFO L255 TraceCheckSpWp]: Trace formula consists of 520 conjuncts, 25 conjuncts are in the unsatisfiable core [2024-10-11 19:22:25,606 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 19:22:25,908 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 0 proven. 253 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 19:22:25,909 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 19:22:27,047 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 0 proven. 253 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 19:22:27,047 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 19:22:27,047 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1269708551] [2024-10-11 19:22:27,048 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1269708551] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 19:22:27,048 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-11 19:22:27,048 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 26] total 50 [2024-10-11 19:22:27,048 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [183797027] [2024-10-11 19:22:27,048 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-11 19:22:27,048 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 50 states [2024-10-11 19:22:27,048 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 19:22:27,049 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2024-10-11 19:22:27,050 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=672, Invalid=1778, Unknown=0, NotChecked=0, Total=2450 [2024-10-11 19:22:27,050 INFO L87 Difference]: Start difference. First operand 1280 states and 1374 transitions. Second operand has 50 states, 48 states have (on average 2.1458333333333335) internal successors, (103), 50 states have internal predecessors, (103), 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-10-11 19:22:36,550 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 19:22:36,551 INFO L93 Difference]: Finished difference Result 1317 states and 1444 transitions. [2024-10-11 19:22:36,551 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 71 states. [2024-10-11 19:22:36,551 INFO L78 Accepts]: Start accepts. Automaton has has 50 states, 48 states have (on average 2.1458333333333335) internal successors, (103), 50 states have internal predecessors, (103), 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 81 [2024-10-11 19:22:36,552 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 19:22:36,555 INFO L225 Difference]: With dead ends: 1317 [2024-10-11 19:22:36,555 INFO L226 Difference]: Without dead ends: 1315 [2024-10-11 19:22:36,557 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 203 GetRequests, 112 SyntacticMatches, 0 SemanticMatches, 91 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 465 ImplicationChecksByTransitivity, 3.8s TimeCoverageRelationStatistics Valid=2713, Invalid=5843, Unknown=0, NotChecked=0, Total=8556 [2024-10-11 19:22:36,558 INFO L432 NwaCegarLoop]: 1130 mSDtfsCounter, 26 mSDsluCounter, 25944 mSDsCounter, 0 mSdLazyCounter, 5381 mSolverCounterSat, 123 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 27074 SdHoareTripleChecker+Invalid, 5504 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 123 IncrementalHoareTripleChecker+Valid, 5381 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.7s IncrementalHoareTripleChecker+Time [2024-10-11 19:22:36,558 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 27074 Invalid, 5504 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [123 Valid, 5381 Invalid, 0 Unknown, 0 Unchecked, 6.7s Time] [2024-10-11 19:22:36,560 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1315 states. [2024-10-11 19:22:36,569 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1315 to 1314. [2024-10-11 19:22:36,570 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1314 states, 714 states have (on average 1.9411764705882353) internal successors, (1386), 1304 states have internal predecessors, (1386), 16 states have call successors, (16), 3 states have call predecessors, (16), 4 states have return successors, (18), 7 states have call predecessors, (18), 16 states have call successors, (18) [2024-10-11 19:22:36,572 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1314 states to 1314 states and 1420 transitions. [2024-10-11 19:22:36,572 INFO L78 Accepts]: Start accepts. Automaton has 1314 states and 1420 transitions. Word has length 81 [2024-10-11 19:22:36,572 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 19:22:36,572 INFO L471 AbstractCegarLoop]: Abstraction has 1314 states and 1420 transitions. [2024-10-11 19:22:36,572 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 50 states, 48 states have (on average 2.1458333333333335) internal successors, (103), 50 states have internal predecessors, (103), 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-10-11 19:22:36,572 INFO L276 IsEmpty]: Start isEmpty. Operand 1314 states and 1420 transitions. [2024-10-11 19:22:36,572 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2024-10-11 19:22:36,573 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 19:22:36,573 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] [2024-10-11 19:22:36,582 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (18)] Forceful destruction successful, exit code 0 [2024-10-11 19:22:36,773 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 19:22:36,774 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr70REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 828 more)] === [2024-10-11 19:22:36,774 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 19:22:36,774 INFO L85 PathProgramCache]: Analyzing trace with hash -163796320, now seen corresponding path program 5 times [2024-10-11 19:22:36,775 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 19:22:36,775 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1115709433] [2024-10-11 19:22:36,775 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2024-10-11 19:22:36,775 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 19:22:36,775 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 19:22:36,776 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-11 19:22:36,777 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (19)] Waiting until timeout for monitored process [2024-10-11 19:22:37,896 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 23 check-sat command(s) [2024-10-11 19:22:37,896 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-11 19:22:37,915 INFO L255 TraceCheckSpWp]: Trace formula consists of 762 conjuncts, 59 conjuncts are in the unsatisfiable core [2024-10-11 19:22:37,922 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 19:22:37,938 INFO L349 Elim1Store]: treesize reduction 13, result has 45.8 percent of original size [2024-10-11 19:22:37,938 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 22 [2024-10-11 19:22:38,271 INFO L349 Elim1Store]: treesize reduction 54, result has 29.9 percent of original size [2024-10-11 19:22:38,271 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 28 treesize of output 45 [2024-10-11 19:22:38,336 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-10-11 19:22:38,497 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 24 [2024-10-11 19:22:40,875 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-10-11 19:22:40,877 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 62 treesize of output 59 [2024-10-11 19:22:40,975 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 27 [2024-10-11 19:22:41,045 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 44 refuted. 0 times theorem prover too weak. 946 trivial. 0 not checked. [2024-10-11 19:22:41,045 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 19:22:41,414 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 19:22:41,414 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1115709433] [2024-10-11 19:22:41,414 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1115709433] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 19:22:41,414 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1530250756] [2024-10-11 19:22:41,414 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2024-10-11 19:22:41,414 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-10-11 19:22:41,414 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/cvc4 [2024-10-11 19:22:41,417 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-10-11 19:22:41,419 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (20)] Waiting until timeout for monitored process