./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/uthash-2.0.2/uthash_BER_test3-2.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 023d838f Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/uthash-2.0.2/uthash_BER_test3-2.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 32a779d95d64b7b3ae1a801430dde2c7d15b3372c5d0cdd47679441a42687631 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.fs.icfgbuilder-eval-023d838-m [2024-11-10 17:24:41,358 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-10 17:24:41,458 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2024-11-10 17:24:41,463 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-10 17:24:41,464 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-10 17:24:41,494 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-10 17:24:41,495 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-10 17:24:41,495 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-10 17:24:41,496 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-10 17:24:41,496 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-10 17:24:41,497 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-10 17:24:41,497 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-10 17:24:41,498 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-10 17:24:41,498 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-10 17:24:41,498 INFO L153 SettingsManager]: * Use SBE=true [2024-11-10 17:24:41,499 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-10 17:24:41,499 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-10 17:24:41,500 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-10 17:24:41,500 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-10 17:24:41,500 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-10 17:24:41,501 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-11-10 17:24:41,502 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-11-10 17:24:41,502 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-11-10 17:24:41,503 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-10 17:24:41,503 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-10 17:24:41,504 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-10 17:24:41,504 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-10 17:24:41,504 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-10 17:24:41,505 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-10 17:24:41,505 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-10 17:24:41,505 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-10 17:24:41,505 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-10 17:24:41,506 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-10 17:24:41,506 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-10 17:24:41,506 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-10 17:24:41,506 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-10 17:24:41,507 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-10 17:24:41,507 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-10 17:24:41,508 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-10 17:24:41,508 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-10 17:24:41,508 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-10 17:24:41,509 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-10 17:24:41,509 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 32a779d95d64b7b3ae1a801430dde2c7d15b3372c5d0cdd47679441a42687631 [2024-11-10 17:24:41,757 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-10 17:24:41,786 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-10 17:24:41,790 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-10 17:24:41,791 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-10 17:24:41,792 INFO L274 PluginConnector]: CDTParser initialized [2024-11-10 17:24:41,794 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/uthash-2.0.2/uthash_BER_test3-2.i [2024-11-10 17:24:43,325 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-10 17:24:43,612 INFO L384 CDTParser]: Found 1 translation units. [2024-11-10 17:24:43,613 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_BER_test3-2.i [2024-11-10 17:24:43,640 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6529de983/c975f8dac7a04444ad9cccad9e107d68/FLAG4b66dd14b [2024-11-10 17:24:43,889 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6529de983/c975f8dac7a04444ad9cccad9e107d68 [2024-11-10 17:24:43,891 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-10 17:24:43,892 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-10 17:24:43,893 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-10 17:24:43,893 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-10 17:24:43,899 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-10 17:24:43,900 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 05:24:43" (1/1) ... [2024-11-10 17:24:43,901 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2d84c9fa and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 05:24:43, skipping insertion in model container [2024-11-10 17:24:43,901 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 05:24:43" (1/1) ... [2024-11-10 17:24:43,960 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-10 17:24:44,407 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-10 17:24:44,451 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-10 17:24:44,458 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-10 17:24:44,464 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-10 17:24:44,475 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-10 17:24:44,527 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-10 17:24:44,530 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-10 17:24:44,533 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-10 17:24:44,534 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-10 17:24:44,537 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-10 17:24:44,542 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-10 17:24:44,543 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-10 17:24:44,545 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-10 17:24:44,552 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-10 17:24:44,557 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-10 17:24:44,559 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-10 17:24:44,560 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-10 17:24:44,561 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-10 17:24:44,562 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-10 17:24:44,565 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-10 17:24:44,574 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-10 17:24:44,585 ERROR L321 MainTranslator]: Unsupported Syntax: Found a cast between two array/pointer types of different sizes while using memory model HoenickeLindenmann_Original (while Not using bitvector translation) [2024-11-10 17:24:44,586 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver@3ba7a1e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 05:24:44, skipping insertion in model container [2024-11-10 17:24:44,586 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-10 17:24:44,587 INFO L186 ToolchainWalker]: Toolchain execution was canceled (user or tool) before executing de.uni_freiburg.informatik.ultimate.boogie.procedureinliner [2024-11-10 17:24:44,589 INFO L158 Benchmark]: Toolchain (without parser) took 695.21ms. Allocated memory is still 167.8MB. Free memory was 108.6MB in the beginning and 84.1MB in the end (delta: 24.5MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2024-11-10 17:24:44,589 INFO L158 Benchmark]: CDTParser took 0.28ms. Allocated memory is still 167.8MB. Free memory is still 129.7MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-10 17:24:44,590 INFO L158 Benchmark]: CACSL2BoogieTranslator took 693.35ms. Allocated memory is still 167.8MB. Free memory was 108.6MB in the beginning and 84.1MB in the end (delta: 24.5MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2024-11-10 17:24:44,591 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.28ms. Allocated memory is still 167.8MB. Free memory is still 129.7MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 693.35ms. Allocated memory is still 167.8MB. Free memory was 108.6MB in the beginning and 84.1MB in the end (delta: 24.5MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - UnsupportedSyntaxResult [Line: 747]: Unsupported Syntax Found a cast between two array/pointer types of different sizes while using memory model HoenickeLindenmann_Original (while Not using bitvector translation) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/uthash-2.0.2/uthash_BER_test3-2.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 32a779d95d64b7b3ae1a801430dde2c7d15b3372c5d0cdd47679441a42687631 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.fs.icfgbuilder-eval-023d838-m [2024-11-10 17:24:46,634 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-10 17:24:46,722 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf [2024-11-10 17:24:46,729 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-10 17:24:46,729 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-10 17:24:46,760 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-10 17:24:46,761 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-10 17:24:46,762 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-10 17:24:46,762 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-10 17:24:46,766 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-10 17:24:46,766 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-10 17:24:46,767 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-10 17:24:46,768 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-10 17:24:46,768 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-10 17:24:46,768 INFO L153 SettingsManager]: * Use SBE=true [2024-11-10 17:24:46,768 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-10 17:24:46,769 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-10 17:24:46,769 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-10 17:24:46,770 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-10 17:24:46,771 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-10 17:24:46,771 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-11-10 17:24:46,771 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-11-10 17:24:46,772 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-11-10 17:24:46,772 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-10 17:24:46,772 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-10 17:24:46,772 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-10 17:24:46,772 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-10 17:24:46,773 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-10 17:24:46,773 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-10 17:24:46,773 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-10 17:24:46,773 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-10 17:24:46,774 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-10 17:24:46,774 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-10 17:24:46,774 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-10 17:24:46,774 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-10 17:24:46,775 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-10 17:24:46,776 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-10 17:24:46,777 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-10 17:24:46,777 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-10 17:24:46,778 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-10 17:24:46,778 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-10 17:24:46,779 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-10 17:24:46,779 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-10 17:24:46,779 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-10 17:24:46,780 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 32a779d95d64b7b3ae1a801430dde2c7d15b3372c5d0cdd47679441a42687631 [2024-11-10 17:24:47,149 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-10 17:24:47,173 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-10 17:24:47,177 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-10 17:24:47,178 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-10 17:24:47,179 INFO L274 PluginConnector]: CDTParser initialized [2024-11-10 17:24:47,180 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/uthash-2.0.2/uthash_BER_test3-2.i [2024-11-10 17:24:48,853 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-10 17:24:49,195 INFO L384 CDTParser]: Found 1 translation units. [2024-11-10 17:24:49,196 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_BER_test3-2.i [2024-11-10 17:24:49,216 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1e8a94b2a/5acf34f3205543c481e328907bc03c06/FLAGd4d5577a7 [2024-11-10 17:24:49,228 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1e8a94b2a/5acf34f3205543c481e328907bc03c06 [2024-11-10 17:24:49,230 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-10 17:24:49,232 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-10 17:24:49,233 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-10 17:24:49,233 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-10 17:24:49,239 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-10 17:24:49,240 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 05:24:49" (1/1) ... [2024-11-10 17:24:49,241 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@9c6cf2c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 05:24:49, skipping insertion in model container [2024-11-10 17:24:49,241 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 05:24:49" (1/1) ... [2024-11-10 17:24:49,301 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-10 17:24:49,741 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-10 17:24:49,782 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-10 17:24:49,788 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-10 17:24:49,794 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-10 17:24:49,801 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-10 17:24:49,835 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-10 17:24:49,836 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-10 17:24:49,840 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-10 17:24:49,841 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-10 17:24:49,847 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-10 17:24:49,848 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-10 17:24:49,853 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-10 17:24:49,854 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-10 17:24:49,861 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-10 17:24:49,866 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-10 17:24:49,868 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-10 17:24:49,872 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-10 17:24:49,873 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-10 17:24:49,874 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-10 17:24:49,881 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-10 17:24:49,891 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-10 17:24:49,909 INFO L197 MainTranslator]: Restarting translation with changed settings: SettingsChange [mNewPreferredMemoryModel=HoenickeLindenmann_1ByteResolution] [2024-11-10 17:24:49,922 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-10 17:24:49,971 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-10 17:24:49,995 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-10 17:24:49,997 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-10 17:24:50,003 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-10 17:24:50,011 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-10 17:24:50,038 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-10 17:24:50,045 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-10 17:24:50,047 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-10 17:24:50,047 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-10 17:24:50,053 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-10 17:24:50,054 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-10 17:24:50,055 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-10 17:24:50,055 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-10 17:24:50,059 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-10 17:24:50,060 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-10 17:24:50,066 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-10 17:24:50,067 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-10 17:24:50,068 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-10 17:24:50,069 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-10 17:24:50,072 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-10 17:24:50,076 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-10 17:24:50,083 INFO L200 MainTranslator]: Completed pre-run [2024-11-10 17:24:50,177 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-10 17:24:50,221 INFO L204 MainTranslator]: Completed translation [2024-11-10 17:24:50,223 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 05:24:50 WrapperNode [2024-11-10 17:24:50,223 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-10 17:24:50,224 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-10 17:24:50,225 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-10 17:24:50,225 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-10 17:24:50,232 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 05:24:50" (1/1) ... [2024-11-10 17:24:50,280 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 05:24:50" (1/1) ... [2024-11-10 17:24:50,350 INFO L138 Inliner]: procedures = 180, calls = 330, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 1196 [2024-11-10 17:24:50,354 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-10 17:24:50,355 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-10 17:24:50,355 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-10 17:24:50,355 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-10 17:24:50,367 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 05:24:50" (1/1) ... [2024-11-10 17:24:50,368 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 05:24:50" (1/1) ... [2024-11-10 17:24:50,384 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 05:24:50" (1/1) ... [2024-11-10 17:24:50,476 INFO L175 MemorySlicer]: Split 303 memory accesses to 3 slices as follows [2, 267, 34]. 88 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0, 0]. The 62 writes are split as follows [0, 58, 4]. [2024-11-10 17:24:50,476 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 05:24:50" (1/1) ... [2024-11-10 17:24:50,476 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 05:24:50" (1/1) ... [2024-11-10 17:24:50,512 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 05:24:50" (1/1) ... [2024-11-10 17:24:50,514 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 05:24:50" (1/1) ... [2024-11-10 17:24:50,519 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 05:24:50" (1/1) ... [2024-11-10 17:24:50,524 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 05:24:50" (1/1) ... [2024-11-10 17:24:50,532 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-10 17:24:50,547 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2024-11-10 17:24:50,547 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2024-11-10 17:24:50,547 INFO L274 PluginConnector]: IcfgBuilder initialized [2024-11-10 17:24:50,549 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 05:24:50" (1/1) ... [2024-11-10 17:24:50,558 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-10 17:24:50,569 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 17:24:50,585 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-10 17:24:50,589 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-10 17:24:50,641 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2024-11-10 17:24:50,641 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2024-11-10 17:24:50,641 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#0 [2024-11-10 17:24:50,641 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#1 [2024-11-10 17:24:50,641 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#2 [2024-11-10 17:24:50,642 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#0 [2024-11-10 17:24:50,642 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#1 [2024-11-10 17:24:50,642 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#2 [2024-11-10 17:24:50,642 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2024-11-10 17:24:50,642 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2024-11-10 17:24:50,642 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#0 [2024-11-10 17:24:50,642 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#1 [2024-11-10 17:24:50,642 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#2 [2024-11-10 17:24:50,643 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#0 [2024-11-10 17:24:50,643 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#1 [2024-11-10 17:24:50,643 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#2 [2024-11-10 17:24:50,643 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-11-10 17:24:50,643 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-10 17:24:50,643 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2024-11-10 17:24:50,643 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2024-11-10 17:24:50,643 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2024-11-10 17:24:50,644 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-11-10 17:24:50,644 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2024-11-10 17:24:50,644 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2024-11-10 17:24:50,644 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2024-11-10 17:24:50,644 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-10 17:24:50,644 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#0 [2024-11-10 17:24:50,644 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#1 [2024-11-10 17:24:50,644 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#2 [2024-11-10 17:24:50,644 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-10 17:24:50,645 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2024-11-10 17:24:50,645 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#2 [2024-11-10 17:24:50,645 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-10 17:24:50,645 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-10 17:24:50,901 INFO L256 CfgBuilder]: Building ICFG [2024-11-10 17:24:50,904 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-10 17:24:55,347 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L733: call ULTIMATE.dealloc(main_~#i~0#1.base, main_~#i~0#1.offset);havoc main_~#i~0#1.base, main_~#i~0#1.offset; [2024-11-10 17:24:55,497 INFO L? ?]: Removed 1312 outVars from TransFormulas that were not future-live. [2024-11-10 17:24:55,497 INFO L307 CfgBuilder]: Performing block encoding [2024-11-10 17:24:55,540 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-10 17:24:55,540 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-10 17:24:55,541 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 05:24:55 BoogieIcfgContainer [2024-11-10 17:24:55,541 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2024-11-10 17:24:55,543 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-10 17:24:55,543 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-10 17:24:55,547 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-10 17:24:55,547 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.11 05:24:49" (1/3) ... [2024-11-10 17:24:55,548 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@c2b44a9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 05:24:55, skipping insertion in model container [2024-11-10 17:24:55,548 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 05:24:50" (2/3) ... [2024-11-10 17:24:55,548 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@c2b44a9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 05:24:55, skipping insertion in model container [2024-11-10 17:24:55,549 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 05:24:55" (3/3) ... [2024-11-10 17:24:55,550 INFO L112 eAbstractionObserver]: Analyzing ICFG uthash_BER_test3-2.i [2024-11-10 17:24:55,567 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-10 17:24:55,567 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 632 error locations. [2024-11-10 17:24:55,647 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-10 17:24:55,655 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;@51dd8d25, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-10 17:24:55,655 INFO L334 AbstractCegarLoop]: Starting to check reachability of 632 error locations. [2024-11-10 17:24:55,665 INFO L276 IsEmpty]: Start isEmpty. Operand has 1308 states, 665 states have (on average 2.169924812030075) internal successors, (1443), 1301 states have internal predecessors, (1443), 10 states have call successors, (10), 3 states have call predecessors, (10), 3 states have return successors, (10), 6 states have call predecessors, (10), 10 states have call successors, (10) [2024-11-10 17:24:55,670 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2024-11-10 17:24:55,672 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 17:24:55,673 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1] [2024-11-10 17:24:55,674 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr629REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 629 more)] === [2024-11-10 17:24:55,680 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 17:24:55,680 INFO L85 PathProgramCache]: Analyzing trace with hash 1492446, now seen corresponding path program 1 times [2024-11-10 17:24:55,690 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-10 17:24:55,691 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1385926520] [2024-11-10 17:24:55,691 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 17:24:55,691 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-10 17:24:55,691 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-10 17:24:55,693 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-10 17:24:55,695 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2024-11-10 17:24:55,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 17:24:55,913 INFO L255 TraceCheckSpWp]: Trace formula consists of 24 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-10 17:24:55,919 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 17:24:55,963 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2024-11-10 17:24:55,978 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 17:24:55,979 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-10 17:24:55,979 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-10 17:24:55,980 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1385926520] [2024-11-10 17:24:55,981 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1385926520] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 17:24:55,981 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 17:24:55,981 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-10 17:24:55,983 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [602368552] [2024-11-10 17:24:55,983 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 17:24:55,988 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 17:24:55,989 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-10 17:24:56,024 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 17:24:56,025 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 17:24:56,030 INFO L87 Difference]: Start difference. First operand has 1308 states, 665 states have (on average 2.169924812030075) internal successors, (1443), 1301 states have internal predecessors, (1443), 10 states have call successors, (10), 3 states have call predecessors, (10), 3 states have return successors, (10), 6 states have call predecessors, (10), 10 states have call successors, (10) Second operand has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 17:24:57,928 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 17:24:57,928 INFO L93 Difference]: Finished difference Result 1488 states and 1574 transitions. [2024-11-10 17:24:57,929 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 17:24:57,930 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 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 3 [2024-11-10 17:24:57,931 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 17:24:57,949 INFO L225 Difference]: With dead ends: 1488 [2024-11-10 17:24:57,949 INFO L226 Difference]: Without dead ends: 1485 [2024-11-10 17:24:57,950 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 17:24:57,953 INFO L432 NwaCegarLoop]: 805 mSDtfsCounter, 1201 mSDsluCounter, 171 mSDsCounter, 0 mSdLazyCounter, 759 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1209 SdHoareTripleChecker+Valid, 976 SdHoareTripleChecker+Invalid, 775 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 759 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2024-11-10 17:24:57,954 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1209 Valid, 976 Invalid, 775 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 759 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2024-11-10 17:24:57,986 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1485 states. [2024-11-10 17:24:58,051 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1485 to 1291. [2024-11-10 17:24:58,053 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1291 states, 665 states have (on average 2.030075187969925) internal successors, (1350), 1284 states have internal predecessors, (1350), 10 states have call successors, (10), 3 states have call predecessors, (10), 2 states have return successors, (8), 4 states have call predecessors, (8), 8 states have call successors, (8) [2024-11-10 17:24:58,058 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1291 states to 1291 states and 1368 transitions. [2024-11-10 17:24:58,060 INFO L78 Accepts]: Start accepts. Automaton has 1291 states and 1368 transitions. Word has length 3 [2024-11-10 17:24:58,060 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 17:24:58,060 INFO L471 AbstractCegarLoop]: Abstraction has 1291 states and 1368 transitions. [2024-11-10 17:24:58,060 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 17:24:58,061 INFO L276 IsEmpty]: Start isEmpty. Operand 1291 states and 1368 transitions. [2024-11-10 17:24:58,061 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2024-11-10 17:24:58,061 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 17:24:58,061 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1] [2024-11-10 17:24:58,065 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2024-11-10 17:24:58,265 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-10 17:24:58,265 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr630REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 629 more)] === [2024-11-10 17:24:58,270 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 17:24:58,270 INFO L85 PathProgramCache]: Analyzing trace with hash 1492447, now seen corresponding path program 1 times [2024-11-10 17:24:58,270 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-10 17:24:58,270 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1997433842] [2024-11-10 17:24:58,270 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 17:24:58,270 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-10 17:24:58,271 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-10 17:24:58,275 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-10 17:24:58,276 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2024-11-10 17:24:58,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 17:24:58,412 INFO L255 TraceCheckSpWp]: Trace formula consists of 24 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-10 17:24:58,414 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 17:24:58,422 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-10 17:24:58,438 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 17:24:58,439 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-10 17:24:58,439 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-10 17:24:58,439 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1997433842] [2024-11-10 17:24:58,440 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1997433842] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 17:24:58,440 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 17:24:58,441 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-10 17:24:58,441 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [633820950] [2024-11-10 17:24:58,441 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 17:24:58,442 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 17:24:58,444 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-10 17:24:58,445 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 17:24:58,445 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 17:24:58,446 INFO L87 Difference]: Start difference. First operand 1291 states and 1368 transitions. Second operand has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 17:25:01,156 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 17:25:01,156 INFO L93 Difference]: Finished difference Result 1931 states and 2061 transitions. [2024-11-10 17:25:01,156 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 17:25:01,157 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 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 3 [2024-11-10 17:25:01,157 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 17:25:01,164 INFO L225 Difference]: With dead ends: 1931 [2024-11-10 17:25:01,165 INFO L226 Difference]: Without dead ends: 1931 [2024-11-10 17:25:01,165 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 17:25:01,166 INFO L432 NwaCegarLoop]: 1073 mSDtfsCounter, 681 mSDsluCounter, 740 mSDsCounter, 0 mSdLazyCounter, 904 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 686 SdHoareTripleChecker+Valid, 1813 SdHoareTripleChecker+Invalid, 910 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 904 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.6s IncrementalHoareTripleChecker+Time [2024-11-10 17:25:01,168 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [686 Valid, 1813 Invalid, 910 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 904 Invalid, 0 Unknown, 0 Unchecked, 2.6s Time] [2024-11-10 17:25:01,172 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1931 states. [2024-11-10 17:25:01,203 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1931 to 1513. [2024-11-10 17:25:01,205 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1513 states, 888 states have (on average 2.0112612612612613) internal successors, (1786), 1506 states have internal predecessors, (1786), 10 states have call successors, (10), 3 states have call predecessors, (10), 2 states have return successors, (8), 4 states have call predecessors, (8), 8 states have call successors, (8) [2024-11-10 17:25:01,211 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1513 states to 1513 states and 1804 transitions. [2024-11-10 17:25:01,212 INFO L78 Accepts]: Start accepts. Automaton has 1513 states and 1804 transitions. Word has length 3 [2024-11-10 17:25:01,212 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 17:25:01,212 INFO L471 AbstractCegarLoop]: Abstraction has 1513 states and 1804 transitions. [2024-11-10 17:25:01,212 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 17:25:01,213 INFO L276 IsEmpty]: Start isEmpty. Operand 1513 states and 1804 transitions. [2024-11-10 17:25:01,213 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2024-11-10 17:25:01,213 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 17:25:01,214 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 17:25:01,218 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Ended with exit code 0 [2024-11-10 17:25:01,414 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-10 17:25:01,415 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr626REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 629 more)] === [2024-11-10 17:25:01,416 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 17:25:01,416 INFO L85 PathProgramCache]: Analyzing trace with hash -1796491749, now seen corresponding path program 1 times [2024-11-10 17:25:01,417 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-10 17:25:01,417 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1401222133] [2024-11-10 17:25:01,420 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 17:25:01,420 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-10 17:25:01,420 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-10 17:25:01,423 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-10 17:25:01,426 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2024-11-10 17:25:01,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 17:25:01,585 INFO L255 TraceCheckSpWp]: Trace formula consists of 62 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-10 17:25:01,591 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 17:25:01,604 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-10 17:25:01,614 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2024-11-10 17:25:01,701 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-10 17:25:01,703 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 9 [2024-11-10 17:25:01,726 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2024-11-10 17:25:01,727 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 13 [2024-11-10 17:25:01,754 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 17:25:01,754 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-10 17:25:01,755 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-10 17:25:01,755 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1401222133] [2024-11-10 17:25:01,755 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1401222133] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 17:25:01,755 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 17:25:01,755 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-10 17:25:01,755 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [320138732] [2024-11-10 17:25:01,755 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 17:25:01,755 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-10 17:25:01,755 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-10 17:25:01,756 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-10 17:25:01,756 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-10 17:25:01,756 INFO L87 Difference]: Start difference. First operand 1513 states and 1804 transitions. Second operand has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 4 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 17:25:04,501 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 17:25:04,501 INFO L93 Difference]: Finished difference Result 1702 states and 2004 transitions. [2024-11-10 17:25:04,502 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-10 17:25:04,502 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 4 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 8 [2024-11-10 17:25:04,502 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 17:25:04,508 INFO L225 Difference]: With dead ends: 1702 [2024-11-10 17:25:04,508 INFO L226 Difference]: Without dead ends: 1702 [2024-11-10 17:25:04,508 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-10 17:25:04,509 INFO L432 NwaCegarLoop]: 484 mSDtfsCounter, 2693 mSDsluCounter, 103 mSDsCounter, 0 mSdLazyCounter, 1118 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2701 SdHoareTripleChecker+Valid, 587 SdHoareTripleChecker+Invalid, 1146 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 1118 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.7s IncrementalHoareTripleChecker+Time [2024-11-10 17:25:04,510 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2701 Valid, 587 Invalid, 1146 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 1118 Invalid, 0 Unknown, 0 Unchecked, 2.7s Time] [2024-11-10 17:25:04,513 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1702 states. [2024-11-10 17:25:04,540 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1702 to 1279. [2024-11-10 17:25:04,541 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1279 states, 665 states have (on average 2.0105263157894737) internal successors, (1337), 1272 states have internal predecessors, (1337), 10 states have call successors, (10), 3 states have call predecessors, (10), 2 states have return successors, (8), 4 states have call predecessors, (8), 8 states have call successors, (8) [2024-11-10 17:25:04,545 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1279 states to 1279 states and 1355 transitions. [2024-11-10 17:25:04,545 INFO L78 Accepts]: Start accepts. Automaton has 1279 states and 1355 transitions. Word has length 8 [2024-11-10 17:25:04,546 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 17:25:04,546 INFO L471 AbstractCegarLoop]: Abstraction has 1279 states and 1355 transitions. [2024-11-10 17:25:04,546 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 4 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 17:25:04,546 INFO L276 IsEmpty]: Start isEmpty. Operand 1279 states and 1355 transitions. [2024-11-10 17:25:04,547 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2024-11-10 17:25:04,547 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 17:25:04,547 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 17:25:04,552 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Ended with exit code 0 [2024-11-10 17:25:04,750 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-10 17:25:04,751 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr623REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 629 more)] === [2024-11-10 17:25:04,752 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 17:25:04,752 INFO L85 PathProgramCache]: Analyzing trace with hash 143332020, now seen corresponding path program 1 times [2024-11-10 17:25:04,752 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-10 17:25:04,753 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [293053093] [2024-11-10 17:25:04,753 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 17:25:04,753 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-10 17:25:04,753 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-10 17:25:04,754 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-10 17:25:04,756 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2024-11-10 17:25:04,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 17:25:04,873 INFO L255 TraceCheckSpWp]: Trace formula consists of 67 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-10 17:25:04,876 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 17:25:04,883 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2024-11-10 17:25:04,897 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 17:25:04,897 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-10 17:25:04,898 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-10 17:25:04,898 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [293053093] [2024-11-10 17:25:04,899 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [293053093] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 17:25:04,899 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 17:25:04,899 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-10 17:25:04,899 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [728450014] [2024-11-10 17:25:04,899 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 17:25:04,900 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 17:25:04,901 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-10 17:25:04,902 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 17:25:04,902 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 17:25:04,902 INFO L87 Difference]: Start difference. First operand 1279 states and 1355 transitions. Second operand has 3 states, 2 states have (on average 4.5) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 17:25:06,547 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 17:25:06,547 INFO L93 Difference]: Finished difference Result 1625 states and 1731 transitions. [2024-11-10 17:25:06,548 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 17:25:06,548 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 4.5) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2024-11-10 17:25:06,548 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 17:25:06,552 INFO L225 Difference]: With dead ends: 1625 [2024-11-10 17:25:06,553 INFO L226 Difference]: Without dead ends: 1625 [2024-11-10 17:25:06,553 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 17:25:06,554 INFO L432 NwaCegarLoop]: 1222 mSDtfsCounter, 961 mSDsluCounter, 367 mSDsCounter, 0 mSdLazyCounter, 879 mSolverCounterSat, 53 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 969 SdHoareTripleChecker+Valid, 1589 SdHoareTripleChecker+Invalid, 932 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 53 IncrementalHoareTripleChecker+Valid, 879 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2024-11-10 17:25:06,554 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [969 Valid, 1589 Invalid, 932 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [53 Valid, 879 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2024-11-10 17:25:06,558 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1625 states. [2024-11-10 17:25:06,574 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1625 to 1230. [2024-11-10 17:25:06,576 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1230 states, 665 states have (on average 1.936842105263158) internal successors, (1288), 1223 states have internal predecessors, (1288), 10 states have call successors, (10), 3 states have call predecessors, (10), 2 states have return successors, (8), 4 states have call predecessors, (8), 8 states have call successors, (8) [2024-11-10 17:25:06,579 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1230 states to 1230 states and 1306 transitions. [2024-11-10 17:25:06,580 INFO L78 Accepts]: Start accepts. Automaton has 1230 states and 1306 transitions. Word has length 9 [2024-11-10 17:25:06,580 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 17:25:06,580 INFO L471 AbstractCegarLoop]: Abstraction has 1230 states and 1306 transitions. [2024-11-10 17:25:06,580 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 4.5) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 17:25:06,580 INFO L276 IsEmpty]: Start isEmpty. Operand 1230 states and 1306 transitions. [2024-11-10 17:25:06,581 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2024-11-10 17:25:06,581 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 17:25:06,581 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 17:25:06,585 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Forceful destruction successful, exit code 0 [2024-11-10 17:25:06,781 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-10 17:25:06,782 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr624REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 629 more)] === [2024-11-10 17:25:06,782 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 17:25:06,782 INFO L85 PathProgramCache]: Analyzing trace with hash 143332021, now seen corresponding path program 1 times [2024-11-10 17:25:06,783 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-10 17:25:06,783 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2108958950] [2024-11-10 17:25:06,783 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 17:25:06,783 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-10 17:25:06,783 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-10 17:25:06,786 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-10 17:25:06,787 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2024-11-10 17:25:06,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 17:25:06,908 INFO L255 TraceCheckSpWp]: Trace formula consists of 67 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-10 17:25:06,914 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 17:25:06,935 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-10 17:25:06,968 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 17:25:06,969 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-10 17:25:06,969 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-10 17:25:06,969 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2108958950] [2024-11-10 17:25:06,969 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2108958950] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 17:25:06,969 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 17:25:06,970 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-10 17:25:06,971 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1740084932] [2024-11-10 17:25:06,971 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 17:25:06,971 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 17:25:06,971 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-10 17:25:06,972 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 17:25:06,972 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 17:25:06,972 INFO L87 Difference]: Start difference. First operand 1230 states and 1306 transitions. Second operand has 3 states, 2 states have (on average 4.5) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 17:25:09,116 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 17:25:09,116 INFO L93 Difference]: Finished difference Result 1717 states and 1826 transitions. [2024-11-10 17:25:09,118 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 17:25:09,118 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 4.5) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2024-11-10 17:25:09,118 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 17:25:09,122 INFO L225 Difference]: With dead ends: 1717 [2024-11-10 17:25:09,122 INFO L226 Difference]: Without dead ends: 1717 [2024-11-10 17:25:09,124 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 17:25:09,124 INFO L432 NwaCegarLoop]: 1421 mSDtfsCounter, 710 mSDsluCounter, 577 mSDsCounter, 0 mSdLazyCounter, 832 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 710 SdHoareTripleChecker+Valid, 1998 SdHoareTripleChecker+Invalid, 845 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 832 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2024-11-10 17:25:09,125 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [710 Valid, 1998 Invalid, 845 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 832 Invalid, 0 Unknown, 0 Unchecked, 2.1s Time] [2024-11-10 17:25:09,129 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1717 states. [2024-11-10 17:25:09,147 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1717 to 1259. [2024-11-10 17:25:09,149 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1259 states, 704 states have (on average 1.9232954545454546) internal successors, (1354), 1252 states have internal predecessors, (1354), 10 states have call successors, (10), 3 states have call predecessors, (10), 2 states have return successors, (8), 4 states have call predecessors, (8), 8 states have call successors, (8) [2024-11-10 17:25:09,152 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1259 states to 1259 states and 1372 transitions. [2024-11-10 17:25:09,153 INFO L78 Accepts]: Start accepts. Automaton has 1259 states and 1372 transitions. Word has length 9 [2024-11-10 17:25:09,153 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 17:25:09,153 INFO L471 AbstractCegarLoop]: Abstraction has 1259 states and 1372 transitions. [2024-11-10 17:25:09,153 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 4.5) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 17:25:09,153 INFO L276 IsEmpty]: Start isEmpty. Operand 1259 states and 1372 transitions. [2024-11-10 17:25:09,154 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2024-11-10 17:25:09,154 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 17:25:09,154 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 17:25:09,158 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Ended with exit code 0 [2024-11-10 17:25:09,354 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-10 17:25:09,355 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr110REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 629 more)] === [2024-11-10 17:25:09,356 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 17:25:09,356 INFO L85 PathProgramCache]: Analyzing trace with hash -1628973646, now seen corresponding path program 1 times [2024-11-10 17:25:09,357 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-10 17:25:09,357 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1024364499] [2024-11-10 17:25:09,357 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 17:25:09,357 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-10 17:25:09,357 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-10 17:25:09,360 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-10 17:25:09,366 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2024-11-10 17:25:09,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 17:25:09,499 INFO L255 TraceCheckSpWp]: Trace formula consists of 86 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-10 17:25:09,500 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 17:25:09,586 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 17:25:09,586 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-10 17:25:09,587 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-10 17:25:09,587 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1024364499] [2024-11-10 17:25:09,587 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1024364499] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 17:25:09,587 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 17:25:09,587 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-10 17:25:09,587 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1444030117] [2024-11-10 17:25:09,587 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 17:25:09,587 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-10 17:25:09,587 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-10 17:25:09,588 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-10 17:25:09,588 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-10 17:25:09,588 INFO L87 Difference]: Start difference. First operand 1259 states and 1372 transitions. Second operand has 4 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 17:25:10,205 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 17:25:10,205 INFO L93 Difference]: Finished difference Result 1877 states and 2074 transitions. [2024-11-10 17:25:10,206 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-10 17:25:10,206 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 14 [2024-11-10 17:25:10,206 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 17:25:10,211 INFO L225 Difference]: With dead ends: 1877 [2024-11-10 17:25:10,211 INFO L226 Difference]: Without dead ends: 1877 [2024-11-10 17:25:10,211 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-10 17:25:10,212 INFO L432 NwaCegarLoop]: 1429 mSDtfsCounter, 652 mSDsluCounter, 2485 mSDsCounter, 0 mSdLazyCounter, 376 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 652 SdHoareTripleChecker+Valid, 3914 SdHoareTripleChecker+Invalid, 385 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 376 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-10 17:25:10,212 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [652 Valid, 3914 Invalid, 385 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 376 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-10 17:25:10,218 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1877 states. [2024-11-10 17:25:10,234 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1877 to 1518. [2024-11-10 17:25:10,236 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1518 states, 963 states have (on average 1.8982346832814123) internal successors, (1828), 1511 states have internal predecessors, (1828), 10 states have call successors, (10), 3 states have call predecessors, (10), 2 states have return successors, (8), 4 states have call predecessors, (8), 8 states have call successors, (8) [2024-11-10 17:25:10,240 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1518 states to 1518 states and 1846 transitions. [2024-11-10 17:25:10,241 INFO L78 Accepts]: Start accepts. Automaton has 1518 states and 1846 transitions. Word has length 14 [2024-11-10 17:25:10,241 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 17:25:10,241 INFO L471 AbstractCegarLoop]: Abstraction has 1518 states and 1846 transitions. [2024-11-10 17:25:10,242 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 17:25:10,242 INFO L276 IsEmpty]: Start isEmpty. Operand 1518 states and 1846 transitions. [2024-11-10 17:25:10,243 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2024-11-10 17:25:10,243 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 17:25:10,243 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 17:25:10,248 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Forceful destruction successful, exit code 0 [2024-11-10 17:25:10,444 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-10 17:25:10,444 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr299REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 629 more)] === [2024-11-10 17:25:10,445 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 17:25:10,445 INFO L85 PathProgramCache]: Analyzing trace with hash -346273135, now seen corresponding path program 1 times [2024-11-10 17:25:10,445 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-10 17:25:10,445 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1953730223] [2024-11-10 17:25:10,445 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 17:25:10,445 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-10 17:25:10,445 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-10 17:25:10,447 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-10 17:25:10,448 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Waiting until timeout for monitored process [2024-11-10 17:25:10,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 17:25:10,565 INFO L255 TraceCheckSpWp]: Trace formula consists of 92 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-10 17:25:10,566 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 17:25:10,577 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 17:25:10,577 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-10 17:25:10,577 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-10 17:25:10,577 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1953730223] [2024-11-10 17:25:10,578 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1953730223] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 17:25:10,578 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 17:25:10,578 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-10 17:25:10,578 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [687721986] [2024-11-10 17:25:10,578 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 17:25:10,578 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 17:25:10,578 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-10 17:25:10,579 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 17:25:10,579 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 17:25:10,579 INFO L87 Difference]: Start difference. First operand 1518 states and 1846 transitions. Second operand has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 17:25:10,610 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 17:25:10,610 INFO L93 Difference]: Finished difference Result 1458 states and 1760 transitions. [2024-11-10 17:25:10,610 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 17:25:10,610 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2024-11-10 17:25:10,611 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 17:25:10,614 INFO L225 Difference]: With dead ends: 1458 [2024-11-10 17:25:10,614 INFO L226 Difference]: Without dead ends: 1458 [2024-11-10 17:25:10,614 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 17:25:10,614 INFO L432 NwaCegarLoop]: 1233 mSDtfsCounter, 71 mSDsluCounter, 1169 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 71 SdHoareTripleChecker+Valid, 2402 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-10 17:25:10,615 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [71 Valid, 2402 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 17:25:10,617 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1458 states. [2024-11-10 17:25:10,631 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1458 to 1458. [2024-11-10 17:25:10,635 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1458 states, 927 states have (on average 1.8791801510248112) internal successors, (1742), 1451 states have internal predecessors, (1742), 10 states have call successors, (10), 3 states have call predecessors, (10), 2 states have return successors, (8), 4 states have call predecessors, (8), 8 states have call successors, (8) [2024-11-10 17:25:10,640 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1458 states to 1458 states and 1760 transitions. [2024-11-10 17:25:10,640 INFO L78 Accepts]: Start accepts. Automaton has 1458 states and 1760 transitions. Word has length 16 [2024-11-10 17:25:10,640 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 17:25:10,641 INFO L471 AbstractCegarLoop]: Abstraction has 1458 states and 1760 transitions. [2024-11-10 17:25:10,641 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 17:25:10,641 INFO L276 IsEmpty]: Start isEmpty. Operand 1458 states and 1760 transitions. [2024-11-10 17:25:10,641 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2024-11-10 17:25:10,642 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 17:25:10,642 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 17:25:10,646 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Ended with exit code 0 [2024-11-10 17:25:10,842 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-10 17:25:10,842 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr275REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 629 more)] === [2024-11-10 17:25:10,843 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 17:25:10,843 INFO L85 PathProgramCache]: Analyzing trace with hash -2056049403, now seen corresponding path program 1 times [2024-11-10 17:25:10,843 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-10 17:25:10,843 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [930618924] [2024-11-10 17:25:10,843 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 17:25:10,843 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-10 17:25:10,844 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-10 17:25:10,845 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-10 17:25:10,845 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Waiting until timeout for monitored process [2024-11-10 17:25:10,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 17:25:10,977 INFO L255 TraceCheckSpWp]: Trace formula consists of 95 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-10 17:25:10,979 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 17:25:11,004 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 17:25:11,004 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-10 17:25:11,004 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-10 17:25:11,005 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [930618924] [2024-11-10 17:25:11,005 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [930618924] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 17:25:11,005 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 17:25:11,005 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-10 17:25:11,005 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1850161742] [2024-11-10 17:25:11,005 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 17:25:11,006 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-10 17:25:11,006 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-10 17:25:11,006 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-10 17:25:11,006 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-10 17:25:11,007 INFO L87 Difference]: Start difference. First operand 1458 states and 1760 transitions. Second operand has 4 states, 4 states have (on average 4.5) internal successors, (18), 4 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 17:25:11,058 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 17:25:11,058 INFO L93 Difference]: Finished difference Result 1428 states and 1702 transitions. [2024-11-10 17:25:11,059 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-10 17:25:11,059 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.5) internal successors, (18), 4 states have internal predecessors, (18), 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 18 [2024-11-10 17:25:11,059 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 17:25:11,062 INFO L225 Difference]: With dead ends: 1428 [2024-11-10 17:25:11,062 INFO L226 Difference]: Without dead ends: 1428 [2024-11-10 17:25:11,062 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-10 17:25:11,063 INFO L432 NwaCegarLoop]: 1188 mSDtfsCounter, 48 mSDsluCounter, 2349 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 48 SdHoareTripleChecker+Valid, 3537 SdHoareTripleChecker+Invalid, 59 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-10 17:25:11,063 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [48 Valid, 3537 Invalid, 59 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 17:25:11,065 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1428 states. [2024-11-10 17:25:11,079 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1428 to 1428. [2024-11-10 17:25:11,080 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1428 states, 911 states have (on average 1.8485181119648737) internal successors, (1684), 1421 states have internal predecessors, (1684), 10 states have call successors, (10), 3 states have call predecessors, (10), 2 states have return successors, (8), 4 states have call predecessors, (8), 8 states have call successors, (8) [2024-11-10 17:25:11,084 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1428 states to 1428 states and 1702 transitions. [2024-11-10 17:25:11,084 INFO L78 Accepts]: Start accepts. Automaton has 1428 states and 1702 transitions. Word has length 18 [2024-11-10 17:25:11,084 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 17:25:11,084 INFO L471 AbstractCegarLoop]: Abstraction has 1428 states and 1702 transitions. [2024-11-10 17:25:11,084 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.5) internal successors, (18), 4 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 17:25:11,085 INFO L276 IsEmpty]: Start isEmpty. Operand 1428 states and 1702 transitions. [2024-11-10 17:25:11,085 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2024-11-10 17:25:11,085 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 17:25:11,085 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] [2024-11-10 17:25:11,090 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Forceful destruction successful, exit code 0 [2024-11-10 17:25:11,288 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-10 17:25:11,289 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr615REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 629 more)] === [2024-11-10 17:25:11,290 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 17:25:11,290 INFO L85 PathProgramCache]: Analyzing trace with hash 49793037, now seen corresponding path program 1 times [2024-11-10 17:25:11,290 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-10 17:25:11,291 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1368924644] [2024-11-10 17:25:11,291 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 17:25:11,291 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-10 17:25:11,291 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-10 17:25:11,295 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-10 17:25:11,297 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Waiting until timeout for monitored process [2024-11-10 17:25:11,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 17:25:11,448 INFO L255 TraceCheckSpWp]: Trace formula consists of 133 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-10 17:25:11,450 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 17:25:11,462 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 17:25:11,462 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-10 17:25:11,462 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-10 17:25:11,462 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1368924644] [2024-11-10 17:25:11,462 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1368924644] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 17:25:11,463 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 17:25:11,463 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-10 17:25:11,463 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1780928241] [2024-11-10 17:25:11,463 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 17:25:11,463 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 17:25:11,463 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-10 17:25:11,464 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 17:25:11,464 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 17:25:11,464 INFO L87 Difference]: Start difference. First operand 1428 states and 1702 transitions. Second operand has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 17:25:11,484 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 17:25:11,485 INFO L93 Difference]: Finished difference Result 1368 states and 1616 transitions. [2024-11-10 17:25:11,485 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 17:25:11,485 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 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 20 [2024-11-10 17:25:11,485 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 17:25:11,488 INFO L225 Difference]: With dead ends: 1368 [2024-11-10 17:25:11,488 INFO L226 Difference]: Without dead ends: 1368 [2024-11-10 17:25:11,488 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 17:25:11,489 INFO L432 NwaCegarLoop]: 1155 mSDtfsCounter, 71 mSDsluCounter, 1091 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 71 SdHoareTripleChecker+Valid, 2246 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-10 17:25:11,489 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [71 Valid, 2246 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 17:25:11,491 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1368 states. [2024-11-10 17:25:11,503 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1368 to 1368. [2024-11-10 17:25:11,505 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1368 states, 875 states have (on average 1.8262857142857143) internal successors, (1598), 1361 states have internal predecessors, (1598), 10 states have call successors, (10), 3 states have call predecessors, (10), 2 states have return successors, (8), 4 states have call predecessors, (8), 8 states have call successors, (8) [2024-11-10 17:25:11,509 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1368 states to 1368 states and 1616 transitions. [2024-11-10 17:25:11,509 INFO L78 Accepts]: Start accepts. Automaton has 1368 states and 1616 transitions. Word has length 20 [2024-11-10 17:25:11,509 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 17:25:11,510 INFO L471 AbstractCegarLoop]: Abstraction has 1368 states and 1616 transitions. [2024-11-10 17:25:11,510 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 17:25:11,510 INFO L276 IsEmpty]: Start isEmpty. Operand 1368 states and 1616 transitions. [2024-11-10 17:25:11,511 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2024-11-10 17:25:11,512 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 17:25:11,512 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 17:25:11,518 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Forceful destruction successful, exit code 0 [2024-11-10 17:25:11,712 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-10 17:25:11,713 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 629 more)] === [2024-11-10 17:25:11,713 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 17:25:11,713 INFO L85 PathProgramCache]: Analyzing trace with hash 1947032309, now seen corresponding path program 1 times [2024-11-10 17:25:11,713 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-10 17:25:11,713 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [241072252] [2024-11-10 17:25:11,713 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 17:25:11,714 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-10 17:25:11,714 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-10 17:25:11,715 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-10 17:25:11,717 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Waiting until timeout for monitored process [2024-11-10 17:25:11,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 17:25:11,877 INFO L255 TraceCheckSpWp]: Trace formula consists of 102 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-10 17:25:11,879 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 17:25:11,886 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-10 17:25:11,886 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-10 17:25:11,887 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-10 17:25:11,890 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 39 [2024-11-10 17:25:11,966 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-10 17:25:11,967 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 70 treesize of output 26 [2024-11-10 17:25:11,981 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 17:25:11,981 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-10 17:25:11,981 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-10 17:25:11,981 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [241072252] [2024-11-10 17:25:11,981 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [241072252] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 17:25:11,981 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 17:25:11,981 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-10 17:25:11,982 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [264279536] [2024-11-10 17:25:11,982 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 17:25:11,982 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-10 17:25:11,982 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-10 17:25:11,982 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-10 17:25:11,982 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-10 17:25:11,982 INFO L87 Difference]: Start difference. First operand 1368 states and 1616 transitions. Second operand has 4 states, 4 states have (on average 5.25) internal successors, (21), 4 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 17:25:12,188 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 17:25:12,188 INFO L93 Difference]: Finished difference Result 2429 states and 2809 transitions. [2024-11-10 17:25:12,189 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-10 17:25:12,189 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.25) internal successors, (21), 4 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 21 [2024-11-10 17:25:12,189 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 17:25:12,195 INFO L225 Difference]: With dead ends: 2429 [2024-11-10 17:25:12,195 INFO L226 Difference]: Without dead ends: 2429 [2024-11-10 17:25:12,196 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-10 17:25:12,196 INFO L432 NwaCegarLoop]: 1149 mSDtfsCounter, 1083 mSDsluCounter, 2283 mSDsCounter, 0 mSdLazyCounter, 71 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1091 SdHoareTripleChecker+Valid, 3432 SdHoareTripleChecker+Invalid, 72 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 71 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-10 17:25:12,196 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1091 Valid, 3432 Invalid, 72 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 71 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-10 17:25:12,199 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2429 states. [2024-11-10 17:25:12,215 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2429 to 1367. [2024-11-10 17:25:12,217 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1367 states, 874 states have (on average 1.826086956521739) internal successors, (1596), 1360 states have internal predecessors, (1596), 10 states have call successors, (10), 3 states have call predecessors, (10), 2 states have return successors, (8), 4 states have call predecessors, (8), 8 states have call successors, (8) [2024-11-10 17:25:12,220 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1367 states to 1367 states and 1614 transitions. [2024-11-10 17:25:12,220 INFO L78 Accepts]: Start accepts. Automaton has 1367 states and 1614 transitions. Word has length 21 [2024-11-10 17:25:12,220 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 17:25:12,231 INFO L471 AbstractCegarLoop]: Abstraction has 1367 states and 1614 transitions. [2024-11-10 17:25:12,231 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.25) internal successors, (21), 4 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 17:25:12,231 INFO L276 IsEmpty]: Start isEmpty. Operand 1367 states and 1614 transitions. [2024-11-10 17:25:12,232 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2024-11-10 17:25:12,232 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 17:25:12,232 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] [2024-11-10 17:25:12,239 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Forceful destruction successful, exit code 0 [2024-11-10 17:25:12,432 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-10 17:25:12,433 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr591REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 629 more)] === [2024-11-10 17:25:12,433 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 17:25:12,433 INFO L85 PathProgramCache]: Analyzing trace with hash 606441473, now seen corresponding path program 1 times [2024-11-10 17:25:12,434 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-10 17:25:12,434 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1987725929] [2024-11-10 17:25:12,434 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 17:25:12,434 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-10 17:25:12,434 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-10 17:25:12,435 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-10 17:25:12,437 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (12)] Waiting until timeout for monitored process [2024-11-10 17:25:12,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 17:25:12,593 INFO L255 TraceCheckSpWp]: Trace formula consists of 136 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-10 17:25:12,595 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 17:25:12,612 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 17:25:12,613 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-10 17:25:12,613 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-10 17:25:12,613 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1987725929] [2024-11-10 17:25:12,613 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1987725929] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 17:25:12,613 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 17:25:12,613 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-10 17:25:12,613 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [467929015] [2024-11-10 17:25:12,613 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 17:25:12,613 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-10 17:25:12,613 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-10 17:25:12,614 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-10 17:25:12,614 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-10 17:25:12,614 INFO L87 Difference]: Start difference. First operand 1367 states and 1614 transitions. Second operand has 4 states, 4 states have (on average 5.5) internal successors, (22), 4 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 17:25:12,669 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 17:25:12,669 INFO L93 Difference]: Finished difference Result 1337 states and 1556 transitions. [2024-11-10 17:25:12,670 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-10 17:25:12,670 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.5) internal successors, (22), 4 states have internal predecessors, (22), 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 22 [2024-11-10 17:25:12,670 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 17:25:12,673 INFO L225 Difference]: With dead ends: 1337 [2024-11-10 17:25:12,673 INFO L226 Difference]: Without dead ends: 1337 [2024-11-10 17:25:12,673 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-10 17:25:12,674 INFO L432 NwaCegarLoop]: 1110 mSDtfsCounter, 48 mSDsluCounter, 2193 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 48 SdHoareTripleChecker+Valid, 3303 SdHoareTripleChecker+Invalid, 59 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-10 17:25:12,674 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [48 Valid, 3303 Invalid, 59 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 17:25:12,675 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1337 states. [2024-11-10 17:25:12,685 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1337 to 1337. [2024-11-10 17:25:12,687 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1337 states, 858 states have (on average 1.7925407925407926) internal successors, (1538), 1330 states have internal predecessors, (1538), 10 states have call successors, (10), 3 states have call predecessors, (10), 2 states have return successors, (8), 4 states have call predecessors, (8), 8 states have call successors, (8) [2024-11-10 17:25:12,689 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1337 states to 1337 states and 1556 transitions. [2024-11-10 17:25:12,689 INFO L78 Accepts]: Start accepts. Automaton has 1337 states and 1556 transitions. Word has length 22 [2024-11-10 17:25:12,690 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 17:25:12,690 INFO L471 AbstractCegarLoop]: Abstraction has 1337 states and 1556 transitions. [2024-11-10 17:25:12,690 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.5) internal successors, (22), 4 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 17:25:12,690 INFO L276 IsEmpty]: Start isEmpty. Operand 1337 states and 1556 transitions. [2024-11-10 17:25:12,691 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2024-11-10 17:25:12,691 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 17:25:12,691 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] [2024-11-10 17:25:12,696 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (12)] Ended with exit code 0 [2024-11-10 17:25:12,891 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-10 17:25:12,892 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr577REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 629 more)] === [2024-11-10 17:25:12,892 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 17:25:12,892 INFO L85 PathProgramCache]: Analyzing trace with hash 2096241655, now seen corresponding path program 1 times [2024-11-10 17:25:12,892 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-10 17:25:12,892 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1599343797] [2024-11-10 17:25:12,893 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 17:25:12,893 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-10 17:25:12,893 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-10 17:25:12,894 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-10 17:25:12,895 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (13)] Waiting until timeout for monitored process [2024-11-10 17:25:13,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 17:25:13,070 INFO L255 TraceCheckSpWp]: Trace formula consists of 150 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-10 17:25:13,072 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 17:25:13,077 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2024-11-10 17:25:13,167 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 17:25:13,167 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-10 17:25:13,167 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-10 17:25:13,168 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1599343797] [2024-11-10 17:25:13,168 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1599343797] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 17:25:13,168 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 17:25:13,168 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-10 17:25:13,168 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [767195199] [2024-11-10 17:25:13,168 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 17:25:13,168 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-10 17:25:13,169 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-10 17:25:13,169 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-10 17:25:13,169 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-10 17:25:13,169 INFO L87 Difference]: Start difference. First operand 1337 states and 1556 transitions. Second operand has 4 states, 3 states have (on average 12.0) internal successors, (36), 4 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 17:25:14,950 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 17:25:14,950 INFO L93 Difference]: Finished difference Result 1748 states and 2080 transitions. [2024-11-10 17:25:14,951 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-10 17:25:14,951 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 12.0) internal successors, (36), 4 states have internal predecessors, (36), 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 36 [2024-11-10 17:25:14,952 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 17:25:14,957 INFO L225 Difference]: With dead ends: 1748 [2024-11-10 17:25:14,957 INFO L226 Difference]: Without dead ends: 1748 [2024-11-10 17:25:14,957 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-10 17:25:14,958 INFO L432 NwaCegarLoop]: 725 mSDtfsCounter, 816 mSDsluCounter, 873 mSDsCounter, 0 mSdLazyCounter, 1299 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 824 SdHoareTripleChecker+Valid, 1598 SdHoareTripleChecker+Invalid, 1307 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 1299 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2024-11-10 17:25:14,958 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [824 Valid, 1598 Invalid, 1307 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 1299 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2024-11-10 17:25:14,960 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1748 states. [2024-11-10 17:25:14,972 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1748 to 1333. [2024-11-10 17:25:14,974 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1333 states, 858 states have (on average 1.7832167832167831) internal successors, (1530), 1326 states have internal predecessors, (1530), 10 states have call successors, (10), 3 states have call predecessors, (10), 2 states have return successors, (8), 4 states have call predecessors, (8), 8 states have call successors, (8) [2024-11-10 17:25:14,976 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1333 states to 1333 states and 1548 transitions. [2024-11-10 17:25:14,976 INFO L78 Accepts]: Start accepts. Automaton has 1333 states and 1548 transitions. Word has length 36 [2024-11-10 17:25:14,977 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 17:25:14,977 INFO L471 AbstractCegarLoop]: Abstraction has 1333 states and 1548 transitions. [2024-11-10 17:25:14,977 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 12.0) internal successors, (36), 4 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 17:25:14,977 INFO L276 IsEmpty]: Start isEmpty. Operand 1333 states and 1548 transitions. [2024-11-10 17:25:14,978 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2024-11-10 17:25:14,978 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 17:25:14,978 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] [2024-11-10 17:25:14,984 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (13)] Ended with exit code 0 [2024-11-10 17:25:15,182 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-10 17:25:15,183 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr578REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 629 more)] === [2024-11-10 17:25:15,183 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 17:25:15,183 INFO L85 PathProgramCache]: Analyzing trace with hash 2096241656, now seen corresponding path program 1 times [2024-11-10 17:25:15,184 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-10 17:25:15,184 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [535686603] [2024-11-10 17:25:15,184 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 17:25:15,184 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-10 17:25:15,184 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-10 17:25:15,187 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-10 17:25:15,190 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (14)] Waiting until timeout for monitored process [2024-11-10 17:25:15,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 17:25:15,346 INFO L255 TraceCheckSpWp]: Trace formula consists of 150 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-10 17:25:15,348 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 17:25:15,357 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-10 17:25:15,530 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 17:25:15,530 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-10 17:25:15,530 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-10 17:25:15,530 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [535686603] [2024-11-10 17:25:15,530 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [535686603] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 17:25:15,530 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 17:25:15,530 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-10 17:25:15,530 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1412613289] [2024-11-10 17:25:15,531 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 17:25:15,531 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-10 17:25:15,531 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-10 17:25:15,531 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-10 17:25:15,531 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-10 17:25:15,531 INFO L87 Difference]: Start difference. First operand 1333 states and 1548 transitions. Second operand has 4 states, 3 states have (on average 12.0) internal successors, (36), 4 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 17:25:17,836 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 17:25:17,837 INFO L93 Difference]: Finished difference Result 1867 states and 2176 transitions. [2024-11-10 17:25:17,838 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-10 17:25:17,838 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 12.0) internal successors, (36), 4 states have internal predecessors, (36), 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 36 [2024-11-10 17:25:17,838 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 17:25:17,842 INFO L225 Difference]: With dead ends: 1867 [2024-11-10 17:25:17,842 INFO L226 Difference]: Without dead ends: 1867 [2024-11-10 17:25:17,842 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-10 17:25:17,842 INFO L432 NwaCegarLoop]: 1350 mSDtfsCounter, 561 mSDsluCounter, 1386 mSDsCounter, 0 mSdLazyCounter, 1407 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 561 SdHoareTripleChecker+Valid, 2736 SdHoareTripleChecker+Invalid, 1410 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 1407 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2024-11-10 17:25:17,843 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [561 Valid, 2736 Invalid, 1410 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 1407 Invalid, 0 Unknown, 0 Unchecked, 2.2s Time] [2024-11-10 17:25:17,844 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1867 states. [2024-11-10 17:25:17,853 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1867 to 1329. [2024-11-10 17:25:17,855 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1329 states, 858 states have (on average 1.7738927738927739) internal successors, (1522), 1322 states have internal predecessors, (1522), 10 states have call successors, (10), 3 states have call predecessors, (10), 2 states have return successors, (8), 4 states have call predecessors, (8), 8 states have call successors, (8) [2024-11-10 17:25:17,857 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1329 states to 1329 states and 1540 transitions. [2024-11-10 17:25:17,857 INFO L78 Accepts]: Start accepts. Automaton has 1329 states and 1540 transitions. Word has length 36 [2024-11-10 17:25:17,858 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 17:25:17,858 INFO L471 AbstractCegarLoop]: Abstraction has 1329 states and 1540 transitions. [2024-11-10 17:25:17,858 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 12.0) internal successors, (36), 4 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 17:25:17,858 INFO L276 IsEmpty]: Start isEmpty. Operand 1329 states and 1540 transitions. [2024-11-10 17:25:17,859 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2024-11-10 17:25:17,859 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 17:25:17,859 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] [2024-11-10 17:25:17,865 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (14)] Ended with exit code 0 [2024-11-10 17:25:18,059 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-10 17:25:18,060 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr534REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 629 more)] === [2024-11-10 17:25:18,060 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 17:25:18,060 INFO L85 PathProgramCache]: Analyzing trace with hash -1769108430, now seen corresponding path program 1 times [2024-11-10 17:25:18,060 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-10 17:25:18,060 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1510558923] [2024-11-10 17:25:18,061 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 17:25:18,061 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-10 17:25:18,061 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-10 17:25:18,062 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-10 17:25:18,063 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (15)] Waiting until timeout for monitored process [2024-11-10 17:25:18,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 17:25:18,283 INFO L255 TraceCheckSpWp]: Trace formula consists of 258 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-10 17:25:18,285 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 17:25:18,316 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 17:25:18,317 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-10 17:25:18,317 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-10 17:25:18,317 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1510558923] [2024-11-10 17:25:18,317 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1510558923] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 17:25:18,317 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 17:25:18,318 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-10 17:25:18,318 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [768974990] [2024-11-10 17:25:18,318 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 17:25:18,318 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-10 17:25:18,318 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-10 17:25:18,319 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-10 17:25:18,319 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-10 17:25:18,319 INFO L87 Difference]: Start difference. First operand 1329 states and 1540 transitions. Second operand has 4 states, 4 states have (on average 14.0) internal successors, (56), 4 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 17:25:18,375 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 17:25:18,375 INFO L93 Difference]: Finished difference Result 1317 states and 1520 transitions. [2024-11-10 17:25:18,375 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-10 17:25:18,376 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 14.0) internal successors, (56), 4 states have internal predecessors, (56), 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 56 [2024-11-10 17:25:18,376 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 17:25:18,380 INFO L225 Difference]: With dead ends: 1317 [2024-11-10 17:25:18,380 INFO L226 Difference]: Without dead ends: 1317 [2024-11-10 17:25:18,380 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 53 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-10 17:25:18,381 INFO L432 NwaCegarLoop]: 1104 mSDtfsCounter, 21 mSDsluCounter, 2176 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 3280 SdHoareTripleChecker+Invalid, 44 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-10 17:25:18,381 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 3280 Invalid, 44 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 17:25:18,383 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1317 states. [2024-11-10 17:25:18,392 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1317 to 1317. [2024-11-10 17:25:18,394 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1317 states, 846 states have (on average 1.7754137115839244) internal successors, (1502), 1310 states have internal predecessors, (1502), 10 states have call successors, (10), 3 states have call predecessors, (10), 2 states have return successors, (8), 4 states have call predecessors, (8), 8 states have call successors, (8) [2024-11-10 17:25:18,409 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1317 states to 1317 states and 1520 transitions. [2024-11-10 17:25:18,410 INFO L78 Accepts]: Start accepts. Automaton has 1317 states and 1520 transitions. Word has length 56 [2024-11-10 17:25:18,410 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 17:25:18,410 INFO L471 AbstractCegarLoop]: Abstraction has 1317 states and 1520 transitions. [2024-11-10 17:25:18,410 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.0) internal successors, (56), 4 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 17:25:18,411 INFO L276 IsEmpty]: Start isEmpty. Operand 1317 states and 1520 transitions. [2024-11-10 17:25:18,411 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2024-11-10 17:25:18,411 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 17:25:18,411 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 17:25:18,417 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (15)] Forceful destruction successful, exit code 0 [2024-11-10 17:25:18,612 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-10 17:25:18,612 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr534REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 629 more)] === [2024-11-10 17:25:18,613 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 17:25:18,613 INFO L85 PathProgramCache]: Analyzing trace with hash -998117638, now seen corresponding path program 1 times [2024-11-10 17:25:18,613 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-10 17:25:18,613 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [84763132] [2024-11-10 17:25:18,613 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 17:25:18,614 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-10 17:25:18,614 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-10 17:25:18,617 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-10 17:25:18,618 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (16)] Waiting until timeout for monitored process [2024-11-10 17:25:18,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 17:25:18,910 INFO L255 TraceCheckSpWp]: Trace formula consists of 282 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-10 17:25:18,913 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 17:25:18,921 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2024-11-10 17:25:18,928 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-10 17:25:19,411 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-10 17:25:19,412 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 9 [2024-11-10 17:25:19,426 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2024-11-10 17:25:19,427 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 13 [2024-11-10 17:25:19,439 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 17:25:19,440 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-10 17:25:19,440 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-10 17:25:19,440 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [84763132] [2024-11-10 17:25:19,440 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [84763132] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 17:25:19,440 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 17:25:19,440 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-10 17:25:19,440 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2138860059] [2024-11-10 17:25:19,440 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 17:25:19,440 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-10 17:25:19,441 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-10 17:25:19,441 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-10 17:25:19,441 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-10 17:25:19,441 INFO L87 Difference]: Start difference. First operand 1317 states and 1520 transitions. Second operand has 4 states, 3 states have (on average 21.333333333333332) internal successors, (64), 4 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 17:25:21,220 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 17:25:21,220 INFO L93 Difference]: Finished difference Result 1686 states and 2006 transitions. [2024-11-10 17:25:21,220 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-10 17:25:21,221 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 21.333333333333332) internal successors, (64), 4 states have internal predecessors, (64), 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 64 [2024-11-10 17:25:21,221 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 17:25:21,225 INFO L225 Difference]: With dead ends: 1686 [2024-11-10 17:25:21,226 INFO L226 Difference]: Without dead ends: 1686 [2024-11-10 17:25:21,226 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 61 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-10 17:25:21,226 INFO L432 NwaCegarLoop]: 568 mSDtfsCounter, 1799 mSDsluCounter, 284 mSDsCounter, 0 mSdLazyCounter, 876 mSolverCounterSat, 46 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1802 SdHoareTripleChecker+Valid, 852 SdHoareTripleChecker+Invalid, 922 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 46 IncrementalHoareTripleChecker+Valid, 876 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2024-11-10 17:25:21,227 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1802 Valid, 852 Invalid, 922 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [46 Valid, 876 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2024-11-10 17:25:21,229 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1686 states. [2024-11-10 17:25:21,237 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1686 to 1240. [2024-11-10 17:25:21,238 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1240 states, 807 states have (on average 1.7199504337050806) internal successors, (1388), 1233 states have internal predecessors, (1388), 10 states have call successors, (10), 3 states have call predecessors, (10), 2 states have return successors, (8), 4 states have call predecessors, (8), 8 states have call successors, (8) [2024-11-10 17:25:21,240 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1240 states to 1240 states and 1406 transitions. [2024-11-10 17:25:21,240 INFO L78 Accepts]: Start accepts. Automaton has 1240 states and 1406 transitions. Word has length 64 [2024-11-10 17:25:21,240 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 17:25:21,240 INFO L471 AbstractCegarLoop]: Abstraction has 1240 states and 1406 transitions. [2024-11-10 17:25:21,240 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 21.333333333333332) internal successors, (64), 4 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 17:25:21,240 INFO L276 IsEmpty]: Start isEmpty. Operand 1240 states and 1406 transitions. [2024-11-10 17:25:21,241 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2024-11-10 17:25:21,241 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 17:25:21,241 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 17:25:21,249 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (16)] Ended with exit code 0 [2024-11-10 17:25:21,441 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-10 17:25:21,442 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr527REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 629 more)] === [2024-11-10 17:25:21,442 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 17:25:21,442 INFO L85 PathProgramCache]: Analyzing trace with hash -225652527, now seen corresponding path program 1 times [2024-11-10 17:25:21,443 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-10 17:25:21,443 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [338850206] [2024-11-10 17:25:21,443 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 17:25:21,443 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-10 17:25:21,443 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-10 17:25:21,444 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-10 17:25:21,445 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (17)] Waiting until timeout for monitored process [2024-11-10 17:25:21,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 17:25:21,724 INFO L255 TraceCheckSpWp]: Trace formula consists of 309 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-11-10 17:25:21,726 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 17:25:21,733 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2024-11-10 17:25:21,748 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2024-11-10 17:25:21,769 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2024-11-10 17:25:21,779 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 17:25:21,779 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-10 17:25:21,779 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-10 17:25:21,779 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [338850206] [2024-11-10 17:25:21,779 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [338850206] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 17:25:21,779 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 17:25:21,780 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-10 17:25:21,780 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [475705657] [2024-11-10 17:25:21,780 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 17:25:21,780 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-10 17:25:21,780 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-10 17:25:21,781 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-10 17:25:21,781 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-10 17:25:21,781 INFO L87 Difference]: Start difference. First operand 1240 states and 1406 transitions. Second operand has 5 states, 4 states have (on average 17.25) internal successors, (69), 5 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 17:25:23,599 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 17:25:23,599 INFO L93 Difference]: Finished difference Result 1239 states and 1405 transitions. [2024-11-10 17:25:23,599 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-10 17:25:23,599 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 17.25) internal successors, (69), 5 states have internal predecessors, (69), 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 69 [2024-11-10 17:25:23,599 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 17:25:23,603 INFO L225 Difference]: With dead ends: 1239 [2024-11-10 17:25:23,603 INFO L226 Difference]: Without dead ends: 1239 [2024-11-10 17:25:23,603 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 65 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-10 17:25:23,604 INFO L432 NwaCegarLoop]: 1077 mSDtfsCounter, 2 mSDsluCounter, 1738 mSDsCounter, 0 mSdLazyCounter, 1500 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 2815 SdHoareTripleChecker+Invalid, 1501 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 1500 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2024-11-10 17:25:23,604 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 2815 Invalid, 1501 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 1500 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2024-11-10 17:25:23,605 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1239 states. [2024-11-10 17:25:23,611 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1239 to 1239. [2024-11-10 17:25:23,612 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1239 states, 807 states have (on average 1.7187112763320942) internal successors, (1387), 1232 states have internal predecessors, (1387), 10 states have call successors, (10), 3 states have call predecessors, (10), 2 states have return successors, (8), 4 states have call predecessors, (8), 8 states have call successors, (8) [2024-11-10 17:25:23,614 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1239 states to 1239 states and 1405 transitions. [2024-11-10 17:25:23,614 INFO L78 Accepts]: Start accepts. Automaton has 1239 states and 1405 transitions. Word has length 69 [2024-11-10 17:25:23,614 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 17:25:23,614 INFO L471 AbstractCegarLoop]: Abstraction has 1239 states and 1405 transitions. [2024-11-10 17:25:23,614 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 17.25) internal successors, (69), 5 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 17:25:23,615 INFO L276 IsEmpty]: Start isEmpty. Operand 1239 states and 1405 transitions. [2024-11-10 17:25:23,615 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2024-11-10 17:25:23,615 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 17:25:23,615 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 17:25:23,624 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (17)] Ended with exit code 0 [2024-11-10 17:25:23,816 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-10 17:25:23,816 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr528REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 629 more)] === [2024-11-10 17:25:23,816 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 17:25:23,816 INFO L85 PathProgramCache]: Analyzing trace with hash -225652526, now seen corresponding path program 1 times [2024-11-10 17:25:23,817 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-10 17:25:23,817 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1606196585] [2024-11-10 17:25:23,817 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 17:25:23,817 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-10 17:25:23,817 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-10 17:25:23,818 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-10 17:25:23,819 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (18)] Waiting until timeout for monitored process [2024-11-10 17:25:24,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 17:25:24,050 INFO L255 TraceCheckSpWp]: Trace formula consists of 309 conjuncts, 11 conjuncts are in the unsatisfiable core [2024-11-10 17:25:24,053 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 17:25:24,060 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-10 17:25:24,072 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2024-11-10 17:25:24,076 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2024-11-10 17:25:24,115 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 9 [2024-11-10 17:25:24,131 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 17:25:24,132 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-10 17:25:24,132 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-10 17:25:24,132 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1606196585] [2024-11-10 17:25:24,132 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1606196585] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 17:25:24,132 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 17:25:24,132 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-10 17:25:24,132 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [996309818] [2024-11-10 17:25:24,132 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 17:25:24,133 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-10 17:25:24,133 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-10 17:25:24,133 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-10 17:25:24,133 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-10 17:25:24,133 INFO L87 Difference]: Start difference. First operand 1239 states and 1405 transitions. Second operand has 5 states, 4 states have (on average 17.25) internal successors, (69), 5 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 17:25:26,248 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 17:25:26,248 INFO L93 Difference]: Finished difference Result 1238 states and 1404 transitions. [2024-11-10 17:25:26,249 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-10 17:25:26,249 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 17.25) internal successors, (69), 5 states have internal predecessors, (69), 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 69 [2024-11-10 17:25:26,250 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 17:25:26,253 INFO L225 Difference]: With dead ends: 1238 [2024-11-10 17:25:26,253 INFO L226 Difference]: Without dead ends: 1238 [2024-11-10 17:25:26,253 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 65 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-10 17:25:26,254 INFO L432 NwaCegarLoop]: 1077 mSDtfsCounter, 1 mSDsluCounter, 1808 mSDsCounter, 0 mSdLazyCounter, 1427 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 2885 SdHoareTripleChecker+Invalid, 1428 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 1427 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2024-11-10 17:25:26,254 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 2885 Invalid, 1428 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 1427 Invalid, 0 Unknown, 0 Unchecked, 2.1s Time] [2024-11-10 17:25:26,255 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1238 states. [2024-11-10 17:25:26,263 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1238 to 1238. [2024-11-10 17:25:26,264 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1238 states, 806 states have (on average 1.7196029776674937) internal successors, (1386), 1231 states have internal predecessors, (1386), 10 states have call successors, (10), 3 states have call predecessors, (10), 2 states have return successors, (8), 4 states have call predecessors, (8), 8 states have call successors, (8) [2024-11-10 17:25:26,266 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1238 states to 1238 states and 1404 transitions. [2024-11-10 17:25:26,266 INFO L78 Accepts]: Start accepts. Automaton has 1238 states and 1404 transitions. Word has length 69 [2024-11-10 17:25:26,266 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 17:25:26,266 INFO L471 AbstractCegarLoop]: Abstraction has 1238 states and 1404 transitions. [2024-11-10 17:25:26,266 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 17.25) internal successors, (69), 5 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 17:25:26,266 INFO L276 IsEmpty]: Start isEmpty. Operand 1238 states and 1404 transitions. [2024-11-10 17:25:26,267 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2024-11-10 17:25:26,267 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 17:25:26,267 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 17:25:26,276 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (18)] Forceful destruction successful, exit code 0 [2024-11-10 17:25:26,468 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-10 17:25:26,468 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr523REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 629 more)] === [2024-11-10 17:25:26,468 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 17:25:26,469 INFO L85 PathProgramCache]: Analyzing trace with hash 2037606574, now seen corresponding path program 1 times [2024-11-10 17:25:26,469 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-10 17:25:26,469 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1502275899] [2024-11-10 17:25:26,469 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 17:25:26,469 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-10 17:25:26,469 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-10 17:25:26,472 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-10 17:25:26,474 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (19)] Waiting until timeout for monitored process [2024-11-10 17:25:26,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 17:25:26,749 INFO L255 TraceCheckSpWp]: Trace formula consists of 335 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-10 17:25:26,752 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 17:25:26,772 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 17:25:26,772 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-10 17:25:26,772 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-10 17:25:26,772 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1502275899] [2024-11-10 17:25:26,773 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1502275899] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 17:25:26,773 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 17:25:26,773 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-10 17:25:26,773 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1634661352] [2024-11-10 17:25:26,773 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 17:25:26,774 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-10 17:25:26,774 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-10 17:25:26,774 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-10 17:25:26,775 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-10 17:25:26,775 INFO L87 Difference]: Start difference. First operand 1238 states and 1404 transitions. Second operand has 4 states, 4 states have (on average 18.75) internal successors, (75), 4 states have internal predecessors, (75), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-10 17:25:26,811 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 17:25:26,812 INFO L93 Difference]: Finished difference Result 1241 states and 1408 transitions. [2024-11-10 17:25:26,812 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-10 17:25:26,812 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 18.75) internal successors, (75), 4 states have internal predecessors, (75), 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 77 [2024-11-10 17:25:26,813 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 17:25:26,820 INFO L225 Difference]: With dead ends: 1241 [2024-11-10 17:25:26,824 INFO L226 Difference]: Without dead ends: 1241 [2024-11-10 17:25:26,824 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 74 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-10 17:25:26,825 INFO L432 NwaCegarLoop]: 1077 mSDtfsCounter, 0 mSDsluCounter, 2149 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 3226 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-10 17:25:26,825 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 3226 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 17:25:26,827 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1241 states. [2024-11-10 17:25:26,846 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1241 to 1241. [2024-11-10 17:25:26,848 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1241 states, 808 states have (on average 1.7190594059405941) internal successors, (1389), 1234 states have internal predecessors, (1389), 10 states have call successors, (10), 3 states have call predecessors, (10), 3 states have return successors, (9), 4 states have call predecessors, (9), 8 states have call successors, (9) [2024-11-10 17:25:26,851 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1241 states to 1241 states and 1408 transitions. [2024-11-10 17:25:26,851 INFO L78 Accepts]: Start accepts. Automaton has 1241 states and 1408 transitions. Word has length 77 [2024-11-10 17:25:26,852 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 17:25:26,852 INFO L471 AbstractCegarLoop]: Abstraction has 1241 states and 1408 transitions. [2024-11-10 17:25:26,852 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 18.75) internal successors, (75), 4 states have internal predecessors, (75), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-10 17:25:26,852 INFO L276 IsEmpty]: Start isEmpty. Operand 1241 states and 1408 transitions. [2024-11-10 17:25:26,853 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2024-11-10 17:25:26,853 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 17:25:26,853 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 17:25:26,862 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (19)] Ended with exit code 0 [2024-11-10 17:25:27,053 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-10 17:25:27,054 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr523REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 629 more)] === [2024-11-10 17:25:27,054 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 17:25:27,054 INFO L85 PathProgramCache]: Analyzing trace with hash 697016905, now seen corresponding path program 1 times [2024-11-10 17:25:27,054 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-10 17:25:27,055 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1711607452] [2024-11-10 17:25:27,055 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 17:25:27,055 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-10 17:25:27,055 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-10 17:25:27,056 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-10 17:25:27,057 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (20)] Waiting until timeout for monitored process [2024-11-10 17:25:27,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 17:25:27,328 INFO L255 TraceCheckSpWp]: Trace formula consists of 346 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-10 17:25:27,330 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 17:25:27,350 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 17:25:27,350 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-10 17:25:27,407 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 17:25:27,408 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-10 17:25:27,408 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1711607452] [2024-11-10 17:25:27,408 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1711607452] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-10 17:25:27,408 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-10 17:25:27,408 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 8 [2024-11-10 17:25:27,408 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1902241553] [2024-11-10 17:25:27,408 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-10 17:25:27,409 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-10 17:25:27,409 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-10 17:25:27,410 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-10 17:25:27,410 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2024-11-10 17:25:27,410 INFO L87 Difference]: Start difference. First operand 1241 states and 1408 transitions. Second operand has 8 states, 8 states have (on average 10.0) internal successors, (80), 8 states have internal predecessors, (80), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-10 17:25:27,526 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 17:25:27,526 INFO L93 Difference]: Finished difference Result 1253 states and 1425 transitions. [2024-11-10 17:25:27,527 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-10 17:25:27,527 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 10.0) internal successors, (80), 8 states have internal predecessors, (80), 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 78 [2024-11-10 17:25:27,527 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 17:25:27,530 INFO L225 Difference]: With dead ends: 1253 [2024-11-10 17:25:27,530 INFO L226 Difference]: Without dead ends: 1253 [2024-11-10 17:25:27,530 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 157 GetRequests, 148 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=44, Invalid=66, Unknown=0, NotChecked=0, Total=110 [2024-11-10 17:25:27,531 INFO L432 NwaCegarLoop]: 1077 mSDtfsCounter, 6 mSDsluCounter, 2151 mSDsCounter, 0 mSdLazyCounter, 50 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 3228 SdHoareTripleChecker+Invalid, 57 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 50 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-10 17:25:27,531 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 3228 Invalid, 57 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 50 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-10 17:25:27,533 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1253 states. [2024-11-10 17:25:27,542 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1253 to 1251. [2024-11-10 17:25:27,543 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1251 states, 817 states have (on average 1.718482252141983) internal successors, (1404), 1243 states have internal predecessors, (1404), 10 states have call successors, (10), 4 states have call predecessors, (10), 4 states have return successors, (9), 4 states have call predecessors, (9), 8 states have call successors, (9) [2024-11-10 17:25:27,546 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1251 states to 1251 states and 1423 transitions. [2024-11-10 17:25:27,546 INFO L78 Accepts]: Start accepts. Automaton has 1251 states and 1423 transitions. Word has length 78 [2024-11-10 17:25:27,546 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 17:25:27,546 INFO L471 AbstractCegarLoop]: Abstraction has 1251 states and 1423 transitions. [2024-11-10 17:25:27,546 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 10.0) internal successors, (80), 8 states have internal predecessors, (80), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-10 17:25:27,547 INFO L276 IsEmpty]: Start isEmpty. Operand 1251 states and 1423 transitions. [2024-11-10 17:25:27,547 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2024-11-10 17:25:27,547 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 17:25:27,547 INFO L215 NwaCegarLoop]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 17:25:27,556 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (20)] Ended with exit code 0 [2024-11-10 17:25:27,748 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 20 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-10 17:25:27,748 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr523REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 629 more)] === [2024-11-10 17:25:27,749 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 17:25:27,749 INFO L85 PathProgramCache]: Analyzing trace with hash -628983954, now seen corresponding path program 2 times [2024-11-10 17:25:27,749 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-10 17:25:27,749 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [423129376] [2024-11-10 17:25:27,749 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-10 17:25:27,749 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-10 17:25:27,749 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-10 17:25:27,750 INFO L229 MonitoredProcess]: Starting monitored process 21 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-10 17:25:27,751 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (21)] Waiting until timeout for monitored process [2024-11-10 17:25:28,238 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-10 17:25:28,238 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-10 17:25:28,256 INFO L255 TraceCheckSpWp]: Trace formula consists of 379 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-11-10 17:25:28,258 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 17:25:28,302 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 17:25:28,303 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-10 17:25:28,412 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 17:25:28,412 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-10 17:25:28,412 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [423129376] [2024-11-10 17:25:28,412 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [423129376] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-10 17:25:28,412 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-10 17:25:28,412 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 14 [2024-11-10 17:25:28,413 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1067640606] [2024-11-10 17:25:28,413 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-10 17:25:28,413 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-11-10 17:25:28,413 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-10 17:25:28,413 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-11-10 17:25:28,414 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=121, Unknown=0, NotChecked=0, Total=182 [2024-11-10 17:25:28,414 INFO L87 Difference]: Start difference. First operand 1251 states and 1423 transitions. Second operand has 14 states, 14 states have (on average 6.142857142857143) internal successors, (86), 14 states have internal predecessors, (86), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-10 17:25:28,729 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 17:25:28,729 INFO L93 Difference]: Finished difference Result 1266 states and 1445 transitions. [2024-11-10 17:25:28,729 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2024-11-10 17:25:28,729 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 6.142857142857143) internal successors, (86), 14 states have internal predecessors, (86), 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-11-10 17:25:28,730 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 17:25:28,735 INFO L225 Difference]: With dead ends: 1266 [2024-11-10 17:25:28,735 INFO L226 Difference]: Without dead ends: 1262 [2024-11-10 17:25:28,736 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 169 GetRequests, 148 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=182, Invalid=324, Unknown=0, NotChecked=0, Total=506 [2024-11-10 17:25:28,736 INFO L432 NwaCegarLoop]: 1077 mSDtfsCounter, 14 mSDsluCounter, 5373 mSDsCounter, 0 mSdLazyCounter, 173 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 6450 SdHoareTripleChecker+Invalid, 191 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 173 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-10 17:25:28,737 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 6450 Invalid, 191 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 173 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-10 17:25:28,738 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1262 states. [2024-11-10 17:25:28,751 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1262 to 1260. [2024-11-10 17:25:28,752 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1260 states, 826 states have (on average 1.7142857142857142) internal successors, (1416), 1252 states have internal predecessors, (1416), 10 states have call successors, (10), 4 states have call predecessors, (10), 4 states have return successors, (9), 4 states have call predecessors, (9), 8 states have call successors, (9) [2024-11-10 17:25:28,754 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1260 states to 1260 states and 1435 transitions. [2024-11-10 17:25:28,754 INFO L78 Accepts]: Start accepts. Automaton has 1260 states and 1435 transitions. Word has length 81 [2024-11-10 17:25:28,755 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 17:25:28,755 INFO L471 AbstractCegarLoop]: Abstraction has 1260 states and 1435 transitions. [2024-11-10 17:25:28,755 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 6.142857142857143) internal successors, (86), 14 states have internal predecessors, (86), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-10 17:25:28,755 INFO L276 IsEmpty]: Start isEmpty. Operand 1260 states and 1435 transitions. [2024-11-10 17:25:28,755 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2024-11-10 17:25:28,755 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 17:25:28,755 INFO L215 NwaCegarLoop]: trace histogram [10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 17:25:28,764 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (21)] Ended with exit code 0 [2024-11-10 17:25:28,956 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-10 17:25:28,956 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr523REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 629 more)] === [2024-11-10 17:25:28,957 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 17:25:28,957 INFO L85 PathProgramCache]: Analyzing trace with hash 867826062, now seen corresponding path program 3 times [2024-11-10 17:25:28,957 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-10 17:25:28,957 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [579873973] [2024-11-10 17:25:28,957 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-10 17:25:28,957 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-10 17:25:28,957 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-10 17:25:28,959 INFO L229 MonitoredProcess]: Starting monitored process 22 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-10 17:25:28,960 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (22)] Waiting until timeout for monitored process [2024-11-10 17:25:29,602 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2024-11-10 17:25:29,602 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-10 17:25:29,613 INFO L255 TraceCheckSpWp]: Trace formula consists of 445 conjuncts, 14 conjuncts are in the unsatisfiable core [2024-11-10 17:25:29,616 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 17:25:29,731 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 17:25:29,731 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-10 17:25:30,170 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 17:25:30,170 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-10 17:25:30,170 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [579873973] [2024-11-10 17:25:30,170 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [579873973] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-10 17:25:30,171 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-10 17:25:30,171 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 26 [2024-11-10 17:25:30,171 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1546233812] [2024-11-10 17:25:30,171 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-10 17:25:30,172 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2024-11-10 17:25:30,172 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-10 17:25:30,172 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2024-11-10 17:25:30,172 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=193, Invalid=457, Unknown=0, NotChecked=0, Total=650 [2024-11-10 17:25:30,173 INFO L87 Difference]: Start difference. First operand 1260 states and 1435 transitions. Second operand has 26 states, 26 states have (on average 3.769230769230769) internal successors, (98), 26 states have internal predecessors, (98), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-10 17:25:31,562 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 17:25:31,562 INFO L93 Difference]: Finished difference Result 1284 states and 1474 transitions. [2024-11-10 17:25:31,563 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2024-11-10 17:25:31,563 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 26 states have (on average 3.769230769230769) internal successors, (98), 26 states have internal predecessors, (98), 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 87 [2024-11-10 17:25:31,564 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 17:25:31,566 INFO L225 Difference]: With dead ends: 1284 [2024-11-10 17:25:31,566 INFO L226 Difference]: Without dead ends: 1278 [2024-11-10 17:25:31,567 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 193 GetRequests, 148 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 100 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=728, Invalid=1434, Unknown=0, NotChecked=0, Total=2162 [2024-11-10 17:25:31,568 INFO L432 NwaCegarLoop]: 1078 mSDtfsCounter, 19 mSDsluCounter, 13969 mSDsCounter, 0 mSdLazyCounter, 594 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 15047 SdHoareTripleChecker+Invalid, 609 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 594 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-10 17:25:31,568 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [19 Valid, 15047 Invalid, 609 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 594 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-10 17:25:31,570 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1278 states. [2024-11-10 17:25:31,580 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1278 to 1278. [2024-11-10 17:25:31,581 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1278 states, 844 states have (on average 1.7049763033175356) internal successors, (1439), 1270 states have internal predecessors, (1439), 10 states have call successors, (10), 4 states have call predecessors, (10), 4 states have return successors, (9), 4 states have call predecessors, (9), 8 states have call successors, (9) [2024-11-10 17:25:31,583 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1278 states to 1278 states and 1458 transitions. [2024-11-10 17:25:31,583 INFO L78 Accepts]: Start accepts. Automaton has 1278 states and 1458 transitions. Word has length 87 [2024-11-10 17:25:31,583 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 17:25:31,583 INFO L471 AbstractCegarLoop]: Abstraction has 1278 states and 1458 transitions. [2024-11-10 17:25:31,584 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 26 states have (on average 3.769230769230769) internal successors, (98), 26 states have internal predecessors, (98), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-10 17:25:31,584 INFO L276 IsEmpty]: Start isEmpty. Operand 1278 states and 1458 transitions. [2024-11-10 17:25:31,584 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2024-11-10 17:25:31,584 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 17:25:31,584 INFO L215 NwaCegarLoop]: trace histogram [22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 17:25:31,595 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (22)] Forceful destruction successful, exit code 0 [2024-11-10 17:25:31,785 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 22 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-10 17:25:31,785 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr523REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 629 more)] === [2024-11-10 17:25:31,786 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 17:25:31,786 INFO L85 PathProgramCache]: Analyzing trace with hash -1493912114, now seen corresponding path program 4 times [2024-11-10 17:25:31,786 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-10 17:25:31,786 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1494890704] [2024-11-10 17:25:31,786 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2024-11-10 17:25:31,786 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-10 17:25:31,787 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-10 17:25:31,788 INFO L229 MonitoredProcess]: Starting monitored process 23 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-10 17:25:31,789 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (23)] Waiting until timeout for monitored process [2024-11-10 17:25:32,239 INFO L227 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2024-11-10 17:25:32,239 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-10 17:25:32,254 INFO L255 TraceCheckSpWp]: Trace formula consists of 577 conjuncts, 25 conjuncts are in the unsatisfiable core [2024-11-10 17:25:32,267 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 17:25:32,681 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 0 proven. 253 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 17:25:32,681 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-10 17:25:33,894 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 0 proven. 253 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 17:25:33,895 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-10 17:25:33,895 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1494890704] [2024-11-10 17:25:33,895 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1494890704] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-10 17:25:33,895 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-10 17:25:33,895 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 26] total 50 [2024-11-10 17:25:33,895 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1050399033] [2024-11-10 17:25:33,896 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-10 17:25:33,896 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 50 states [2024-11-10 17:25:33,896 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-10 17:25:33,897 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2024-11-10 17:25:33,898 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=672, Invalid=1778, Unknown=0, NotChecked=0, Total=2450 [2024-11-10 17:25:33,898 INFO L87 Difference]: Start difference. First operand 1278 states and 1458 transitions. Second operand has 50 states, 50 states have (on average 2.44) internal successors, (122), 50 states have internal predecessors, (122), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-10 17:25:38,510 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 17:25:38,510 INFO L93 Difference]: Finished difference Result 1318 states and 1530 transitions. [2024-11-10 17:25:38,511 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 71 states. [2024-11-10 17:25:38,511 INFO L78 Accepts]: Start accepts. Automaton has has 50 states, 50 states have (on average 2.44) internal successors, (122), 50 states have internal predecessors, (122), 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 99 [2024-11-10 17:25:38,512 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 17:25:38,514 INFO L225 Difference]: With dead ends: 1318 [2024-11-10 17:25:38,514 INFO L226 Difference]: Without dead ends: 1314 [2024-11-10 17:25:38,516 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 239 GetRequests, 148 SyntacticMatches, 0 SemanticMatches, 91 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 465 ImplicationChecksByTransitivity, 4.1s TimeCoverageRelationStatistics Valid=2713, Invalid=5843, Unknown=0, NotChecked=0, Total=8556 [2024-11-10 17:25:38,516 INFO L432 NwaCegarLoop]: 1077 mSDtfsCounter, 31 mSDsluCounter, 25778 mSDsCounter, 0 mSdLazyCounter, 1968 mSolverCounterSat, 34 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 26855 SdHoareTripleChecker+Invalid, 2002 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 34 IncrementalHoareTripleChecker+Valid, 1968 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2024-11-10 17:25:38,517 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [31 Valid, 26855 Invalid, 2002 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [34 Valid, 1968 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2024-11-10 17:25:38,519 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1314 states. [2024-11-10 17:25:38,529 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1314 to 1312. [2024-11-10 17:25:38,530 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1312 states, 878 states have (on average 1.6913439635535308) internal successors, (1485), 1304 states have internal predecessors, (1485), 10 states have call successors, (10), 4 states have call predecessors, (10), 4 states have return successors, (9), 4 states have call predecessors, (9), 8 states have call successors, (9) [2024-11-10 17:25:38,532 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1312 states to 1312 states and 1504 transitions. [2024-11-10 17:25:38,532 INFO L78 Accepts]: Start accepts. Automaton has 1312 states and 1504 transitions. Word has length 99 [2024-11-10 17:25:38,532 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 17:25:38,533 INFO L471 AbstractCegarLoop]: Abstraction has 1312 states and 1504 transitions. [2024-11-10 17:25:38,533 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 50 states, 50 states have (on average 2.44) internal successors, (122), 50 states have internal predecessors, (122), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-10 17:25:38,533 INFO L276 IsEmpty]: Start isEmpty. Operand 1312 states and 1504 transitions. [2024-11-10 17:25:38,534 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2024-11-10 17:25:38,534 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 17:25:38,534 INFO L215 NwaCegarLoop]: trace histogram [44, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 17:25:38,547 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (23)] Forceful destruction successful, exit code 0 [2024-11-10 17:25:38,734 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 23 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-10 17:25:38,735 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr523REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 629 more)] === [2024-11-10 17:25:38,735 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 17:25:38,735 INFO L85 PathProgramCache]: Analyzing trace with hash 2130799342, now seen corresponding path program 5 times [2024-11-10 17:25:38,736 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-10 17:25:38,736 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [567057577] [2024-11-10 17:25:38,736 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2024-11-10 17:25:38,736 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-10 17:25:38,736 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-10 17:25:38,737 INFO L229 MonitoredProcess]: Starting monitored process 24 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-10 17:25:38,738 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (24)] Waiting until timeout for monitored process [2024-11-10 17:25:39,832 INFO L227 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 23 check-sat command(s) [2024-11-10 17:25:39,833 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-10 17:25:39,856 INFO L255 TraceCheckSpWp]: Trace formula consists of 819 conjuncts, 59 conjuncts are in the unsatisfiable core [2024-11-10 17:25:39,863 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 17:25:39,868 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2024-11-10 17:25:39,969 INFO L349 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2024-11-10 17:25:39,969 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 27 [2024-11-10 17:25:39,999 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2024-11-10 17:25:40,065 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 12 [2024-11-10 17:25:41,013 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-10 17:25:41,014 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 44 treesize of output 43 [2024-11-10 17:25:41,056 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 15 [2024-11-10 17:25:41,090 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 44 refuted. 0 times theorem prover too weak. 946 trivial. 0 not checked. [2024-11-10 17:25:41,091 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-10 17:25:41,426 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-10 17:25:41,426 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [567057577] [2024-11-10 17:25:41,426 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [567057577] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 17:25:41,426 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1099646605] [2024-11-10 17:25:41,427 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2024-11-10 17:25:41,427 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-11-10 17:25:41,427 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2024-11-10 17:25:41,433 INFO L229 MonitoredProcess]: Starting monitored process 25 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-11-10 17:25:41,434 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (25)] Waiting until timeout for monitored process