./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_test8-1.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version a046e57d 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_test8-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 3b6a7e09bdf002daf4e1e371c35be311dd644a61b41d9b32022b9ee835751b90 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-mul-div-a046e57-m [2024-10-13 11:54:32,528 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-13 11:54:32,589 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2024-10-13 11:54:32,594 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-13 11:54:32,595 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-13 11:54:32,620 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-13 11:54:32,621 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-13 11:54:32,621 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-13 11:54:32,623 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-13 11:54:32,623 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-13 11:54:32,624 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-13 11:54:32,624 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-13 11:54:32,624 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-13 11:54:32,626 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-13 11:54:32,626 INFO L153 SettingsManager]: * Use SBE=true [2024-10-13 11:54:32,626 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-13 11:54:32,627 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-13 11:54:32,627 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-13 11:54:32,627 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-13 11:54:32,627 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-13 11:54:32,627 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-10-13 11:54:32,631 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-10-13 11:54:32,631 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-10-13 11:54:32,631 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-13 11:54:32,631 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-10-13 11:54:32,631 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-13 11:54:32,631 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-10-13 11:54:32,631 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-13 11:54:32,632 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-13 11:54:32,632 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-13 11:54:32,632 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-13 11:54:32,632 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-13 11:54:32,632 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-13 11:54:32,632 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-13 11:54:32,633 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-13 11:54:32,633 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-13 11:54:32,633 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-13 11:54:32,633 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-13 11:54:32,633 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-13 11:54:32,633 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-13 11:54:32,633 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-13 11:54:32,636 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-13 11:54:32,636 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 -> 3b6a7e09bdf002daf4e1e371c35be311dd644a61b41d9b32022b9ee835751b90 [2024-10-13 11:54:32,878 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-13 11:54:32,897 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-13 11:54:32,901 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-13 11:54:32,902 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-13 11:54:32,902 INFO L274 PluginConnector]: CDTParser initialized [2024-10-13 11:54:32,903 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_JEN_test8-1.i [2024-10-13 11:54:34,189 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-13 11:54:34,451 INFO L384 CDTParser]: Found 1 translation units. [2024-10-13 11:54:34,453 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_JEN_test8-1.i [2024-10-13 11:54:34,477 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5761779a4/1646752136074a1f97fdcb24a534d3f9/FLAGc5f9f60ca [2024-10-13 11:54:34,782 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5761779a4/1646752136074a1f97fdcb24a534d3f9 [2024-10-13 11:54:34,784 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-13 11:54:34,786 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-13 11:54:34,787 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-13 11:54:34,787 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-13 11:54:34,795 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-13 11:54:34,796 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 11:54:34" (1/1) ... [2024-10-13 11:54:34,797 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@426cef59 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 11:54:34, skipping insertion in model container [2024-10-13 11:54:34,797 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 11:54:34" (1/1) ... [2024-10-13 11:54:34,844 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-13 11:54:35,266 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-13 11:54:35,281 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-13 11:54:35,282 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver@3a1ef65f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 11:54:35, skipping insertion in model container [2024-10-13 11:54:35,282 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-13 11:54:35,283 INFO L186 ToolchainWalker]: Toolchain execution was canceled (user or tool) before executing de.uni_freiburg.informatik.ultimate.boogie.procedureinliner [2024-10-13 11:54:35,285 INFO L158 Benchmark]: Toolchain (without parser) took 498.02ms. Allocated memory was 146.8MB in the beginning and 216.0MB in the end (delta: 69.2MB). Free memory was 71.6MB in the beginning and 173.7MB in the end (delta: -102.1MB). Peak memory consumption was 11.7MB. Max. memory is 16.1GB. [2024-10-13 11:54:35,285 INFO L158 Benchmark]: CDTParser took 0.15ms. Allocated memory is still 146.8MB. Free memory is still 97.7MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-13 11:54:35,286 INFO L158 Benchmark]: CACSL2BoogieTranslator took 495.65ms. Allocated memory was 146.8MB in the beginning and 216.0MB in the end (delta: 69.2MB). Free memory was 71.5MB in the beginning and 173.7MB in the end (delta: -102.2MB). Peak memory consumption was 11.7MB. Max. memory is 16.1GB. [2024-10-13 11:54:35,287 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.15ms. Allocated memory is still 146.8MB. Free memory is still 97.7MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 495.65ms. Allocated memory was 146.8MB in the beginning and 216.0MB in the end (delta: 69.2MB). Free memory was 71.5MB in the beginning and 173.7MB in the end (delta: -102.2MB). Peak memory consumption was 11.7MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - UnsupportedSyntaxResult [Line: 766]: 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_test8-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 3b6a7e09bdf002daf4e1e371c35be311dd644a61b41d9b32022b9ee835751b90 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-mul-div-a046e57-m [2024-10-13 11:54:37,016 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-13 11:54:37,079 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf [2024-10-13 11:54:37,083 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-13 11:54:37,083 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-13 11:54:37,111 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-13 11:54:37,112 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-13 11:54:37,113 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-13 11:54:37,113 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-13 11:54:37,114 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-13 11:54:37,114 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-13 11:54:37,115 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-13 11:54:37,115 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-13 11:54:37,115 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-13 11:54:37,117 INFO L153 SettingsManager]: * Use SBE=true [2024-10-13 11:54:37,117 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-13 11:54:37,117 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-13 11:54:37,118 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-13 11:54:37,118 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-13 11:54:37,118 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-13 11:54:37,118 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-10-13 11:54:37,121 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-10-13 11:54:37,122 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-10-13 11:54:37,122 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-13 11:54:37,122 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-10-13 11:54:37,122 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-10-13 11:54:37,123 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-13 11:54:37,123 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-10-13 11:54:37,123 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-10-13 11:54:37,123 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-13 11:54:37,123 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-13 11:54:37,123 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-13 11:54:37,124 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-13 11:54:37,124 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-13 11:54:37,124 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-13 11:54:37,124 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-13 11:54:37,124 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-13 11:54:37,124 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-13 11:54:37,125 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-10-13 11:54:37,126 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-10-13 11:54:37,127 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-13 11:54:37,127 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-13 11:54:37,127 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-13 11:54:37,127 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-13 11:54:37,127 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2024-10-13 11:54:37,128 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 -> 3b6a7e09bdf002daf4e1e371c35be311dd644a61b41d9b32022b9ee835751b90 [2024-10-13 11:54:37,415 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-13 11:54:37,436 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-13 11:54:37,438 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-13 11:54:37,439 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-13 11:54:37,439 INFO L274 PluginConnector]: CDTParser initialized [2024-10-13 11:54:37,440 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_JEN_test8-1.i [2024-10-13 11:54:38,748 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-13 11:54:39,041 INFO L384 CDTParser]: Found 1 translation units. [2024-10-13 11:54:39,043 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_JEN_test8-1.i [2024-10-13 11:54:39,069 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9a9e96e80/c520af910cfa498a83646951fe442872/FLAG3bb042f1f [2024-10-13 11:54:39,335 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9a9e96e80/c520af910cfa498a83646951fe442872 [2024-10-13 11:54:39,337 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-13 11:54:39,339 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-13 11:54:39,347 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-13 11:54:39,347 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-13 11:54:39,352 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-13 11:54:39,352 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 11:54:39" (1/1) ... [2024-10-13 11:54:39,353 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@743d0309 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 11:54:39, skipping insertion in model container [2024-10-13 11:54:39,355 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 11:54:39" (1/1) ... [2024-10-13 11:54:39,398 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-13 11:54:39,875 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-13 11:54:39,888 INFO L197 MainTranslator]: Restarting translation with changed settings: SettingsChange [mNewPreferredMemoryModel=HoenickeLindenmann_1ByteResolution] [2024-10-13 11:54:39,905 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-13 11:54:39,990 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-13 11:54:39,995 INFO L200 MainTranslator]: Completed pre-run [2024-10-13 11:54:40,061 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-13 11:54:40,097 INFO L204 MainTranslator]: Completed translation [2024-10-13 11:54:40,097 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 11:54:40 WrapperNode [2024-10-13 11:54:40,098 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-13 11:54:40,098 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-13 11:54:40,099 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-13 11:54:40,099 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-13 11:54:40,104 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 11:54:40" (1/1) ... [2024-10-13 11:54:40,139 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 11:54:40" (1/1) ... [2024-10-13 11:54:40,202 INFO L138 Inliner]: procedures = 180, calls = 291, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 1037 [2024-10-13 11:54:40,203 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-13 11:54:40,203 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-13 11:54:40,203 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-13 11:54:40,203 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-13 11:54:40,217 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 11:54:40" (1/1) ... [2024-10-13 11:54:40,218 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 11:54:40" (1/1) ... [2024-10-13 11:54:40,227 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 11:54:40" (1/1) ... [2024-10-13 11:54:40,281 INFO L175 MemorySlicer]: Split 256 memory accesses to 3 slices as follows [2, 34, 220]. 86 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0, 0]. The 54 writes are split as follows [0, 4, 50]. [2024-10-13 11:54:40,281 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 11:54:40" (1/1) ... [2024-10-13 11:54:40,282 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 11:54:40" (1/1) ... [2024-10-13 11:54:40,313 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 11:54:40" (1/1) ... [2024-10-13 11:54:40,319 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 11:54:40" (1/1) ... [2024-10-13 11:54:40,323 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 11:54:40" (1/1) ... [2024-10-13 11:54:40,328 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 11:54:40" (1/1) ... [2024-10-13 11:54:40,336 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-13 11:54:40,338 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-13 11:54:40,338 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-13 11:54:40,338 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-13 11:54:40,341 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 11:54:40" (1/1) ... [2024-10-13 11:54:40,346 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-13 11:54:40,354 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 11:54:40,372 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-13 11:54:40,375 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-13 11:54:40,433 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2024-10-13 11:54:40,433 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2024-10-13 11:54:40,433 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#0 [2024-10-13 11:54:40,433 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#1 [2024-10-13 11:54:40,434 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#2 [2024-10-13 11:54:40,434 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#0 [2024-10-13 11:54:40,434 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#1 [2024-10-13 11:54:40,434 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#2 [2024-10-13 11:54:40,434 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2024-10-13 11:54:40,434 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2024-10-13 11:54:40,434 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#0 [2024-10-13 11:54:40,434 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#1 [2024-10-13 11:54:40,434 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#2 [2024-10-13 11:54:40,434 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#0 [2024-10-13 11:54:40,434 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#1 [2024-10-13 11:54:40,435 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#2 [2024-10-13 11:54:40,436 INFO L130 BoogieDeclarations]: Found specification of procedure test_int [2024-10-13 11:54:40,436 INFO L138 BoogieDeclarations]: Found implementation of procedure test_int [2024-10-13 11:54:40,436 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-10-13 11:54:40,436 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-13 11:54:40,436 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2024-10-13 11:54:40,436 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2024-10-13 11:54:40,436 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2024-10-13 11:54:40,436 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-10-13 11:54:40,436 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2024-10-13 11:54:40,436 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2024-10-13 11:54:40,436 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2024-10-13 11:54:40,436 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-10-13 11:54:40,437 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#0 [2024-10-13 11:54:40,437 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#1 [2024-10-13 11:54:40,437 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#2 [2024-10-13 11:54:40,437 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-10-13 11:54:40,437 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2024-10-13 11:54:40,437 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#2 [2024-10-13 11:54:40,437 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-13 11:54:40,438 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-13 11:54:40,610 INFO L238 CfgBuilder]: Building ICFG [2024-10-13 11:54:40,612 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-13 11:54:40,632 WARN L779 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2024-10-13 11:54:40,657 WARN L779 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2024-10-13 11:54:40,671 WARN L779 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2024-10-13 11:54:43,812 INFO L? ?]: Removed 1099 outVars from TransFormulas that were not future-live. [2024-10-13 11:54:43,812 INFO L287 CfgBuilder]: Performing block encoding [2024-10-13 11:54:43,981 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-13 11:54:43,981 INFO L314 CfgBuilder]: Removed 62 assume(true) statements. [2024-10-13 11:54:43,982 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 11:54:43 BoogieIcfgContainer [2024-10-13 11:54:43,982 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-13 11:54:43,987 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-13 11:54:43,987 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-13 11:54:43,990 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-13 11:54:43,990 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.10 11:54:39" (1/3) ... [2024-10-13 11:54:43,991 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1edb3a91 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 11:54:43, skipping insertion in model container [2024-10-13 11:54:43,991 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 11:54:40" (2/3) ... [2024-10-13 11:54:43,992 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1edb3a91 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 11:54:43, skipping insertion in model container [2024-10-13 11:54:43,992 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 11:54:43" (3/3) ... [2024-10-13 11:54:43,993 INFO L112 eAbstractionObserver]: Analyzing ICFG uthash_JEN_test8-1.i [2024-10-13 11:54:44,009 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-13 11:54:44,010 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 529 error locations. [2024-10-13 11:54:44,075 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-13 11:54:44,081 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;@4234baf6, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-13 11:54:44,081 INFO L334 AbstractCegarLoop]: Starting to check reachability of 529 error locations. [2024-10-13 11:54:44,087 INFO L276 IsEmpty]: Start isEmpty. Operand has 998 states, 445 states have (on average 2.4898876404494383) internal successors, (1108), 988 states have internal predecessors, (1108), 22 states have call successors, (22), 4 states have call predecessors, (22), 4 states have return successors, (22), 8 states have call predecessors, (22), 22 states have call successors, (22) [2024-10-13 11:54:44,092 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 3 [2024-10-13 11:54:44,092 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 11:54:44,093 INFO L215 NwaCegarLoop]: trace histogram [1, 1] [2024-10-13 11:54:44,093 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 526 more)] === [2024-10-13 11:54:44,097 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 11:54:44,097 INFO L85 PathProgramCache]: Analyzing trace with hash 60491, now seen corresponding path program 1 times [2024-10-13 11:54:44,106 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 11:54:44,107 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [720649636] [2024-10-13 11:54:44,107 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 11:54:44,107 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-13 11:54:44,107 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 11:54:44,110 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-13 11:54:44,111 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-13 11:54:44,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 11:54:44,234 INFO L255 TraceCheckSpWp]: Trace formula consists of 24 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-13 11:54:44,238 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 11:54:44,273 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-13 11:54:44,286 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-13 11:54:44,289 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-13 11:54:44,290 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 11:54:44,290 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [720649636] [2024-10-13 11:54:44,291 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [720649636] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 11:54:44,291 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 11:54:44,291 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-10-13 11:54:44,293 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1910810891] [2024-10-13 11:54:44,294 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 11:54:44,297 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 11:54:44,298 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 11:54:44,340 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 11:54:44,344 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 11:54:44,350 INFO L87 Difference]: Start difference. First operand has 998 states, 445 states have (on average 2.4898876404494383) internal successors, (1108), 988 states have internal predecessors, (1108), 22 states have call successors, (22), 4 states have call predecessors, (22), 4 states have return successors, (22), 8 states have call predecessors, (22), 22 states have call successors, (22) 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-13 11:54:45,687 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 11:54:45,687 INFO L93 Difference]: Finished difference Result 1001 states and 1088 transitions. [2024-10-13 11:54:45,688 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 11:54:45,689 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-13 11:54:45,690 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 11:54:45,723 INFO L225 Difference]: With dead ends: 1001 [2024-10-13 11:54:45,724 INFO L226 Difference]: Without dead ends: 1000 [2024-10-13 11:54:45,725 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-13 11:54:45,728 INFO L432 NwaCegarLoop]: 588 mSDtfsCounter, 871 mSDsluCounter, 122 mSDsCounter, 0 mSdLazyCounter, 564 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 875 SdHoareTripleChecker+Valid, 710 SdHoareTripleChecker+Invalid, 580 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 564 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2024-10-13 11:54:45,729 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [875 Valid, 710 Invalid, 580 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 564 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2024-10-13 11:54:45,753 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1000 states. [2024-10-13 11:54:45,835 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1000 to 988. [2024-10-13 11:54:45,837 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 988 states, 451 states have (on average 2.29490022172949) internal successors, (1035), 977 states have internal predecessors, (1035), 23 states have call successors, (23), 4 states have call predecessors, (23), 3 states have return successors, (21), 7 states have call predecessors, (21), 21 states have call successors, (21) [2024-10-13 11:54:45,841 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 988 states to 988 states and 1079 transitions. [2024-10-13 11:54:45,842 INFO L78 Accepts]: Start accepts. Automaton has 988 states and 1079 transitions. Word has length 2 [2024-10-13 11:54:45,843 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 11:54:45,843 INFO L471 AbstractCegarLoop]: Abstraction has 988 states and 1079 transitions. [2024-10-13 11:54:45,843 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-13 11:54:45,843 INFO L276 IsEmpty]: Start isEmpty. Operand 988 states and 1079 transitions. [2024-10-13 11:54:45,843 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 3 [2024-10-13 11:54:45,843 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 11:54:45,843 INFO L215 NwaCegarLoop]: trace histogram [1, 1] [2024-10-13 11:54:45,847 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 (2)] Forceful destruction successful, exit code 0 [2024-10-13 11:54:46,044 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-13 11:54:46,044 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 526 more)] === [2024-10-13 11:54:46,045 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 11:54:46,045 INFO L85 PathProgramCache]: Analyzing trace with hash 60492, now seen corresponding path program 1 times [2024-10-13 11:54:46,046 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 11:54:46,046 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [424708847] [2024-10-13 11:54:46,046 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 11:54:46,046 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-13 11:54:46,046 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 11:54:46,047 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-13 11:54:46,048 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-13 11:54:46,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 11:54:46,157 INFO L255 TraceCheckSpWp]: Trace formula consists of 24 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-10-13 11:54:46,159 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 11:54:46,164 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-13 11:54:46,173 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-13 11:54:46,174 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-13 11:54:46,174 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 11:54:46,174 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [424708847] [2024-10-13 11:54:46,174 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [424708847] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 11:54:46,174 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 11:54:46,174 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-10-13 11:54:46,174 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [666083910] [2024-10-13 11:54:46,175 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 11:54:46,175 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 11:54:46,175 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 11:54:46,176 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 11:54:46,176 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 11:54:46,176 INFO L87 Difference]: Start difference. First operand 988 states and 1079 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-13 11:54:48,009 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 11:54:48,009 INFO L93 Difference]: Finished difference Result 1354 states and 1477 transitions. [2024-10-13 11:54:48,011 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 11:54:48,011 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-13 11:54:48,011 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 11:54:48,015 INFO L225 Difference]: With dead ends: 1354 [2024-10-13 11:54:48,015 INFO L226 Difference]: Without dead ends: 1354 [2024-10-13 11:54:48,015 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-13 11:54:48,016 INFO L432 NwaCegarLoop]: 805 mSDtfsCounter, 394 mSDsluCounter, 541 mSDsCounter, 0 mSdLazyCounter, 772 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 395 SdHoareTripleChecker+Valid, 1346 SdHoareTripleChecker+Invalid, 778 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 772 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2024-10-13 11:54:48,016 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [395 Valid, 1346 Invalid, 778 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 772 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2024-10-13 11:54:48,019 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1354 states. [2024-10-13 11:54:48,039 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1354 to 1165. [2024-10-13 11:54:48,041 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1165 states, 628 states have (on average 2.2754777070063694) internal successors, (1429), 1153 states have internal predecessors, (1429), 24 states have call successors, (24), 4 states have call predecessors, (24), 3 states have return successors, (22), 8 states have call predecessors, (22), 22 states have call successors, (22) [2024-10-13 11:54:48,046 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1165 states to 1165 states and 1475 transitions. [2024-10-13 11:54:48,047 INFO L78 Accepts]: Start accepts. Automaton has 1165 states and 1475 transitions. Word has length 2 [2024-10-13 11:54:48,047 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 11:54:48,047 INFO L471 AbstractCegarLoop]: Abstraction has 1165 states and 1475 transitions. [2024-10-13 11:54:48,047 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-13 11:54:48,048 INFO L276 IsEmpty]: Start isEmpty. Operand 1165 states and 1475 transitions. [2024-10-13 11:54:48,048 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2024-10-13 11:54:48,048 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 11:54:48,049 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2024-10-13 11:54:48,055 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 (3)] Forceful destruction successful, exit code 0 [2024-10-13 11:54:48,249 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-13 11:54:48,249 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 526 more)] === [2024-10-13 11:54:48,250 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 11:54:48,250 INFO L85 PathProgramCache]: Analyzing trace with hash 33496533, now seen corresponding path program 1 times [2024-10-13 11:54:48,250 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 11:54:48,254 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [194376157] [2024-10-13 11:54:48,254 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 11:54:48,254 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-13 11:54:48,255 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 11:54:48,257 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-13 11:54:48,258 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-13 11:54:48,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 11:54:48,369 INFO L255 TraceCheckSpWp]: Trace formula consists of 61 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-10-13 11:54:48,371 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 11:54:48,381 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-13 11:54:48,389 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-13 11:54:48,457 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-13 11:54:48,458 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-13 11:54:48,473 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2024-10-13 11:54:48,474 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-13 11:54:48,497 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-13 11:54:48,497 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-13 11:54:48,497 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 11:54:48,497 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [194376157] [2024-10-13 11:54:48,497 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [194376157] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 11:54:48,497 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 11:54:48,498 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-13 11:54:48,498 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [186895178] [2024-10-13 11:54:48,498 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 11:54:48,498 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-13 11:54:48,498 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 11:54:48,499 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-13 11:54:48,499 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-13 11:54:48,499 INFO L87 Difference]: Start difference. First operand 1165 states and 1475 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-13 11:54:50,295 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 11:54:50,295 INFO L93 Difference]: Finished difference Result 1171 states and 1479 transitions. [2024-10-13 11:54:50,295 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-13 11:54:50,296 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-13 11:54:50,296 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 11:54:50,299 INFO L225 Difference]: With dead ends: 1171 [2024-10-13 11:54:50,300 INFO L226 Difference]: Without dead ends: 1171 [2024-10-13 11:54:50,300 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-13 11:54:50,302 INFO L432 NwaCegarLoop]: 324 mSDtfsCounter, 1838 mSDsluCounter, 95 mSDsCounter, 0 mSdLazyCounter, 829 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1844 SdHoareTripleChecker+Valid, 419 SdHoareTripleChecker+Invalid, 853 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 829 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2024-10-13 11:54:50,303 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1844 Valid, 419 Invalid, 853 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 829 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2024-10-13 11:54:50,308 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1171 states. [2024-10-13 11:54:50,324 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1171 to 976. [2024-10-13 11:54:50,326 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 976 states, 451 states have (on average 2.2660753880266076) internal successors, (1022), 965 states have internal predecessors, (1022), 23 states have call successors, (23), 4 states have call predecessors, (23), 3 states have return successors, (21), 7 states have call predecessors, (21), 21 states have call successors, (21) [2024-10-13 11:54:50,329 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 976 states to 976 states and 1066 transitions. [2024-10-13 11:54:50,330 INFO L78 Accepts]: Start accepts. Automaton has 976 states and 1066 transitions. Word has length 6 [2024-10-13 11:54:50,330 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 11:54:50,330 INFO L471 AbstractCegarLoop]: Abstraction has 976 states and 1066 transitions. [2024-10-13 11:54:50,330 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-13 11:54:50,330 INFO L276 IsEmpty]: Start isEmpty. Operand 976 states and 1066 transitions. [2024-10-13 11:54:50,332 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2024-10-13 11:54:50,332 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 11:54:50,332 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2024-10-13 11:54:50,337 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-13 11:54:50,532 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-13 11:54:50,533 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 526 more)] === [2024-10-13 11:54:50,533 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 11:54:50,533 INFO L85 PathProgramCache]: Analyzing trace with hash 1038392618, now seen corresponding path program 1 times [2024-10-13 11:54:50,533 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 11:54:50,534 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [501950805] [2024-10-13 11:54:50,534 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 11:54:50,534 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-13 11:54:50,534 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 11:54:50,538 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-13 11:54:50,539 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-13 11:54:50,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 11:54:50,631 INFO L255 TraceCheckSpWp]: Trace formula consists of 66 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-13 11:54:50,632 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 11:54:50,638 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-13 11:54:50,649 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-13 11:54:50,650 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-13 11:54:50,650 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 11:54:50,650 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [501950805] [2024-10-13 11:54:50,650 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [501950805] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 11:54:50,650 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 11:54:50,650 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-13 11:54:50,650 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [324531458] [2024-10-13 11:54:50,650 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 11:54:50,650 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 11:54:50,650 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 11:54:50,651 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 11:54:50,651 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 11:54:50,651 INFO L87 Difference]: Start difference. First operand 976 states and 1066 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-13 11:54:52,052 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 11:54:52,053 INFO L93 Difference]: Finished difference Result 1276 states and 1395 transitions. [2024-10-13 11:54:52,053 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 11:54:52,053 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-13 11:54:52,053 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 11:54:52,057 INFO L225 Difference]: With dead ends: 1276 [2024-10-13 11:54:52,057 INFO L226 Difference]: Without dead ends: 1276 [2024-10-13 11:54:52,058 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-13 11:54:52,059 INFO L432 NwaCegarLoop]: 839 mSDtfsCounter, 842 mSDsluCounter, 270 mSDsCounter, 0 mSdLazyCounter, 793 mSolverCounterSat, 52 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 847 SdHoareTripleChecker+Valid, 1109 SdHoareTripleChecker+Invalid, 845 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 52 IncrementalHoareTripleChecker+Valid, 793 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2024-10-13 11:54:52,059 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [847 Valid, 1109 Invalid, 845 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [52 Valid, 793 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2024-10-13 11:54:52,061 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1276 states. [2024-10-13 11:54:52,072 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1276 to 928. [2024-10-13 11:54:52,073 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 928 states, 451 states have (on average 2.1574279379157426) internal successors, (973), 917 states have internal predecessors, (973), 23 states have call successors, (23), 4 states have call predecessors, (23), 3 states have return successors, (21), 7 states have call predecessors, (21), 21 states have call successors, (21) [2024-10-13 11:54:52,075 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 928 states to 928 states and 1017 transitions. [2024-10-13 11:54:52,075 INFO L78 Accepts]: Start accepts. Automaton has 928 states and 1017 transitions. Word has length 7 [2024-10-13 11:54:52,075 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 11:54:52,075 INFO L471 AbstractCegarLoop]: Abstraction has 928 states and 1017 transitions. [2024-10-13 11:54:52,075 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-13 11:54:52,076 INFO L276 IsEmpty]: Start isEmpty. Operand 928 states and 1017 transitions. [2024-10-13 11:54:52,076 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2024-10-13 11:54:52,076 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 11:54:52,076 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2024-10-13 11:54:52,081 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Forceful destruction successful, exit code 0 [2024-10-13 11:54:52,278 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-13 11:54:52,278 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 526 more)] === [2024-10-13 11:54:52,279 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 11:54:52,279 INFO L85 PathProgramCache]: Analyzing trace with hash 1038392619, now seen corresponding path program 1 times [2024-10-13 11:54:52,279 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 11:54:52,279 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [911410137] [2024-10-13 11:54:52,279 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 11:54:52,279 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-13 11:54:52,279 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 11:54:52,282 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-13 11:54:52,282 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-13 11:54:52,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 11:54:52,364 INFO L255 TraceCheckSpWp]: Trace formula consists of 66 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-10-13 11:54:52,365 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 11:54:52,372 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-13 11:54:52,396 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-13 11:54:52,397 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-13 11:54:52,397 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 11:54:52,397 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [911410137] [2024-10-13 11:54:52,397 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [911410137] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 11:54:52,397 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 11:54:52,397 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-13 11:54:52,397 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [4513955] [2024-10-13 11:54:52,397 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 11:54:52,397 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 11:54:52,397 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 11:54:52,398 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 11:54:52,398 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 11:54:52,398 INFO L87 Difference]: Start difference. First operand 928 states and 1017 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-13 11:54:54,275 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 11:54:54,275 INFO L93 Difference]: Finished difference Result 1365 states and 1489 transitions. [2024-10-13 11:54:54,276 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 11:54:54,276 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-13 11:54:54,277 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 11:54:54,281 INFO L225 Difference]: With dead ends: 1365 [2024-10-13 11:54:54,281 INFO L226 Difference]: Without dead ends: 1365 [2024-10-13 11:54:54,281 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-13 11:54:54,282 INFO L432 NwaCegarLoop]: 1011 mSDtfsCounter, 635 mSDsluCounter, 412 mSDsCounter, 0 mSdLazyCounter, 797 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 637 SdHoareTripleChecker+Valid, 1423 SdHoareTripleChecker+Invalid, 812 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 797 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2024-10-13 11:54:54,283 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [637 Valid, 1423 Invalid, 812 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 797 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2024-10-13 11:54:54,285 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1365 states. [2024-10-13 11:54:54,296 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1365 to 1136. [2024-10-13 11:54:54,297 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1136 states, 667 states have (on average 2.151424287856072) internal successors, (1435), 1123 states have internal predecessors, (1435), 25 states have call successors, (25), 4 states have call predecessors, (25), 3 states have return successors, (23), 9 states have call predecessors, (23), 23 states have call successors, (23) [2024-10-13 11:54:54,300 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1136 states to 1136 states and 1483 transitions. [2024-10-13 11:54:54,300 INFO L78 Accepts]: Start accepts. Automaton has 1136 states and 1483 transitions. Word has length 7 [2024-10-13 11:54:54,300 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 11:54:54,301 INFO L471 AbstractCegarLoop]: Abstraction has 1136 states and 1483 transitions. [2024-10-13 11:54:54,301 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-13 11:54:54,301 INFO L276 IsEmpty]: Start isEmpty. Operand 1136 states and 1483 transitions. [2024-10-13 11:54:54,301 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2024-10-13 11:54:54,301 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 11:54:54,301 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 11:54:54,306 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Forceful destruction successful, exit code 0 [2024-10-13 11:54:54,502 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-13 11:54:54,502 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr527ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 526 more)] === [2024-10-13 11:54:54,503 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 11:54:54,503 INFO L85 PathProgramCache]: Analyzing trace with hash -2031260814, now seen corresponding path program 1 times [2024-10-13 11:54:54,503 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 11:54:54,503 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [187155187] [2024-10-13 11:54:54,503 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 11:54:54,503 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-13 11:54:54,503 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 11:54:54,505 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-13 11:54:54,506 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-13 11:54:54,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 11:54:54,636 INFO L255 TraceCheckSpWp]: Trace formula consists of 83 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-10-13 11:54:54,638 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 11:54:54,646 INFO L173 IndexEqualityManager]: detected equality via solver [2024-10-13 11:54:54,647 INFO L173 IndexEqualityManager]: detected equality via solver [2024-10-13 11:54:54,647 INFO L173 IndexEqualityManager]: detected equality via solver [2024-10-13 11:54:54,654 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-13 11:54:54,701 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-13 11:54:54,701 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-13 11:54:54,711 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-13 11:54:54,712 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-13 11:54:54,712 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 11:54:54,712 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [187155187] [2024-10-13 11:54:54,713 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [187155187] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 11:54:54,713 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 11:54:54,713 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-13 11:54:54,713 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1875913002] [2024-10-13 11:54:54,713 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 11:54:54,713 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-13 11:54:54,713 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 11:54:54,713 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-13 11:54:54,713 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-13 11:54:54,714 INFO L87 Difference]: Start difference. First operand 1136 states and 1483 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-13 11:54:55,839 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 11:54:55,839 INFO L93 Difference]: Finished difference Result 2218 states and 2885 transitions. [2024-10-13 11:54:55,840 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-13 11:54:55,840 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-13 11:54:55,840 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 11:54:55,845 INFO L225 Difference]: With dead ends: 2218 [2024-10-13 11:54:55,846 INFO L226 Difference]: Without dead ends: 2218 [2024-10-13 11:54:55,846 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 6 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-13 11:54:55,847 INFO L432 NwaCegarLoop]: 869 mSDtfsCounter, 898 mSDsluCounter, 1730 mSDsCounter, 0 mSdLazyCounter, 372 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 903 SdHoareTripleChecker+Valid, 2599 SdHoareTripleChecker+Invalid, 373 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 372 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2024-10-13 11:54:55,847 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [903 Valid, 2599 Invalid, 373 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 372 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2024-10-13 11:54:55,849 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2218 states. [2024-10-13 11:54:55,864 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2218 to 1138. [2024-10-13 11:54:55,866 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1138 states, 669 states have (on average 2.1479820627802693) internal successors, (1437), 1125 states have internal predecessors, (1437), 25 states have call successors, (25), 4 states have call predecessors, (25), 3 states have return successors, (23), 9 states have call predecessors, (23), 23 states have call successors, (23) [2024-10-13 11:54:55,870 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1138 states to 1138 states and 1485 transitions. [2024-10-13 11:54:55,870 INFO L78 Accepts]: Start accepts. Automaton has 1138 states and 1485 transitions. Word has length 9 [2024-10-13 11:54:55,870 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 11:54:55,870 INFO L471 AbstractCegarLoop]: Abstraction has 1138 states and 1485 transitions. [2024-10-13 11:54:55,871 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-13 11:54:55,871 INFO L276 IsEmpty]: Start isEmpty. Operand 1138 states and 1485 transitions. [2024-10-13 11:54:55,871 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2024-10-13 11:54:55,871 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 11:54:55,871 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 11:54:55,879 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-13 11:54:56,071 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-13 11:54:56,072 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 526 more)] === [2024-10-13 11:54:56,072 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 11:54:56,072 INFO L85 PathProgramCache]: Analyzing trace with hash -2109262366, now seen corresponding path program 1 times [2024-10-13 11:54:56,072 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 11:54:56,073 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [115877648] [2024-10-13 11:54:56,073 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 11:54:56,073 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-13 11:54:56,073 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 11:54:56,074 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-13 11:54:56,075 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-13 11:54:56,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 11:54:56,191 INFO L255 TraceCheckSpWp]: Trace formula consists of 129 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-13 11:54:56,192 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 11:54:56,203 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-13 11:54:56,203 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-13 11:54:56,203 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 11:54:56,203 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [115877648] [2024-10-13 11:54:56,203 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [115877648] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 11:54:56,203 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 11:54:56,203 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-13 11:54:56,204 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [180936721] [2024-10-13 11:54:56,204 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 11:54:56,204 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 11:54:56,204 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 11:54:56,204 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 11:54:56,204 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 11:54:56,204 INFO L87 Difference]: Start difference. First operand 1138 states and 1485 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-13 11:54:56,671 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 11:54:56,671 INFO L93 Difference]: Finished difference Result 1099 states and 1445 transitions. [2024-10-13 11:54:56,673 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 11:54:56,673 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-13 11:54:56,673 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 11:54:56,676 INFO L225 Difference]: With dead ends: 1099 [2024-10-13 11:54:56,676 INFO L226 Difference]: Without dead ends: 1099 [2024-10-13 11:54:56,676 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-13 11:54:56,677 INFO L432 NwaCegarLoop]: 842 mSDtfsCounter, 61 mSDsluCounter, 800 mSDsCounter, 0 mSdLazyCounter, 198 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 61 SdHoareTripleChecker+Valid, 1642 SdHoareTripleChecker+Invalid, 198 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 198 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-10-13 11:54:56,677 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [61 Valid, 1642 Invalid, 198 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 198 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-10-13 11:54:56,679 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1099 states. [2024-10-13 11:54:56,688 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1099 to 1099. [2024-10-13 11:54:56,690 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1099 states, 654 states have (on average 2.136085626911315) internal successors, (1397), 1086 states have internal predecessors, (1397), 25 states have call successors, (25), 4 states have call predecessors, (25), 3 states have return successors, (23), 9 states have call predecessors, (23), 23 states have call successors, (23) [2024-10-13 11:54:56,692 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1099 states to 1099 states and 1445 transitions. [2024-10-13 11:54:56,692 INFO L78 Accepts]: Start accepts. Automaton has 1099 states and 1445 transitions. Word has length 15 [2024-10-13 11:54:56,692 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 11:54:56,693 INFO L471 AbstractCegarLoop]: Abstraction has 1099 states and 1445 transitions. [2024-10-13 11:54:56,693 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-13 11:54:56,693 INFO L276 IsEmpty]: Start isEmpty. Operand 1099 states and 1445 transitions. [2024-10-13 11:54:56,693 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2024-10-13 11:54:56,693 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 11:54:56,693 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 11:54:56,699 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-13 11:54:56,894 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-13 11:54:56,894 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr38REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 526 more)] === [2024-10-13 11:54:56,894 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 11:54:56,894 INFO L85 PathProgramCache]: Analyzing trace with hash 223429275, now seen corresponding path program 1 times [2024-10-13 11:54:56,895 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 11:54:56,895 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1668850921] [2024-10-13 11:54:56,895 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 11:54:56,895 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-13 11:54:56,895 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 11:54:56,896 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-13 11:54:56,897 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-13 11:54:57,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 11:54:57,016 INFO L255 TraceCheckSpWp]: Trace formula consists of 132 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-13 11:54:57,017 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 11:54:57,033 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-13 11:54:57,033 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-13 11:54:57,034 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 11:54:57,034 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1668850921] [2024-10-13 11:54:57,034 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1668850921] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 11:54:57,034 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 11:54:57,034 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-13 11:54:57,034 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [922755823] [2024-10-13 11:54:57,034 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 11:54:57,034 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-13 11:54:57,034 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 11:54:57,035 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-13 11:54:57,035 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-13 11:54:57,035 INFO L87 Difference]: Start difference. First operand 1099 states and 1445 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-13 11:54:57,544 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 11:54:57,544 INFO L93 Difference]: Finished difference Result 1084 states and 1423 transitions. [2024-10-13 11:54:57,545 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-13 11:54:57,545 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-13 11:54:57,545 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 11:54:57,547 INFO L225 Difference]: With dead ends: 1084 [2024-10-13 11:54:57,547 INFO L226 Difference]: Without dead ends: 1084 [2024-10-13 11:54:57,548 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-13 11:54:57,548 INFO L432 NwaCegarLoop]: 811 mSDtfsCounter, 45 mSDsluCounter, 1604 mSDsCounter, 0 mSdLazyCounter, 303 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 45 SdHoareTripleChecker+Valid, 2415 SdHoareTripleChecker+Invalid, 324 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 303 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-10-13 11:54:57,548 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [45 Valid, 2415 Invalid, 324 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 303 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-10-13 11:54:57,549 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1084 states. [2024-10-13 11:54:57,559 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1084 to 1084. [2024-10-13 11:54:57,560 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1084 states, 653 states have (on average 2.105666156202144) internal successors, (1375), 1071 states have internal predecessors, (1375), 25 states have call successors, (25), 4 states have call predecessors, (25), 3 states have return successors, (23), 9 states have call predecessors, (23), 23 states have call successors, (23) [2024-10-13 11:54:57,563 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1084 states to 1084 states and 1423 transitions. [2024-10-13 11:54:57,563 INFO L78 Accepts]: Start accepts. Automaton has 1084 states and 1423 transitions. Word has length 17 [2024-10-13 11:54:57,563 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 11:54:57,563 INFO L471 AbstractCegarLoop]: Abstraction has 1084 states and 1423 transitions. [2024-10-13 11:54:57,563 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-13 11:54:57,563 INFO L276 IsEmpty]: Start isEmpty. Operand 1084 states and 1423 transitions. [2024-10-13 11:54:57,564 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2024-10-13 11:54:57,564 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 11:54:57,564 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-13 11:54:57,570 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Forceful destruction successful, exit code 0 [2024-10-13 11:54:57,765 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-13 11:54:57,765 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr52REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 526 more)] === [2024-10-13 11:54:57,765 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 11:54:57,766 INFO L85 PathProgramCache]: Analyzing trace with hash 553507241, now seen corresponding path program 1 times [2024-10-13 11:54:57,766 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 11:54:57,766 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1465170475] [2024-10-13 11:54:57,766 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 11:54:57,766 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-13 11:54:57,766 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 11:54:57,768 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-13 11:54:57,769 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-13 11:54:57,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 11:54:57,882 INFO L255 TraceCheckSpWp]: Trace formula consists of 146 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-10-13 11:54:57,884 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 11:54:57,888 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-13 11:54:57,941 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-13 11:54:57,941 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-13 11:54:57,941 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 11:54:57,941 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1465170475] [2024-10-13 11:54:57,941 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1465170475] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 11:54:57,941 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 11:54:57,941 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-13 11:54:57,941 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1968451853] [2024-10-13 11:54:57,941 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 11:54:57,942 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-13 11:54:57,942 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 11:54:57,942 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-13 11:54:57,942 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-13 11:54:57,942 INFO L87 Difference]: Start difference. First operand 1084 states and 1423 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-13 11:54:59,238 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 11:54:59,238 INFO L93 Difference]: Finished difference Result 1097 states and 1439 transitions. [2024-10-13 11:54:59,238 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-13 11:54:59,239 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-13 11:54:59,239 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 11:54:59,241 INFO L225 Difference]: With dead ends: 1097 [2024-10-13 11:54:59,241 INFO L226 Difference]: Without dead ends: 1097 [2024-10-13 11:54:59,242 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-13 11:54:59,242 INFO L432 NwaCegarLoop]: 471 mSDtfsCounter, 784 mSDsluCounter, 498 mSDsCounter, 0 mSdLazyCounter, 1003 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 789 SdHoareTripleChecker+Valid, 969 SdHoareTripleChecker+Invalid, 1011 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 1003 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2024-10-13 11:54:59,242 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [789 Valid, 969 Invalid, 1011 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 1003 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2024-10-13 11:54:59,243 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1097 states. [2024-10-13 11:54:59,252 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1097 to 1080. [2024-10-13 11:54:59,253 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1080 states, 653 states have (on average 2.099540581929556) internal successors, (1371), 1067 states have internal predecessors, (1371), 25 states have call successors, (25), 4 states have call predecessors, (25), 3 states have return successors, (23), 9 states have call predecessors, (23), 23 states have call successors, (23) [2024-10-13 11:54:59,255 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1080 states to 1080 states and 1419 transitions. [2024-10-13 11:54:59,256 INFO L78 Accepts]: Start accepts. Automaton has 1080 states and 1419 transitions. Word has length 31 [2024-10-13 11:54:59,256 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 11:54:59,256 INFO L471 AbstractCegarLoop]: Abstraction has 1080 states and 1419 transitions. [2024-10-13 11:54:59,256 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-13 11:54:59,256 INFO L276 IsEmpty]: Start isEmpty. Operand 1080 states and 1419 transitions. [2024-10-13 11:54:59,257 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2024-10-13 11:54:59,257 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 11:54:59,257 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-13 11:54:59,264 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-13 11:54:59,457 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-13 11:54:59,457 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr53REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 526 more)] === [2024-10-13 11:54:59,458 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 11:54:59,458 INFO L85 PathProgramCache]: Analyzing trace with hash 553507242, now seen corresponding path program 1 times [2024-10-13 11:54:59,458 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 11:54:59,458 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1231206502] [2024-10-13 11:54:59,458 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 11:54:59,458 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-13 11:54:59,458 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 11:54:59,461 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-13 11:54:59,463 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-13 11:54:59,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 11:54:59,595 INFO L255 TraceCheckSpWp]: Trace formula consists of 146 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-10-13 11:54:59,597 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 11:54:59,608 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-13 11:54:59,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-13 11:54:59,747 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-13 11:54:59,748 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 11:54:59,748 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1231206502] [2024-10-13 11:54:59,748 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1231206502] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 11:54:59,748 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 11:54:59,748 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-13 11:54:59,748 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [928695068] [2024-10-13 11:54:59,748 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 11:54:59,748 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-13 11:54:59,748 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 11:54:59,749 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-13 11:54:59,749 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-13 11:54:59,749 INFO L87 Difference]: Start difference. First operand 1080 states and 1419 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-13 11:55:01,688 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 11:55:01,688 INFO L93 Difference]: Finished difference Result 1309 states and 1425 transitions. [2024-10-13 11:55:01,689 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-13 11:55:01,690 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-13 11:55:01,690 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 11:55:01,693 INFO L225 Difference]: With dead ends: 1309 [2024-10-13 11:55:01,693 INFO L226 Difference]: Without dead ends: 1309 [2024-10-13 11:55:01,693 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-13 11:55:01,694 INFO L432 NwaCegarLoop]: 615 mSDtfsCounter, 573 mSDsluCounter, 840 mSDsCounter, 0 mSdLazyCounter, 1175 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 575 SdHoareTripleChecker+Valid, 1455 SdHoareTripleChecker+Invalid, 1178 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 1175 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2024-10-13 11:55:01,694 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [575 Valid, 1455 Invalid, 1178 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 1175 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2024-10-13 11:55:01,695 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1309 states. [2024-10-13 11:55:01,705 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1309 to 1076. [2024-10-13 11:55:01,706 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1076 states, 653 states have (on average 2.0934150076569678) internal successors, (1367), 1063 states have internal predecessors, (1367), 25 states have call successors, (25), 4 states have call predecessors, (25), 3 states have return successors, (23), 9 states have call predecessors, (23), 23 states have call successors, (23) [2024-10-13 11:55:01,709 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1076 states to 1076 states and 1415 transitions. [2024-10-13 11:55:01,710 INFO L78 Accepts]: Start accepts. Automaton has 1076 states and 1415 transitions. Word has length 31 [2024-10-13 11:55:01,710 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 11:55:01,710 INFO L471 AbstractCegarLoop]: Abstraction has 1076 states and 1415 transitions. [2024-10-13 11:55:01,710 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-13 11:55:01,710 INFO L276 IsEmpty]: Start isEmpty. Operand 1076 states and 1415 transitions. [2024-10-13 11:55:01,712 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2024-10-13 11:55:01,713 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 11:55:01,713 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-13 11:55:01,721 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-13 11:55:01,916 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-13 11:55:01,917 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr117REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 526 more)] === [2024-10-13 11:55:01,918 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 11:55:01,918 INFO L85 PathProgramCache]: Analyzing trace with hash -1433991645, now seen corresponding path program 1 times [2024-10-13 11:55:01,918 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 11:55:01,918 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [944012757] [2024-10-13 11:55:01,918 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 11:55:01,918 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-13 11:55:01,918 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 11:55:01,921 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-13 11:55:01,922 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-13 11:55:02,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 11:55:02,096 INFO L255 TraceCheckSpWp]: Trace formula consists of 218 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-13 11:55:02,098 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 11:55:02,137 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 11:55:02,138 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-13 11:55:02,138 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 11:55:02,138 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [944012757] [2024-10-13 11:55:02,138 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [944012757] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 11:55:02,138 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 11:55:02,138 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-13 11:55:02,138 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1424749726] [2024-10-13 11:55:02,138 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 11:55:02,139 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-13 11:55:02,139 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 11:55:02,139 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-13 11:55:02,139 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-13 11:55:02,139 INFO L87 Difference]: Start difference. First operand 1076 states and 1415 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-13 11:55:02,755 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 11:55:02,755 INFO L93 Difference]: Finished difference Result 1070 states and 1405 transitions. [2024-10-13 11:55:02,756 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-13 11:55:02,756 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-13 11:55:02,757 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 11:55:02,759 INFO L225 Difference]: With dead ends: 1070 [2024-10-13 11:55:02,759 INFO L226 Difference]: Without dead ends: 1070 [2024-10-13 11:55:02,759 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-13 11:55:02,760 INFO L432 NwaCegarLoop]: 805 mSDtfsCounter, 15 mSDsluCounter, 1593 mSDsCounter, 0 mSdLazyCounter, 300 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 2398 SdHoareTripleChecker+Invalid, 306 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 300 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-10-13 11:55:02,761 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 2398 Invalid, 306 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 300 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-10-13 11:55:02,762 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1070 states. [2024-10-13 11:55:02,771 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1070 to 1070. [2024-10-13 11:55:02,773 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1070 states, 647 states have (on average 2.097372488408037) internal successors, (1357), 1057 states have internal predecessors, (1357), 25 states have call successors, (25), 4 states have call predecessors, (25), 3 states have return successors, (23), 9 states have call predecessors, (23), 23 states have call successors, (23) [2024-10-13 11:55:02,776 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1070 states to 1070 states and 1405 transitions. [2024-10-13 11:55:02,776 INFO L78 Accepts]: Start accepts. Automaton has 1070 states and 1405 transitions. Word has length 47 [2024-10-13 11:55:02,776 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 11:55:02,776 INFO L471 AbstractCegarLoop]: Abstraction has 1070 states and 1405 transitions. [2024-10-13 11:55:02,776 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-13 11:55:02,777 INFO L276 IsEmpty]: Start isEmpty. Operand 1070 states and 1405 transitions. [2024-10-13 11:55:02,778 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2024-10-13 11:55:02,778 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 11:55:02,778 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-13 11:55:02,784 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-13 11:55:02,979 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-13 11:55:02,979 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr117REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 526 more)] === [2024-10-13 11:55:02,980 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 11:55:02,980 INFO L85 PathProgramCache]: Analyzing trace with hash -621555131, now seen corresponding path program 1 times [2024-10-13 11:55:02,980 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 11:55:02,980 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1250483166] [2024-10-13 11:55:02,980 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 11:55:02,980 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-13 11:55:02,981 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 11:55:02,983 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-13 11:55:02,984 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-13 11:55:03,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 11:55:03,168 INFO L255 TraceCheckSpWp]: Trace formula consists of 238 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-13 11:55:03,170 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 11:55:03,365 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-13 11:55:03,365 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-13 11:55:03,365 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 11:55:03,365 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1250483166] [2024-10-13 11:55:03,365 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1250483166] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 11:55:03,365 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 11:55:03,365 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-13 11:55:03,366 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1863390052] [2024-10-13 11:55:03,366 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 11:55:03,366 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 11:55:03,366 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 11:55:03,366 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 11:55:03,366 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 11:55:03,367 INFO L87 Difference]: Start difference. First operand 1070 states and 1405 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-13 11:55:04,087 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 11:55:04,088 INFO L93 Difference]: Finished difference Result 1525 states and 2073 transitions. [2024-10-13 11:55:04,088 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 11:55:04,088 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-13 11:55:04,089 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 11:55:04,093 INFO L225 Difference]: With dead ends: 1525 [2024-10-13 11:55:04,093 INFO L226 Difference]: Without dead ends: 1525 [2024-10-13 11:55:04,094 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-13 11:55:04,095 INFO L432 NwaCegarLoop]: 984 mSDtfsCounter, 287 mSDsluCounter, 745 mSDsCounter, 0 mSdLazyCounter, 317 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 288 SdHoareTripleChecker+Valid, 1729 SdHoareTripleChecker+Invalid, 320 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 317 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-10-13 11:55:04,095 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [288 Valid, 1729 Invalid, 320 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 317 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-10-13 11:55:04,096 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1525 states. [2024-10-13 11:55:04,114 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1525 to 1378. [2024-10-13 11:55:04,116 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1378 states, 953 states have (on average 2.079748163693599) internal successors, (1982), 1363 states have internal predecessors, (1982), 27 states have call successors, (27), 4 states have call predecessors, (27), 3 states have return successors, (25), 11 states have call predecessors, (25), 25 states have call successors, (25) [2024-10-13 11:55:04,120 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1378 states to 1378 states and 2034 transitions. [2024-10-13 11:55:04,121 INFO L78 Accepts]: Start accepts. Automaton has 1378 states and 2034 transitions. Word has length 51 [2024-10-13 11:55:04,121 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 11:55:04,121 INFO L471 AbstractCegarLoop]: Abstraction has 1378 states and 2034 transitions. [2024-10-13 11:55:04,121 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-13 11:55:04,121 INFO L276 IsEmpty]: Start isEmpty. Operand 1378 states and 2034 transitions. [2024-10-13 11:55:04,122 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2024-10-13 11:55:04,122 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 11:55:04,122 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-13 11:55:04,132 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-13 11:55:04,323 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-13 11:55:04,323 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr71REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 526 more)] === [2024-10-13 11:55:04,323 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 11:55:04,324 INFO L85 PathProgramCache]: Analyzing trace with hash -1252239301, now seen corresponding path program 1 times [2024-10-13 11:55:04,324 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 11:55:04,324 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [249664730] [2024-10-13 11:55:04,324 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 11:55:04,324 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-13 11:55:04,324 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 11:55:04,325 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-13 11:55:04,326 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-13 11:55:04,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 11:55:04,596 INFO L255 TraceCheckSpWp]: Trace formula consists of 273 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-10-13 11:55:04,598 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 11:55:04,605 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-13 11:55:04,610 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-13 11:55:04,994 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-13 11:55:04,994 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-13 11:55:05,006 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2024-10-13 11:55:05,007 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-13 11:55:05,016 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-13 11:55:05,017 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-13 11:55:05,017 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 11:55:05,017 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [249664730] [2024-10-13 11:55:05,017 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [249664730] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 11:55:05,018 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 11:55:05,018 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-13 11:55:05,018 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1595228471] [2024-10-13 11:55:05,018 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 11:55:05,019 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-13 11:55:05,019 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 11:55:05,019 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-13 11:55:05,019 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-13 11:55:05,019 INFO L87 Difference]: Start difference. First operand 1378 states and 2034 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-13 11:55:06,162 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 11:55:06,162 INFO L93 Difference]: Finished difference Result 1351 states and 2008 transitions. [2024-10-13 11:55:06,162 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-13 11:55:06,162 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-13 11:55:06,162 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 11:55:06,169 INFO L225 Difference]: With dead ends: 1351 [2024-10-13 11:55:06,169 INFO L226 Difference]: Without dead ends: 1351 [2024-10-13 11:55:06,169 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-13 11:55:06,169 INFO L432 NwaCegarLoop]: 288 mSDtfsCounter, 1448 mSDsluCounter, 79 mSDsCounter, 0 mSdLazyCounter, 619 mSolverCounterSat, 51 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1453 SdHoareTripleChecker+Valid, 367 SdHoareTripleChecker+Invalid, 670 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 51 IncrementalHoareTripleChecker+Valid, 619 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2024-10-13 11:55:06,169 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1453 Valid, 367 Invalid, 670 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [51 Valid, 619 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2024-10-13 11:55:06,170 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1351 states. [2024-10-13 11:55:06,182 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1351 to 989. [2024-10-13 11:55:06,183 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 989 states, 607 states have (on average 1.942339373970346) internal successors, (1179), 977 states have internal predecessors, (1179), 24 states have call successors, (24), 4 states have call predecessors, (24), 3 states have return successors, (22), 8 states have call predecessors, (22), 22 states have call successors, (22) [2024-10-13 11:55:06,184 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 989 states to 989 states and 1225 transitions. [2024-10-13 11:55:06,185 INFO L78 Accepts]: Start accepts. Automaton has 989 states and 1225 transitions. Word has length 54 [2024-10-13 11:55:06,185 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 11:55:06,185 INFO L471 AbstractCegarLoop]: Abstraction has 989 states and 1225 transitions. [2024-10-13 11:55:06,185 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-13 11:55:06,185 INFO L276 IsEmpty]: Start isEmpty. Operand 989 states and 1225 transitions. [2024-10-13 11:55:06,187 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2024-10-13 11:55:06,187 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 11:55:06,187 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-13 11:55:06,196 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (14)] Ended with exit code 0 [2024-10-13 11:55:06,387 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-13 11:55:06,388 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr76REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 526 more)] === [2024-10-13 11:55:06,389 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 11:55:06,389 INFO L85 PathProgramCache]: Analyzing trace with hash -780752689, now seen corresponding path program 1 times [2024-10-13 11:55:06,389 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 11:55:06,389 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1036330353] [2024-10-13 11:55:06,389 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 11:55:06,390 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-13 11:55:06,390 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 11:55:06,392 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-13 11:55:06,393 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-13 11:55:06,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 11:55:06,601 INFO L255 TraceCheckSpWp]: Trace formula consists of 299 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-10-13 11:55:06,603 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 11:55:06,609 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-13 11:55:06,626 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-13 11:55:06,641 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-13 11:55:06,647 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-13 11:55:06,647 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-13 11:55:06,647 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 11:55:06,647 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1036330353] [2024-10-13 11:55:06,648 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1036330353] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 11:55:06,648 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 11:55:06,648 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-13 11:55:06,648 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [639637559] [2024-10-13 11:55:06,648 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 11:55:06,648 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-13 11:55:06,648 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 11:55:06,648 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-13 11:55:06,648 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-13 11:55:06,649 INFO L87 Difference]: Start difference. First operand 989 states and 1225 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-13 11:55:08,163 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 11:55:08,164 INFO L93 Difference]: Finished difference Result 988 states and 1224 transitions. [2024-10-13 11:55:08,164 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-13 11:55:08,164 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-13 11:55:08,164 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 11:55:08,167 INFO L225 Difference]: With dead ends: 988 [2024-10-13 11:55:08,167 INFO L226 Difference]: Without dead ends: 988 [2024-10-13 11:55:08,167 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-13 11:55:08,167 INFO L432 NwaCegarLoop]: 777 mSDtfsCounter, 2 mSDsluCounter, 1329 mSDsCounter, 0 mSdLazyCounter, 1366 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 2106 SdHoareTripleChecker+Invalid, 1367 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 1366 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2024-10-13 11:55:08,168 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 2106 Invalid, 1367 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 1366 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2024-10-13 11:55:08,169 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 988 states. [2024-10-13 11:55:08,176 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 988 to 988. [2024-10-13 11:55:08,177 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 988 states, 607 states have (on average 1.9406919275123558) internal successors, (1178), 976 states have internal predecessors, (1178), 24 states have call successors, (24), 4 states have call predecessors, (24), 3 states have return successors, (22), 8 states have call predecessors, (22), 22 states have call successors, (22) [2024-10-13 11:55:08,178 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 988 states to 988 states and 1224 transitions. [2024-10-13 11:55:08,179 INFO L78 Accepts]: Start accepts. Automaton has 988 states and 1224 transitions. Word has length 58 [2024-10-13 11:55:08,179 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 11:55:08,179 INFO L471 AbstractCegarLoop]: Abstraction has 988 states and 1224 transitions. [2024-10-13 11:55:08,179 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-13 11:55:08,179 INFO L276 IsEmpty]: Start isEmpty. Operand 988 states and 1224 transitions. [2024-10-13 11:55:08,180 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2024-10-13 11:55:08,180 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 11:55:08,180 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-13 11:55:08,188 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (15)] Ended with exit code 0 [2024-10-13 11:55:08,380 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-13 11:55:08,381 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr77REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 526 more)] === [2024-10-13 11:55:08,381 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 11:55:08,381 INFO L85 PathProgramCache]: Analyzing trace with hash -780752688, now seen corresponding path program 1 times [2024-10-13 11:55:08,381 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 11:55:08,381 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1086357023] [2024-10-13 11:55:08,382 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 11:55:08,382 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-13 11:55:08,382 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 11:55:08,383 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-13 11:55:08,383 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-13 11:55:08,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 11:55:08,619 INFO L255 TraceCheckSpWp]: Trace formula consists of 299 conjuncts, 10 conjuncts are in the unsatisfiable core [2024-10-13 11:55:08,621 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 11:55:08,631 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-13 11:55:08,645 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-13 11:55:08,654 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-13 11:55:08,688 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-13 11:55:08,701 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-13 11:55:08,701 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-13 11:55:08,701 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 11:55:08,701 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1086357023] [2024-10-13 11:55:08,701 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1086357023] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 11:55:08,701 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 11:55:08,701 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-13 11:55:08,701 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2138124173] [2024-10-13 11:55:08,701 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 11:55:08,701 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-13 11:55:08,702 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 11:55:08,702 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-13 11:55:08,702 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-13 11:55:08,702 INFO L87 Difference]: Start difference. First operand 988 states and 1224 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-13 11:55:10,682 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 11:55:10,682 INFO L93 Difference]: Finished difference Result 987 states and 1223 transitions. [2024-10-13 11:55:10,684 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-13 11:55:10,684 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-13 11:55:10,684 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 11:55:10,686 INFO L225 Difference]: With dead ends: 987 [2024-10-13 11:55:10,686 INFO L226 Difference]: Without dead ends: 987 [2024-10-13 11:55:10,687 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-13 11:55:10,688 INFO L432 NwaCegarLoop]: 777 mSDtfsCounter, 1 mSDsluCounter, 1369 mSDsCounter, 0 mSdLazyCounter, 1323 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 2146 SdHoareTripleChecker+Invalid, 1324 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 1323 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2024-10-13 11:55:10,688 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 2146 Invalid, 1324 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 1323 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2024-10-13 11:55:10,689 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 987 states. [2024-10-13 11:55:10,697 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 987 to 987. [2024-10-13 11:55:10,698 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 987 states, 606 states have (on average 1.9422442244224423) internal successors, (1177), 975 states have internal predecessors, (1177), 24 states have call successors, (24), 4 states have call predecessors, (24), 3 states have return successors, (22), 8 states have call predecessors, (22), 22 states have call successors, (22) [2024-10-13 11:55:10,699 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 987 states to 987 states and 1223 transitions. [2024-10-13 11:55:10,699 INFO L78 Accepts]: Start accepts. Automaton has 987 states and 1223 transitions. Word has length 58 [2024-10-13 11:55:10,700 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 11:55:10,700 INFO L471 AbstractCegarLoop]: Abstraction has 987 states and 1223 transitions. [2024-10-13 11:55:10,700 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-13 11:55:10,700 INFO L276 IsEmpty]: Start isEmpty. Operand 987 states and 1223 transitions. [2024-10-13 11:55:10,701 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2024-10-13 11:55:10,701 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 11:55:10,701 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-13 11:55:10,709 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 (16)] Forceful destruction successful, exit code 0 [2024-10-13 11:55:10,901 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-13 11:55:10,902 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr80REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 526 more)] === [2024-10-13 11:55:10,902 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 11:55:10,902 INFO L85 PathProgramCache]: Analyzing trace with hash -1640083757, now seen corresponding path program 1 times [2024-10-13 11:55:10,902 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 11:55:10,902 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1093362873] [2024-10-13 11:55:10,903 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 11:55:10,903 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-13 11:55:10,903 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 11:55:10,904 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-13 11:55:10,904 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-13 11:55:11,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 11:55:11,127 INFO L255 TraceCheckSpWp]: Trace formula consists of 325 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-13 11:55:11,128 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 11:55:11,145 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-13 11:55:11,145 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-13 11:55:11,145 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 11:55:11,145 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1093362873] [2024-10-13 11:55:11,146 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1093362873] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 11:55:11,146 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 11:55:11,146 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-13 11:55:11,146 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1276445913] [2024-10-13 11:55:11,146 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 11:55:11,146 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-13 11:55:11,146 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 11:55:11,147 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-13 11:55:11,147 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-13 11:55:11,147 INFO L87 Difference]: Start difference. First operand 987 states and 1223 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-13 11:55:11,714 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 11:55:11,714 INFO L93 Difference]: Finished difference Result 989 states and 1226 transitions. [2024-10-13 11:55:11,715 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-13 11:55:11,715 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-13 11:55:11,716 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 11:55:11,719 INFO L225 Difference]: With dead ends: 989 [2024-10-13 11:55:11,719 INFO L226 Difference]: Without dead ends: 989 [2024-10-13 11:55:11,719 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-13 11:55:11,720 INFO L432 NwaCegarLoop]: 777 mSDtfsCounter, 0 mSDsluCounter, 1551 mSDsCounter, 0 mSdLazyCounter, 278 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 2328 SdHoareTripleChecker+Invalid, 279 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 278 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-10-13 11:55:11,720 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 2328 Invalid, 279 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 278 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-10-13 11:55:11,721 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 989 states. [2024-10-13 11:55:11,731 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 989 to 989. [2024-10-13 11:55:11,732 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 989 states, 607 states have (on average 1.942339373970346) internal successors, (1179), 977 states have internal predecessors, (1179), 24 states have call successors, (24), 4 states have call predecessors, (24), 4 states have return successors, (23), 8 states have call predecessors, (23), 22 states have call successors, (23) [2024-10-13 11:55:11,733 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 989 states to 989 states and 1226 transitions. [2024-10-13 11:55:11,733 INFO L78 Accepts]: Start accepts. Automaton has 989 states and 1226 transitions. Word has length 64 [2024-10-13 11:55:11,734 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 11:55:11,734 INFO L471 AbstractCegarLoop]: Abstraction has 989 states and 1226 transitions. [2024-10-13 11:55:11,734 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-13 11:55:11,734 INFO L276 IsEmpty]: Start isEmpty. Operand 989 states and 1226 transitions. [2024-10-13 11:55:11,734 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2024-10-13 11:55:11,734 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 11:55:11,734 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-13 11:55:11,744 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-13 11:55:11,935 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-13 11:55:11,935 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr80REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 526 more)] === [2024-10-13 11:55:11,935 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 11:55:11,935 INFO L85 PathProgramCache]: Analyzing trace with hash 1189888449, now seen corresponding path program 1 times [2024-10-13 11:55:11,936 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 11:55:11,936 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [274010861] [2024-10-13 11:55:11,936 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 11:55:11,936 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-13 11:55:11,936 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 11:55:11,939 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-13 11:55:11,940 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-13 11:55:12,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 11:55:12,173 INFO L255 TraceCheckSpWp]: Trace formula consists of 336 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-10-13 11:55:12,175 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 11:55:12,196 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-13 11:55:12,196 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-13 11:55:12,245 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-13 11:55:12,245 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 11:55:12,246 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [274010861] [2024-10-13 11:55:12,246 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [274010861] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-13 11:55:12,246 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-13 11:55:12,246 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 8 [2024-10-13 11:55:12,246 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1641577195] [2024-10-13 11:55:12,246 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-13 11:55:12,246 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-13 11:55:12,246 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 11:55:12,247 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-13 11:55:12,247 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2024-10-13 11:55:12,247 INFO L87 Difference]: Start difference. First operand 989 states and 1226 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-13 11:55:13,059 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 11:55:13,059 INFO L93 Difference]: Finished difference Result 998 states and 1240 transitions. [2024-10-13 11:55:13,060 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-10-13 11:55:13,060 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-13 11:55:13,061 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 11:55:13,063 INFO L225 Difference]: With dead ends: 998 [2024-10-13 11:55:13,063 INFO L226 Difference]: Without dead ends: 998 [2024-10-13 11:55:13,063 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 131 GetRequests, 122 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=44, Invalid=66, Unknown=0, NotChecked=0, Total=110 [2024-10-13 11:55:13,064 INFO L432 NwaCegarLoop]: 776 mSDtfsCounter, 4 mSDsluCounter, 2323 mSDsCounter, 0 mSdLazyCounter, 406 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 3099 SdHoareTripleChecker+Invalid, 413 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 406 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-10-13 11:55:13,064 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 3099 Invalid, 413 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 406 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-10-13 11:55:13,065 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 998 states. [2024-10-13 11:55:13,072 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 998 to 997. [2024-10-13 11:55:13,073 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 997 states, 614 states have (on average 1.9413680781758957) internal successors, (1192), 984 states have internal predecessors, (1192), 24 states have call successors, (24), 5 states have call predecessors, (24), 5 states have return successors, (23), 8 states have call predecessors, (23), 22 states have call successors, (23) [2024-10-13 11:55:13,074 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 997 states to 997 states and 1239 transitions. [2024-10-13 11:55:13,075 INFO L78 Accepts]: Start accepts. Automaton has 997 states and 1239 transitions. Word has length 65 [2024-10-13 11:55:13,075 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 11:55:13,075 INFO L471 AbstractCegarLoop]: Abstraction has 997 states and 1239 transitions. [2024-10-13 11:55:13,075 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-13 11:55:13,075 INFO L276 IsEmpty]: Start isEmpty. Operand 997 states and 1239 transitions. [2024-10-13 11:55:13,075 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2024-10-13 11:55:13,075 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 11:55:13,076 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-13 11:55:13,083 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-13 11:55:13,276 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-13 11:55:13,277 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr80REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 526 more)] === [2024-10-13 11:55:13,277 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 11:55:13,277 INFO L85 PathProgramCache]: Analyzing trace with hash 1402640979, now seen corresponding path program 2 times [2024-10-13 11:55:13,277 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 11:55:13,277 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1800156817] [2024-10-13 11:55:13,277 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-10-13 11:55:13,277 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-13 11:55:13,278 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 11:55:13,280 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-13 11:55:13,285 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-13 11:55:13,649 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-10-13 11:55:13,649 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-13 11:55:13,660 INFO L255 TraceCheckSpWp]: Trace formula consists of 369 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-10-13 11:55:13,662 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 11:55:13,694 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-13 11:55:13,694 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-13 11:55:13,811 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-13 11:55:13,811 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 11:55:13,811 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1800156817] [2024-10-13 11:55:13,811 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1800156817] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-13 11:55:13,811 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-13 11:55:13,811 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 14 [2024-10-13 11:55:13,811 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [557905755] [2024-10-13 11:55:13,811 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-13 11:55:13,811 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-10-13 11:55:13,811 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 11:55:13,812 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-10-13 11:55:13,812 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=121, Unknown=0, NotChecked=0, Total=182 [2024-10-13 11:55:13,812 INFO L87 Difference]: Start difference. First operand 997 states and 1239 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-13 11:55:15,137 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 11:55:15,137 INFO L93 Difference]: Finished difference Result 1009 states and 1258 transitions. [2024-10-13 11:55:15,138 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2024-10-13 11:55:15,138 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-13 11:55:15,139 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 11:55:15,141 INFO L225 Difference]: With dead ends: 1009 [2024-10-13 11:55:15,141 INFO L226 Difference]: Without dead ends: 1007 [2024-10-13 11:55:15,141 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-13 11:55:15,142 INFO L432 NwaCegarLoop]: 776 mSDtfsCounter, 7 mSDsluCounter, 3875 mSDsCounter, 0 mSdLazyCounter, 693 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 4651 SdHoareTripleChecker+Invalid, 705 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 693 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2024-10-13 11:55:15,142 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 4651 Invalid, 705 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 693 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2024-10-13 11:55:15,144 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1007 states. [2024-10-13 11:55:15,153 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1007 to 1006. [2024-10-13 11:55:15,154 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1006 states, 623 states have (on average 1.9325842696629214) internal successors, (1204), 993 states have internal predecessors, (1204), 24 states have call successors, (24), 5 states have call predecessors, (24), 5 states have return successors, (23), 8 states have call predecessors, (23), 22 states have call successors, (23) [2024-10-13 11:55:15,156 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1006 states to 1006 states and 1251 transitions. [2024-10-13 11:55:15,156 INFO L78 Accepts]: Start accepts. Automaton has 1006 states and 1251 transitions. Word has length 68 [2024-10-13 11:55:15,156 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 11:55:15,156 INFO L471 AbstractCegarLoop]: Abstraction has 1006 states and 1251 transitions. [2024-10-13 11:55:15,156 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-13 11:55:15,156 INFO L276 IsEmpty]: Start isEmpty. Operand 1006 states and 1251 transitions. [2024-10-13 11:55:15,157 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2024-10-13 11:55:15,157 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 11:55:15,157 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-13 11:55:15,166 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-13 11:55:15,357 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-13 11:55:15,357 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr80REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 526 more)] === [2024-10-13 11:55:15,358 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 11:55:15,358 INFO L85 PathProgramCache]: Analyzing trace with hash -1438006381, now seen corresponding path program 3 times [2024-10-13 11:55:15,358 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 11:55:15,358 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [230959687] [2024-10-13 11:55:15,358 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-10-13 11:55:15,358 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-13 11:55:15,358 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 11:55:15,359 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-13 11:55:15,360 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-13 11:55:15,910 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2024-10-13 11:55:15,911 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-13 11:55:15,924 INFO L255 TraceCheckSpWp]: Trace formula consists of 435 conjuncts, 14 conjuncts are in the unsatisfiable core [2024-10-13 11:55:15,926 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 11:55:16,043 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-13 11:55:16,044 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-13 11:55:16,425 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-13 11:55:16,426 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 11:55:16,426 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [230959687] [2024-10-13 11:55:16,426 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [230959687] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-13 11:55:16,426 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-13 11:55:16,426 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 26 [2024-10-13 11:55:16,426 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [725857874] [2024-10-13 11:55:16,426 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-13 11:55:16,426 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2024-10-13 11:55:16,426 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 11:55:16,427 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2024-10-13 11:55:16,427 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=193, Invalid=457, Unknown=0, NotChecked=0, Total=650 [2024-10-13 11:55:16,427 INFO L87 Difference]: Start difference. First operand 1006 states and 1251 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-13 11:55:20,288 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 11:55:20,288 INFO L93 Difference]: Finished difference Result 1027 states and 1287 transitions. [2024-10-13 11:55:20,289 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2024-10-13 11:55:20,289 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-13 11:55:20,289 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 11:55:20,292 INFO L225 Difference]: With dead ends: 1027 [2024-10-13 11:55:20,292 INFO L226 Difference]: Without dead ends: 1024 [2024-10-13 11:55:20,292 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-13 11:55:20,293 INFO L432 NwaCegarLoop]: 776 mSDtfsCounter, 13 mSDsluCounter, 12393 mSDsCounter, 0 mSdLazyCounter, 2063 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 13169 SdHoareTripleChecker+Invalid, 2078 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 2063 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.1s IncrementalHoareTripleChecker+Time [2024-10-13 11:55:20,293 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 13169 Invalid, 2078 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 2063 Invalid, 0 Unknown, 0 Unchecked, 3.1s Time] [2024-10-13 11:55:20,294 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1024 states. [2024-10-13 11:55:20,301 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1024 to 1024. [2024-10-13 11:55:20,302 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1024 states, 641 states have (on average 1.9141965678627144) internal successors, (1227), 1011 states have internal predecessors, (1227), 24 states have call successors, (24), 5 states have call predecessors, (24), 5 states have return successors, (23), 8 states have call predecessors, (23), 22 states have call successors, (23) [2024-10-13 11:55:20,303 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1024 states to 1024 states and 1274 transitions. [2024-10-13 11:55:20,303 INFO L78 Accepts]: Start accepts. Automaton has 1024 states and 1274 transitions. Word has length 74 [2024-10-13 11:55:20,303 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 11:55:20,303 INFO L471 AbstractCegarLoop]: Abstraction has 1024 states and 1274 transitions. [2024-10-13 11:55:20,303 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-13 11:55:20,303 INFO L276 IsEmpty]: Start isEmpty. Operand 1024 states and 1274 transitions. [2024-10-13 11:55:20,304 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2024-10-13 11:55:20,304 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 11:55:20,304 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-13 11:55:20,315 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (20)] Ended with exit code 0 [2024-10-13 11:55:20,505 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-13 11:55:20,505 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr80REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 526 more)] === [2024-10-13 11:55:20,505 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 11:55:20,505 INFO L85 PathProgramCache]: Analyzing trace with hash 2143307283, now seen corresponding path program 4 times [2024-10-13 11:55:20,506 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 11:55:20,506 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [594512535] [2024-10-13 11:55:20,506 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2024-10-13 11:55:20,506 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-13 11:55:20,506 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 11:55:20,507 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-13 11:55:20,508 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-13 11:55:20,983 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2024-10-13 11:55:20,983 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-13 11:55:20,996 INFO L255 TraceCheckSpWp]: Trace formula consists of 567 conjuncts, 25 conjuncts are in the unsatisfiable core [2024-10-13 11:55:20,998 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 11:55:21,257 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-13 11:55:21,258 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-13 11:55:22,305 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-13 11:55:22,305 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 11:55:22,305 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [594512535] [2024-10-13 11:55:22,305 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [594512535] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-13 11:55:22,305 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-13 11:55:22,305 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 26] total 50 [2024-10-13 11:55:22,306 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [780166522] [2024-10-13 11:55:22,306 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-13 11:55:22,306 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 50 states [2024-10-13 11:55:22,306 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 11:55:22,307 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2024-10-13 11:55:22,307 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=672, Invalid=1778, Unknown=0, NotChecked=0, Total=2450 [2024-10-13 11:55:22,307 INFO L87 Difference]: Start difference. First operand 1024 states and 1274 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-13 11:55:29,900 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 11:55:29,901 INFO L93 Difference]: Finished difference Result 1061 states and 1343 transitions. [2024-10-13 11:55:29,902 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 71 states. [2024-10-13 11:55:29,902 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-13 11:55:29,902 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 11:55:29,905 INFO L225 Difference]: With dead ends: 1061 [2024-10-13 11:55:29,905 INFO L226 Difference]: Without dead ends: 1059 [2024-10-13 11:55:29,910 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 213 GetRequests, 122 SyntacticMatches, 0 SemanticMatches, 91 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 465 ImplicationChecksByTransitivity, 3.5s TimeCoverageRelationStatistics Valid=2713, Invalid=5843, Unknown=0, NotChecked=0, Total=8556 [2024-10-13 11:55:29,911 INFO L432 NwaCegarLoop]: 776 mSDtfsCounter, 26 mSDsluCounter, 17825 mSDsCounter, 0 mSdLazyCounter, 4037 mSolverCounterSat, 52 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 18601 SdHoareTripleChecker+Invalid, 4089 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 52 IncrementalHoareTripleChecker+Valid, 4037 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.0s IncrementalHoareTripleChecker+Time [2024-10-13 11:55:29,911 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 18601 Invalid, 4089 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [52 Valid, 4037 Invalid, 0 Unknown, 0 Unchecked, 5.0s Time] [2024-10-13 11:55:29,912 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1059 states. [2024-10-13 11:55:29,919 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1059 to 1058. [2024-10-13 11:55:29,920 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1058 states, 675 states have (on average 1.885925925925926) internal successors, (1273), 1045 states have internal predecessors, (1273), 24 states have call successors, (24), 5 states have call predecessors, (24), 5 states have return successors, (23), 8 states have call predecessors, (23), 22 states have call successors, (23) [2024-10-13 11:55:29,921 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1058 states to 1058 states and 1320 transitions. [2024-10-13 11:55:29,921 INFO L78 Accepts]: Start accepts. Automaton has 1058 states and 1320 transitions. Word has length 86 [2024-10-13 11:55:29,921 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 11:55:29,921 INFO L471 AbstractCegarLoop]: Abstraction has 1058 states and 1320 transitions. [2024-10-13 11:55:29,921 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-13 11:55:29,921 INFO L276 IsEmpty]: Start isEmpty. Operand 1058 states and 1320 transitions. [2024-10-13 11:55:29,922 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2024-10-13 11:55:29,922 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 11:55:29,922 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-13 11:55:29,933 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 (21)] Forceful destruction successful, exit code 0 [2024-10-13 11:55:30,122 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-13 11:55:30,123 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr80REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 526 more)] === [2024-10-13 11:55:30,123 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 11:55:30,123 INFO L85 PathProgramCache]: Analyzing trace with hash 1103449427, now seen corresponding path program 5 times [2024-10-13 11:55:30,124 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 11:55:30,124 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [35051525] [2024-10-13 11:55:30,124 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2024-10-13 11:55:30,124 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-13 11:55:30,124 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 11:55:30,125 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-13 11:55:30,125 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-13 11:55:31,209 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 23 check-sat command(s) [2024-10-13 11:55:31,209 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-13 11:55:31,232 INFO L255 TraceCheckSpWp]: Trace formula consists of 809 conjuncts, 58 conjuncts are in the unsatisfiable core [2024-10-13 11:55:31,237 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 11:55:31,242 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-13 11:55:31,320 INFO L349 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2024-10-13 11:55:31,321 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-13 11:55:31,347 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-13 11:55:31,401 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-13 11:55:32,079 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-10-13 11:55:32,079 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-13 11:55:32,130 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-13 11:55:32,158 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-13 11:55:32,158 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-13 11:55:32,443 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 11:55:32,443 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [35051525] [2024-10-13 11:55:32,443 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [35051525] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-13 11:55:32,443 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [429669726] [2024-10-13 11:55:32,443 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2024-10-13 11:55:32,443 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-10-13 11:55:32,443 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2024-10-13 11:55:32,446 INFO L229 MonitoredProcess]: Starting monitored process 23 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-10-13 11:55:32,446 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (23)] Waiting until timeout for monitored process