./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/valid-memcleanup.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_SFH_test10-1.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (memcleanup) Using default analysis Version 84cfde4a Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_SFH_test10-1.i -s /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-MemCleanup-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-memcleanup) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 85fe539c4a9811cd5d49f239f4680cc0b3752a2958e9f287c34e302b923af4f9 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-84cfde4 [2024-10-11 17:41:30,585 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-11 17:41:30,654 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-MemCleanup-32bit-Automizer_Default.epf [2024-10-11 17:41:30,659 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-11 17:41:30,659 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-11 17:41:30,691 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-11 17:41:30,693 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-11 17:41:30,694 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-11 17:41:30,695 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-11 17:41:30,696 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-11 17:41:30,697 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-11 17:41:30,698 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-11 17:41:30,698 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-11 17:41:30,701 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-11 17:41:30,702 INFO L153 SettingsManager]: * Use SBE=true [2024-10-11 17:41:30,702 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-11 17:41:30,702 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-11 17:41:30,703 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-11 17:41:30,703 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-11 17:41:30,703 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-11 17:41:30,703 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-11 17:41:30,705 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-11 17:41:30,706 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-10-11 17:41:30,706 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-10-11 17:41:30,706 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-11 17:41:30,707 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-11 17:41:30,707 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-10-11 17:41:30,707 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-11 17:41:30,707 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-10-11 17:41:30,708 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-11 17:41:30,708 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-11 17:41:30,708 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-11 17:41:30,708 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-11 17:41:30,709 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-11 17:41:30,709 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-11 17:41:30,709 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-11 17:41:30,710 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 17:41:30,710 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-11 17:41:30,711 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-11 17:41:30,711 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-11 17:41:30,711 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-11 17:41:30,712 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-11 17:41:30,712 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-11 17:41:30,712 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-11 17:41:30,712 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-11 17:41:30,713 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G valid-memcleanup) ) 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 -> 85fe539c4a9811cd5d49f239f4680cc0b3752a2958e9f287c34e302b923af4f9 [2024-10-11 17:41:30,968 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-11 17:41:30,995 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-11 17:41:30,999 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-11 17:41:31,000 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-11 17:41:31,002 INFO L274 PluginConnector]: CDTParser initialized [2024-10-11 17:41:31,004 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_SFH_test10-1.i [2024-10-11 17:41:32,539 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-11 17:41:32,879 INFO L384 CDTParser]: Found 1 translation units. [2024-10-11 17:41:32,880 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_SFH_test10-1.i [2024-10-11 17:41:32,908 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/aef2ce61e/338cde144fb04da98e0d29ea901c4740/FLAGcfb0052cc [2024-10-11 17:41:33,117 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/aef2ce61e/338cde144fb04da98e0d29ea901c4740 [2024-10-11 17:41:33,120 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-11 17:41:33,122 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-11 17:41:33,123 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-11 17:41:33,123 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-11 17:41:33,132 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-11 17:41:33,133 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 05:41:33" (1/1) ... [2024-10-11 17:41:33,134 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@658cfb1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:41:33, skipping insertion in model container [2024-10-11 17:41:33,134 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 05:41:33" (1/1) ... [2024-10-11 17:41:33,191 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-11 17:41:34,068 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 17:41:34,085 ERROR L321 MainTranslator]: Unsupported Syntax: Found a cast between two array/pointer types of different sizes while using memory model HoenickeLindenmann_Original (while Not using bitvector translation) [2024-10-11 17:41:34,085 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver@772eb44d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:41:34, skipping insertion in model container [2024-10-11 17:41:34,086 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-11 17:41:34,086 INFO L186 ToolchainWalker]: Toolchain execution was canceled (user or tool) before executing de.uni_freiburg.informatik.ultimate.boogie.procedureinliner [2024-10-11 17:41:34,088 INFO L158 Benchmark]: Toolchain (without parser) took 966.13ms. Allocated memory is still 159.4MB. Free memory was 100.3MB in the beginning and 69.7MB in the end (delta: 30.5MB). Peak memory consumption was 31.5MB. Max. memory is 16.1GB. [2024-10-11 17:41:34,089 INFO L158 Benchmark]: CDTParser took 0.23ms. Allocated memory is still 159.4MB. Free memory is still 118.3MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-11 17:41:34,090 INFO L158 Benchmark]: CACSL2BoogieTranslator took 963.52ms. Allocated memory is still 159.4MB. Free memory was 99.9MB in the beginning and 69.7MB in the end (delta: 30.2MB). Peak memory consumption was 29.4MB. Max. memory is 16.1GB. [2024-10-11 17:41:34,091 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.23ms. Allocated memory is still 159.4MB. Free memory is still 118.3MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 963.52ms. Allocated memory is still 159.4MB. Free memory was 99.9MB in the beginning and 69.7MB in the end (delta: 30.2MB). Peak memory consumption was 29.4MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - UnsupportedSyntaxResult [Line: 734]: Unsupported Syntax Found a cast between two array/pointer types of different sizes while using memory model HoenickeLindenmann_Original (while Not using bitvector translation) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_SFH_test10-1.i -s /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-MemCleanup-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-memcleanup) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 85fe539c4a9811cd5d49f239f4680cc0b3752a2958e9f287c34e302b923af4f9 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-84cfde4 [2024-10-11 17:41:36,317 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-11 17:41:36,396 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-MemCleanup-32bit-Automizer_Bitvector.epf [2024-10-11 17:41:36,401 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-11 17:41:36,402 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-11 17:41:36,435 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-11 17:41:36,435 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-11 17:41:36,436 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-11 17:41:36,436 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-11 17:41:36,437 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-11 17:41:36,437 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-11 17:41:36,437 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-11 17:41:36,438 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-11 17:41:36,439 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-11 17:41:36,442 INFO L153 SettingsManager]: * Use SBE=true [2024-10-11 17:41:36,443 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-11 17:41:36,443 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-11 17:41:36,443 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-11 17:41:36,443 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-11 17:41:36,443 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-11 17:41:36,444 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-11 17:41:36,445 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-11 17:41:36,446 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-10-11 17:41:36,446 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-10-11 17:41:36,446 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-11 17:41:36,446 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-11 17:41:36,447 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-10-11 17:41:36,447 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-10-11 17:41:36,448 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-11 17:41:36,448 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-10-11 17:41:36,448 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-10-11 17:41:36,448 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-11 17:41:36,449 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-11 17:41:36,449 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-11 17:41:36,449 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-11 17:41:36,450 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-11 17:41:36,450 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-11 17:41:36,450 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-11 17:41:36,451 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 17:41:36,451 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-11 17:41:36,451 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-11 17:41:36,452 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-10-11 17:41:36,452 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-10-11 17:41:36,452 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-11 17:41:36,452 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-11 17:41:36,452 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-11 17:41:36,453 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-11 17:41:36,453 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2024-10-11 17:41:36,453 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G valid-memcleanup) ) 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 -> 85fe539c4a9811cd5d49f239f4680cc0b3752a2958e9f287c34e302b923af4f9 [2024-10-11 17:41:36,788 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-11 17:41:36,811 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-11 17:41:36,814 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-11 17:41:36,816 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-11 17:41:36,816 INFO L274 PluginConnector]: CDTParser initialized [2024-10-11 17:41:36,818 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_SFH_test10-1.i [2024-10-11 17:41:38,430 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-11 17:41:38,777 INFO L384 CDTParser]: Found 1 translation units. [2024-10-11 17:41:38,777 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_SFH_test10-1.i [2024-10-11 17:41:38,800 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/d27648ff7/cb2312f462d34ef4842a62c2e32bb6d3/FLAG1def97cbf [2024-10-11 17:41:38,811 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/d27648ff7/cb2312f462d34ef4842a62c2e32bb6d3 [2024-10-11 17:41:38,814 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-11 17:41:38,815 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-11 17:41:38,816 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-11 17:41:38,816 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-11 17:41:38,821 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-11 17:41:38,822 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 05:41:38" (1/1) ... [2024-10-11 17:41:38,823 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@64a4a936 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:41:38, skipping insertion in model container [2024-10-11 17:41:38,823 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 05:41:38" (1/1) ... [2024-10-11 17:41:38,891 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-11 17:41:39,711 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 17:41:39,732 INFO L197 MainTranslator]: Restarting translation with changed settings: SettingsChange [mNewPreferredMemoryModel=HoenickeLindenmann_1ByteResolution] [2024-10-11 17:41:39,747 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-11 17:41:39,891 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 17:41:39,898 INFO L200 MainTranslator]: Completed pre-run [2024-10-11 17:41:40,013 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 17:41:40,056 INFO L204 MainTranslator]: Completed translation [2024-10-11 17:41:40,058 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:41:40 WrapperNode [2024-10-11 17:41:40,058 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-11 17:41:40,059 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-11 17:41:40,059 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-11 17:41:40,059 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-11 17:41:40,066 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:41:40" (1/1) ... [2024-10-11 17:41:40,129 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:41:40" (1/1) ... [2024-10-11 17:41:40,230 INFO L138 Inliner]: procedures = 180, calls = 507, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 2244 [2024-10-11 17:41:40,231 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-11 17:41:40,232 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-11 17:41:40,233 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-11 17:41:40,233 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-11 17:41:40,244 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:41:40" (1/1) ... [2024-10-11 17:41:40,245 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:41:40" (1/1) ... [2024-10-11 17:41:40,262 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:41:40" (1/1) ... [2024-10-11 17:41:40,415 INFO L175 MemorySlicer]: Split 480 memory accesses to 3 slices as follows [2, 106, 372]. 78 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0, 0]. The 86 writes are split as follows [0, 4, 82]. [2024-10-11 17:41:40,416 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:41:40" (1/1) ... [2024-10-11 17:41:40,416 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:41:40" (1/1) ... [2024-10-11 17:41:40,471 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:41:40" (1/1) ... [2024-10-11 17:41:40,485 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:41:40" (1/1) ... [2024-10-11 17:41:40,492 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:41:40" (1/1) ... [2024-10-11 17:41:40,507 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:41:40" (1/1) ... [2024-10-11 17:41:40,540 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-11 17:41:40,542 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-11 17:41:40,542 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-11 17:41:40,542 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-11 17:41:40,543 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:41:40" (1/1) ... [2024-10-11 17:41:40,549 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 17:41:40,562 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 17:41:40,580 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-11 17:41:40,584 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-11 17:41:40,639 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#0 [2024-10-11 17:41:40,639 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#1 [2024-10-11 17:41:40,640 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#2 [2024-10-11 17:41:40,641 INFO L130 BoogieDeclarations]: Found specification of procedure test_int_int [2024-10-11 17:41:40,641 INFO L138 BoogieDeclarations]: Found implementation of procedure test_int_int [2024-10-11 17:41:40,641 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#0 [2024-10-11 17:41:40,641 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#1 [2024-10-11 17:41:40,642 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#2 [2024-10-11 17:41:40,642 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2024-10-11 17:41:40,642 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2024-10-11 17:41:40,642 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#0 [2024-10-11 17:41:40,642 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#1 [2024-10-11 17:41:40,642 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#2 [2024-10-11 17:41:40,642 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#0 [2024-10-11 17:41:40,643 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#1 [2024-10-11 17:41:40,643 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#2 [2024-10-11 17:41:40,643 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-10-11 17:41:40,643 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-11 17:41:40,643 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2024-10-11 17:41:40,643 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2024-10-11 17:41:40,643 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2024-10-11 17:41:40,643 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-10-11 17:41:40,643 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2024-10-11 17:41:40,645 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2024-10-11 17:41:40,645 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2024-10-11 17:41:40,645 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-10-11 17:41:40,645 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#0 [2024-10-11 17:41:40,646 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#1 [2024-10-11 17:41:40,646 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#2 [2024-10-11 17:41:40,646 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-10-11 17:41:40,646 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2024-10-11 17:41:40,646 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#2 [2024-10-11 17:41:40,647 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-11 17:41:40,647 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-11 17:41:40,966 INFO L238 CfgBuilder]: Building ICFG [2024-10-11 17:41:40,968 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-11 17:41:58,373 INFO L? ?]: Removed 268 outVars from TransFormulas that were not future-live. [2024-10-11 17:41:58,373 INFO L287 CfgBuilder]: Performing block encoding [2024-10-11 17:41:58,444 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-11 17:41:58,444 INFO L314 CfgBuilder]: Removed 151 assume(true) statements. [2024-10-11 17:41:58,448 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 05:41:58 BoogieIcfgContainer [2024-10-11 17:41:58,449 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-11 17:41:58,450 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-11 17:41:58,451 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-11 17:41:58,456 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-11 17:41:58,456 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.10 05:41:38" (1/3) ... [2024-10-11 17:41:58,457 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6320f8c7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 05:41:58, skipping insertion in model container [2024-10-11 17:41:58,457 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:41:40" (2/3) ... [2024-10-11 17:41:58,457 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6320f8c7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 05:41:58, skipping insertion in model container [2024-10-11 17:41:58,459 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 05:41:58" (3/3) ... [2024-10-11 17:41:58,460 INFO L112 eAbstractionObserver]: Analyzing ICFG uthash_SFH_test10-1.i [2024-10-11 17:41:58,480 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-11 17:41:58,480 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2024-10-11 17:41:58,551 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-11 17:41:58,559 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;@23b1f20d, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-11 17:41:58,560 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2024-10-11 17:41:58,566 INFO L276 IsEmpty]: Start isEmpty. Operand has 443 states, 423 states have (on average 1.6879432624113475) internal successors, (714), 429 states have internal predecessors, (714), 14 states have call successors, (14), 3 states have call predecessors, (14), 3 states have return successors, (14), 11 states have call predecessors, (14), 14 states have call successors, (14) [2024-10-11 17:41:58,580 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2024-10-11 17:41:58,581 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 17:41:58,582 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 17:41:58,582 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, __VERIFIER_assertErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2024-10-11 17:41:58,588 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:41:58,589 INFO L85 PathProgramCache]: Analyzing trace with hash 600665814, now seen corresponding path program 1 times [2024-10-11 17:41:58,604 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 17:41:58,604 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1626218582] [2024-10-11 17:41:58,604 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:41:58,605 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 17:41:58,605 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 17:41:58,608 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-11 17:41:58,610 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2024-10-11 17:41:58,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:41:58,881 INFO L255 TraceCheckSpWp]: Trace formula consists of 81 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-10-11 17:41:58,887 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 17:41:58,897 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 17:41:58,897 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 17:41:58,898 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 17:41:58,898 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1626218582] [2024-10-11 17:41:58,899 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1626218582] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:41:58,899 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 17:41:58,899 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 17:41:58,901 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [946828991] [2024-10-11 17:41:58,902 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:41:58,907 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-11 17:41:58,907 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 17:41:58,957 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-11 17:41:58,962 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-11 17:41:58,970 INFO L87 Difference]: Start difference. First operand has 443 states, 423 states have (on average 1.6879432624113475) internal successors, (714), 429 states have internal predecessors, (714), 14 states have call successors, (14), 3 states have call predecessors, (14), 3 states have return successors, (14), 11 states have call predecessors, (14), 14 states have call successors, (14) Second operand has 2 states, 2 states have (on average 5.5) internal successors, (11), 2 states have internal predecessors, (11), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:41:59,164 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 17:41:59,165 INFO L93 Difference]: Finished difference Result 442 states and 581 transitions. [2024-10-11 17:41:59,166 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-11 17:41:59,168 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 5.5) internal successors, (11), 2 states have internal predecessors, (11), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2024-10-11 17:41:59,172 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 17:41:59,197 INFO L225 Difference]: With dead ends: 442 [2024-10-11 17:41:59,198 INFO L226 Difference]: Without dead ends: 441 [2024-10-11 17:41:59,200 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-11 17:41:59,206 INFO L432 NwaCegarLoop]: 577 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 577 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 17:41:59,209 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 577 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 17:41:59,236 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 441 states. [2024-10-11 17:41:59,280 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 441 to 441. [2024-10-11 17:41:59,282 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 441 states, 422 states have (on average 1.3080568720379147) internal successors, (552), 427 states have internal predecessors, (552), 14 states have call successors, (14), 3 states have call predecessors, (14), 3 states have return successors, (14), 11 states have call predecessors, (14), 14 states have call successors, (14) [2024-10-11 17:41:59,287 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 441 states to 441 states and 580 transitions. [2024-10-11 17:41:59,288 INFO L78 Accepts]: Start accepts. Automaton has 441 states and 580 transitions. Word has length 13 [2024-10-11 17:41:59,289 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 17:41:59,289 INFO L471 AbstractCegarLoop]: Abstraction has 441 states and 580 transitions. [2024-10-11 17:41:59,292 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 5.5) internal successors, (11), 2 states have internal predecessors, (11), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:41:59,292 INFO L276 IsEmpty]: Start isEmpty. Operand 441 states and 580 transitions. [2024-10-11 17:41:59,296 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2024-10-11 17:41:59,298 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 17:41:59,298 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] [2024-10-11 17:41:59,303 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0 [2024-10-11 17:41:59,499 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 17:41:59,500 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, __VERIFIER_assertErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2024-10-11 17:41:59,500 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:41:59,500 INFO L85 PathProgramCache]: Analyzing trace with hash 404687426, now seen corresponding path program 1 times [2024-10-11 17:41:59,501 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 17:41:59,501 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [76188109] [2024-10-11 17:41:59,501 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:41:59,502 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 17:41:59,502 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 17:41:59,504 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-11 17:41:59,505 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2024-10-11 17:41:59,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:41:59,805 INFO L255 TraceCheckSpWp]: Trace formula consists of 146 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-11 17:41:59,810 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 17:41:59,905 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 17:41:59,906 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 17:41:59,906 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 17:41:59,906 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [76188109] [2024-10-11 17:41:59,906 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [76188109] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:41:59,907 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 17:41:59,907 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 17:41:59,907 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2017133731] [2024-10-11 17:41:59,907 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:41:59,908 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 17:41:59,909 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 17:41:59,909 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 17:41:59,910 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 17:41:59,910 INFO L87 Difference]: Start difference. First operand 441 states and 580 transitions. Second operand has 4 states, 4 states have (on average 12.0) internal successors, (48), 4 states have internal predecessors, (48), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:42:00,199 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 17:42:00,200 INFO L93 Difference]: Finished difference Result 444 states and 575 transitions. [2024-10-11 17:42:00,200 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-11 17:42:00,200 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.0) internal successors, (48), 4 states have internal predecessors, (48), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 50 [2024-10-11 17:42:00,200 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 17:42:00,203 INFO L225 Difference]: With dead ends: 444 [2024-10-11 17:42:00,203 INFO L226 Difference]: Without dead ends: 444 [2024-10-11 17:42:00,203 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 47 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-11 17:42:00,204 INFO L432 NwaCegarLoop]: 547 mSDtfsCounter, 30 mSDsluCounter, 1077 mSDsCounter, 0 mSdLazyCounter, 50 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 1624 SdHoareTripleChecker+Invalid, 72 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 50 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-11 17:42:00,205 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 1624 Invalid, 72 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 50 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-11 17:42:00,207 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 444 states. [2024-10-11 17:42:00,224 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 444 to 444. [2024-10-11 17:42:00,225 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 444 states, 425 states have (on average 1.2870588235294118) internal successors, (547), 430 states have internal predecessors, (547), 14 states have call successors, (14), 3 states have call predecessors, (14), 3 states have return successors, (14), 11 states have call predecessors, (14), 14 states have call successors, (14) [2024-10-11 17:42:00,227 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 444 states to 444 states and 575 transitions. [2024-10-11 17:42:00,228 INFO L78 Accepts]: Start accepts. Automaton has 444 states and 575 transitions. Word has length 50 [2024-10-11 17:42:00,228 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 17:42:00,228 INFO L471 AbstractCegarLoop]: Abstraction has 444 states and 575 transitions. [2024-10-11 17:42:00,229 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.0) internal successors, (48), 4 states have internal predecessors, (48), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:42:00,229 INFO L276 IsEmpty]: Start isEmpty. Operand 444 states and 575 transitions. [2024-10-11 17:42:00,231 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2024-10-11 17:42:00,231 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 17:42:00,231 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] [2024-10-11 17:42:00,240 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Ended with exit code 0 [2024-10-11 17:42:00,435 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 17:42:00,436 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, __VERIFIER_assertErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2024-10-11 17:42:00,437 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:42:00,437 INFO L85 PathProgramCache]: Analyzing trace with hash -1635690418, now seen corresponding path program 1 times [2024-10-11 17:42:00,437 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 17:42:00,437 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [416635427] [2024-10-11 17:42:00,437 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:42:00,438 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 17:42:00,438 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 17:42:00,444 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-11 17:42:00,446 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2024-10-11 17:42:00,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:42:00,794 INFO L255 TraceCheckSpWp]: Trace formula consists of 134 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-10-11 17:42:00,802 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 17:42:01,040 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 17:42:01,041 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 17:42:01,041 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 17:42:01,041 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [416635427] [2024-10-11 17:42:01,042 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [416635427] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:42:01,042 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 17:42:01,042 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-11 17:42:01,042 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [226683451] [2024-10-11 17:42:01,042 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:42:01,043 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 17:42:01,043 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 17:42:01,043 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 17:42:01,044 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-11 17:42:01,044 INFO L87 Difference]: Start difference. First operand 444 states and 575 transitions. Second operand has 5 states, 5 states have (on average 9.6) internal successors, (48), 5 states have internal predecessors, (48), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:42:01,317 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 17:42:01,318 INFO L93 Difference]: Finished difference Result 438 states and 565 transitions. [2024-10-11 17:42:01,318 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-11 17:42:01,318 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.6) internal successors, (48), 5 states have internal predecessors, (48), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 50 [2024-10-11 17:42:01,319 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 17:42:01,320 INFO L225 Difference]: With dead ends: 438 [2024-10-11 17:42:01,321 INFO L226 Difference]: Without dead ends: 438 [2024-10-11 17:42:01,321 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 46 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-11 17:42:01,322 INFO L432 NwaCegarLoop]: 546 mSDtfsCounter, 0 mSDsluCounter, 1611 mSDsCounter, 0 mSdLazyCounter, 68 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 2157 SdHoareTripleChecker+Invalid, 71 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 68 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-11 17:42:01,323 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 2157 Invalid, 71 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 68 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-11 17:42:01,324 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 438 states. [2024-10-11 17:42:01,341 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 438 to 438. [2024-10-11 17:42:01,344 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 438 states, 419 states have (on average 1.2816229116945108) internal successors, (537), 424 states have internal predecessors, (537), 14 states have call successors, (14), 3 states have call predecessors, (14), 3 states have return successors, (14), 11 states have call predecessors, (14), 14 states have call successors, (14) [2024-10-11 17:42:01,346 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 438 states to 438 states and 565 transitions. [2024-10-11 17:42:01,347 INFO L78 Accepts]: Start accepts. Automaton has 438 states and 565 transitions. Word has length 50 [2024-10-11 17:42:01,347 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 17:42:01,347 INFO L471 AbstractCegarLoop]: Abstraction has 438 states and 565 transitions. [2024-10-11 17:42:01,347 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.6) internal successors, (48), 5 states have internal predecessors, (48), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:42:01,347 INFO L276 IsEmpty]: Start isEmpty. Operand 438 states and 565 transitions. [2024-10-11 17:42:01,349 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2024-10-11 17:42:01,349 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 17:42:01,349 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] [2024-10-11 17:42:01,361 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Ended with exit code 0 [2024-10-11 17:42:01,553 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 17:42:01,554 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, __VERIFIER_assertErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2024-10-11 17:42:01,555 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:42:01,555 INFO L85 PathProgramCache]: Analyzing trace with hash -2058392244, now seen corresponding path program 1 times [2024-10-11 17:42:01,556 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 17:42:01,556 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1948262136] [2024-10-11 17:42:01,556 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:42:01,557 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 17:42:01,557 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 17:42:01,560 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-11 17:42:01,569 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2024-10-11 17:42:01,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:42:01,890 INFO L255 TraceCheckSpWp]: Trace formula consists of 136 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-10-11 17:42:01,900 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 17:42:01,939 INFO L173 IndexEqualityManager]: detected equality via solver [2024-10-11 17:42:01,940 INFO L173 IndexEqualityManager]: detected equality via solver [2024-10-11 17:42:01,941 INFO L173 IndexEqualityManager]: detected equality via solver [2024-10-11 17:42:01,952 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-11 17:42:02,044 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-11 17:42:02,045 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-11 17:42:02,076 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 17:42:02,076 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 17:42:02,077 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 17:42:02,077 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1948262136] [2024-10-11 17:42:02,077 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1948262136] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:42:02,077 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 17:42:02,077 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 17:42:02,078 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1790452618] [2024-10-11 17:42:02,078 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:42:02,078 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 17:42:02,079 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 17:42:02,079 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 17:42:02,079 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 17:42:02,079 INFO L87 Difference]: Start difference. First operand 438 states and 565 transitions. Second operand has 4 states, 4 states have (on average 12.0) internal successors, (48), 3 states have internal predecessors, (48), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:42:02,893 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 17:42:02,893 INFO L93 Difference]: Finished difference Result 614 states and 794 transitions. [2024-10-11 17:42:02,893 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 17:42:02,894 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.0) internal successors, (48), 3 states have internal predecessors, (48), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 50 [2024-10-11 17:42:02,894 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 17:42:02,896 INFO L225 Difference]: With dead ends: 614 [2024-10-11 17:42:02,896 INFO L226 Difference]: Without dead ends: 614 [2024-10-11 17:42:02,897 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 47 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-11 17:42:02,898 INFO L432 NwaCegarLoop]: 558 mSDtfsCounter, 216 mSDsluCounter, 1059 mSDsCounter, 0 mSdLazyCounter, 77 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 222 SdHoareTripleChecker+Valid, 1617 SdHoareTripleChecker+Invalid, 77 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 77 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-10-11 17:42:02,899 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [222 Valid, 1617 Invalid, 77 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 77 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-10-11 17:42:02,900 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 614 states. [2024-10-11 17:42:02,912 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 614 to 440. [2024-10-11 17:42:02,913 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 440 states, 421 states have (on average 1.2802850356294537) internal successors, (539), 426 states have internal predecessors, (539), 14 states have call successors, (14), 3 states have call predecessors, (14), 3 states have return successors, (14), 11 states have call predecessors, (14), 14 states have call successors, (14) [2024-10-11 17:42:02,915 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 440 states to 440 states and 567 transitions. [2024-10-11 17:42:02,915 INFO L78 Accepts]: Start accepts. Automaton has 440 states and 567 transitions. Word has length 50 [2024-10-11 17:42:02,916 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 17:42:02,916 INFO L471 AbstractCegarLoop]: Abstraction has 440 states and 567 transitions. [2024-10-11 17:42:02,916 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.0) internal successors, (48), 3 states have internal predecessors, (48), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:42:02,917 INFO L276 IsEmpty]: Start isEmpty. Operand 440 states and 567 transitions. [2024-10-11 17:42:02,919 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2024-10-11 17:42:02,920 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 17:42:02,920 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 17:42:02,929 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Ended with exit code 0 [2024-10-11 17:42:03,124 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 17:42:03,125 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, __VERIFIER_assertErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2024-10-11 17:42:03,125 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:42:03,125 INFO L85 PathProgramCache]: Analyzing trace with hash -1282122613, now seen corresponding path program 1 times [2024-10-11 17:42:03,127 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 17:42:03,127 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [475590191] [2024-10-11 17:42:03,127 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:42:03,127 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 17:42:03,127 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 17:42:03,130 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-11 17:42:03,131 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2024-10-11 17:42:03,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:42:03,572 INFO L255 TraceCheckSpWp]: Trace formula consists of 431 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-11 17:42:03,576 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 17:42:03,619 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 17:42:03,619 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 17:42:03,619 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 17:42:03,620 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [475590191] [2024-10-11 17:42:03,620 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [475590191] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:42:03,620 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 17:42:03,620 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 17:42:03,620 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2080283237] [2024-10-11 17:42:03,620 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:42:03,621 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 17:42:03,621 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 17:42:03,622 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 17:42:03,622 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 17:42:03,622 INFO L87 Difference]: Start difference. First operand 440 states and 567 transitions. Second operand has 4 states, 4 states have (on average 26.25) internal successors, (105), 4 states have internal predecessors, (105), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:42:03,788 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 17:42:03,788 INFO L93 Difference]: Finished difference Result 443 states and 562 transitions. [2024-10-11 17:42:03,791 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-11 17:42:03,791 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 26.25) internal successors, (105), 4 states have internal predecessors, (105), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 107 [2024-10-11 17:42:03,791 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 17:42:03,794 INFO L225 Difference]: With dead ends: 443 [2024-10-11 17:42:03,794 INFO L226 Difference]: Without dead ends: 443 [2024-10-11 17:42:03,794 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 107 GetRequests, 104 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-11 17:42:03,795 INFO L432 NwaCegarLoop]: 532 mSDtfsCounter, 30 mSDsluCounter, 1047 mSDsCounter, 0 mSdLazyCounter, 50 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 1579 SdHoareTripleChecker+Invalid, 72 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 50 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 17:42:03,796 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 1579 Invalid, 72 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 50 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 17:42:03,797 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 443 states. [2024-10-11 17:42:03,803 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 443 to 443. [2024-10-11 17:42:03,804 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 443 states, 424 states have (on average 1.259433962264151) internal successors, (534), 429 states have internal predecessors, (534), 14 states have call successors, (14), 3 states have call predecessors, (14), 3 states have return successors, (14), 11 states have call predecessors, (14), 14 states have call successors, (14) [2024-10-11 17:42:03,806 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 443 states to 443 states and 562 transitions. [2024-10-11 17:42:03,807 INFO L78 Accepts]: Start accepts. Automaton has 443 states and 562 transitions. Word has length 107 [2024-10-11 17:42:03,807 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 17:42:03,807 INFO L471 AbstractCegarLoop]: Abstraction has 443 states and 562 transitions. [2024-10-11 17:42:03,808 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 26.25) internal successors, (105), 4 states have internal predecessors, (105), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:42:03,808 INFO L276 IsEmpty]: Start isEmpty. Operand 443 states and 562 transitions. [2024-10-11 17:42:03,810 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2024-10-11 17:42:03,811 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 17:42:03,811 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 17:42:03,825 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Forceful destruction successful, exit code 0 [2024-10-11 17:42:04,011 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 17:42:04,012 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, __VERIFIER_assertErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2024-10-11 17:42:04,013 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:42:04,013 INFO L85 PathProgramCache]: Analyzing trace with hash -1652004225, now seen corresponding path program 1 times [2024-10-11 17:42:04,014 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 17:42:04,014 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1781733143] [2024-10-11 17:42:04,014 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:42:04,014 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 17:42:04,014 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 17:42:04,018 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-11 17:42:04,019 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2024-10-11 17:42:04,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:42:04,490 INFO L255 TraceCheckSpWp]: Trace formula consists of 419 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-11 17:42:04,496 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 17:42:04,935 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 17:42:04,936 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 17:42:04,936 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 17:42:04,936 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1781733143] [2024-10-11 17:42:04,936 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1781733143] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:42:04,936 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 17:42:04,937 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 17:42:04,937 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [235122240] [2024-10-11 17:42:04,937 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:42:04,937 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 17:42:04,938 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 17:42:04,942 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 17:42:04,943 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 17:42:04,943 INFO L87 Difference]: Start difference. First operand 443 states and 562 transitions. Second operand has 3 states, 3 states have (on average 35.0) internal successors, (105), 2 states have internal predecessors, (105), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:42:05,447 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 17:42:05,447 INFO L93 Difference]: Finished difference Result 682 states and 865 transitions. [2024-10-11 17:42:05,448 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 17:42:05,448 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 35.0) internal successors, (105), 2 states have internal predecessors, (105), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 107 [2024-10-11 17:42:05,449 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 17:42:05,451 INFO L225 Difference]: With dead ends: 682 [2024-10-11 17:42:05,451 INFO L226 Difference]: Without dead ends: 682 [2024-10-11 17:42:05,451 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 106 GetRequests, 105 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 17:42:05,452 INFO L432 NwaCegarLoop]: 552 mSDtfsCounter, 248 mSDsluCounter, 532 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 254 SdHoareTripleChecker+Valid, 1084 SdHoareTripleChecker+Invalid, 27 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-10-11 17:42:05,452 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [254 Valid, 1084 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-10-11 17:42:05,454 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 682 states. [2024-10-11 17:42:05,466 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 682 to 674. [2024-10-11 17:42:05,467 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 674 states, 650 states have (on average 1.26) internal successors, (819), 655 states have internal predecessors, (819), 19 states have call successors, (19), 3 states have call predecessors, (19), 3 states have return successors, (19), 16 states have call predecessors, (19), 19 states have call successors, (19) [2024-10-11 17:42:05,470 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 674 states to 674 states and 857 transitions. [2024-10-11 17:42:05,470 INFO L78 Accepts]: Start accepts. Automaton has 674 states and 857 transitions. Word has length 107 [2024-10-11 17:42:05,470 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 17:42:05,470 INFO L471 AbstractCegarLoop]: Abstraction has 674 states and 857 transitions. [2024-10-11 17:42:05,471 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 35.0) internal successors, (105), 2 states have internal predecessors, (105), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:42:05,471 INFO L276 IsEmpty]: Start isEmpty. Operand 674 states and 857 transitions. [2024-10-11 17:42:05,472 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2024-10-11 17:42:05,472 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 17:42:05,473 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 17:42:05,483 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Forceful destruction successful, exit code 0 [2024-10-11 17:42:05,673 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 17:42:05,674 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, __VERIFIER_assertErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2024-10-11 17:42:05,674 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:42:05,674 INFO L85 PathProgramCache]: Analyzing trace with hash -432796772, now seen corresponding path program 1 times [2024-10-11 17:42:05,675 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 17:42:05,675 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2144818724] [2024-10-11 17:42:05,675 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:42:05,675 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 17:42:05,676 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 17:42:05,677 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-11 17:42:05,678 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Waiting until timeout for monitored process [2024-10-11 17:42:06,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:42:06,247 INFO L255 TraceCheckSpWp]: Trace formula consists of 548 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-11 17:42:06,250 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 17:42:06,291 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 17:42:06,291 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 17:42:06,292 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 17:42:06,292 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2144818724] [2024-10-11 17:42:06,292 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2144818724] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:42:06,292 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 17:42:06,292 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 17:42:06,292 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [751676667] [2024-10-11 17:42:06,293 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:42:06,293 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 17:42:06,293 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 17:42:06,296 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 17:42:06,298 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 17:42:06,298 INFO L87 Difference]: Start difference. First operand 674 states and 857 transitions. Second operand has 4 states, 3 states have (on average 38.0) internal successors, (114), 4 states have internal predecessors, (114), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2024-10-11 17:42:06,432 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 17:42:06,433 INFO L93 Difference]: Finished difference Result 676 states and 862 transitions. [2024-10-11 17:42:06,433 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 17:42:06,434 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 38.0) internal successors, (114), 4 states have internal predecessors, (114), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) Word has length 120 [2024-10-11 17:42:06,434 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 17:42:06,437 INFO L225 Difference]: With dead ends: 676 [2024-10-11 17:42:06,437 INFO L226 Difference]: Without dead ends: 676 [2024-10-11 17:42:06,438 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 119 GetRequests, 117 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 17:42:06,439 INFO L432 NwaCegarLoop]: 548 mSDtfsCounter, 0 mSDsluCounter, 1089 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1637 SdHoareTripleChecker+Invalid, 27 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 17:42:06,439 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1637 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 17:42:06,441 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 676 states. [2024-10-11 17:42:06,463 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 676 to 676. [2024-10-11 17:42:06,464 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 676 states, 651 states have (on average 1.261136712749616) internal successors, (821), 657 states have internal predecessors, (821), 19 states have call successors, (19), 3 states have call predecessors, (19), 4 states have return successors, (22), 16 states have call predecessors, (22), 19 states have call successors, (22) [2024-10-11 17:42:06,467 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 676 states to 676 states and 862 transitions. [2024-10-11 17:42:06,467 INFO L78 Accepts]: Start accepts. Automaton has 676 states and 862 transitions. Word has length 120 [2024-10-11 17:42:06,468 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 17:42:06,468 INFO L471 AbstractCegarLoop]: Abstraction has 676 states and 862 transitions. [2024-10-11 17:42:06,468 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 38.0) internal successors, (114), 4 states have internal predecessors, (114), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2024-10-11 17:42:06,469 INFO L276 IsEmpty]: Start isEmpty. Operand 676 states and 862 transitions. [2024-10-11 17:42:06,470 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2024-10-11 17:42:06,470 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 17:42:06,471 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 17:42:06,489 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Ended with exit code 0 [2024-10-11 17:42:06,671 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 17:42:06,672 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, __VERIFIER_assertErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2024-10-11 17:42:06,672 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:42:06,672 INFO L85 PathProgramCache]: Analyzing trace with hash 1162013926, now seen corresponding path program 1 times [2024-10-11 17:42:06,673 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 17:42:06,673 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1959047784] [2024-10-11 17:42:06,673 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:42:06,673 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 17:42:06,673 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 17:42:06,675 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-11 17:42:06,677 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Waiting until timeout for monitored process [2024-10-11 17:42:07,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:42:07,279 INFO L255 TraceCheckSpWp]: Trace formula consists of 570 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-10-11 17:42:07,283 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 17:42:07,347 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 8 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-10-11 17:42:07,347 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 17:42:07,508 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-10-11 17:42:07,509 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 17:42:07,509 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1959047784] [2024-10-11 17:42:07,509 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1959047784] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 17:42:07,509 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-11 17:42:07,509 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 8 [2024-10-11 17:42:07,509 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1449882996] [2024-10-11 17:42:07,510 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-11 17:42:07,510 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-11 17:42:07,510 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 17:42:07,511 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-11 17:42:07,511 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2024-10-11 17:42:07,512 INFO L87 Difference]: Start difference. First operand 676 states and 862 transitions. Second operand has 8 states, 6 states have (on average 20.333333333333332) internal successors, (122), 8 states have internal predecessors, (122), 2 states have call successors, (5), 2 states have call predecessors, (5), 4 states have return successors, (4), 1 states have call predecessors, (4), 2 states have call successors, (4) [2024-10-11 17:42:07,978 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 17:42:07,978 INFO L93 Difference]: Finished difference Result 685 states and 878 transitions. [2024-10-11 17:42:07,979 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-10-11 17:42:07,980 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 6 states have (on average 20.333333333333332) internal successors, (122), 8 states have internal predecessors, (122), 2 states have call successors, (5), 2 states have call predecessors, (5), 4 states have return successors, (4), 1 states have call predecessors, (4), 2 states have call successors, (4) Word has length 122 [2024-10-11 17:42:07,980 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 17:42:07,983 INFO L225 Difference]: With dead ends: 685 [2024-10-11 17:42:07,983 INFO L226 Difference]: Without dead ends: 685 [2024-10-11 17:42:07,984 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 245 GetRequests, 236 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=44, Invalid=66, Unknown=0, NotChecked=0, Total=110 [2024-10-11 17:42:07,985 INFO L432 NwaCegarLoop]: 547 mSDtfsCounter, 5 mSDsluCounter, 1628 mSDsCounter, 0 mSdLazyCounter, 70 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 2175 SdHoareTripleChecker+Invalid, 88 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 70 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-11 17:42:07,985 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 2175 Invalid, 88 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 70 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-11 17:42:07,988 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 685 states. [2024-10-11 17:42:08,007 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 685 to 684. [2024-10-11 17:42:08,009 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 684 states, 658 states have (on average 1.2674772036474165) internal successors, (834), 664 states have internal predecessors, (834), 19 states have call successors, (19), 4 states have call predecessors, (19), 5 states have return successors, (22), 16 states have call predecessors, (22), 19 states have call successors, (22) [2024-10-11 17:42:08,013 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 684 states to 684 states and 875 transitions. [2024-10-11 17:42:08,013 INFO L78 Accepts]: Start accepts. Automaton has 684 states and 875 transitions. Word has length 122 [2024-10-11 17:42:08,014 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 17:42:08,015 INFO L471 AbstractCegarLoop]: Abstraction has 684 states and 875 transitions. [2024-10-11 17:42:08,016 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 6 states have (on average 20.333333333333332) internal successors, (122), 8 states have internal predecessors, (122), 2 states have call successors, (5), 2 states have call predecessors, (5), 4 states have return successors, (4), 1 states have call predecessors, (4), 2 states have call successors, (4) [2024-10-11 17:42:08,016 INFO L276 IsEmpty]: Start isEmpty. Operand 684 states and 875 transitions. [2024-10-11 17:42:08,017 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2024-10-11 17:42:08,018 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 17:42:08,018 INFO L215 NwaCegarLoop]: trace histogram [6, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 17:42:08,032 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Forceful destruction successful, exit code 0 [2024-10-11 17:42:08,218 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 17:42:08,219 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, __VERIFIER_assertErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2024-10-11 17:42:08,219 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:42:08,219 INFO L85 PathProgramCache]: Analyzing trace with hash 366709788, now seen corresponding path program 2 times [2024-10-11 17:42:08,220 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 17:42:08,220 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1126682005] [2024-10-11 17:42:08,220 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-10-11 17:42:08,220 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 17:42:08,220 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 17:42:08,222 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-11 17:42:08,223 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Waiting until timeout for monitored process [2024-10-11 17:42:08,953 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-10-11 17:42:08,954 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-11 17:42:08,985 INFO L255 TraceCheckSpWp]: Trace formula consists of 614 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-10-11 17:42:08,989 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 17:42:09,168 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 19 proven. 10 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-10-11 17:42:09,169 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 17:42:09,592 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 2 proven. 26 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-10-11 17:42:09,593 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 17:42:09,593 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1126682005] [2024-10-11 17:42:09,593 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1126682005] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 17:42:09,593 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-11 17:42:09,593 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 14 [2024-10-11 17:42:09,594 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [819623598] [2024-10-11 17:42:09,594 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-11 17:42:09,595 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-10-11 17:42:09,595 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 17:42:09,596 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-10-11 17:42:09,596 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=121, Unknown=0, NotChecked=0, Total=182 [2024-10-11 17:42:09,596 INFO L87 Difference]: Start difference. First operand 684 states and 875 transitions. Second operand has 14 states, 12 states have (on average 10.666666666666666) internal successors, (128), 14 states have internal predecessors, (128), 2 states have call successors, (5), 2 states have call predecessors, (5), 4 states have return successors, (4), 1 states have call predecessors, (4), 2 states have call successors, (4) [2024-10-11 17:42:10,681 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 17:42:10,683 INFO L93 Difference]: Finished difference Result 696 states and 896 transitions. [2024-10-11 17:42:10,684 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2024-10-11 17:42:10,684 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 12 states have (on average 10.666666666666666) internal successors, (128), 14 states have internal predecessors, (128), 2 states have call successors, (5), 2 states have call predecessors, (5), 4 states have return successors, (4), 1 states have call predecessors, (4), 2 states have call successors, (4) Word has length 126 [2024-10-11 17:42:10,685 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 17:42:10,688 INFO L225 Difference]: With dead ends: 696 [2024-10-11 17:42:10,689 INFO L226 Difference]: Without dead ends: 694 [2024-10-11 17:42:10,689 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 259 GetRequests, 238 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=182, Invalid=324, Unknown=0, NotChecked=0, Total=506 [2024-10-11 17:42:10,691 INFO L432 NwaCegarLoop]: 547 mSDtfsCounter, 8 mSDsluCounter, 2718 mSDsCounter, 0 mSdLazyCounter, 203 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 3265 SdHoareTripleChecker+Invalid, 232 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 203 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-10-11 17:42:10,692 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 3265 Invalid, 232 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 203 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-10-11 17:42:10,693 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 694 states. [2024-10-11 17:42:10,705 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 694 to 693. [2024-10-11 17:42:10,706 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 693 states, 667 states have (on average 1.2683658170914542) internal successors, (846), 673 states have internal predecessors, (846), 19 states have call successors, (19), 4 states have call predecessors, (19), 5 states have return successors, (22), 16 states have call predecessors, (22), 19 states have call successors, (22) [2024-10-11 17:42:10,710 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 693 states to 693 states and 887 transitions. [2024-10-11 17:42:10,710 INFO L78 Accepts]: Start accepts. Automaton has 693 states and 887 transitions. Word has length 126 [2024-10-11 17:42:10,710 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 17:42:10,711 INFO L471 AbstractCegarLoop]: Abstraction has 693 states and 887 transitions. [2024-10-11 17:42:10,711 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 12 states have (on average 10.666666666666666) internal successors, (128), 14 states have internal predecessors, (128), 2 states have call successors, (5), 2 states have call predecessors, (5), 4 states have return successors, (4), 1 states have call predecessors, (4), 2 states have call successors, (4) [2024-10-11 17:42:10,711 INFO L276 IsEmpty]: Start isEmpty. Operand 693 states and 887 transitions. [2024-10-11 17:42:10,713 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2024-10-11 17:42:10,714 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 17:42:10,715 INFO L215 NwaCegarLoop]: trace histogram [15, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 17:42:10,729 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Ended with exit code 0 [2024-10-11 17:42:10,919 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 17:42:10,920 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, __VERIFIER_assertErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2024-10-11 17:42:10,920 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:42:10,920 INFO L85 PathProgramCache]: Analyzing trace with hash 735010660, now seen corresponding path program 3 times [2024-10-11 17:42:10,921 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 17:42:10,921 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [324654409] [2024-10-11 17:42:10,921 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-10-11 17:42:10,921 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 17:42:10,921 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 17:42:10,924 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-11 17:42:10,926 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Waiting until timeout for monitored process [2024-10-11 17:42:11,733 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2024-10-11 17:42:11,733 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-11 17:42:11,754 INFO L255 TraceCheckSpWp]: Trace formula consists of 434 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-10-11 17:42:11,758 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 17:42:11,766 INFO L173 IndexEqualityManager]: detected equality via solver [2024-10-11 17:42:11,767 INFO L173 IndexEqualityManager]: detected equality via solver [2024-10-11 17:42:11,767 INFO L173 IndexEqualityManager]: detected equality via solver [2024-10-11 17:42:11,770 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-11 17:42:14,399 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-11 17:42:14,400 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 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 189 treesize of output 87 [2024-10-11 17:42:14,555 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-11 17:42:14,555 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 118 treesize of output 74 [2024-10-11 17:42:14,584 INFO L134 CoverageAnalysis]: Checked inductivity of 140 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 138 trivial. 0 not checked. [2024-10-11 17:42:14,584 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 17:42:15,298 INFO L134 CoverageAnalysis]: Checked inductivity of 140 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 138 trivial. 0 not checked. [2024-10-11 17:42:15,299 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 17:42:15,299 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [324654409] [2024-10-11 17:42:15,299 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [324654409] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 17:42:15,299 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-11 17:42:15,299 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 7] total 12 [2024-10-11 17:42:15,299 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [478807151] [2024-10-11 17:42:15,299 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-11 17:42:15,300 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-10-11 17:42:15,300 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 17:42:15,301 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-10-11 17:42:15,301 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=92, Unknown=0, NotChecked=0, Total=132 [2024-10-11 17:42:15,301 INFO L87 Difference]: Start difference. First operand 693 states and 887 transitions. Second operand has 12 states, 12 states have (on average 15.083333333333334) internal successors, (181), 12 states have internal predecessors, (181), 3 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2024-10-11 17:42:19,754 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-10-11 17:42:24,075 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-10-11 17:42:28,213 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-10-11 17:42:32,966 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-10-11 17:42:37,122 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-10-11 17:42:41,242 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-10-11 17:42:45,270 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-10-11 17:42:49,504 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-10-11 17:42:53,581 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-10-11 17:42:57,643 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0]