./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/valid-memsafety.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_JEN_test2-1.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 61a67961 Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_JEN_test2-1.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 1ccd4b93de7420a1f7847638daedeeee3b82eb082e434a23182d7e5e0aee2085 --- Real Ultimate output --- This is Ultimate 0.2.5-wip.fs.cvc5-61a6796-m [2024-10-14 19:07:45,742 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-14 19:07:45,807 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2024-10-14 19:07:45,812 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-14 19:07:45,815 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-14 19:07:45,848 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-14 19:07:45,849 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-14 19:07:45,849 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-14 19:07:45,850 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-14 19:07:45,851 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-14 19:07:45,852 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-14 19:07:45,852 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-14 19:07:45,852 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-14 19:07:45,852 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-14 19:07:45,853 INFO L153 SettingsManager]: * Use SBE=true [2024-10-14 19:07:45,853 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-14 19:07:45,855 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-14 19:07:45,855 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-14 19:07:45,855 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-14 19:07:45,855 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-14 19:07:45,856 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-10-14 19:07:45,856 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-10-14 19:07:45,859 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-10-14 19:07:45,859 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-14 19:07:45,859 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-10-14 19:07:45,859 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-14 19:07:45,860 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-10-14 19:07:45,860 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-14 19:07:45,860 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-14 19:07:45,860 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-14 19:07:45,860 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-14 19:07:45,860 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-14 19:07:45,861 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-14 19:07:45,861 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-14 19:07:45,861 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-14 19:07:45,861 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-14 19:07:45,861 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-14 19:07:45,861 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-14 19:07:45,861 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-14 19:07:45,861 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-14 19:07:45,862 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-14 19:07:45,862 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-14 19:07:45,862 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 -> 1ccd4b93de7420a1f7847638daedeeee3b82eb082e434a23182d7e5e0aee2085 [2024-10-14 19:07:46,061 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-14 19:07:46,079 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-14 19:07:46,082 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-14 19:07:46,084 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-14 19:07:46,084 INFO L274 PluginConnector]: CDTParser initialized [2024-10-14 19:07:46,085 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_JEN_test2-1.i [2024-10-14 19:07:47,331 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-14 19:07:47,575 INFO L384 CDTParser]: Found 1 translation units. [2024-10-14 19:07:47,575 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_JEN_test2-1.i [2024-10-14 19:07:47,591 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d5ce62145/9f4690c565ce492186cddf817335e626/FLAGee47f5c69 [2024-10-14 19:07:47,603 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d5ce62145/9f4690c565ce492186cddf817335e626 [2024-10-14 19:07:47,605 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-14 19:07:47,607 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-14 19:07:47,609 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-14 19:07:47,610 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-14 19:07:47,614 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-14 19:07:47,615 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.10 07:07:47" (1/1) ... [2024-10-14 19:07:47,616 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6276e48b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 07:07:47, skipping insertion in model container [2024-10-14 19:07:47,616 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.10 07:07:47" (1/1) ... [2024-10-14 19:07:47,668 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-14 19:07:48,128 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-14 19:07:48,142 ERROR L321 MainTranslator]: Unsupported Syntax: Found a cast between two array/pointer types of different sizes while using memory model HoenickeLindenmann_Original (while Not using bitvector translation) [2024-10-14 19:07:48,143 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver@14e919d2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 07:07:48, skipping insertion in model container [2024-10-14 19:07:48,143 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-14 19:07:48,144 INFO L186 ToolchainWalker]: Toolchain execution was canceled (user or tool) before executing de.uni_freiburg.informatik.ultimate.boogie.procedureinliner [2024-10-14 19:07:48,146 INFO L158 Benchmark]: Toolchain (without parser) took 538.60ms. Allocated memory is still 172.0MB. Free memory was 116.7MB in the beginning and 95.7MB in the end (delta: 21.0MB). Peak memory consumption was 21.0MB. Max. memory is 16.1GB. [2024-10-14 19:07:48,146 INFO L158 Benchmark]: CDTParser took 0.22ms. Allocated memory is still 172.0MB. Free memory is still 136.9MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-14 19:07:48,147 INFO L158 Benchmark]: CACSL2BoogieTranslator took 534.36ms. Allocated memory is still 172.0MB. Free memory was 116.3MB in the beginning and 95.8MB in the end (delta: 20.5MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. [2024-10-14 19:07:48,148 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.22ms. Allocated memory is still 172.0MB. Free memory is still 136.9MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 534.36ms. Allocated memory is still 172.0MB. Free memory was 116.3MB in the beginning and 95.8MB in the end (delta: 20.5MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - UnsupportedSyntaxResult [Line: 815]: Unsupported Syntax Found a cast between two array/pointer types of different sizes while using memory model HoenickeLindenmann_Original (while Not using bitvector translation) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_JEN_test2-1.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 1ccd4b93de7420a1f7847638daedeeee3b82eb082e434a23182d7e5e0aee2085 --- Real Ultimate output --- This is Ultimate 0.2.5-wip.fs.cvc5-61a6796-m [2024-10-14 19:07:49,885 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-14 19:07:49,946 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf [2024-10-14 19:07:49,951 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-14 19:07:49,951 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-14 19:07:49,976 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-14 19:07:49,977 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-14 19:07:49,978 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-14 19:07:49,979 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-14 19:07:49,981 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-14 19:07:49,981 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-14 19:07:49,982 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-14 19:07:49,982 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-14 19:07:49,982 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-14 19:07:49,982 INFO L153 SettingsManager]: * Use SBE=true [2024-10-14 19:07:49,983 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-14 19:07:49,983 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-14 19:07:49,983 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-14 19:07:49,983 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-14 19:07:49,984 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-14 19:07:49,984 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-10-14 19:07:49,985 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-10-14 19:07:49,985 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-10-14 19:07:49,985 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-14 19:07:49,985 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-10-14 19:07:49,985 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-10-14 19:07:49,985 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-14 19:07:49,986 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-10-14 19:07:49,986 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-10-14 19:07:49,986 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-14 19:07:49,986 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-14 19:07:49,986 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-14 19:07:49,986 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-14 19:07:49,986 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-14 19:07:49,987 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-14 19:07:49,987 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-14 19:07:49,987 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-14 19:07:49,987 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-14 19:07:49,987 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-10-14 19:07:49,987 INFO L153 SettingsManager]: * Command for external solver=cvc5 --incremental --print-success --lang smt [2024-10-14 19:07:49,988 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-14 19:07:49,989 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-14 19:07:49,990 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-14 19:07:49,990 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-14 19:07:49,990 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2024-10-14 19:07:49,990 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 -> 1ccd4b93de7420a1f7847638daedeeee3b82eb082e434a23182d7e5e0aee2085 [2024-10-14 19:07:50,260 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-14 19:07:50,286 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-14 19:07:50,288 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-14 19:07:50,289 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-14 19:07:50,290 INFO L274 PluginConnector]: CDTParser initialized [2024-10-14 19:07:50,291 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_JEN_test2-1.i [2024-10-14 19:07:51,587 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-14 19:07:51,874 INFO L384 CDTParser]: Found 1 translation units. [2024-10-14 19:07:51,875 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_JEN_test2-1.i [2024-10-14 19:07:51,895 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0b4da7c17/53396c7df74141e7a4fd14fa4850a169/FLAGa77a6c1d3 [2024-10-14 19:07:52,179 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0b4da7c17/53396c7df74141e7a4fd14fa4850a169 [2024-10-14 19:07:52,181 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-14 19:07:52,182 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-14 19:07:52,183 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-14 19:07:52,183 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-14 19:07:52,187 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-14 19:07:52,188 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.10 07:07:52" (1/1) ... [2024-10-14 19:07:52,190 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3861fafc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 07:07:52, skipping insertion in model container [2024-10-14 19:07:52,191 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.10 07:07:52" (1/1) ... [2024-10-14 19:07:52,230 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-14 19:07:52,704 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-14 19:07:52,726 INFO L197 MainTranslator]: Restarting translation with changed settings: SettingsChange [mNewPreferredMemoryModel=HoenickeLindenmann_1ByteResolution] [2024-10-14 19:07:52,738 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-14 19:07:52,791 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-14 19:07:52,799 INFO L200 MainTranslator]: Completed pre-run [2024-10-14 19:07:52,873 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-14 19:07:52,917 INFO L204 MainTranslator]: Completed translation [2024-10-14 19:07:52,918 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 07:07:52 WrapperNode [2024-10-14 19:07:52,918 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-14 19:07:52,919 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-14 19:07:52,919 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-14 19:07:52,920 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-14 19:07:52,925 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 07:07:52" (1/1) ... [2024-10-14 19:07:52,960 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 07:07:52" (1/1) ... [2024-10-14 19:07:53,000 INFO L138 Inliner]: procedures = 211, calls = 229, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 915 [2024-10-14 19:07:53,000 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-14 19:07:53,001 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-14 19:07:53,001 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-14 19:07:53,001 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-14 19:07:53,009 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 07:07:52" (1/1) ... [2024-10-14 19:07:53,010 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 07:07:52" (1/1) ... [2024-10-14 19:07:53,015 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 07:07:52" (1/1) ... [2024-10-14 19:07:53,068 INFO L175 MemorySlicer]: Split 208 memory accesses to 3 slices as follows [172, 2, 34]. 83 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [0, 2, 0]. The 46 writes are split as follows [42, 0, 4]. [2024-10-14 19:07:53,069 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 07:07:52" (1/1) ... [2024-10-14 19:07:53,069 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 07:07:52" (1/1) ... [2024-10-14 19:07:53,102 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 07:07:52" (1/1) ... [2024-10-14 19:07:53,108 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 07:07:52" (1/1) ... [2024-10-14 19:07:53,111 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 07:07:52" (1/1) ... [2024-10-14 19:07:53,115 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 07:07:52" (1/1) ... [2024-10-14 19:07:53,121 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-14 19:07:53,122 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-14 19:07:53,122 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-14 19:07:53,122 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-14 19:07:53,123 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 07:07:52" (1/1) ... [2024-10-14 19:07:53,127 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-14 19:07:53,139 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 19:07:53,152 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-10-14 19:07:53,154 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-10-14 19:07:53,188 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2024-10-14 19:07:53,189 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2024-10-14 19:07:53,189 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#0 [2024-10-14 19:07:53,189 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#1 [2024-10-14 19:07:53,189 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#2 [2024-10-14 19:07:53,189 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#0 [2024-10-14 19:07:53,189 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#1 [2024-10-14 19:07:53,189 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#2 [2024-10-14 19:07:53,190 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#0 [2024-10-14 19:07:53,190 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#1 [2024-10-14 19:07:53,190 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#2 [2024-10-14 19:07:53,190 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#0 [2024-10-14 19:07:53,190 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#1 [2024-10-14 19:07:53,190 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#2 [2024-10-14 19:07:53,190 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-10-14 19:07:53,190 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2024-10-14 19:07:53,190 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2024-10-14 19:07:53,191 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2024-10-14 19:07:53,191 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-10-14 19:07:53,191 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#0 [2024-10-14 19:07:53,191 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#1 [2024-10-14 19:07:53,191 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#2 [2024-10-14 19:07:53,191 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-10-14 19:07:53,191 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2024-10-14 19:07:53,191 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#2 [2024-10-14 19:07:53,193 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2024-10-14 19:07:53,193 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2024-10-14 19:07:53,193 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-10-14 19:07:53,194 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-14 19:07:53,194 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2024-10-14 19:07:53,194 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2024-10-14 19:07:53,194 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2024-10-14 19:07:53,194 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-14 19:07:53,194 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-14 19:07:53,361 INFO L238 CfgBuilder]: Building ICFG [2024-10-14 19:07:53,364 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-14 19:07:53,384 WARN L779 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2024-10-14 19:07:53,412 WARN L779 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2024-10-14 19:07:53,431 WARN L779 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2024-10-14 19:07:56,002 INFO L? ?]: Removed 878 outVars from TransFormulas that were not future-live. [2024-10-14 19:07:56,002 INFO L287 CfgBuilder]: Performing block encoding [2024-10-14 19:07:56,126 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-14 19:07:56,127 INFO L314 CfgBuilder]: Removed 54 assume(true) statements. [2024-10-14 19:07:56,127 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 07:07:56 BoogieIcfgContainer [2024-10-14 19:07:56,127 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-14 19:07:56,128 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-14 19:07:56,128 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-14 19:07:56,132 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-14 19:07:56,132 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.10 07:07:52" (1/3) ... [2024-10-14 19:07:56,132 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@72e54467 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.10 07:07:56, skipping insertion in model container [2024-10-14 19:07:56,132 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 07:07:52" (2/3) ... [2024-10-14 19:07:56,133 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@72e54467 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.10 07:07:56, skipping insertion in model container [2024-10-14 19:07:56,133 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 07:07:56" (3/3) ... [2024-10-14 19:07:56,134 INFO L112 eAbstractionObserver]: Analyzing ICFG uthash_JEN_test2-1.i [2024-10-14 19:07:56,148 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-14 19:07:56,149 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 424 error locations. [2024-10-14 19:07:56,221 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-14 19:07:56,228 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;@4953247e, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-14 19:07:56,228 INFO L334 AbstractCegarLoop]: Starting to check reachability of 424 error locations. [2024-10-14 19:07:56,234 INFO L276 IsEmpty]: Start isEmpty. Operand has 795 states, 360 states have (on average 2.477777777777778) internal successors, (892), 788 states have internal predecessors, (892), 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-10-14 19:07:56,240 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 3 [2024-10-14 19:07:56,240 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 19:07:56,241 INFO L215 NwaCegarLoop]: trace histogram [1, 1] [2024-10-14 19:07:56,241 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 421 more)] === [2024-10-14 19:07:56,246 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 19:07:56,247 INFO L85 PathProgramCache]: Analyzing trace with hash 47005, now seen corresponding path program 1 times [2024-10-14 19:07:56,257 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-14 19:07:56,258 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [852589821] [2024-10-14 19:07:56,258 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 19:07:56,259 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-14 19:07:56,259 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-14 19:07:56,262 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-10-14 19:07:56,264 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-10-14 19:07:56,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 19:07:56,394 INFO L255 TraceCheckSpWp]: Trace formula consists of 24 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-14 19:07:56,398 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 19:07:56,431 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2024-10-14 19:07:56,444 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 19:07:56,444 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-14 19:07:56,445 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-14 19:07:56,445 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [852589821] [2024-10-14 19:07:56,446 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [852589821] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 19:07:56,446 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 19:07:56,446 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-10-14 19:07:56,449 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1307201725] [2024-10-14 19:07:56,450 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 19:07:56,454 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-14 19:07:56,454 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-14 19:07:56,476 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-14 19:07:56,477 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 19:07:56,480 INFO L87 Difference]: Start difference. First operand has 795 states, 360 states have (on average 2.477777777777778) internal successors, (892), 788 states have internal predecessors, (892), 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.0) internal successors, (2), 2 states have internal predecessors, (2), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 19:07:57,669 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 19:07:57,669 INFO L93 Difference]: Finished difference Result 781 states and 838 transitions. [2024-10-14 19:07:57,671 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-14 19:07:57,673 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 2 [2024-10-14 19:07:57,674 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 19:07:57,692 INFO L225 Difference]: With dead ends: 781 [2024-10-14 19:07:57,692 INFO L226 Difference]: Without dead ends: 780 [2024-10-14 19:07:57,693 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 19:07:57,698 INFO L432 NwaCegarLoop]: 439 mSDtfsCounter, 714 mSDsluCounter, 41 mSDsCounter, 0 mSdLazyCounter, 458 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 722 SdHoareTripleChecker+Valid, 480 SdHoareTripleChecker+Invalid, 474 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 458 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2024-10-14 19:07:57,699 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [722 Valid, 480 Invalid, 474 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 458 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2024-10-14 19:07:57,714 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 780 states. [2024-10-14 19:07:57,766 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 780 to 780. [2024-10-14 19:07:57,768 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 780 states, 363 states have (on average 2.256198347107438) internal successors, (819), 773 states have internal predecessors, (819), 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-10-14 19:07:57,770 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 780 states to 780 states and 837 transitions. [2024-10-14 19:07:57,771 INFO L78 Accepts]: Start accepts. Automaton has 780 states and 837 transitions. Word has length 2 [2024-10-14 19:07:57,771 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 19:07:57,772 INFO L471 AbstractCegarLoop]: Abstraction has 780 states and 837 transitions. [2024-10-14 19:07:57,772 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 19:07:57,772 INFO L276 IsEmpty]: Start isEmpty. Operand 780 states and 837 transitions. [2024-10-14 19:07:57,772 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 3 [2024-10-14 19:07:57,772 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 19:07:57,772 INFO L215 NwaCegarLoop]: trace histogram [1, 1] [2024-10-14 19:07:57,775 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-10-14 19:07:57,975 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-10-14 19:07:57,975 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 421 more)] === [2024-10-14 19:07:57,976 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 19:07:57,976 INFO L85 PathProgramCache]: Analyzing trace with hash 47006, now seen corresponding path program 1 times [2024-10-14 19:07:57,976 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-14 19:07:57,976 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1893073906] [2024-10-14 19:07:57,976 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 19:07:57,977 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-14 19:07:57,977 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-14 19:07:57,978 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-10-14 19:07:57,979 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-10-14 19:07:58,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 19:07:58,057 INFO L255 TraceCheckSpWp]: Trace formula consists of 24 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-10-14 19:07:58,058 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 19:07:58,066 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-10-14 19:07:58,076 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 19:07:58,076 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-14 19:07:58,077 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-14 19:07:58,077 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1893073906] [2024-10-14 19:07:58,077 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1893073906] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 19:07:58,078 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 19:07:58,078 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-10-14 19:07:58,078 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1425260667] [2024-10-14 19:07:58,078 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 19:07:58,079 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-14 19:07:58,079 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-14 19:07:58,079 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-14 19:07:58,079 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 19:07:58,079 INFO L87 Difference]: Start difference. First operand 780 states and 837 transitions. Second operand has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 19:07:59,585 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 19:07:59,587 INFO L93 Difference]: Finished difference Result 984 states and 1073 transitions. [2024-10-14 19:07:59,587 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-14 19:07:59,587 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 2 [2024-10-14 19:07:59,588 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 19:07:59,590 INFO L225 Difference]: With dead ends: 984 [2024-10-14 19:07:59,591 INFO L226 Difference]: Without dead ends: 984 [2024-10-14 19:07:59,592 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 19:07:59,593 INFO L432 NwaCegarLoop]: 665 mSDtfsCounter, 225 mSDsluCounter, 401 mSDsCounter, 0 mSdLazyCounter, 586 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 230 SdHoareTripleChecker+Valid, 1066 SdHoareTripleChecker+Invalid, 592 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 586 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2024-10-14 19:07:59,593 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [230 Valid, 1066 Invalid, 592 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 586 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2024-10-14 19:07:59,596 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 984 states. [2024-10-14 19:07:59,609 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 984 to 896. [2024-10-14 19:07:59,610 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 896 states, 475 states have (on average 2.1957894736842105) internal successors, (1043), 889 states have internal predecessors, (1043), 15 states have call successors, (15), 3 states have call predecessors, (15), 2 states have return successors, (13), 5 states have call predecessors, (13), 13 states have call successors, (13) [2024-10-14 19:07:59,612 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 896 states to 896 states and 1071 transitions. [2024-10-14 19:07:59,612 INFO L78 Accepts]: Start accepts. Automaton has 896 states and 1071 transitions. Word has length 2 [2024-10-14 19:07:59,612 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 19:07:59,613 INFO L471 AbstractCegarLoop]: Abstraction has 896 states and 1071 transitions. [2024-10-14 19:07:59,613 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 19:07:59,613 INFO L276 IsEmpty]: Start isEmpty. Operand 896 states and 1071 transitions. [2024-10-14 19:07:59,613 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2024-10-14 19:07:59,613 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 19:07:59,613 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2024-10-14 19:07:59,616 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-10-14 19:07:59,815 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-10-14 19:07:59,816 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 421 more)] === [2024-10-14 19:07:59,816 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 19:07:59,817 INFO L85 PathProgramCache]: Analyzing trace with hash 460900519, now seen corresponding path program 1 times [2024-10-14 19:07:59,817 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-14 19:07:59,817 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1531596123] [2024-10-14 19:07:59,817 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 19:07:59,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-10-14 19:07:59,817 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-14 19:07:59,820 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-10-14 19:07:59,821 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-10-14 19:07:59,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 19:07:59,930 INFO L255 TraceCheckSpWp]: Trace formula consists of 61 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-10-14 19:07:59,932 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 19:07:59,942 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2024-10-14 19:07:59,948 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-10-14 19:08:00,020 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-14 19:08:00,022 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 9 [2024-10-14 19:08:00,038 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2024-10-14 19:08:00,038 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 13 [2024-10-14 19:08:00,058 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 19:08:00,059 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-14 19:08:00,059 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-14 19:08:00,059 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1531596123] [2024-10-14 19:08:00,059 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1531596123] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 19:08:00,059 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 19:08:00,059 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-14 19:08:00,059 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1278455278] [2024-10-14 19:08:00,060 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 19:08:00,060 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-14 19:08:00,060 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-14 19:08:00,060 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-14 19:08:00,060 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-14 19:08:00,061 INFO L87 Difference]: Start difference. First operand 896 states and 1071 transitions. Second operand has 4 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 19:08:01,490 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 19:08:01,490 INFO L93 Difference]: Finished difference Result 885 states and 1059 transitions. [2024-10-14 19:08:01,490 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-14 19:08:01,491 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2024-10-14 19:08:01,491 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 19:08:01,493 INFO L225 Difference]: With dead ends: 885 [2024-10-14 19:08:01,493 INFO L226 Difference]: Without dead ends: 885 [2024-10-14 19:08:01,493 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-14 19:08:01,494 INFO L432 NwaCegarLoop]: 229 mSDtfsCounter, 786 mSDsluCounter, 30 mSDsCounter, 0 mSdLazyCounter, 675 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 794 SdHoareTripleChecker+Valid, 259 SdHoareTripleChecker+Invalid, 691 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 675 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2024-10-14 19:08:01,494 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [794 Valid, 259 Invalid, 691 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 675 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2024-10-14 19:08:01,496 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 885 states. [2024-10-14 19:08:01,505 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 885 to 768. [2024-10-14 19:08:01,506 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 768 states, 363 states have (on average 2.2203856749311295) internal successors, (806), 761 states have internal predecessors, (806), 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-10-14 19:08:01,508 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 768 states to 768 states and 824 transitions. [2024-10-14 19:08:01,508 INFO L78 Accepts]: Start accepts. Automaton has 768 states and 824 transitions. Word has length 6 [2024-10-14 19:08:01,508 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 19:08:01,508 INFO L471 AbstractCegarLoop]: Abstraction has 768 states and 824 transitions. [2024-10-14 19:08:01,508 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 19:08:01,508 INFO L276 IsEmpty]: Start isEmpty. Operand 768 states and 824 transitions. [2024-10-14 19:08:01,509 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2024-10-14 19:08:01,509 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 19:08:01,509 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2024-10-14 19:08:01,513 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-10-14 19:08:01,709 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-10-14 19:08:01,710 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 421 more)] === [2024-10-14 19:08:01,710 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 19:08:01,710 INFO L85 PathProgramCache]: Analyzing trace with hash 1403014203, now seen corresponding path program 1 times [2024-10-14 19:08:01,710 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-14 19:08:01,711 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [703772803] [2024-10-14 19:08:01,711 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 19:08:01,711 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-14 19:08:01,711 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-14 19:08:01,715 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-10-14 19:08:01,716 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-10-14 19:08:01,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 19:08:01,795 INFO L255 TraceCheckSpWp]: Trace formula consists of 66 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-10-14 19:08:01,797 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 19:08:01,804 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-10-14 19:08:01,820 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 19:08:01,821 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-14 19:08:01,821 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-14 19:08:01,821 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [703772803] [2024-10-14 19:08:01,821 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [703772803] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 19:08:01,821 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 19:08:01,821 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-14 19:08:01,821 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1337221200] [2024-10-14 19:08:01,821 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 19:08:01,821 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-14 19:08:01,821 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-14 19:08:01,822 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-14 19:08:01,822 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 19:08:01,822 INFO L87 Difference]: Start difference. First operand 768 states and 824 transitions. Second operand has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 19:08:03,466 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 19:08:03,467 INFO L93 Difference]: Finished difference Result 1038 states and 1132 transitions. [2024-10-14 19:08:03,467 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-14 19:08:03,467 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2024-10-14 19:08:03,468 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 19:08:03,471 INFO L225 Difference]: With dead ends: 1038 [2024-10-14 19:08:03,471 INFO L226 Difference]: Without dead ends: 1038 [2024-10-14 19:08:03,471 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 19:08:03,472 INFO L432 NwaCegarLoop]: 756 mSDtfsCounter, 462 mSDsluCounter, 278 mSDsCounter, 0 mSdLazyCounter, 655 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 467 SdHoareTripleChecker+Valid, 1034 SdHoareTripleChecker+Invalid, 668 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 655 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2024-10-14 19:08:03,472 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [467 Valid, 1034 Invalid, 668 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 655 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2024-10-14 19:08:03,473 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1038 states. [2024-10-14 19:08:03,483 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1038 to 785. [2024-10-14 19:08:03,484 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 785 states, 390 states have (on average 2.2153846153846155) internal successors, (864), 778 states have internal predecessors, (864), 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-10-14 19:08:03,486 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 785 states to 785 states and 882 transitions. [2024-10-14 19:08:03,486 INFO L78 Accepts]: Start accepts. Automaton has 785 states and 882 transitions. Word has length 7 [2024-10-14 19:08:03,486 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 19:08:03,486 INFO L471 AbstractCegarLoop]: Abstraction has 785 states and 882 transitions. [2024-10-14 19:08:03,487 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 19:08:03,487 INFO L276 IsEmpty]: Start isEmpty. Operand 785 states and 882 transitions. [2024-10-14 19:08:03,487 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2024-10-14 19:08:03,487 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 19:08:03,487 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2024-10-14 19:08:03,494 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Ended with exit code 0 [2024-10-14 19:08:03,690 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-10-14 19:08:03,690 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 421 more)] === [2024-10-14 19:08:03,691 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 19:08:03,691 INFO L85 PathProgramCache]: Analyzing trace with hash 1403014202, now seen corresponding path program 1 times [2024-10-14 19:08:03,691 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-14 19:08:03,691 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [609111699] [2024-10-14 19:08:03,691 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 19:08:03,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-10-14 19:08:03,691 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-14 19:08:03,694 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-10-14 19:08:03,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 (6)] Waiting until timeout for monitored process [2024-10-14 19:08:03,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 19:08:03,783 INFO L255 TraceCheckSpWp]: Trace formula consists of 66 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-14 19:08:03,785 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 19:08:03,796 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2024-10-14 19:08:03,806 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 19:08:03,806 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-14 19:08:03,806 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-14 19:08:03,806 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [609111699] [2024-10-14 19:08:03,806 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [609111699] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 19:08:03,806 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 19:08:03,806 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-14 19:08:03,806 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [892058328] [2024-10-14 19:08:03,807 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 19:08:03,807 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-14 19:08:03,807 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-14 19:08:03,807 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-14 19:08:03,807 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 19:08:03,807 INFO L87 Difference]: Start difference. First operand 785 states and 882 transitions. Second operand has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 19:08:04,936 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 19:08:04,936 INFO L93 Difference]: Finished difference Result 943 states and 1068 transitions. [2024-10-14 19:08:04,937 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-14 19:08:04,937 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2024-10-14 19:08:04,937 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 19:08:04,940 INFO L225 Difference]: With dead ends: 943 [2024-10-14 19:08:04,940 INFO L226 Difference]: Without dead ends: 943 [2024-10-14 19:08:04,940 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 19:08:04,941 INFO L432 NwaCegarLoop]: 574 mSDtfsCounter, 681 mSDsluCounter, 150 mSDsCounter, 0 mSdLazyCounter, 570 mSolverCounterSat, 50 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 689 SdHoareTripleChecker+Valid, 724 SdHoareTripleChecker+Invalid, 620 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 50 IncrementalHoareTripleChecker+Valid, 570 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2024-10-14 19:08:04,941 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [689 Valid, 724 Invalid, 620 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [50 Valid, 570 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2024-10-14 19:08:04,942 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 943 states. [2024-10-14 19:08:04,950 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 943 to 738. [2024-10-14 19:08:04,951 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 738 states, 390 states have (on average 2.0846153846153848) internal successors, (813), 731 states have internal predecessors, (813), 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-10-14 19:08:04,953 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 738 states to 738 states and 831 transitions. [2024-10-14 19:08:04,953 INFO L78 Accepts]: Start accepts. Automaton has 738 states and 831 transitions. Word has length 7 [2024-10-14 19:08:04,953 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 19:08:04,953 INFO L471 AbstractCegarLoop]: Abstraction has 738 states and 831 transitions. [2024-10-14 19:08:04,954 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 19:08:04,954 INFO L276 IsEmpty]: Start isEmpty. Operand 738 states and 831 transitions. [2024-10-14 19:08:04,954 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2024-10-14 19:08:04,954 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 19:08:04,954 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 19:08:04,961 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-10-14 19:08:05,155 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-10-14 19:08:05,155 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr422ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 421 more)] === [2024-10-14 19:08:05,155 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 19:08:05,155 INFO L85 PathProgramCache]: Analyzing trace with hash 469131321, now seen corresponding path program 1 times [2024-10-14 19:08:05,155 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-14 19:08:05,156 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1582476289] [2024-10-14 19:08:05,156 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 19:08:05,156 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-14 19:08:05,156 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-14 19:08:05,157 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-10-14 19:08:05,158 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-10-14 19:08:05,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 19:08:05,280 INFO L255 TraceCheckSpWp]: Trace formula consists of 83 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-10-14 19:08:05,287 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 19:08:05,295 INFO L173 IndexEqualityManager]: detected equality via solver [2024-10-14 19:08:05,295 INFO L173 IndexEqualityManager]: detected equality via solver [2024-10-14 19:08:05,296 INFO L173 IndexEqualityManager]: detected equality via solver [2024-10-14 19:08:05,300 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-10-14 19:08:05,357 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-14 19:08:05,358 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-10-14 19:08:05,374 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 19:08:05,374 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-14 19:08:05,375 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-14 19:08:05,375 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1582476289] [2024-10-14 19:08:05,375 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1582476289] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 19:08:05,375 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 19:08:05,375 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-14 19:08:05,375 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [300966095] [2024-10-14 19:08:05,376 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 19:08:05,376 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-14 19:08:05,376 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-14 19:08:05,376 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-14 19:08:05,376 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-14 19:08:05,377 INFO L87 Difference]: Start difference. First operand 738 states and 831 transitions. Second operand has 4 states, 4 states have (on average 2.25) internal successors, (9), 4 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-10-14 19:08:06,575 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 19:08:06,575 INFO L93 Difference]: Finished difference Result 1459 states and 1647 transitions. [2024-10-14 19:08:06,575 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-14 19:08:06,576 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.25) internal successors, (9), 4 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-10-14 19:08:06,576 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 19:08:06,579 INFO L225 Difference]: With dead ends: 1459 [2024-10-14 19:08:06,580 INFO L226 Difference]: Without dead ends: 1459 [2024-10-14 19:08:06,580 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 6 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-10-14 19:08:06,582 INFO L432 NwaCegarLoop]: 653 mSDtfsCounter, 723 mSDsluCounter, 1294 mSDsCounter, 0 mSdLazyCounter, 330 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 731 SdHoareTripleChecker+Valid, 1947 SdHoareTripleChecker+Invalid, 331 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 330 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2024-10-14 19:08:06,583 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [731 Valid, 1947 Invalid, 331 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 330 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2024-10-14 19:08:06,584 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1459 states. [2024-10-14 19:08:06,598 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1459 to 740. [2024-10-14 19:08:06,599 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 740 states, 392 states have (on average 2.079081632653061) internal successors, (815), 733 states have internal predecessors, (815), 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-10-14 19:08:06,600 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 740 states to 740 states and 833 transitions. [2024-10-14 19:08:06,601 INFO L78 Accepts]: Start accepts. Automaton has 740 states and 833 transitions. Word has length 9 [2024-10-14 19:08:06,601 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 19:08:06,602 INFO L471 AbstractCegarLoop]: Abstraction has 740 states and 833 transitions. [2024-10-14 19:08:06,602 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.25) internal successors, (9), 4 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-10-14 19:08:06,603 INFO L276 IsEmpty]: Start isEmpty. Operand 740 states and 833 transitions. [2024-10-14 19:08:06,603 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2024-10-14 19:08:06,603 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 19:08:06,603 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 19:08:06,611 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Ended with exit code 0 [2024-10-14 19:08:06,807 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-10-14 19:08:06,807 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 421 more)] === [2024-10-14 19:08:06,808 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 19:08:06,808 INFO L85 PathProgramCache]: Analyzing trace with hash 1384503377, now seen corresponding path program 1 times [2024-10-14 19:08:06,808 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-14 19:08:06,808 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [478769773] [2024-10-14 19:08:06,808 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 19:08:06,808 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-14 19:08:06,808 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-14 19:08:06,809 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-10-14 19:08:06,810 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-10-14 19:08:06,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 19:08:06,922 INFO L255 TraceCheckSpWp]: Trace formula consists of 129 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-14 19:08:06,923 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 19:08:06,932 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 19:08:06,932 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-14 19:08:06,933 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-14 19:08:06,934 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [478769773] [2024-10-14 19:08:06,934 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [478769773] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 19:08:06,934 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 19:08:06,934 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-14 19:08:06,935 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [22251200] [2024-10-14 19:08:06,935 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 19:08:06,935 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-14 19:08:06,935 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-14 19:08:06,935 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-14 19:08:06,935 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 19:08:06,936 INFO L87 Difference]: Start difference. First operand 740 states and 833 transitions. Second operand has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 19:08:07,400 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 19:08:07,400 INFO L93 Difference]: Finished difference Result 701 states and 793 transitions. [2024-10-14 19:08:07,401 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-14 19:08:07,401 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 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 15 [2024-10-14 19:08:07,402 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 19:08:07,403 INFO L225 Difference]: With dead ends: 701 [2024-10-14 19:08:07,403 INFO L226 Difference]: Without dead ends: 701 [2024-10-14 19:08:07,404 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 19:08:07,404 INFO L432 NwaCegarLoop]: 624 mSDtfsCounter, 61 mSDsluCounter, 582 mSDsCounter, 0 mSdLazyCounter, 170 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 61 SdHoareTripleChecker+Valid, 1206 SdHoareTripleChecker+Invalid, 170 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 170 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-10-14 19:08:07,404 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [61 Valid, 1206 Invalid, 170 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 170 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-10-14 19:08:07,405 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 701 states. [2024-10-14 19:08:07,411 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 701 to 701. [2024-10-14 19:08:07,411 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 701 states, 377 states have (on average 2.055702917771883) internal successors, (775), 694 states have internal predecessors, (775), 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-10-14 19:08:07,413 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 701 states to 701 states and 793 transitions. [2024-10-14 19:08:07,413 INFO L78 Accepts]: Start accepts. Automaton has 701 states and 793 transitions. Word has length 15 [2024-10-14 19:08:07,413 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 19:08:07,413 INFO L471 AbstractCegarLoop]: Abstraction has 701 states and 793 transitions. [2024-10-14 19:08:07,413 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 19:08:07,413 INFO L276 IsEmpty]: Start isEmpty. Operand 701 states and 793 transitions. [2024-10-14 19:08:07,414 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2024-10-14 19:08:07,414 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 19:08:07,414 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 19:08:07,420 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-10-14 19:08:07,614 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-10-14 19:08:07,615 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr38REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 421 more)] === [2024-10-14 19:08:07,615 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 19:08:07,616 INFO L85 PathProgramCache]: Analyzing trace with hash -932119221, now seen corresponding path program 1 times [2024-10-14 19:08:07,616 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-14 19:08:07,616 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1862102404] [2024-10-14 19:08:07,616 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 19:08:07,616 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-14 19:08:07,616 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-14 19:08:07,619 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-10-14 19:08:07,620 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-10-14 19:08:07,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 19:08:07,727 INFO L255 TraceCheckSpWp]: Trace formula consists of 132 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-14 19:08:07,728 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 19:08:07,745 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 19:08:07,745 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-14 19:08:07,745 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-14 19:08:07,745 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1862102404] [2024-10-14 19:08:07,746 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1862102404] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 19:08:07,746 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 19:08:07,746 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-14 19:08:07,746 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1949057744] [2024-10-14 19:08:07,746 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 19:08:07,746 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-14 19:08:07,746 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-14 19:08:07,747 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-14 19:08:07,747 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-14 19:08:07,747 INFO L87 Difference]: Start difference. First operand 701 states and 793 transitions. Second operand has 4 states, 4 states have (on average 4.25) internal successors, (17), 4 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 19:08:08,289 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 19:08:08,289 INFO L93 Difference]: Finished difference Result 686 states and 771 transitions. [2024-10-14 19:08:08,293 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-14 19:08:08,294 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.25) internal successors, (17), 4 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2024-10-14 19:08:08,294 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 19:08:08,295 INFO L225 Difference]: With dead ends: 686 [2024-10-14 19:08:08,295 INFO L226 Difference]: Without dead ends: 686 [2024-10-14 19:08:08,296 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-14 19:08:08,296 INFO L432 NwaCegarLoop]: 593 mSDtfsCounter, 45 mSDsluCounter, 1168 mSDsCounter, 0 mSdLazyCounter, 261 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 45 SdHoareTripleChecker+Valid, 1761 SdHoareTripleChecker+Invalid, 282 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 261 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-10-14 19:08:08,296 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [45 Valid, 1761 Invalid, 282 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 261 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-10-14 19:08:08,298 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 686 states. [2024-10-14 19:08:08,304 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 686 to 686. [2024-10-14 19:08:08,305 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 686 states, 376 states have (on average 2.002659574468085) internal successors, (753), 679 states have internal predecessors, (753), 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-10-14 19:08:08,307 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 686 states to 686 states and 771 transitions. [2024-10-14 19:08:08,307 INFO L78 Accepts]: Start accepts. Automaton has 686 states and 771 transitions. Word has length 17 [2024-10-14 19:08:08,307 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 19:08:08,307 INFO L471 AbstractCegarLoop]: Abstraction has 686 states and 771 transitions. [2024-10-14 19:08:08,308 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.25) internal successors, (17), 4 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 19:08:08,308 INFO L276 IsEmpty]: Start isEmpty. Operand 686 states and 771 transitions. [2024-10-14 19:08:08,309 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2024-10-14 19:08:08,309 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 19:08:08,309 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] [2024-10-14 19:08:08,314 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Ended with exit code 0 [2024-10-14 19:08:08,509 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-10-14 19:08:08,510 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr52REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 421 more)] === [2024-10-14 19:08:08,510 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 19:08:08,511 INFO L85 PathProgramCache]: Analyzing trace with hash 1310162457, now seen corresponding path program 1 times [2024-10-14 19:08:08,511 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-14 19:08:08,511 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1668109193] [2024-10-14 19:08:08,511 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 19:08:08,511 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-14 19:08:08,512 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-14 19:08:08,513 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-10-14 19:08:08,514 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-10-14 19:08:08,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 19:08:08,675 INFO L255 TraceCheckSpWp]: Trace formula consists of 146 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-10-14 19:08:08,677 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 19:08:08,682 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2024-10-14 19:08:08,747 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 19:08:08,748 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-14 19:08:08,748 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-14 19:08:08,748 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1668109193] [2024-10-14 19:08:08,748 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1668109193] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 19:08:08,748 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 19:08:08,748 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-14 19:08:08,748 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [363102185] [2024-10-14 19:08:08,748 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 19:08:08,749 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-14 19:08:08,749 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-14 19:08:08,749 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-14 19:08:08,749 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-14 19:08:08,749 INFO L87 Difference]: Start difference. First operand 686 states and 771 transitions. Second operand has 4 states, 3 states have (on average 10.333333333333334) internal successors, (31), 4 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 19:08:09,791 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 19:08:09,791 INFO L93 Difference]: Finished difference Result 686 states and 771 transitions. [2024-10-14 19:08:09,791 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-14 19:08:09,791 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 10.333333333333334) internal successors, (31), 4 states have internal predecessors, (31), 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 31 [2024-10-14 19:08:09,792 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 19:08:09,793 INFO L225 Difference]: With dead ends: 686 [2024-10-14 19:08:09,793 INFO L226 Difference]: Without dead ends: 686 [2024-10-14 19:08:09,794 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-14 19:08:09,794 INFO L432 NwaCegarLoop]: 328 mSDtfsCounter, 623 mSDsluCounter, 285 mSDsCounter, 0 mSdLazyCounter, 798 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 631 SdHoareTripleChecker+Valid, 613 SdHoareTripleChecker+Invalid, 805 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 798 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2024-10-14 19:08:09,794 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [631 Valid, 613 Invalid, 805 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 798 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2024-10-14 19:08:09,795 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 686 states. [2024-10-14 19:08:09,801 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 686 to 682. [2024-10-14 19:08:09,804 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 682 states, 376 states have (on average 1.9920212765957446) internal successors, (749), 675 states have internal predecessors, (749), 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-10-14 19:08:09,805 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 682 states to 682 states and 767 transitions. [2024-10-14 19:08:09,805 INFO L78 Accepts]: Start accepts. Automaton has 682 states and 767 transitions. Word has length 31 [2024-10-14 19:08:09,805 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 19:08:09,805 INFO L471 AbstractCegarLoop]: Abstraction has 682 states and 767 transitions. [2024-10-14 19:08:09,805 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 10.333333333333334) internal successors, (31), 4 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 19:08:09,806 INFO L276 IsEmpty]: Start isEmpty. Operand 682 states and 767 transitions. [2024-10-14 19:08:09,806 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2024-10-14 19:08:09,806 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 19:08:09,806 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] [2024-10-14 19:08:09,814 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Ended with exit code 0 [2024-10-14 19:08:10,006 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-10-14 19:08:10,007 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr53REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 421 more)] === [2024-10-14 19:08:10,007 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 19:08:10,007 INFO L85 PathProgramCache]: Analyzing trace with hash 1310162458, now seen corresponding path program 1 times [2024-10-14 19:08:10,007 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-14 19:08:10,007 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [356903349] [2024-10-14 19:08:10,007 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 19:08:10,008 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-14 19:08:10,008 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-14 19:08:10,010 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-10-14 19:08:10,011 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-10-14 19:08:10,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 19:08:10,125 INFO L255 TraceCheckSpWp]: Trace formula consists of 146 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-10-14 19:08:10,127 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 19:08:10,135 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-10-14 19:08:10,265 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 19:08:10,266 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-14 19:08:10,266 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-14 19:08:10,266 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [356903349] [2024-10-14 19:08:10,266 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [356903349] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 19:08:10,266 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 19:08:10,266 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-14 19:08:10,266 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [409848003] [2024-10-14 19:08:10,266 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 19:08:10,266 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-14 19:08:10,267 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-14 19:08:10,267 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-14 19:08:10,267 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-14 19:08:10,267 INFO L87 Difference]: Start difference. First operand 682 states and 767 transitions. Second operand has 4 states, 3 states have (on average 10.333333333333334) internal successors, (31), 4 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 19:08:11,767 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 19:08:11,767 INFO L93 Difference]: Finished difference Result 935 states and 1017 transitions. [2024-10-14 19:08:11,767 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-14 19:08:11,767 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 10.333333333333334) internal successors, (31), 4 states have internal predecessors, (31), 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 31 [2024-10-14 19:08:11,767 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 19:08:11,769 INFO L225 Difference]: With dead ends: 935 [2024-10-14 19:08:11,769 INFO L226 Difference]: Without dead ends: 935 [2024-10-14 19:08:11,770 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-14 19:08:11,770 INFO L432 NwaCegarLoop]: 478 mSDtfsCounter, 400 mSDsluCounter, 561 mSDsCounter, 0 mSdLazyCounter, 895 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 405 SdHoareTripleChecker+Valid, 1039 SdHoareTripleChecker+Invalid, 898 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 895 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2024-10-14 19:08:11,770 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [405 Valid, 1039 Invalid, 898 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 895 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2024-10-14 19:08:11,771 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 935 states. [2024-10-14 19:08:11,776 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 935 to 678. [2024-10-14 19:08:11,777 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 678 states, 376 states have (on average 1.9813829787234043) internal successors, (745), 671 states have internal predecessors, (745), 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-10-14 19:08:11,779 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 678 states to 678 states and 763 transitions. [2024-10-14 19:08:11,779 INFO L78 Accepts]: Start accepts. Automaton has 678 states and 763 transitions. Word has length 31 [2024-10-14 19:08:11,779 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 19:08:11,779 INFO L471 AbstractCegarLoop]: Abstraction has 678 states and 763 transitions. [2024-10-14 19:08:11,779 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 10.333333333333334) internal successors, (31), 4 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 19:08:11,779 INFO L276 IsEmpty]: Start isEmpty. Operand 678 states and 763 transitions. [2024-10-14 19:08:11,782 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2024-10-14 19:08:11,782 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 19:08:11,782 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] [2024-10-14 19:08:11,788 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Ended with exit code 0 [2024-10-14 19:08:11,986 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-10-14 19:08:11,986 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr117REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 421 more)] === [2024-10-14 19:08:11,986 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 19:08:11,986 INFO L85 PathProgramCache]: Analyzing trace with hash 1916251283, now seen corresponding path program 1 times [2024-10-14 19:08:11,987 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-14 19:08:11,987 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1227053402] [2024-10-14 19:08:11,987 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 19:08:11,987 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-14 19:08:11,987 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-14 19:08:11,988 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-10-14 19:08:11,989 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-10-14 19:08:12,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 19:08:12,135 INFO L255 TraceCheckSpWp]: Trace formula consists of 218 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-14 19:08:12,137 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 19:08:12,169 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 19:08:12,169 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-14 19:08:12,169 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-14 19:08:12,169 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1227053402] [2024-10-14 19:08:12,169 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1227053402] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 19:08:12,169 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 19:08:12,169 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-14 19:08:12,169 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1223120331] [2024-10-14 19:08:12,169 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 19:08:12,170 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-14 19:08:12,170 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-14 19:08:12,170 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-14 19:08:12,170 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-14 19:08:12,170 INFO L87 Difference]: Start difference. First operand 678 states and 763 transitions. Second operand has 4 states, 4 states have (on average 11.75) internal successors, (47), 4 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 19:08:12,630 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 19:08:12,630 INFO L93 Difference]: Finished difference Result 672 states and 753 transitions. [2024-10-14 19:08:12,631 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-14 19:08:12,631 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 11.75) internal successors, (47), 4 states have internal predecessors, (47), 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 47 [2024-10-14 19:08:12,631 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 19:08:12,633 INFO L225 Difference]: With dead ends: 672 [2024-10-14 19:08:12,633 INFO L226 Difference]: Without dead ends: 672 [2024-10-14 19:08:12,633 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-14 19:08:12,634 INFO L432 NwaCegarLoop]: 587 mSDtfsCounter, 15 mSDsluCounter, 1157 mSDsCounter, 0 mSdLazyCounter, 258 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 1744 SdHoareTripleChecker+Invalid, 264 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 258 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-14 19:08:12,634 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 1744 Invalid, 264 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 258 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-14 19:08:12,635 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 672 states. [2024-10-14 19:08:12,645 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 672 to 672. [2024-10-14 19:08:12,647 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 672 states, 370 states have (on average 1.9864864864864864) internal successors, (735), 665 states have internal predecessors, (735), 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-10-14 19:08:12,649 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 672 states to 672 states and 753 transitions. [2024-10-14 19:08:12,649 INFO L78 Accepts]: Start accepts. Automaton has 672 states and 753 transitions. Word has length 47 [2024-10-14 19:08:12,649 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 19:08:12,649 INFO L471 AbstractCegarLoop]: Abstraction has 672 states and 753 transitions. [2024-10-14 19:08:12,649 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.75) internal successors, (47), 4 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 19:08:12,649 INFO L276 IsEmpty]: Start isEmpty. Operand 672 states and 753 transitions. [2024-10-14 19:08:12,652 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2024-10-14 19:08:12,653 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 19:08:12,653 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 19:08:12,660 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-10-14 19:08:12,853 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-10-14 19:08:12,853 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr117REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 421 more)] === [2024-10-14 19:08:12,854 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 19:08:12,854 INFO L85 PathProgramCache]: Analyzing trace with hash 227917556, now seen corresponding path program 1 times [2024-10-14 19:08:12,854 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-14 19:08:12,854 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [617877062] [2024-10-14 19:08:12,854 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 19:08:12,855 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-14 19:08:12,855 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-14 19:08:12,857 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-10-14 19:08:12,858 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-10-14 19:08:13,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 19:08:13,019 INFO L255 TraceCheckSpWp]: Trace formula consists of 238 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-14 19:08:13,021 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 19:08:13,206 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 19:08:13,206 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-14 19:08:13,206 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-14 19:08:13,206 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [617877062] [2024-10-14 19:08:13,206 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [617877062] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 19:08:13,206 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 19:08:13,206 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-14 19:08:13,206 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1525371121] [2024-10-14 19:08:13,206 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 19:08:13,207 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-14 19:08:13,207 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-14 19:08:13,207 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-14 19:08:13,207 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 19:08:13,207 INFO L87 Difference]: Start difference. First operand 672 states and 753 transitions. Second operand has 3 states, 3 states have (on average 17.0) internal successors, (51), 2 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 19:08:13,699 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 19:08:13,699 INFO L93 Difference]: Finished difference Result 853 states and 957 transitions. [2024-10-14 19:08:13,701 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-14 19:08:13,701 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 17.0) internal successors, (51), 2 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 51 [2024-10-14 19:08:13,701 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 19:08:13,703 INFO L225 Difference]: With dead ends: 853 [2024-10-14 19:08:13,703 INFO L226 Difference]: Without dead ends: 853 [2024-10-14 19:08:13,703 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 49 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 19:08:13,704 INFO L432 NwaCegarLoop]: 712 mSDtfsCounter, 146 mSDsluCounter, 558 mSDsCounter, 0 mSdLazyCounter, 210 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 151 SdHoareTripleChecker+Valid, 1270 SdHoareTripleChecker+Invalid, 212 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 210 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-10-14 19:08:13,704 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [151 Valid, 1270 Invalid, 212 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 210 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-10-14 19:08:13,705 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 853 states. [2024-10-14 19:08:13,711 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 853 to 799. [2024-10-14 19:08:13,711 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 799 states, 492 states have (on average 1.8821138211382114) internal successors, (926), 792 states have internal predecessors, (926), 15 states have call successors, (15), 3 states have call predecessors, (15), 2 states have return successors, (13), 5 states have call predecessors, (13), 13 states have call successors, (13) [2024-10-14 19:08:13,713 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 799 states to 799 states and 954 transitions. [2024-10-14 19:08:13,713 INFO L78 Accepts]: Start accepts. Automaton has 799 states and 954 transitions. Word has length 51 [2024-10-14 19:08:13,713 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 19:08:13,713 INFO L471 AbstractCegarLoop]: Abstraction has 799 states and 954 transitions. [2024-10-14 19:08:13,713 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 17.0) internal successors, (51), 2 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 19:08:13,714 INFO L276 IsEmpty]: Start isEmpty. Operand 799 states and 954 transitions. [2024-10-14 19:08:13,714 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2024-10-14 19:08:13,714 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 19:08:13,714 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 19:08:13,725 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-10-14 19:08:13,914 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-10-14 19:08:13,915 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr71REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 421 more)] === [2024-10-14 19:08:13,915 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 19:08:13,915 INFO L85 PathProgramCache]: Analyzing trace with hash -558822258, now seen corresponding path program 1 times [2024-10-14 19:08:13,915 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-14 19:08:13,915 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [632552906] [2024-10-14 19:08:13,915 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 19:08:13,915 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-14 19:08:13,916 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-14 19:08:13,916 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-10-14 19:08:13,917 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-10-14 19:08:14,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 19:08:14,182 INFO L255 TraceCheckSpWp]: Trace formula consists of 273 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-10-14 19:08:14,186 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 19:08:14,200 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2024-10-14 19:08:14,207 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-10-14 19:08:14,577 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-14 19:08:14,578 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 9 [2024-10-14 19:08:14,590 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2024-10-14 19:08:14,591 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 13 [2024-10-14 19:08:14,598 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 19:08:14,599 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-14 19:08:14,599 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-14 19:08:14,599 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [632552906] [2024-10-14 19:08:14,599 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [632552906] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 19:08:14,599 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 19:08:14,599 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-14 19:08:14,599 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [671144379] [2024-10-14 19:08:14,599 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 19:08:14,600 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-14 19:08:14,600 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-14 19:08:14,600 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-14 19:08:14,600 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-14 19:08:14,600 INFO L87 Difference]: Start difference. First operand 799 states and 954 transitions. Second operand has 4 states, 3 states have (on average 18.0) internal successors, (54), 4 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 19:08:15,554 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 19:08:15,554 INFO L93 Difference]: Finished difference Result 761 states and 916 transitions. [2024-10-14 19:08:15,554 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-14 19:08:15,554 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 18.0) internal successors, (54), 4 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 54 [2024-10-14 19:08:15,554 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 19:08:15,556 INFO L225 Difference]: With dead ends: 761 [2024-10-14 19:08:15,556 INFO L226 Difference]: Without dead ends: 761 [2024-10-14 19:08:15,557 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 51 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-14 19:08:15,557 INFO L432 NwaCegarLoop]: 195 mSDtfsCounter, 1114 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 466 mSolverCounterSat, 51 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1122 SdHoareTripleChecker+Valid, 203 SdHoareTripleChecker+Invalid, 517 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 51 IncrementalHoareTripleChecker+Valid, 466 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-10-14 19:08:15,557 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1122 Valid, 203 Invalid, 517 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [51 Valid, 466 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-10-14 19:08:15,558 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 761 states. [2024-10-14 19:08:15,563 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 761 to 734. [2024-10-14 19:08:15,564 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 734 states, 465 states have (on average 1.772043010752688) internal successors, (824), 727 states have internal predecessors, (824), 15 states have call successors, (15), 3 states have call predecessors, (15), 2 states have return successors, (13), 5 states have call predecessors, (13), 13 states have call successors, (13) [2024-10-14 19:08:15,565 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 734 states to 734 states and 852 transitions. [2024-10-14 19:08:15,565 INFO L78 Accepts]: Start accepts. Automaton has 734 states and 852 transitions. Word has length 54 [2024-10-14 19:08:15,565 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 19:08:15,565 INFO L471 AbstractCegarLoop]: Abstraction has 734 states and 852 transitions. [2024-10-14 19:08:15,565 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 18.0) internal successors, (54), 4 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 19:08:15,565 INFO L276 IsEmpty]: Start isEmpty. Operand 734 states and 852 transitions. [2024-10-14 19:08:15,566 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2024-10-14 19:08:15,566 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 19:08:15,566 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] [2024-10-14 19:08:15,574 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 (14)] Forceful destruction successful, exit code 0 [2024-10-14 19:08:15,766 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-10-14 19:08:15,766 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr76REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 421 more)] === [2024-10-14 19:08:15,767 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 19:08:15,767 INFO L85 PathProgramCache]: Analyzing trace with hash 277799603, now seen corresponding path program 1 times [2024-10-14 19:08:15,767 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-14 19:08:15,767 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1370360143] [2024-10-14 19:08:15,767 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 19:08:15,767 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-14 19:08:15,767 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-14 19:08:15,768 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-10-14 19:08:15,770 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-10-14 19:08:15,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 19:08:15,948 INFO L255 TraceCheckSpWp]: Trace formula consists of 299 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-10-14 19:08:15,950 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 19:08:15,954 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2024-10-14 19:08:15,964 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2024-10-14 19:08:15,975 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2024-10-14 19:08:15,980 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 19:08:15,981 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-14 19:08:15,981 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-14 19:08:15,981 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1370360143] [2024-10-14 19:08:15,981 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1370360143] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 19:08:15,981 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 19:08:15,981 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-14 19:08:15,981 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [406998124] [2024-10-14 19:08:15,981 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 19:08:15,981 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-14 19:08:15,981 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-14 19:08:15,982 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-14 19:08:15,982 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-14 19:08:15,982 INFO L87 Difference]: Start difference. First operand 734 states and 852 transitions. Second operand has 5 states, 4 states have (on average 14.5) internal successors, (58), 5 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 19:08:17,250 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 19:08:17,250 INFO L93 Difference]: Finished difference Result 733 states and 851 transitions. [2024-10-14 19:08:17,251 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-14 19:08:17,251 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 14.5) internal successors, (58), 5 states have internal predecessors, (58), 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 58 [2024-10-14 19:08:17,251 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 19:08:17,253 INFO L225 Difference]: With dead ends: 733 [2024-10-14 19:08:17,253 INFO L226 Difference]: Without dead ends: 733 [2024-10-14 19:08:17,253 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 54 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-10-14 19:08:17,253 INFO L432 NwaCegarLoop]: 561 mSDtfsCounter, 2 mSDsluCounter, 945 mSDsCounter, 0 mSdLazyCounter, 1046 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 1506 SdHoareTripleChecker+Invalid, 1047 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 1046 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2024-10-14 19:08:17,253 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 1506 Invalid, 1047 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 1046 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2024-10-14 19:08:17,254 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 733 states. [2024-10-14 19:08:17,259 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 733 to 733. [2024-10-14 19:08:17,260 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 733 states, 465 states have (on average 1.7698924731182795) internal successors, (823), 726 states have internal predecessors, (823), 15 states have call successors, (15), 3 states have call predecessors, (15), 2 states have return successors, (13), 5 states have call predecessors, (13), 13 states have call successors, (13) [2024-10-14 19:08:17,261 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 733 states to 733 states and 851 transitions. [2024-10-14 19:08:17,261 INFO L78 Accepts]: Start accepts. Automaton has 733 states and 851 transitions. Word has length 58 [2024-10-14 19:08:17,261 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 19:08:17,261 INFO L471 AbstractCegarLoop]: Abstraction has 733 states and 851 transitions. [2024-10-14 19:08:17,261 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 14.5) internal successors, (58), 5 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 19:08:17,262 INFO L276 IsEmpty]: Start isEmpty. Operand 733 states and 851 transitions. [2024-10-14 19:08:17,262 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2024-10-14 19:08:17,262 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 19:08:17,262 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] [2024-10-14 19:08:17,272 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-10-14 19:08:17,462 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-10-14 19:08:17,463 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr77REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 421 more)] === [2024-10-14 19:08:17,463 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 19:08:17,463 INFO L85 PathProgramCache]: Analyzing trace with hash 277799604, now seen corresponding path program 1 times [2024-10-14 19:08:17,464 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-14 19:08:17,464 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1528644257] [2024-10-14 19:08:17,464 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 19:08:17,464 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-14 19:08:17,464 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-14 19:08:17,465 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-10-14 19:08:17,466 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-10-14 19:08:17,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 19:08:17,658 INFO L255 TraceCheckSpWp]: Trace formula consists of 299 conjuncts, 10 conjuncts are in the unsatisfiable core [2024-10-14 19:08:17,660 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 19:08:17,667 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-10-14 19:08:17,678 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2024-10-14 19:08:17,685 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2024-10-14 19:08:17,716 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 9 [2024-10-14 19:08:17,730 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 19:08:17,730 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-14 19:08:17,730 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-14 19:08:17,730 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1528644257] [2024-10-14 19:08:17,730 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1528644257] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 19:08:17,730 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 19:08:17,730 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-14 19:08:17,731 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [842884525] [2024-10-14 19:08:17,731 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 19:08:17,731 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-14 19:08:17,731 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-14 19:08:17,731 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-14 19:08:17,731 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-14 19:08:17,731 INFO L87 Difference]: Start difference. First operand 733 states and 851 transitions. Second operand has 5 states, 4 states have (on average 14.5) internal successors, (58), 5 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 19:08:19,329 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 19:08:19,330 INFO L93 Difference]: Finished difference Result 732 states and 850 transitions. [2024-10-14 19:08:19,333 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-14 19:08:19,333 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 14.5) internal successors, (58), 5 states have internal predecessors, (58), 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 58 [2024-10-14 19:08:19,333 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 19:08:19,335 INFO L225 Difference]: With dead ends: 732 [2024-10-14 19:08:19,335 INFO L226 Difference]: Without dead ends: 732 [2024-10-14 19:08:19,336 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 54 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-10-14 19:08:19,336 INFO L432 NwaCegarLoop]: 561 mSDtfsCounter, 1 mSDsluCounter, 962 mSDsCounter, 0 mSdLazyCounter, 1026 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 1523 SdHoareTripleChecker+Invalid, 1027 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 1026 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2024-10-14 19:08:19,337 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 1523 Invalid, 1027 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 1026 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2024-10-14 19:08:19,338 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 732 states. [2024-10-14 19:08:19,343 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 732 to 732. [2024-10-14 19:08:19,344 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 732 states, 464 states have (on average 1.771551724137931) internal successors, (822), 725 states have internal predecessors, (822), 15 states have call successors, (15), 3 states have call predecessors, (15), 2 states have return successors, (13), 5 states have call predecessors, (13), 13 states have call successors, (13) [2024-10-14 19:08:19,345 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 732 states to 732 states and 850 transitions. [2024-10-14 19:08:19,346 INFO L78 Accepts]: Start accepts. Automaton has 732 states and 850 transitions. Word has length 58 [2024-10-14 19:08:19,346 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 19:08:19,346 INFO L471 AbstractCegarLoop]: Abstraction has 732 states and 850 transitions. [2024-10-14 19:08:19,346 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 14.5) internal successors, (58), 5 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 19:08:19,346 INFO L276 IsEmpty]: Start isEmpty. Operand 732 states and 850 transitions. [2024-10-14 19:08:19,347 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2024-10-14 19:08:19,347 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 19:08:19,347 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-10-14 19:08:19,354 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-10-14 19:08:19,550 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-10-14 19:08:19,551 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr80REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 421 more)] === [2024-10-14 19:08:19,551 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 19:08:19,551 INFO L85 PathProgramCache]: Analyzing trace with hash 2091064887, now seen corresponding path program 1 times [2024-10-14 19:08:19,552 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-14 19:08:19,552 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1684443701] [2024-10-14 19:08:19,552 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 19:08:19,552 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-14 19:08:19,552 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-14 19:08:19,555 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-10-14 19:08:19,555 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-10-14 19:08:19,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 19:08:19,772 INFO L255 TraceCheckSpWp]: Trace formula consists of 325 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-14 19:08:19,774 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 19:08:19,791 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 19:08:19,791 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-14 19:08:19,792 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-14 19:08:19,792 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1684443701] [2024-10-14 19:08:19,792 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1684443701] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 19:08:19,792 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 19:08:19,792 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-14 19:08:19,792 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [646804034] [2024-10-14 19:08:19,792 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 19:08:19,792 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-14 19:08:19,792 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-14 19:08:19,793 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-14 19:08:19,793 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-14 19:08:19,793 INFO L87 Difference]: Start difference. First operand 732 states and 850 transitions. Second operand has 4 states, 3 states have (on average 20.666666666666668) internal successors, (62), 4 states have internal predecessors, (62), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-14 19:08:20,264 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 19:08:20,264 INFO L93 Difference]: Finished difference Result 734 states and 853 transitions. [2024-10-14 19:08:20,265 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-14 19:08:20,265 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 20.666666666666668) internal successors, (62), 4 states have internal predecessors, (62), 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 64 [2024-10-14 19:08:20,265 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 19:08:20,268 INFO L225 Difference]: With dead ends: 734 [2024-10-14 19:08:20,268 INFO L226 Difference]: Without dead ends: 734 [2024-10-14 19:08:20,269 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 61 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-14 19:08:20,269 INFO L432 NwaCegarLoop]: 561 mSDtfsCounter, 0 mSDsluCounter, 1119 mSDsCounter, 0 mSdLazyCounter, 236 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1680 SdHoareTripleChecker+Invalid, 237 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 236 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-10-14 19:08:20,269 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1680 Invalid, 237 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 236 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-10-14 19:08:20,270 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 734 states. [2024-10-14 19:08:20,278 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 734 to 734. [2024-10-14 19:08:20,279 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 734 states, 465 states have (on average 1.772043010752688) internal successors, (824), 727 states have internal predecessors, (824), 15 states have call successors, (15), 3 states have call predecessors, (15), 3 states have return successors, (14), 5 states have call predecessors, (14), 13 states have call successors, (14) [2024-10-14 19:08:20,280 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 734 states to 734 states and 853 transitions. [2024-10-14 19:08:20,280 INFO L78 Accepts]: Start accepts. Automaton has 734 states and 853 transitions. Word has length 64 [2024-10-14 19:08:20,281 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 19:08:20,281 INFO L471 AbstractCegarLoop]: Abstraction has 734 states and 853 transitions. [2024-10-14 19:08:20,281 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 20.666666666666668) internal successors, (62), 4 states have internal predecessors, (62), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-14 19:08:20,281 INFO L276 IsEmpty]: Start isEmpty. Operand 734 states and 853 transitions. [2024-10-14 19:08:20,281 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2024-10-14 19:08:20,281 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 19:08:20,282 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] [2024-10-14 19:08:20,288 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-10-14 19:08:20,482 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-10-14 19:08:20,482 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr80REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 421 more)] === [2024-10-14 19:08:20,483 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 19:08:20,483 INFO L85 PathProgramCache]: Analyzing trace with hash -1977639406, now seen corresponding path program 1 times [2024-10-14 19:08:20,483 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-14 19:08:20,483 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [684518150] [2024-10-14 19:08:20,483 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 19:08:20,484 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-14 19:08:20,484 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-14 19:08:20,486 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-10-14 19:08:20,487 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-10-14 19:08:20,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 19:08:20,703 INFO L255 TraceCheckSpWp]: Trace formula consists of 336 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-10-14 19:08:20,704 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 19:08:20,720 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 19:08:20,720 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-14 19:08:20,768 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 19:08:20,768 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-14 19:08:20,768 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [684518150] [2024-10-14 19:08:20,768 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [684518150] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-14 19:08:20,769 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-14 19:08:20,769 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 8 [2024-10-14 19:08:20,769 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1046532369] [2024-10-14 19:08:20,769 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-14 19:08:20,769 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-14 19:08:20,769 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-14 19:08:20,770 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-14 19:08:20,770 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2024-10-14 19:08:20,770 INFO L87 Difference]: Start difference. First operand 734 states and 853 transitions. Second operand has 8 states, 6 states have (on average 11.0) internal successors, (66), 8 states have internal predecessors, (66), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-14 19:08:21,752 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 19:08:21,752 INFO L93 Difference]: Finished difference Result 743 states and 867 transitions. [2024-10-14 19:08:21,754 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-10-14 19:08:21,754 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 6 states have (on average 11.0) internal successors, (66), 8 states have internal predecessors, (66), 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 65 [2024-10-14 19:08:21,754 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 19:08:21,756 INFO L225 Difference]: With dead ends: 743 [2024-10-14 19:08:21,756 INFO L226 Difference]: Without dead ends: 743 [2024-10-14 19:08:21,756 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 131 GetRequests, 122 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=44, Invalid=66, Unknown=0, NotChecked=0, Total=110 [2024-10-14 19:08:21,756 INFO L432 NwaCegarLoop]: 560 mSDtfsCounter, 4 mSDsluCounter, 2790 mSDsCounter, 0 mSdLazyCounter, 504 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 3350 SdHoareTripleChecker+Invalid, 509 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 504 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-10-14 19:08:21,757 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 3350 Invalid, 509 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 504 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-10-14 19:08:21,757 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 743 states. [2024-10-14 19:08:21,763 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 743 to 742. [2024-10-14 19:08:21,763 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 742 states, 472 states have (on average 1.7733050847457628) internal successors, (837), 734 states have internal predecessors, (837), 15 states have call successors, (15), 4 states have call predecessors, (15), 4 states have return successors, (14), 5 states have call predecessors, (14), 13 states have call successors, (14) [2024-10-14 19:08:21,765 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 742 states to 742 states and 866 transitions. [2024-10-14 19:08:21,765 INFO L78 Accepts]: Start accepts. Automaton has 742 states and 866 transitions. Word has length 65 [2024-10-14 19:08:21,765 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 19:08:21,765 INFO L471 AbstractCegarLoop]: Abstraction has 742 states and 866 transitions. [2024-10-14 19:08:21,765 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 6 states have (on average 11.0) internal successors, (66), 8 states have internal predecessors, (66), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-14 19:08:21,766 INFO L276 IsEmpty]: Start isEmpty. Operand 742 states and 866 transitions. [2024-10-14 19:08:21,766 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2024-10-14 19:08:21,766 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 19:08:21,766 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] [2024-10-14 19:08:21,773 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-10-14 19:08:21,970 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-10-14 19:08:21,971 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr80REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 421 more)] === [2024-10-14 19:08:21,971 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 19:08:21,971 INFO L85 PathProgramCache]: Analyzing trace with hash 934395127, now seen corresponding path program 2 times [2024-10-14 19:08:21,971 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-14 19:08:21,972 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1939766856] [2024-10-14 19:08:21,972 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-10-14 19:08:21,972 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-14 19:08:21,972 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-14 19:08:21,974 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-10-14 19:08:21,975 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-10-14 19:08:22,392 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-10-14 19:08:22,393 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-14 19:08:22,403 INFO L255 TraceCheckSpWp]: Trace formula consists of 369 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-10-14 19:08:22,405 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 19:08:22,435 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 19:08:22,435 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-14 19:08:22,549 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 19:08:22,549 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-14 19:08:22,549 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1939766856] [2024-10-14 19:08:22,549 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1939766856] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-14 19:08:22,549 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-14 19:08:22,549 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 14 [2024-10-14 19:08:22,549 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1112666792] [2024-10-14 19:08:22,549 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-14 19:08:22,550 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-10-14 19:08:22,550 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-14 19:08:22,550 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-10-14 19:08:22,550 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=121, Unknown=0, NotChecked=0, Total=182 [2024-10-14 19:08:22,551 INFO L87 Difference]: Start difference. First operand 742 states and 866 transitions. Second operand has 14 states, 12 states have (on average 6.0) internal successors, (72), 14 states have internal predecessors, (72), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-14 19:08:23,863 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 19:08:23,863 INFO L93 Difference]: Finished difference Result 754 states and 885 transitions. [2024-10-14 19:08:23,864 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2024-10-14 19:08:23,865 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 12 states have (on average 6.0) internal successors, (72), 14 states have internal predecessors, (72), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 68 [2024-10-14 19:08:23,865 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 19:08:23,867 INFO L225 Difference]: With dead ends: 754 [2024-10-14 19:08:23,867 INFO L226 Difference]: Without dead ends: 752 [2024-10-14 19:08:23,867 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 143 GetRequests, 122 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-10-14 19:08:23,867 INFO L432 NwaCegarLoop]: 560 mSDtfsCounter, 7 mSDsluCounter, 3352 mSDsCounter, 0 mSdLazyCounter, 687 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 3912 SdHoareTripleChecker+Invalid, 695 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 687 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2024-10-14 19:08:23,868 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 3912 Invalid, 695 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 687 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2024-10-14 19:08:23,868 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 752 states. [2024-10-14 19:08:23,875 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 752 to 751. [2024-10-14 19:08:23,876 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 751 states, 481 states have (on average 1.7650727650727651) internal successors, (849), 743 states have internal predecessors, (849), 15 states have call successors, (15), 4 states have call predecessors, (15), 4 states have return successors, (14), 5 states have call predecessors, (14), 13 states have call successors, (14) [2024-10-14 19:08:23,879 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 751 states to 751 states and 878 transitions. [2024-10-14 19:08:23,879 INFO L78 Accepts]: Start accepts. Automaton has 751 states and 878 transitions. Word has length 68 [2024-10-14 19:08:23,880 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 19:08:23,880 INFO L471 AbstractCegarLoop]: Abstraction has 751 states and 878 transitions. [2024-10-14 19:08:23,880 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 12 states have (on average 6.0) internal successors, (72), 14 states have internal predecessors, (72), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-14 19:08:23,880 INFO L276 IsEmpty]: Start isEmpty. Operand 751 states and 878 transitions. [2024-10-14 19:08:23,880 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2024-10-14 19:08:23,880 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 19:08:23,881 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] [2024-10-14 19:08:23,890 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (19)] Ended with exit code 0 [2024-10-14 19:08:24,081 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-10-14 19:08:24,081 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr80REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 421 more)] === [2024-10-14 19:08:24,082 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 19:08:24,082 INFO L85 PathProgramCache]: Analyzing trace with hash -605972713, now seen corresponding path program 3 times [2024-10-14 19:08:24,082 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-14 19:08:24,082 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2036267130] [2024-10-14 19:08:24,082 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-10-14 19:08:24,082 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-14 19:08:24,082 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-14 19:08:24,085 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-10-14 19:08:24,090 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-10-14 19:08:24,738 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2024-10-14 19:08:24,738 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-14 19:08:24,751 INFO L255 TraceCheckSpWp]: Trace formula consists of 435 conjuncts, 14 conjuncts are in the unsatisfiable core [2024-10-14 19:08:24,752 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 19:08:24,857 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 19:08:24,857 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-14 19:08:25,243 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 19:08:25,243 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-14 19:08:25,243 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2036267130] [2024-10-14 19:08:25,243 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2036267130] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-14 19:08:25,243 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-14 19:08:25,243 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 26 [2024-10-14 19:08:25,243 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [22890605] [2024-10-14 19:08:25,243 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-14 19:08:25,244 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2024-10-14 19:08:25,244 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-14 19:08:25,246 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2024-10-14 19:08:25,246 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=193, Invalid=457, Unknown=0, NotChecked=0, Total=650 [2024-10-14 19:08:25,246 INFO L87 Difference]: Start difference. First operand 751 states and 878 transitions. Second operand has 26 states, 24 states have (on average 3.5) internal successors, (84), 26 states have internal predecessors, (84), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-14 19:08:28,354 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 19:08:28,354 INFO L93 Difference]: Finished difference Result 772 states and 914 transitions. [2024-10-14 19:08:28,355 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2024-10-14 19:08:28,355 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 24 states have (on average 3.5) internal successors, (84), 26 states have internal predecessors, (84), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 74 [2024-10-14 19:08:28,355 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 19:08:28,357 INFO L225 Difference]: With dead ends: 772 [2024-10-14 19:08:28,357 INFO L226 Difference]: Without dead ends: 769 [2024-10-14 19:08:28,357 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 167 GetRequests, 122 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 100 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=728, Invalid=1434, Unknown=0, NotChecked=0, Total=2162 [2024-10-14 19:08:28,358 INFO L432 NwaCegarLoop]: 560 mSDtfsCounter, 14 mSDsluCounter, 6705 mSDsCounter, 0 mSdLazyCounter, 1521 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 7265 SdHoareTripleChecker+Invalid, 1534 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 1521 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2024-10-14 19:08:28,358 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 7265 Invalid, 1534 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 1521 Invalid, 0 Unknown, 0 Unchecked, 2.4s Time] [2024-10-14 19:08:28,363 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 769 states. [2024-10-14 19:08:28,373 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 769 to 769. [2024-10-14 19:08:28,374 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 769 states, 499 states have (on average 1.74749498997996) internal successors, (872), 761 states have internal predecessors, (872), 15 states have call successors, (15), 4 states have call predecessors, (15), 4 states have return successors, (14), 5 states have call predecessors, (14), 13 states have call successors, (14) [2024-10-14 19:08:28,377 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 769 states to 769 states and 901 transitions. [2024-10-14 19:08:28,377 INFO L78 Accepts]: Start accepts. Automaton has 769 states and 901 transitions. Word has length 74 [2024-10-14 19:08:28,377 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 19:08:28,377 INFO L471 AbstractCegarLoop]: Abstraction has 769 states and 901 transitions. [2024-10-14 19:08:28,377 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 24 states have (on average 3.5) internal successors, (84), 26 states have internal predecessors, (84), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-14 19:08:28,378 INFO L276 IsEmpty]: Start isEmpty. Operand 769 states and 901 transitions. [2024-10-14 19:08:28,378 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2024-10-14 19:08:28,378 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 19:08:28,378 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] [2024-10-14 19:08:28,392 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 (20)] Forceful destruction successful, exit code 0 [2024-10-14 19:08:28,578 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-10-14 19:08:28,579 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr80REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 421 more)] === [2024-10-14 19:08:28,579 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 19:08:28,579 INFO L85 PathProgramCache]: Analyzing trace with hash 1168573271, now seen corresponding path program 4 times [2024-10-14 19:08:28,580 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-14 19:08:28,580 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [82978149] [2024-10-14 19:08:28,580 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2024-10-14 19:08:28,580 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-14 19:08:28,580 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-14 19:08:28,581 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-10-14 19:08:28,582 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-10-14 19:08:29,033 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2024-10-14 19:08:29,034 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-14 19:08:29,048 INFO L255 TraceCheckSpWp]: Trace formula consists of 567 conjuncts, 25 conjuncts are in the unsatisfiable core [2024-10-14 19:08:29,050 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 19:08:29,329 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 0 proven. 253 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 19:08:29,329 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-14 19:08:30,358 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 0 proven. 253 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 19:08:30,358 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-14 19:08:30,358 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [82978149] [2024-10-14 19:08:30,358 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [82978149] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-14 19:08:30,358 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-14 19:08:30,358 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 26] total 50 [2024-10-14 19:08:30,358 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1527010606] [2024-10-14 19:08:30,358 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-14 19:08:30,359 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 50 states [2024-10-14 19:08:30,359 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-14 19:08:30,359 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2024-10-14 19:08:30,360 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=672, Invalid=1778, Unknown=0, NotChecked=0, Total=2450 [2024-10-14 19:08:30,360 INFO L87 Difference]: Start difference. First operand 769 states and 901 transitions. Second operand has 50 states, 48 states have (on average 2.25) internal successors, (108), 50 states have internal predecessors, (108), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-14 19:08:37,993 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 19:08:37,993 INFO L93 Difference]: Finished difference Result 806 states and 970 transitions. [2024-10-14 19:08:37,995 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 71 states. [2024-10-14 19:08:37,995 INFO L78 Accepts]: Start accepts. Automaton has has 50 states, 48 states have (on average 2.25) internal successors, (108), 50 states have internal predecessors, (108), 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 86 [2024-10-14 19:08:37,996 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 19:08:37,997 INFO L225 Difference]: With dead ends: 806 [2024-10-14 19:08:37,997 INFO L226 Difference]: Without dead ends: 804 [2024-10-14 19:08:37,999 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 213 GetRequests, 122 SyntacticMatches, 0 SemanticMatches, 91 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 465 ImplicationChecksByTransitivity, 3.7s TimeCoverageRelationStatistics Valid=2713, Invalid=5843, Unknown=0, NotChecked=0, Total=8556 [2024-10-14 19:08:37,999 INFO L432 NwaCegarLoop]: 560 mSDtfsCounter, 25 mSDsluCounter, 13415 mSDsCounter, 0 mSdLazyCounter, 3743 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 13975 SdHoareTripleChecker+Invalid, 3773 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 3743 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.9s IncrementalHoareTripleChecker+Time [2024-10-14 19:08:37,999 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [25 Valid, 13975 Invalid, 3773 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 3743 Invalid, 0 Unknown, 0 Unchecked, 4.9s Time] [2024-10-14 19:08:38,000 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 804 states. [2024-10-14 19:08:38,005 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 804 to 803. [2024-10-14 19:08:38,006 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 803 states, 533 states have (on average 1.722326454033771) internal successors, (918), 795 states have internal predecessors, (918), 15 states have call successors, (15), 4 states have call predecessors, (15), 4 states have return successors, (14), 5 states have call predecessors, (14), 13 states have call successors, (14) [2024-10-14 19:08:38,007 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 803 states to 803 states and 947 transitions. [2024-10-14 19:08:38,008 INFO L78 Accepts]: Start accepts. Automaton has 803 states and 947 transitions. Word has length 86 [2024-10-14 19:08:38,008 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 19:08:38,008 INFO L471 AbstractCegarLoop]: Abstraction has 803 states and 947 transitions. [2024-10-14 19:08:38,008 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 50 states, 48 states have (on average 2.25) internal successors, (108), 50 states have internal predecessors, (108), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-14 19:08:38,008 INFO L276 IsEmpty]: Start isEmpty. Operand 803 states and 947 transitions. [2024-10-14 19:08:38,009 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2024-10-14 19:08:38,009 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 19:08:38,009 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] [2024-10-14 19:08:38,020 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-10-14 19:08:38,209 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-10-14 19:08:38,210 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr80REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 421 more)] === [2024-10-14 19:08:38,210 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 19:08:38,210 INFO L85 PathProgramCache]: Analyzing trace with hash -1095479177, now seen corresponding path program 5 times [2024-10-14 19:08:38,211 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-14 19:08:38,211 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1739037021] [2024-10-14 19:08:38,211 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2024-10-14 19:08:38,211 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-14 19:08:38,211 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-14 19:08:38,214 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-10-14 19:08:38,215 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-10-14 19:08:39,401 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 23 check-sat command(s) [2024-10-14 19:08:39,401 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-14 19:08:39,426 INFO L255 TraceCheckSpWp]: Trace formula consists of 809 conjuncts, 58 conjuncts are in the unsatisfiable core [2024-10-14 19:08:39,432 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 19:08:39,436 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2024-10-14 19:08:39,506 INFO L349 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2024-10-14 19:08:39,507 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-10-14 19:08:39,539 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2024-10-14 19:08:39,592 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-10-14 19:08:40,352 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-10-14 19:08:40,352 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-10-14 19:08:40,386 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-10-14 19:08:40,415 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 44 refuted. 0 times theorem prover too weak. 946 trivial. 0 not checked. [2024-10-14 19:08:40,415 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-14 19:08:40,675 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1997 (Array (_ BitVec 32) (_ BitVec 32)))) (= (bvadd (_ bv1 1) (select |c_#valid| (select (select (store |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_main_#t~mem36#1.base| v_ArrVal_1997) |c_ULTIMATE.start_main_~user~0#1.base|) (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|)))) (_ bv0 1))) is different from false [2024-10-14 19:08:40,677 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-14 19:08:40,677 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1739037021] [2024-10-14 19:08:40,677 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1739037021] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-14 19:08:40,677 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc5 [654493022] [2024-10-14 19:08:40,677 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2024-10-14 19:08:40,677 INFO L173 SolverBuilder]: Constructing external solver with command: cvc5 --incremental --print-success --lang smt [2024-10-14 19:08:40,678 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc5 [2024-10-14 19:08:40,679 INFO L229 MonitoredProcess]: Starting monitored process 23 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc5 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-10-14 19:08:40,680 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc5 --incremental --print-success --lang smt (23)] Waiting until timeout for monitored process [2024-10-14 19:08:41,123 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 23 check-sat command(s) [2024-10-14 19:08:41,124 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-14 19:08:41,174 WARN L253 TraceCheckSpWp]: Trace formula consists of 809 conjuncts, 619 conjuncts are in the unsatisfiable core [2024-10-14 19:08:41,208 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 19:08:41,214 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 8 treesize of output 1 [2024-10-14 19:08:41,217 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-10-14 19:08:41,243 INFO L173 IndexEqualityManager]: detected equality via solver [2024-10-14 19:08:41,243 INFO L173 IndexEqualityManager]: detected equality via solver [2024-10-14 19:08:41,244 INFO L173 IndexEqualityManager]: detected equality via solver [2024-10-14 19:08:41,245 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 6 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 33 [2024-10-14 19:08:41,311 INFO L349 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2024-10-14 19:08:41,312 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 18 [2024-10-14 19:08:41,335 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2024-10-14 19:08:41,505 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 8 treesize of output 1 [2024-10-14 19:08:41,518 INFO L173 IndexEqualityManager]: detected equality via solver [2024-10-14 19:08:41,519 INFO L173 IndexEqualityManager]: detected equality via solver [2024-10-14 19:08:41,519 INFO L173 IndexEqualityManager]: detected equality via solver [2024-10-14 19:08:41,522 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 6 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 112 treesize of output 121 [2024-10-14 19:08:41,729 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 203 treesize of output 91 [2024-10-14 19:08:41,815 INFO L173 IndexEqualityManager]: detected equality via solver [2024-10-14 19:08:41,816 INFO L173 IndexEqualityManager]: detected equality via solver [2024-10-14 19:08:41,816 INFO L173 IndexEqualityManager]: detected equality via solver [2024-10-14 19:08:41,817 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 28 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 185 treesize of output 205 [2024-10-14 19:08:41,858 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 8 treesize of output 1 [2024-10-14 19:08:58,279 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 8 select indices, 8 select index equivalence classes, 66 disjoint index pairs (out of 28 index pairs), introduced 8 new quantified variables, introduced 0 case distinctions, treesize of input 149885 treesize of output 118989 [2024-10-14 19:08:58,612 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 8 treesize of output 1 [2024-10-14 19:09:20,941 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 11 treesize of output 7 [2024-10-14 19:09:20,954 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 12 select indices, 12 select index equivalence classes, 66 disjoint index pairs (out of 66 index pairs), introduced 12 new quantified variables, introduced 0 case distinctions, treesize of input 204017 treesize of output 203969 [2024-10-14 19:09:20,963 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 11 treesize of output 7 [2024-10-14 19:09:21,174 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 7 treesize of output 3 [2024-10-14 19:09:21,182 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 7 treesize of output 3 [2024-10-14 19:09:21,187 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-14 19:09:21,188 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-14 19:09:21,189 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-14 19:09:21,190 INFO L173 IndexEqualityManager]: detected equality via solver [2024-10-14 19:09:21,190 INFO L173 IndexEqualityManager]: detected equality via solver [2024-10-14 19:09:21,191 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 7 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 33 [2024-10-14 19:09:21,394 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 25 [2024-10-14 19:09:21,400 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 11 treesize of output 7 [2024-10-14 19:09:21,405 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 11 treesize of output 7 [2024-10-14 19:09:21,566 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 19 treesize of output 18 [2024-10-14 19:09:21,577 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 19 treesize of output 18 [2024-10-14 19:09:21,587 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 8 treesize of output 1 [2024-10-14 19:09:21,784 INFO L349 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2024-10-14 19:09:21,784 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-10-14 19:09:21,806 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 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 5 treesize of output 3 [2024-10-14 19:09:22,035 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 15 treesize of output 1 [2024-10-14 19:09:22,043 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 28 [2024-10-14 19:09:22,057 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 21 [2024-10-14 19:09:22,537 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 18 [2024-10-14 19:09:22,542 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 10