./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_FNV_nondet_test3-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_FNV_nondet_test3-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 6fd297418200393a9bb890e84311a80b6eacd7d5d7cdd65efb1397f8b8ab870f --- Real Ultimate output --- This is Ultimate 0.2.5-dev-84cfde4 [2024-10-11 17:28:06,129 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-11 17:28:06,185 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:28:06,188 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-11 17:28:06,188 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-11 17:28:06,211 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-11 17:28:06,212 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-11 17:28:06,213 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-11 17:28:06,213 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-11 17:28:06,214 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-11 17:28:06,214 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-11 17:28:06,214 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-11 17:28:06,215 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-11 17:28:06,215 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-11 17:28:06,216 INFO L153 SettingsManager]: * Use SBE=true [2024-10-11 17:28:06,217 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-11 17:28:06,218 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-11 17:28:06,218 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-11 17:28:06,218 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-11 17:28:06,218 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-11 17:28:06,219 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-11 17:28:06,222 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-11 17:28:06,223 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-10-11 17:28:06,223 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-10-11 17:28:06,223 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-11 17:28:06,223 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-11 17:28:06,223 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-10-11 17:28:06,223 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-11 17:28:06,224 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-10-11 17:28:06,224 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-11 17:28:06,224 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-11 17:28:06,224 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-11 17:28:06,224 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-11 17:28:06,224 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-11 17:28:06,225 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-11 17:28:06,225 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-11 17:28:06,225 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 17:28:06,225 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-11 17:28:06,225 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-11 17:28:06,225 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-11 17:28:06,225 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-11 17:28:06,226 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-11 17:28:06,226 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-11 17:28:06,226 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-11 17:28:06,227 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-11 17:28:06,227 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 -> 6fd297418200393a9bb890e84311a80b6eacd7d5d7cdd65efb1397f8b8ab870f [2024-10-11 17:28:06,443 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-11 17:28:06,470 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-11 17:28:06,472 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-11 17:28:06,473 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-11 17:28:06,474 INFO L274 PluginConnector]: CDTParser initialized [2024-10-11 17:28:06,475 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_FNV_nondet_test3-1.i [2024-10-11 17:28:07,770 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-11 17:28:07,993 INFO L384 CDTParser]: Found 1 translation units. [2024-10-11 17:28:07,993 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_FNV_nondet_test3-1.i [2024-10-11 17:28:08,006 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/4327dadc2/c2ca6b72bfe84a53b950809439c4d4a6/FLAG7396dcdbd [2024-10-11 17:28:08,019 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/4327dadc2/c2ca6b72bfe84a53b950809439c4d4a6 [2024-10-11 17:28:08,021 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-11 17:28:08,022 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-11 17:28:08,023 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-11 17:28:08,023 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-11 17:28:08,031 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-11 17:28:08,032 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 05:28:08" (1/1) ... [2024-10-11 17:28:08,032 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@10c1f975 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:28:08, skipping insertion in model container [2024-10-11 17:28:08,033 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 05:28:08" (1/1) ... [2024-10-11 17:28:08,068 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-11 17:28:08,588 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 17:28:08,633 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:28:08,634 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver@50e87803 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:28:08, skipping insertion in model container [2024-10-11 17:28:08,634 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-11 17:28:08,635 INFO L186 ToolchainWalker]: Toolchain execution was canceled (user or tool) before executing de.uni_freiburg.informatik.ultimate.boogie.procedureinliner [2024-10-11 17:28:08,637 INFO L158 Benchmark]: Toolchain (without parser) took 613.93ms. Allocated memory is still 174.1MB. Free memory was 107.2MB in the beginning and 144.8MB in the end (delta: -37.6MB). Peak memory consumption was 27.3MB. Max. memory is 16.1GB. [2024-10-11 17:28:08,637 INFO L158 Benchmark]: CDTParser took 0.15ms. Allocated memory is still 174.1MB. Free memory is still 138.6MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-11 17:28:08,637 INFO L158 Benchmark]: CACSL2BoogieTranslator took 611.93ms. Allocated memory is still 174.1MB. Free memory was 106.9MB in the beginning and 144.8MB in the end (delta: -37.9MB). Peak memory consumption was 27.3MB. Max. memory is 16.1GB. [2024-10-11 17:28:08,639 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.15ms. Allocated memory is still 174.1MB. Free memory is still 138.6MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 611.93ms. Allocated memory is still 174.1MB. Free memory was 106.9MB in the beginning and 144.8MB in the end (delta: -37.9MB). Peak memory consumption was 27.3MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - UnsupportedSyntaxResult [Line: 739]: 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_FNV_nondet_test3-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 6fd297418200393a9bb890e84311a80b6eacd7d5d7cdd65efb1397f8b8ab870f --- Real Ultimate output --- This is Ultimate 0.2.5-dev-84cfde4 [2024-10-11 17:28:10,595 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-11 17:28:10,655 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:28:10,658 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-11 17:28:10,659 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-11 17:28:10,684 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-11 17:28:10,684 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-11 17:28:10,684 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-11 17:28:10,685 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-11 17:28:10,686 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-11 17:28:10,686 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-11 17:28:10,686 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-11 17:28:10,687 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-11 17:28:10,687 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-11 17:28:10,688 INFO L153 SettingsManager]: * Use SBE=true [2024-10-11 17:28:10,689 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-11 17:28:10,689 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-11 17:28:10,689 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-11 17:28:10,689 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-11 17:28:10,690 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-11 17:28:10,692 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-11 17:28:10,693 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-11 17:28:10,693 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-10-11 17:28:10,693 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-10-11 17:28:10,693 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-11 17:28:10,693 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-11 17:28:10,693 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-10-11 17:28:10,693 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-10-11 17:28:10,693 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-11 17:28:10,693 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-10-11 17:28:10,694 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-10-11 17:28:10,694 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-11 17:28:10,694 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-11 17:28:10,694 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-11 17:28:10,694 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-11 17:28:10,694 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-11 17:28:10,694 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-11 17:28:10,695 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-11 17:28:10,695 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 17:28:10,695 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-11 17:28:10,695 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-11 17:28:10,696 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-10-11 17:28:10,696 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-10-11 17:28:10,697 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-11 17:28:10,697 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-11 17:28:10,697 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-11 17:28:10,697 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-11 17:28:10,697 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2024-10-11 17:28:10,698 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 -> 6fd297418200393a9bb890e84311a80b6eacd7d5d7cdd65efb1397f8b8ab870f [2024-10-11 17:28:10,961 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-11 17:28:10,992 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-11 17:28:10,995 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-11 17:28:10,996 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-11 17:28:10,997 INFO L274 PluginConnector]: CDTParser initialized [2024-10-11 17:28:10,998 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_FNV_nondet_test3-1.i [2024-10-11 17:28:12,430 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-11 17:28:12,678 INFO L384 CDTParser]: Found 1 translation units. [2024-10-11 17:28:12,678 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_FNV_nondet_test3-1.i [2024-10-11 17:28:12,701 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/26fe1e6d2/58117ba80b274493bc29035996cae67e/FLAGf498ce87e [2024-10-11 17:28:12,718 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/26fe1e6d2/58117ba80b274493bc29035996cae67e [2024-10-11 17:28:12,721 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-11 17:28:12,723 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-11 17:28:12,726 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-11 17:28:12,726 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-11 17:28:12,732 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-11 17:28:12,733 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 05:28:12" (1/1) ... [2024-10-11 17:28:12,734 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5fd51f60 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:28:12, skipping insertion in model container [2024-10-11 17:28:12,735 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 05:28:12" (1/1) ... [2024-10-11 17:28:12,786 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-11 17:28:13,225 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 17:28:13,244 INFO L197 MainTranslator]: Restarting translation with changed settings: SettingsChange [mNewPreferredMemoryModel=HoenickeLindenmann_1ByteResolution] [2024-10-11 17:28:13,260 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-11 17:28:13,347 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 17:28:13,353 INFO L200 MainTranslator]: Completed pre-run [2024-10-11 17:28:13,464 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 17:28:13,515 INFO L204 MainTranslator]: Completed translation [2024-10-11 17:28:13,516 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:28:13 WrapperNode [2024-10-11 17:28:13,516 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-11 17:28:13,517 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-11 17:28:13,517 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-11 17:28:13,517 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-11 17:28:13,524 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:28:13" (1/1) ... [2024-10-11 17:28:13,557 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:28:13" (1/1) ... [2024-10-11 17:28:13,599 INFO L138 Inliner]: procedures = 180, calls = 274, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 1031 [2024-10-11 17:28:13,600 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-11 17:28:13,600 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-11 17:28:13,600 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-11 17:28:13,600 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-11 17:28:13,613 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:28:13" (1/1) ... [2024-10-11 17:28:13,613 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:28:13" (1/1) ... [2024-10-11 17:28:13,625 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:28:13" (1/1) ... [2024-10-11 17:28:13,675 INFO L175 MemorySlicer]: Split 254 memory accesses to 3 slices as follows [2, 34, 218]. 86 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0, 0]. The 54 writes are split as follows [0, 4, 50]. [2024-10-11 17:28:13,675 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:28:13" (1/1) ... [2024-10-11 17:28:13,675 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:28:13" (1/1) ... [2024-10-11 17:28:13,729 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:28:13" (1/1) ... [2024-10-11 17:28:13,738 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:28:13" (1/1) ... [2024-10-11 17:28:13,747 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:28:13" (1/1) ... [2024-10-11 17:28:13,750 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:28:13" (1/1) ... [2024-10-11 17:28:13,762 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-11 17:28:13,762 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-11 17:28:13,762 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-11 17:28:13,763 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-11 17:28:13,763 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:28:13" (1/1) ... [2024-10-11 17:28:13,767 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 17:28:13,777 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 17:28:13,792 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:28:13,794 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:28:13,833 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#0 [2024-10-11 17:28:13,833 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#1 [2024-10-11 17:28:13,833 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#2 [2024-10-11 17:28:13,833 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#0 [2024-10-11 17:28:13,834 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#1 [2024-10-11 17:28:13,834 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#2 [2024-10-11 17:28:13,834 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2024-10-11 17:28:13,834 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2024-10-11 17:28:13,834 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#0 [2024-10-11 17:28:13,834 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#1 [2024-10-11 17:28:13,834 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#2 [2024-10-11 17:28:13,834 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#0 [2024-10-11 17:28:13,834 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#1 [2024-10-11 17:28:13,835 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#2 [2024-10-11 17:28:13,835 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-10-11 17:28:13,835 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-11 17:28:13,835 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2024-10-11 17:28:13,835 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2024-10-11 17:28:13,835 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2024-10-11 17:28:13,839 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-10-11 17:28:13,839 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2024-10-11 17:28:13,839 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2024-10-11 17:28:13,839 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2024-10-11 17:28:13,839 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#0 [2024-10-11 17:28:13,839 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#1 [2024-10-11 17:28:13,839 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#2 [2024-10-11 17:28:13,839 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-10-11 17:28:13,840 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-10-11 17:28:13,840 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2024-10-11 17:28:13,840 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#2 [2024-10-11 17:28:13,840 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-11 17:28:13,840 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-11 17:28:14,051 INFO L238 CfgBuilder]: Building ICFG [2024-10-11 17:28:14,053 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-11 17:28:20,959 INFO L? ?]: Removed 127 outVars from TransFormulas that were not future-live. [2024-10-11 17:28:20,959 INFO L287 CfgBuilder]: Performing block encoding [2024-10-11 17:28:20,994 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-11 17:28:20,995 INFO L314 CfgBuilder]: Removed 63 assume(true) statements. [2024-10-11 17:28:20,995 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 05:28:20 BoogieIcfgContainer [2024-10-11 17:28:20,996 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-11 17:28:20,997 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-11 17:28:20,997 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-11 17:28:21,000 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-11 17:28:21,000 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.10 05:28:12" (1/3) ... [2024-10-11 17:28:21,000 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@34b566c9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 05:28:21, skipping insertion in model container [2024-10-11 17:28:21,001 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:28:13" (2/3) ... [2024-10-11 17:28:21,001 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@34b566c9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 05:28:21, skipping insertion in model container [2024-10-11 17:28:21,001 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 05:28:20" (3/3) ... [2024-10-11 17:28:21,002 INFO L112 eAbstractionObserver]: Analyzing ICFG uthash_FNV_nondet_test3-1.i [2024-10-11 17:28:21,014 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-11 17:28:21,015 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2024-10-11 17:28:21,063 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-11 17:28:21,069 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;@4115f33d, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-11 17:28:21,069 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2024-10-11 17:28:21,073 INFO L276 IsEmpty]: Start isEmpty. Operand has 198 states, 188 states have (on average 1.675531914893617) internal successors, (315), 191 states have internal predecessors, (315), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2024-10-11 17:28:21,077 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2024-10-11 17:28:21,078 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 17:28:21,078 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1] [2024-10-11 17:28:21,078 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, __VERIFIER_assertErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2024-10-11 17:28:21,083 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:28:21,083 INFO L85 PathProgramCache]: Analyzing trace with hash 838735, now seen corresponding path program 1 times [2024-10-11 17:28:21,093 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 17:28:21,093 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [766978030] [2024-10-11 17:28:21,093 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:28:21,094 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:28:21,094 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 17:28:21,097 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:28:21,109 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:28:21,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:28:21,221 INFO L255 TraceCheckSpWp]: Trace formula consists of 27 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-10-11 17:28:21,225 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 17:28:21,313 WARN L873 $PredicateComparison]: unable to prove that (exists ((|v_ULTIMATE.start_main_~#i~0#1.base_20| (_ BitVec 32))) (and (= (_ bv0 1) (select |c_ULTIMATE.start_main_old_#valid#1| |v_ULTIMATE.start_main_~#i~0#1.base_20|)) (= (store |c_ULTIMATE.start_main_old_#valid#1| |v_ULTIMATE.start_main_~#i~0#1.base_20| (_ bv0 1)) |c_#valid|))) is different from true [2024-10-11 17:28:21,314 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:28:21,314 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 17:28:21,315 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 17:28:21,315 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [766978030] [2024-10-11 17:28:21,316 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [766978030] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:28:21,316 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 17:28:21,316 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 17:28:21,317 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [420464649] [2024-10-11 17:28:21,317 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:28:21,320 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 17:28:21,320 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 17:28:21,339 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 17:28:21,339 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=4, Unknown=1, NotChecked=2, Total=12 [2024-10-11 17:28:21,342 INFO L87 Difference]: Start difference. First operand has 198 states, 188 states have (on average 1.675531914893617) internal successors, (315), 191 states have internal predecessors, (315), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) Second operand has 4 states, 3 states have (on average 1.0) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:28:25,508 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 [] [2024-10-11 17:28:26,062 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 17:28:26,062 INFO L93 Difference]: Finished difference Result 292 states and 383 transitions. [2024-10-11 17:28:26,064 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 17:28:26,065 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 1.0) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 3 [2024-10-11 17:28:26,065 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 17:28:26,080 INFO L225 Difference]: With dead ends: 292 [2024-10-11 17:28:26,080 INFO L226 Difference]: Without dead ends: 290 [2024-10-11 17:28:26,081 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=4, Unknown=1, NotChecked=2, Total=12 [2024-10-11 17:28:26,083 INFO L432 NwaCegarLoop]: 244 mSDtfsCounter, 120 mSDsluCounter, 231 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 0 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 122 SdHoareTripleChecker+Valid, 475 SdHoareTripleChecker+Invalid, 422 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 37 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 384 IncrementalHoareTripleChecker+Unchecked, 4.7s IncrementalHoareTripleChecker+Time [2024-10-11 17:28:26,087 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [122 Valid, 475 Invalid, 422 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 37 Invalid, 1 Unknown, 384 Unchecked, 4.7s Time] [2024-10-11 17:28:26,109 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 290 states. [2024-10-11 17:28:26,131 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 290 to 196. [2024-10-11 17:28:26,132 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 196 states, 187 states have (on average 1.2994652406417113) internal successors, (243), 189 states have internal predecessors, (243), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2024-10-11 17:28:26,134 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 196 states to 196 states and 253 transitions. [2024-10-11 17:28:26,135 INFO L78 Accepts]: Start accepts. Automaton has 196 states and 253 transitions. Word has length 3 [2024-10-11 17:28:26,135 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 17:28:26,135 INFO L471 AbstractCegarLoop]: Abstraction has 196 states and 253 transitions. [2024-10-11 17:28:26,135 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 1.0) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:28:26,136 INFO L276 IsEmpty]: Start isEmpty. Operand 196 states and 253 transitions. [2024-10-11 17:28:26,136 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2024-10-11 17:28:26,136 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 17:28:26,136 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 17:28:26,139 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2024-10-11 17:28:26,338 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:28:26,339 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, __VERIFIER_assertErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2024-10-11 17:28:26,339 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:28:26,339 INFO L85 PathProgramCache]: Analyzing trace with hash 661190916, now seen corresponding path program 1 times [2024-10-11 17:28:26,340 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 17:28:26,340 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1558893104] [2024-10-11 17:28:26,340 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:28:26,340 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:28:26,340 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 17:28:26,344 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:28:26,345 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:28:26,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:28:26,512 INFO L255 TraceCheckSpWp]: Trace formula consists of 71 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-10-11 17:28:26,514 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 17:28:26,626 WARN L873 $PredicateComparison]: unable to prove that (exists ((|v_ULTIMATE.start_main_~#i~0#1.base_21| (_ BitVec 32))) (and (= |c_#valid| (store |c_ULTIMATE.start_main_old_#valid#1| |v_ULTIMATE.start_main_~#i~0#1.base_21| (_ bv0 1))) (= (_ bv0 1) (select |c_ULTIMATE.start_main_old_#valid#1| |v_ULTIMATE.start_main_~#i~0#1.base_21|)))) is different from true [2024-10-11 17:28:26,626 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:28:26,626 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 17:28:26,626 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 17:28:26,626 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1558893104] [2024-10-11 17:28:26,627 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1558893104] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:28:26,627 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 17:28:26,627 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 17:28:26,627 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [641184181] [2024-10-11 17:28:26,627 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:28:26,629 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 17:28:26,629 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 17:28:26,630 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 17:28:26,630 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=4, Unknown=1, NotChecked=2, Total=12 [2024-10-11 17:28:26,630 INFO L87 Difference]: Start difference. First operand 196 states and 253 transitions. Second operand has 4 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:28:30,770 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 [] [2024-10-11 17:28:31,697 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 17:28:31,697 INFO L93 Difference]: Finished difference Result 291 states and 380 transitions. [2024-10-11 17:28:31,698 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 17:28:31,698 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2024-10-11 17:28:31,698 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 17:28:31,699 INFO L225 Difference]: With dead ends: 291 [2024-10-11 17:28:31,699 INFO L226 Difference]: Without dead ends: 289 [2024-10-11 17:28:31,700 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=4, Unknown=1, NotChecked=2, Total=12 [2024-10-11 17:28:31,700 INFO L432 NwaCegarLoop]: 244 mSDtfsCounter, 112 mSDsluCounter, 231 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 0 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 114 SdHoareTripleChecker+Valid, 475 SdHoareTripleChecker+Invalid, 413 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 33 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 379 IncrementalHoareTripleChecker+Unchecked, 5.0s IncrementalHoareTripleChecker+Time [2024-10-11 17:28:31,701 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [114 Valid, 475 Invalid, 413 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 33 Invalid, 1 Unknown, 379 Unchecked, 5.0s Time] [2024-10-11 17:28:31,702 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 289 states. [2024-10-11 17:28:31,716 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 289 to 265. [2024-10-11 17:28:31,716 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 265 states, 254 states have (on average 1.3070866141732282) internal successors, (332), 256 states have internal predecessors, (332), 7 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2024-10-11 17:28:31,718 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 265 states to 265 states and 346 transitions. [2024-10-11 17:28:31,718 INFO L78 Accepts]: Start accepts. Automaton has 265 states and 346 transitions. Word has length 11 [2024-10-11 17:28:31,718 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 17:28:31,718 INFO L471 AbstractCegarLoop]: Abstraction has 265 states and 346 transitions. [2024-10-11 17:28:31,719 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:28:31,719 INFO L276 IsEmpty]: Start isEmpty. Operand 265 states and 346 transitions. [2024-10-11 17:28:31,719 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2024-10-11 17:28:31,719 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 17:28:31,719 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 17:28:31,724 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:28:31,920 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:28:31,920 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, __VERIFIER_assertErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2024-10-11 17:28:31,921 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:28:31,921 INFO L85 PathProgramCache]: Analyzing trace with hash 904417889, now seen corresponding path program 1 times [2024-10-11 17:28:31,921 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 17:28:31,921 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1546166818] [2024-10-11 17:28:31,921 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:28:31,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:28:31,921 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 17:28:31,924 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:28:31,925 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:28:32,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:28:32,056 INFO L255 TraceCheckSpWp]: Trace formula consists of 74 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-10-11 17:28:32,057 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 17:28:32,167 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 17:28:32,167 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 17:28:32,168 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 17:28:32,168 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1546166818] [2024-10-11 17:28:32,169 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1546166818] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:28:32,169 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 17:28:32,169 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 17:28:32,169 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1743894098] [2024-10-11 17:28:32,170 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:28:32,171 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 17:28:32,171 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 17:28:32,172 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 17:28:32,173 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 17:28:32,173 INFO L87 Difference]: Start difference. First operand 265 states and 346 transitions. Second operand has 4 states, 4 states have (on average 3.25) internal successors, (13), 3 states have internal predecessors, (13), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:28:36,446 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 [] [2024-10-11 17:28:37,958 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 17:28:37,958 INFO L93 Difference]: Finished difference Result 355 states and 462 transitions. [2024-10-11 17:28:37,964 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 17:28:37,964 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.25) internal successors, (13), 3 states have internal predecessors, (13), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 14 [2024-10-11 17:28:37,965 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 17:28:37,966 INFO L225 Difference]: With dead ends: 355 [2024-10-11 17:28:37,968 INFO L226 Difference]: Without dead ends: 353 [2024-10-11 17:28:37,968 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 11 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:28:37,970 INFO L432 NwaCegarLoop]: 238 mSDtfsCounter, 136 mSDsluCounter, 434 mSDsCounter, 0 mSdLazyCounter, 82 mSolverCounterSat, 5 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 137 SdHoareTripleChecker+Valid, 672 SdHoareTripleChecker+Invalid, 88 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 82 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.8s IncrementalHoareTripleChecker+Time [2024-10-11 17:28:37,973 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [137 Valid, 672 Invalid, 88 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 82 Invalid, 1 Unknown, 0 Unchecked, 5.8s Time] [2024-10-11 17:28:37,974 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 353 states. [2024-10-11 17:28:37,997 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 353 to 352. [2024-10-11 17:28:37,998 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 352 states, 341 states have (on average 1.3049853372434017) internal successors, (445), 344 states have internal predecessors, (445), 7 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2024-10-11 17:28:37,999 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 352 states to 352 states and 459 transitions. [2024-10-11 17:28:37,999 INFO L78 Accepts]: Start accepts. Automaton has 352 states and 459 transitions. Word has length 14 [2024-10-11 17:28:37,999 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 17:28:37,999 INFO L471 AbstractCegarLoop]: Abstraction has 352 states and 459 transitions. [2024-10-11 17:28:37,999 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.25) internal successors, (13), 3 states have internal predecessors, (13), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:28:37,999 INFO L276 IsEmpty]: Start isEmpty. Operand 352 states and 459 transitions. [2024-10-11 17:28:38,000 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2024-10-11 17:28:38,000 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 17:28:38,000 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:28:38,006 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:28:38,201 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:28:38,201 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, __VERIFIER_assertErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2024-10-11 17:28:38,202 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:28:38,202 INFO L85 PathProgramCache]: Analyzing trace with hash 605623697, now seen corresponding path program 1 times [2024-10-11 17:28:38,202 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 17:28:38,205 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2091398123] [2024-10-11 17:28:38,205 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:28:38,205 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:28:38,205 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 17:28:38,207 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:28:38,209 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:28:38,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:28:38,336 INFO L255 TraceCheckSpWp]: Trace formula consists of 139 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-11 17:28:38,338 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 17:28:38,356 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:28:38,356 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 17:28:38,357 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 17:28:38,357 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2091398123] [2024-10-11 17:28:38,357 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2091398123] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:28:38,357 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 17:28:38,357 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 17:28:38,357 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1295115594] [2024-10-11 17:28:38,357 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:28:38,358 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 17:28:38,358 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 17:28:38,358 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 17:28:38,358 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 17:28:38,358 INFO L87 Difference]: Start difference. First operand 352 states and 459 transitions. Second operand has 4 states, 4 states have (on average 12.25) internal successors, (49), 4 states have internal predecessors, (49), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:28:38,447 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 17:28:38,447 INFO L93 Difference]: Finished difference Result 361 states and 444 transitions. [2024-10-11 17:28:38,448 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-11 17:28:38,448 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.25) internal successors, (49), 4 states have internal predecessors, (49), 1 states have call successors, (1), 1 states have call predecessors, (1), 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:28:38,448 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 17:28:38,449 INFO L225 Difference]: With dead ends: 361 [2024-10-11 17:28:38,449 INFO L226 Difference]: Without dead ends: 361 [2024-10-11 17:28:38,449 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:28:38,450 INFO L432 NwaCegarLoop]: 220 mSDtfsCounter, 30 mSDsluCounter, 423 mSDsCounter, 0 mSdLazyCounter, 50 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 643 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:28:38,450 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 643 Invalid, 72 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 50 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 17:28:38,451 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 361 states. [2024-10-11 17:28:38,470 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 361 to 361. [2024-10-11 17:28:38,470 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 361 states, 350 states have (on average 1.2285714285714286) internal successors, (430), 353 states have internal predecessors, (430), 7 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2024-10-11 17:28:38,472 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 361 states to 361 states and 444 transitions. [2024-10-11 17:28:38,472 INFO L78 Accepts]: Start accepts. Automaton has 361 states and 444 transitions. Word has length 50 [2024-10-11 17:28:38,472 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 17:28:38,472 INFO L471 AbstractCegarLoop]: Abstraction has 361 states and 444 transitions. [2024-10-11 17:28:38,472 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.25) internal successors, (49), 4 states have internal predecessors, (49), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:28:38,472 INFO L276 IsEmpty]: Start isEmpty. Operand 361 states and 444 transitions. [2024-10-11 17:28:38,473 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2024-10-11 17:28:38,473 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 17:28:38,473 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:28:38,482 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Forceful destruction successful, exit code 0 [2024-10-11 17:28:38,677 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:28:38,677 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, __VERIFIER_assertErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2024-10-11 17:28:38,678 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:28:38,681 INFO L85 PathProgramCache]: Analyzing trace with hash 1020800389, now seen corresponding path program 1 times [2024-10-11 17:28:38,681 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 17:28:38,681 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [594647591] [2024-10-11 17:28:38,681 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:28:38,681 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:28:38,681 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 17:28:38,684 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:28:38,684 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:28:38,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:28:38,838 INFO L255 TraceCheckSpWp]: Trace formula consists of 127 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-10-11 17:28:38,840 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 17:28:38,850 INFO L173 IndexEqualityManager]: detected equality via solver [2024-10-11 17:28:38,851 INFO L173 IndexEqualityManager]: detected equality via solver [2024-10-11 17:28:38,852 INFO L173 IndexEqualityManager]: detected equality via solver [2024-10-11 17:28:38,856 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:28:38,919 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-11 17:28:38,919 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:28:38,965 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:28:38,966 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 17:28:38,966 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 17:28:38,966 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [594647591] [2024-10-11 17:28:38,966 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [594647591] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:28:38,966 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 17:28:38,966 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-11 17:28:38,966 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2021261955] [2024-10-11 17:28:38,966 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:28:38,966 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 17:28:38,966 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 17:28:38,967 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 17:28:38,967 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-11 17:28:38,967 INFO L87 Difference]: Start difference. First operand 361 states and 444 transitions. Second operand has 5 states, 5 states have (on average 9.8) internal successors, (49), 5 states have internal predecessors, (49), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:28:39,334 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 17:28:39,334 INFO L93 Difference]: Finished difference Result 362 states and 451 transitions. [2024-10-11 17:28:39,335 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-11 17:28:39,335 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.8) internal successors, (49), 5 states have internal predecessors, (49), 1 states have call successors, (1), 1 states have call predecessors, (1), 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:28:39,335 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 17:28:39,336 INFO L225 Difference]: With dead ends: 362 [2024-10-11 17:28:39,336 INFO L226 Difference]: Without dead ends: 359 [2024-10-11 17:28:39,337 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 46 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-10-11 17:28:39,337 INFO L432 NwaCegarLoop]: 232 mSDtfsCounter, 108 mSDsluCounter, 673 mSDsCounter, 0 mSdLazyCounter, 62 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 111 SdHoareTripleChecker+Valid, 905 SdHoareTripleChecker+Invalid, 63 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 62 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-11 17:28:39,337 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [111 Valid, 905 Invalid, 63 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 62 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-11 17:28:39,338 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 359 states. [2024-10-11 17:28:39,344 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 359 to 312. [2024-10-11 17:28:39,345 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 312 states, 302 states have (on average 1.2450331125827814) internal successors, (376), 305 states have internal predecessors, (376), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-10-11 17:28:39,346 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 312 states to 312 states and 388 transitions. [2024-10-11 17:28:39,346 INFO L78 Accepts]: Start accepts. Automaton has 312 states and 388 transitions. Word has length 50 [2024-10-11 17:28:39,346 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 17:28:39,346 INFO L471 AbstractCegarLoop]: Abstraction has 312 states and 388 transitions. [2024-10-11 17:28:39,346 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.8) internal successors, (49), 5 states have internal predecessors, (49), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:28:39,347 INFO L276 IsEmpty]: Start isEmpty. Operand 312 states and 388 transitions. [2024-10-11 17:28:39,348 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2024-10-11 17:28:39,348 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 17:28:39,348 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] [2024-10-11 17:28:39,357 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:28:39,552 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:28:39,553 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, __VERIFIER_assertErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2024-10-11 17:28:39,554 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:28:39,554 INFO L85 PathProgramCache]: Analyzing trace with hash -235593599, now seen corresponding path program 1 times [2024-10-11 17:28:39,555 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 17:28:39,555 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2106338414] [2024-10-11 17:28:39,555 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:28:39,555 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:28:39,555 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 17:28:39,558 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:28:39,558 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:28:39,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:28:39,865 INFO L255 TraceCheckSpWp]: Trace formula consists of 491 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-11 17:28:39,868 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 17:28:39,887 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-10-11 17:28:39,888 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 17:28:39,888 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 17:28:39,888 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2106338414] [2024-10-11 17:28:39,888 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2106338414] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:28:39,888 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 17:28:39,888 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 17:28:39,888 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [985010921] [2024-10-11 17:28:39,888 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:28:39,889 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 17:28:39,889 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 17:28:39,890 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 17:28:39,890 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 17:28:39,890 INFO L87 Difference]: Start difference. First operand 312 states and 388 transitions. Second operand has 4 states, 4 states have (on average 18.5) internal successors, (74), 4 states have internal predecessors, (74), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-11 17:28:39,977 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 17:28:39,977 INFO L93 Difference]: Finished difference Result 318 states and 378 transitions. [2024-10-11 17:28:39,978 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-11 17:28:39,978 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 18.5) internal successors, (74), 4 states have internal predecessors, (74), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 80 [2024-10-11 17:28:39,978 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 17:28:39,979 INFO L225 Difference]: With dead ends: 318 [2024-10-11 17:28:39,979 INFO L226 Difference]: Without dead ends: 318 [2024-10-11 17:28:39,979 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 77 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:28:39,980 INFO L432 NwaCegarLoop]: 207 mSDtfsCounter, 33 mSDsluCounter, 400 mSDsCounter, 0 mSdLazyCounter, 46 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 33 SdHoareTripleChecker+Valid, 607 SdHoareTripleChecker+Invalid, 68 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 46 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 17:28:39,980 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [33 Valid, 607 Invalid, 68 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 46 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 17:28:39,980 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 318 states. [2024-10-11 17:28:39,983 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 318 to 318. [2024-10-11 17:28:39,984 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 318 states, 308 states have (on average 1.1883116883116882) internal successors, (366), 311 states have internal predecessors, (366), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-10-11 17:28:39,984 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 318 states to 318 states and 378 transitions. [2024-10-11 17:28:39,985 INFO L78 Accepts]: Start accepts. Automaton has 318 states and 378 transitions. Word has length 80 [2024-10-11 17:28:39,985 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 17:28:39,985 INFO L471 AbstractCegarLoop]: Abstraction has 318 states and 378 transitions. [2024-10-11 17:28:39,985 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 18.5) internal successors, (74), 4 states have internal predecessors, (74), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-11 17:28:39,985 INFO L276 IsEmpty]: Start isEmpty. Operand 318 states and 378 transitions. [2024-10-11 17:28:39,986 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2024-10-11 17:28:39,986 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 17:28:39,987 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] [2024-10-11 17:28:39,998 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Ended with exit code 0 [2024-10-11 17:28:40,187 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:28:40,188 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, __VERIFIER_assertErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2024-10-11 17:28:40,188 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:28:40,188 INFO L85 PathProgramCache]: Analyzing trace with hash -1092709359, now seen corresponding path program 1 times [2024-10-11 17:28:40,189 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 17:28:40,189 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [376789819] [2024-10-11 17:28:40,189 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:28:40,189 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:28:40,189 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 17:28:40,191 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:28:40,192 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:28:40,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:28:40,503 INFO L255 TraceCheckSpWp]: Trace formula consists of 475 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-10-11 17:28:40,506 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 17:28:40,615 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-10-11 17:28:40,615 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 17:28:40,615 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 17:28:40,615 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [376789819] [2024-10-11 17:28:40,616 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [376789819] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:28:40,616 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 17:28:40,616 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-11 17:28:40,616 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1409947246] [2024-10-11 17:28:40,616 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:28:40,616 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 17:28:40,616 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 17:28:40,617 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 17:28:40,617 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-11 17:28:40,617 INFO L87 Difference]: Start difference. First operand 318 states and 378 transitions. Second operand has 5 states, 5 states have (on average 14.8) internal successors, (74), 5 states have internal predecessors, (74), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-11 17:28:40,726 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 17:28:40,727 INFO L93 Difference]: Finished difference Result 306 states and 358 transitions. [2024-10-11 17:28:40,727 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-11 17:28:40,728 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 14.8) internal successors, (74), 5 states have internal predecessors, (74), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 80 [2024-10-11 17:28:40,728 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 17:28:40,729 INFO L225 Difference]: With dead ends: 306 [2024-10-11 17:28:40,729 INFO L226 Difference]: Without dead ends: 306 [2024-10-11 17:28:40,729 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 76 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:28:40,730 INFO L432 NwaCegarLoop]: 208 mSDtfsCounter, 8 mSDsluCounter, 399 mSDsCounter, 0 mSdLazyCounter, 45 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 607 SdHoareTripleChecker+Invalid, 52 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 45 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 17:28:40,730 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 607 Invalid, 52 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 45 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 17:28:40,731 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 306 states. [2024-10-11 17:28:40,734 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 306 to 306. [2024-10-11 17:28:40,734 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 306 states, 296 states have (on average 1.1689189189189189) internal successors, (346), 299 states have internal predecessors, (346), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-10-11 17:28:40,735 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 306 states to 306 states and 358 transitions. [2024-10-11 17:28:40,736 INFO L78 Accepts]: Start accepts. Automaton has 306 states and 358 transitions. Word has length 80 [2024-10-11 17:28:40,736 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 17:28:40,736 INFO L471 AbstractCegarLoop]: Abstraction has 306 states and 358 transitions. [2024-10-11 17:28:40,736 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 14.8) internal successors, (74), 5 states have internal predecessors, (74), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-11 17:28:40,736 INFO L276 IsEmpty]: Start isEmpty. Operand 306 states and 358 transitions. [2024-10-11 17:28:40,737 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2024-10-11 17:28:40,737 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 17:28:40,738 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] [2024-10-11 17:28:40,752 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:28:40,939 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:28:40,939 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, __VERIFIER_assertErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2024-10-11 17:28:40,939 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:28:40,939 INFO L85 PathProgramCache]: Analyzing trace with hash 507494795, now seen corresponding path program 1 times [2024-10-11 17:28:40,940 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 17:28:40,940 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1678111758] [2024-10-11 17:28:40,940 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:28:40,940 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:28:40,940 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 17:28:40,944 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:28:40,954 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:28:41,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:28:41,386 INFO L255 TraceCheckSpWp]: Trace formula consists of 481 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-11 17:28:41,389 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 17:28:41,424 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:28:41,424 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 17:28:41,424 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 17:28:41,424 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1678111758] [2024-10-11 17:28:41,424 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1678111758] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:28:41,425 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 17:28:41,425 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 17:28:41,425 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1674812698] [2024-10-11 17:28:41,425 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:28:41,425 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 17:28:41,426 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 17:28:41,426 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 17:28:41,426 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 17:28:41,426 INFO L87 Difference]: Start difference. First operand 306 states and 358 transitions. Second operand has 4 states, 3 states have (on average 25.333333333333332) internal successors, (76), 4 states have internal predecessors, (76), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2024-10-11 17:28:41,502 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 17:28:41,502 INFO L93 Difference]: Finished difference Result 308 states and 361 transitions. [2024-10-11 17:28:41,503 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 17:28:41,503 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 25.333333333333332) internal successors, (76), 4 states have internal predecessors, (76), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) Word has length 80 [2024-10-11 17:28:41,504 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 17:28:41,506 INFO L225 Difference]: With dead ends: 308 [2024-10-11 17:28:41,506 INFO L226 Difference]: Without dead ends: 308 [2024-10-11 17:28:41,506 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 77 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:28:41,507 INFO L432 NwaCegarLoop]: 222 mSDtfsCounter, 0 mSDsluCounter, 440 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 662 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 17:28:41,507 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 662 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 17:28:41,508 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 308 states. [2024-10-11 17:28:41,512 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 308 to 308. [2024-10-11 17:28:41,513 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 308 states, 297 states have (on average 1.1717171717171717) internal successors, (348), 301 states have internal predecessors, (348), 6 states have call successors, (6), 2 states have call predecessors, (6), 3 states have return successors, (7), 6 states have call predecessors, (7), 6 states have call successors, (7) [2024-10-11 17:28:41,514 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 308 states to 308 states and 361 transitions. [2024-10-11 17:28:41,514 INFO L78 Accepts]: Start accepts. Automaton has 308 states and 361 transitions. Word has length 80 [2024-10-11 17:28:41,515 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 17:28:41,515 INFO L471 AbstractCegarLoop]: Abstraction has 308 states and 361 transitions. [2024-10-11 17:28:41,515 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 25.333333333333332) internal successors, (76), 4 states have internal predecessors, (76), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2024-10-11 17:28:41,515 INFO L276 IsEmpty]: Start isEmpty. Operand 308 states and 361 transitions. [2024-10-11 17:28:41,516 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2024-10-11 17:28:41,516 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 17:28:41,516 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] [2024-10-11 17:28:41,527 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:28:41,720 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:28:41,720 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, __VERIFIER_assertErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2024-10-11 17:28:41,721 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:28:41,721 INFO L85 PathProgramCache]: Analyzing trace with hash 1165626829, now seen corresponding path program 1 times [2024-10-11 17:28:41,721 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 17:28:41,721 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1966683447] [2024-10-11 17:28:41,721 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:28:41,721 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:28:41,721 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 17:28:41,723 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:28:41,725 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:28:42,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:28:42,156 INFO L255 TraceCheckSpWp]: Trace formula consists of 503 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-10-11 17:28:42,158 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 17:28:42,195 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:28:42,195 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 17:28:42,275 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:28:42,275 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 17:28:42,276 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1966683447] [2024-10-11 17:28:42,276 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1966683447] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 17:28:42,276 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-11 17:28:42,276 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 8 [2024-10-11 17:28:42,276 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [205533854] [2024-10-11 17:28:42,276 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-11 17:28:42,276 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-11 17:28:42,276 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 17:28:42,277 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-11 17:28:42,277 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2024-10-11 17:28:42,277 INFO L87 Difference]: Start difference. First operand 308 states and 361 transitions. Second operand has 8 states, 6 states have (on average 14.0) internal successors, (84), 8 states have internal predecessors, (84), 2 states have call successors, (3), 2 states have call predecessors, (3), 4 states have return successors, (4), 1 states have call predecessors, (4), 2 states have call successors, (4) [2024-10-11 17:28:42,536 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 17:28:42,537 INFO L93 Difference]: Finished difference Result 317 states and 375 transitions. [2024-10-11 17:28:42,537 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-10-11 17:28:42,537 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 6 states have (on average 14.0) internal successors, (84), 8 states have internal predecessors, (84), 2 states have call successors, (3), 2 states have call predecessors, (3), 4 states have return successors, (4), 1 states have call predecessors, (4), 2 states have call successors, (4) Word has length 82 [2024-10-11 17:28:42,538 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 17:28:42,538 INFO L225 Difference]: With dead ends: 317 [2024-10-11 17:28:42,539 INFO L226 Difference]: Without dead ends: 317 [2024-10-11 17:28:42,539 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 165 GetRequests, 156 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=44, Invalid=66, Unknown=0, NotChecked=0, Total=110 [2024-10-11 17:28:42,539 INFO L432 NwaCegarLoop]: 222 mSDtfsCounter, 5 mSDsluCounter, 658 mSDsCounter, 0 mSdLazyCounter, 54 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 880 SdHoareTripleChecker+Invalid, 63 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 54 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-11 17:28:42,539 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 880 Invalid, 63 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 54 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-11 17:28:42,540 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 317 states. [2024-10-11 17:28:42,544 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 317 to 316. [2024-10-11 17:28:42,544 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 316 states, 304 states have (on average 1.1875) internal successors, (361), 308 states have internal predecessors, (361), 6 states have call successors, (6), 3 states have call predecessors, (6), 4 states have return successors, (7), 6 states have call predecessors, (7), 6 states have call successors, (7) [2024-10-11 17:28:42,545 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 316 states to 316 states and 374 transitions. [2024-10-11 17:28:42,546 INFO L78 Accepts]: Start accepts. Automaton has 316 states and 374 transitions. Word has length 82 [2024-10-11 17:28:42,546 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 17:28:42,546 INFO L471 AbstractCegarLoop]: Abstraction has 316 states and 374 transitions. [2024-10-11 17:28:42,546 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 6 states have (on average 14.0) internal successors, (84), 8 states have internal predecessors, (84), 2 states have call successors, (3), 2 states have call predecessors, (3), 4 states have return successors, (4), 1 states have call predecessors, (4), 2 states have call successors, (4) [2024-10-11 17:28:42,546 INFO L276 IsEmpty]: Start isEmpty. Operand 316 states and 374 transitions. [2024-10-11 17:28:42,547 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2024-10-11 17:28:42,547 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 17:28:42,547 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] [2024-10-11 17:28:42,560 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:28:42,748 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:28:42,748 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, __VERIFIER_assertErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2024-10-11 17:28:42,749 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:28:42,749 INFO L85 PathProgramCache]: Analyzing trace with hash -356041909, now seen corresponding path program 2 times [2024-10-11 17:28:42,749 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 17:28:42,750 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1934179437] [2024-10-11 17:28:42,750 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-10-11 17:28:42,750 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:28:42,750 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 17:28:42,753 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:28:42,754 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:28:43,229 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-10-11 17:28:43,229 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-11 17:28:43,246 INFO L255 TraceCheckSpWp]: Trace formula consists of 547 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-10-11 17:28:43,248 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 17:28:43,330 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:28:43,334 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 17:28:43,658 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:28:43,658 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 17:28:43,658 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1934179437] [2024-10-11 17:28:43,659 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1934179437] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 17:28:43,659 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-11 17:28:43,659 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 14 [2024-10-11 17:28:43,659 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1937789484] [2024-10-11 17:28:43,659 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-11 17:28:43,659 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-10-11 17:28:43,659 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 17:28:43,660 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-10-11 17:28:43,660 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=121, Unknown=0, NotChecked=0, Total=182 [2024-10-11 17:28:43,660 INFO L87 Difference]: Start difference. First operand 316 states and 374 transitions. Second operand has 14 states, 12 states have (on average 7.5) internal successors, (90), 14 states have internal predecessors, (90), 2 states have call successors, (3), 2 states have call predecessors, (3), 4 states have return successors, (4), 1 states have call predecessors, (4), 2 states have call successors, (4) [2024-10-11 17:28:44,252 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 17:28:44,253 INFO L93 Difference]: Finished difference Result 328 states and 393 transitions. [2024-10-11 17:28:44,253 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2024-10-11 17:28:44,254 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 12 states have (on average 7.5) internal successors, (90), 14 states have internal predecessors, (90), 2 states have call successors, (3), 2 states have call predecessors, (3), 4 states have return successors, (4), 1 states have call predecessors, (4), 2 states have call successors, (4) Word has length 86 [2024-10-11 17:28:44,254 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 17:28:44,255 INFO L225 Difference]: With dead ends: 328 [2024-10-11 17:28:44,255 INFO L226 Difference]: Without dead ends: 326 [2024-10-11 17:28:44,255 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 179 GetRequests, 158 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=182, Invalid=324, Unknown=0, NotChecked=0, Total=506 [2024-10-11 17:28:44,256 INFO L432 NwaCegarLoop]: 222 mSDtfsCounter, 8 mSDsluCounter, 2187 mSDsCounter, 0 mSdLazyCounter, 199 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 2409 SdHoareTripleChecker+Invalid, 209 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 199 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-11 17:28:44,256 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 2409 Invalid, 209 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 199 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-11 17:28:44,257 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 326 states. [2024-10-11 17:28:44,261 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 326 to 325. [2024-10-11 17:28:44,261 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 325 states, 313 states have (on average 1.1916932907348243) internal successors, (373), 317 states have internal predecessors, (373), 6 states have call successors, (6), 3 states have call predecessors, (6), 4 states have return successors, (7), 6 states have call predecessors, (7), 6 states have call successors, (7) [2024-10-11 17:28:44,262 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 325 states to 325 states and 386 transitions. [2024-10-11 17:28:44,262 INFO L78 Accepts]: Start accepts. Automaton has 325 states and 386 transitions. Word has length 86 [2024-10-11 17:28:44,262 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 17:28:44,263 INFO L471 AbstractCegarLoop]: Abstraction has 325 states and 386 transitions. [2024-10-11 17:28:44,263 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 12 states have (on average 7.5) internal successors, (90), 14 states have internal predecessors, (90), 2 states have call successors, (3), 2 states have call predecessors, (3), 4 states have return successors, (4), 1 states have call predecessors, (4), 2 states have call successors, (4) [2024-10-11 17:28:44,263 INFO L276 IsEmpty]: Start isEmpty. Operand 325 states and 386 transitions. [2024-10-11 17:28:44,263 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2024-10-11 17:28:44,263 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 17:28:44,264 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] [2024-10-11 17:28:44,277 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Ended with exit code 0 [2024-10-11 17:28:44,467 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 17:28:44,468 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, __VERIFIER_assertErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2024-10-11 17:28:44,468 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:28:44,468 INFO L85 PathProgramCache]: Analyzing trace with hash 392063569, now seen corresponding path program 3 times [2024-10-11 17:28:44,469 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 17:28:44,469 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [175826871] [2024-10-11 17:28:44,469 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-10-11 17:28:44,469 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 17:28:44,470 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 17:28:44,471 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-11 17:28:44,473 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (12)] Waiting until timeout for monitored process [2024-10-11 17:28:44,910 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2024-10-11 17:28:44,910 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-11 17:28:44,922 INFO L255 TraceCheckSpWp]: Trace formula consists of 367 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-10-11 17:28:44,925 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 17:28:45,129 INFO L134 CoverageAnalysis]: Checked inductivity of 140 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 138 trivial. 0 not checked. [2024-10-11 17:28:45,129 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 17:28:45,129 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 17:28:45,129 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [175826871] [2024-10-11 17:28:45,129 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [175826871] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:28:45,129 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 17:28:45,129 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 17:28:45,129 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1582597811] [2024-10-11 17:28:45,129 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:28:45,130 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 17:28:45,130 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 17:28:45,130 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 17:28:45,130 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 17:28:45,130 INFO L87 Difference]: Start difference. First operand 325 states and 386 transitions. Second operand has 4 states, 4 states have (on average 18.75) internal successors, (75), 4 states have internal predecessors, (75), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-11 17:28:49,492 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 [] [2024-10-11 17:28:53,497 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 [] [2024-10-11 17:28:54,964 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 17:28:54,964 INFO L93 Difference]: Finished difference Result 417 states and 499 transitions. [2024-10-11 17:28:54,965 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 17:28:54,965 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 18.75) internal successors, (75), 4 states have internal predecessors, (75), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 95 [2024-10-11 17:28:54,965 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 17:28:54,967 INFO L225 Difference]: With dead ends: 417 [2024-10-11 17:28:54,967 INFO L226 Difference]: Without dead ends: 417 [2024-10-11 17:28:54,967 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 96 GetRequests, 93 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:28:54,967 INFO L432 NwaCegarLoop]: 217 mSDtfsCounter, 422 mSDsluCounter, 162 mSDsCounter, 0 mSdLazyCounter, 85 mSolverCounterSat, 5 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 9.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 424 SdHoareTripleChecker+Valid, 379 SdHoareTripleChecker+Invalid, 92 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 85 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 9.8s IncrementalHoareTripleChecker+Time [2024-10-11 17:28:54,967 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [424 Valid, 379 Invalid, 92 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 85 Invalid, 2 Unknown, 0 Unchecked, 9.8s Time] [2024-10-11 17:28:54,968 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 417 states. [2024-10-11 17:28:54,976 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 417 to 414. [2024-10-11 17:28:54,983 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 414 states, 401 states have (on average 1.1970074812967582) internal successors, (480), 406 states have internal predecessors, (480), 7 states have call successors, (7), 3 states have call predecessors, (7), 4 states have return successors, (8), 7 states have call predecessors, (8), 7 states have call successors, (8) [2024-10-11 17:28:54,984 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 414 states to 414 states and 495 transitions. [2024-10-11 17:28:54,984 INFO L78 Accepts]: Start accepts. Automaton has 414 states and 495 transitions. Word has length 95 [2024-10-11 17:28:54,985 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 17:28:54,988 INFO L471 AbstractCegarLoop]: Abstraction has 414 states and 495 transitions. [2024-10-11 17:28:54,988 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 18.75) internal successors, (75), 4 states have internal predecessors, (75), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-11 17:28:54,988 INFO L276 IsEmpty]: Start isEmpty. Operand 414 states and 495 transitions. [2024-10-11 17:28:54,989 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2024-10-11 17:28:54,989 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 17:28:54,989 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] [2024-10-11 17:28:55,000 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (12)] Ended with exit code 0 [2024-10-11 17:28:55,189 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 17:28:55,190 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, __VERIFIER_assertErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2024-10-11 17:28:55,190 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:28:55,190 INFO L85 PathProgramCache]: Analyzing trace with hash 2035565044, now seen corresponding path program 1 times [2024-10-11 17:28:55,190 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 17:28:55,191 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1280686838] [2024-10-11 17:28:55,191 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:28:55,191 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:28:55,191 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 17:28:55,192 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-11 17:28:55,193 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (13)] Waiting until timeout for monitored process [2024-10-11 17:28:55,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:28:55,616 INFO L255 TraceCheckSpWp]: Trace formula consists of 649 conjuncts, 13 conjuncts are in the unsatisfiable core [2024-10-11 17:28:55,618 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 17:28:55,770 INFO L134 CoverageAnalysis]: Checked inductivity of 140 backedges. 70 proven. 55 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2024-10-11 17:28:55,770 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 17:28:56,228 INFO L134 CoverageAnalysis]: Checked inductivity of 140 backedges. 2 proven. 122 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2024-10-11 17:28:56,228 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 17:28:56,228 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1280686838] [2024-10-11 17:28:56,228 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1280686838] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 17:28:56,228 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-11 17:28:56,228 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 26 [2024-10-11 17:28:56,228 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1352100381] [2024-10-11 17:28:56,228 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-11 17:28:56,229 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2024-10-11 17:28:56,230 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 17:28:56,230 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2024-10-11 17:28:56,231 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=193, Invalid=457, Unknown=0, NotChecked=0, Total=650 [2024-10-11 17:28:56,231 INFO L87 Difference]: Start difference. First operand 414 states and 495 transitions. Second operand has 26 states, 24 states have (on average 4.333333333333333) internal successors, (104), 26 states have internal predecessors, (104), 2 states have call successors, (4), 2 states have call predecessors, (4), 4 states have return successors, (4), 1 states have call predecessors, (4), 2 states have call successors, (4) [2024-10-11 17:28:57,724 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 17:28:57,725 INFO L93 Difference]: Finished difference Result 435 states and 532 transitions. [2024-10-11 17:28:57,725 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2024-10-11 17:28:57,725 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 24 states have (on average 4.333333333333333) internal successors, (104), 26 states have internal predecessors, (104), 2 states have call successors, (4), 2 states have call predecessors, (4), 4 states have return successors, (4), 1 states have call predecessors, (4), 2 states have call successors, (4) Word has length 98 [2024-10-11 17:28:57,726 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 17:28:57,727 INFO L225 Difference]: With dead ends: 435 [2024-10-11 17:28:57,727 INFO L226 Difference]: Without dead ends: 433 [2024-10-11 17:28:57,728 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 215 GetRequests, 170 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 100 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=728, Invalid=1434, Unknown=0, NotChecked=0, Total=2162 [2024-10-11 17:28:57,729 INFO L432 NwaCegarLoop]: 222 mSDtfsCounter, 14 mSDsluCounter, 2630 mSDsCounter, 0 mSdLazyCounter, 578 mSolverCounterSat, 36 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 2852 SdHoareTripleChecker+Invalid, 614 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 36 IncrementalHoareTripleChecker+Valid, 578 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-10-11 17:28:57,730 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 2852 Invalid, 614 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [36 Valid, 578 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-10-11 17:28:57,730 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 433 states. [2024-10-11 17:28:57,734 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 433 to 432. [2024-10-11 17:28:57,735 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 432 states, 419 states have (on average 1.2028639618138426) internal successors, (504), 424 states have internal predecessors, (504), 7 states have call successors, (7), 3 states have call predecessors, (7), 4 states have return successors, (8), 7 states have call predecessors, (8), 7 states have call successors, (8) [2024-10-11 17:28:57,746 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 432 states to 432 states and 519 transitions. [2024-10-11 17:28:57,746 INFO L78 Accepts]: Start accepts. Automaton has 432 states and 519 transitions. Word has length 98 [2024-10-11 17:28:57,746 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 17:28:57,747 INFO L471 AbstractCegarLoop]: Abstraction has 432 states and 519 transitions. [2024-10-11 17:28:57,747 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 24 states have (on average 4.333333333333333) internal successors, (104), 26 states have internal predecessors, (104), 2 states have call successors, (4), 2 states have call predecessors, (4), 4 states have return successors, (4), 1 states have call predecessors, (4), 2 states have call successors, (4) [2024-10-11 17:28:57,747 INFO L276 IsEmpty]: Start isEmpty. Operand 432 states and 519 transitions. [2024-10-11 17:28:57,748 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2024-10-11 17:28:57,748 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 17:28:57,748 INFO L215 NwaCegarLoop]: trace histogram [33, 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] [2024-10-11 17:28:57,761 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 (13)] Forceful destruction successful, exit code 0 [2024-10-11 17:28:57,952 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 17:28:57,953 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, __VERIFIER_assertErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2024-10-11 17:28:57,953 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:28:57,953 INFO L85 PathProgramCache]: Analyzing trace with hash 1229274932, now seen corresponding path program 2 times [2024-10-11 17:28:57,954 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 17:28:57,954 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1973715153] [2024-10-11 17:28:57,954 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-10-11 17:28:57,955 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:28:57,955 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 17:28:57,956 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-11 17:28:57,957 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (14)] Waiting until timeout for monitored process [2024-10-11 17:28:58,470 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-10-11 17:28:58,470 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-11 17:28:58,491 INFO L255 TraceCheckSpWp]: Trace formula consists of 847 conjuncts, 25 conjuncts are in the unsatisfiable core [2024-10-11 17:28:58,494 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 17:28:58,987 INFO L134 CoverageAnalysis]: Checked inductivity of 599 backedges. 280 proven. 253 refuted. 0 times theorem prover too weak. 66 trivial. 0 not checked. [2024-10-11 17:28:58,987 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 17:29:00,561 INFO L134 CoverageAnalysis]: Checked inductivity of 599 backedges. 2 proven. 530 refuted. 0 times theorem prover too weak. 67 trivial. 0 not checked. [2024-10-11 17:29:00,561 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 17:29:00,561 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1973715153] [2024-10-11 17:29:00,561 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1973715153] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 17:29:00,561 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-11 17:29:00,562 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 26] total 50 [2024-10-11 17:29:00,562 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [398851673] [2024-10-11 17:29:00,562 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-11 17:29:00,562 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 50 states [2024-10-11 17:29:00,562 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 17:29:00,563 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2024-10-11 17:29:00,563 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=672, Invalid=1778, Unknown=0, NotChecked=0, Total=2450 [2024-10-11 17:29:00,563 INFO L87 Difference]: Start difference. First operand 432 states and 519 transitions. Second operand has 50 states, 48 states have (on average 2.6666666666666665) internal successors, (128), 50 states have internal predecessors, (128), 2 states have call successors, (4), 2 states have call predecessors, (4), 4 states have return successors, (4), 1 states have call predecessors, (4), 2 states have call successors, (4) [2024-10-11 17:29:06,297 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 17:29:06,297 INFO L93 Difference]: Finished difference Result 469 states and 588 transitions. [2024-10-11 17:29:06,298 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 71 states. [2024-10-11 17:29:06,298 INFO L78 Accepts]: Start accepts. Automaton has has 50 states, 48 states have (on average 2.6666666666666665) internal successors, (128), 50 states have internal predecessors, (128), 2 states have call successors, (4), 2 states have call predecessors, (4), 4 states have return successors, (4), 1 states have call predecessors, (4), 2 states have call successors, (4) Word has length 116 [2024-10-11 17:29:06,298 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 17:29:06,300 INFO L225 Difference]: With dead ends: 469 [2024-10-11 17:29:06,300 INFO L226 Difference]: Without dead ends: 467 [2024-10-11 17:29:06,301 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 273 GetRequests, 182 SyntacticMatches, 0 SemanticMatches, 91 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 465 ImplicationChecksByTransitivity, 5.1s TimeCoverageRelationStatistics Valid=2713, Invalid=5843, Unknown=0, NotChecked=0, Total=8556 [2024-10-11 17:29:06,302 INFO L432 NwaCegarLoop]: 222 mSDtfsCounter, 26 mSDsluCounter, 5257 mSDsCounter, 0 mSdLazyCounter, 1954 mSolverCounterSat, 35 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 5479 SdHoareTripleChecker+Invalid, 1989 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 35 IncrementalHoareTripleChecker+Valid, 1954 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2024-10-11 17:29:06,302 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 5479 Invalid, 1989 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [35 Valid, 1954 Invalid, 0 Unknown, 0 Unchecked, 2.2s Time] [2024-10-11 17:29:06,302 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 467 states. [2024-10-11 17:29:06,306 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 467 to 466. [2024-10-11 17:29:06,307 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 466 states, 453 states have (on average 1.2141280353200883) internal successors, (550), 458 states have internal predecessors, (550), 7 states have call successors, (7), 3 states have call predecessors, (7), 4 states have return successors, (8), 7 states have call predecessors, (8), 7 states have call successors, (8) [2024-10-11 17:29:06,307 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 466 states to 466 states and 565 transitions. [2024-10-11 17:29:06,308 INFO L78 Accepts]: Start accepts. Automaton has 466 states and 565 transitions. Word has length 116 [2024-10-11 17:29:06,308 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 17:29:06,308 INFO L471 AbstractCegarLoop]: Abstraction has 466 states and 565 transitions. [2024-10-11 17:29:06,308 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 50 states, 48 states have (on average 2.6666666666666665) internal successors, (128), 50 states have internal predecessors, (128), 2 states have call successors, (4), 2 states have call predecessors, (4), 4 states have return successors, (4), 1 states have call predecessors, (4), 2 states have call successors, (4) [2024-10-11 17:29:06,308 INFO L276 IsEmpty]: Start isEmpty. Operand 466 states and 565 transitions. [2024-10-11 17:29:06,309 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2024-10-11 17:29:06,309 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 17:29:06,309 INFO L215 NwaCegarLoop]: trace histogram [67, 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] [2024-10-11 17:29:06,323 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (14)] Ended with exit code 0 [2024-10-11 17:29:06,513 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 17:29:06,514 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, __VERIFIER_assertErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2024-10-11 17:29:06,514 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:29:06,514 INFO L85 PathProgramCache]: Analyzing trace with hash -42702540, now seen corresponding path program 3 times [2024-10-11 17:29:06,515 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 17:29:06,515 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [560055910] [2024-10-11 17:29:06,515 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-10-11 17:29:06,515 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:29:06,515 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 17:29:06,517 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-11 17:29:06,518 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (15)] Waiting until timeout for monitored process [2024-10-11 17:29:07,064 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2024-10-11 17:29:07,064 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-11 17:29:07,083 INFO L255 TraceCheckSpWp]: Trace formula consists of 370 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-10-11 17:29:07,103 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 17:29:07,334 INFO L173 IndexEqualityManager]: detected equality via solver [2024-10-11 17:29:07,334 INFO L173 IndexEqualityManager]: detected equality via solver [2024-10-11 17:29:07,335 INFO L173 IndexEqualityManager]: detected equality via solver [2024-10-11 17:29:07,339 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:29:07,392 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-11 17:29:07,393 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:29:07,414 INFO L134 CoverageAnalysis]: Checked inductivity of 2350 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 2348 trivial. 0 not checked. [2024-10-11 17:29:07,415 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 17:29:07,415 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 17:29:07,415 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [560055910] [2024-10-11 17:29:07,415 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [560055910] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:29:07,415 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 17:29:07,415 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-11 17:29:07,415 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [784781940] [2024-10-11 17:29:07,415 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:29:07,416 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-11 17:29:07,416 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 17:29:07,416 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-11 17:29:07,416 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2024-10-11 17:29:07,416 INFO L87 Difference]: Start difference. First operand 466 states and 565 transitions. Second operand has 6 states, 6 states have (on average 12.833333333333334) internal successors, (77), 6 states have internal predecessors, (77), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-11 17:29:07,673 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 17:29:07,673 INFO L93 Difference]: Finished difference Result 576 states and 699 transitions. [2024-10-11 17:29:07,674 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-11 17:29:07,674 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 12.833333333333334) internal successors, (77), 6 states have internal predecessors, (77), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 150 [2024-10-11 17:29:07,674 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 17:29:07,676 INFO L225 Difference]: With dead ends: 576 [2024-10-11 17:29:07,676 INFO L226 Difference]: Without dead ends: 576 [2024-10-11 17:29:07,676 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 150 GetRequests, 145 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=20, Invalid=22, Unknown=0, NotChecked=0, Total=42 [2024-10-11 17:29:07,677 INFO L432 NwaCegarLoop]: 214 mSDtfsCounter, 572 mSDsluCounter, 395 mSDsCounter, 0 mSdLazyCounter, 54 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 575 SdHoareTripleChecker+Valid, 609 SdHoareTripleChecker+Invalid, 58 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 54 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-11 17:29:07,677 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [575 Valid, 609 Invalid, 58 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 54 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-11 17:29:07,679 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 576 states. [2024-10-11 17:29:07,696 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 576 to 468. [2024-10-11 17:29:07,696 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 468 states, 455 states have (on average 1.213186813186813) internal successors, (552), 460 states have internal predecessors, (552), 7 states have call successors, (7), 3 states have call predecessors, (7), 4 states have return successors, (8), 7 states have call predecessors, (8), 7 states have call successors, (8) [2024-10-11 17:29:07,697 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 468 states to 468 states and 567 transitions. [2024-10-11 17:29:07,698 INFO L78 Accepts]: Start accepts. Automaton has 468 states and 567 transitions. Word has length 150 [2024-10-11 17:29:07,698 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 17:29:07,698 INFO L471 AbstractCegarLoop]: Abstraction has 468 states and 567 transitions. [2024-10-11 17:29:07,698 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 12.833333333333334) internal successors, (77), 6 states have internal predecessors, (77), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-11 17:29:07,698 INFO L276 IsEmpty]: Start isEmpty. Operand 468 states and 567 transitions. [2024-10-11 17:29:07,699 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 195 [2024-10-11 17:29:07,699 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 17:29:07,699 INFO L215 NwaCegarLoop]: trace histogram [67, 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, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 17:29:07,709 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 (15)] Ended with exit code 0 [2024-10-11 17:29:07,900 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 17:29:07,900 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, __VERIFIER_assertErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2024-10-11 17:29:07,900 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:29:07,901 INFO L85 PathProgramCache]: Analyzing trace with hash -1292381150, now seen corresponding path program 1 times [2024-10-11 17:29:07,901 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 17:29:07,901 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [833525570] [2024-10-11 17:29:07,901 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:29:07,902 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:29:07,902 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 17:29:07,904 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-11 17:29:07,904 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (16)] Waiting until timeout for monitored process [2024-10-11 17:29:08,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:29:08,858 INFO L255 TraceCheckSpWp]: Trace formula consists of 1290 conjuncts, 26 conjuncts are in the unsatisfiable core [2024-10-11 17:29:08,862 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 17:29:09,356 INFO L134 CoverageAnalysis]: Checked inductivity of 2350 backedges. 1083 proven. 276 refuted. 0 times theorem prover too weak. 991 trivial. 0 not checked. [2024-10-11 17:29:09,356 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 17:29:11,080 INFO L134 CoverageAnalysis]: Checked inductivity of 2350 backedges. 1083 proven. 276 refuted. 0 times theorem prover too weak. 991 trivial. 0 not checked. [2024-10-11 17:29:11,081 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 17:29:11,081 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [833525570] [2024-10-11 17:29:11,081 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [833525570] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 17:29:11,081 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-11 17:29:11,081 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 27] total 52 [2024-10-11 17:29:11,081 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1865516989] [2024-10-11 17:29:11,081 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-11 17:29:11,082 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 52 states [2024-10-11 17:29:11,082 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 17:29:11,082 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2024-10-11 17:29:11,083 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=726, Invalid=1926, Unknown=0, NotChecked=0, Total=2652 [2024-10-11 17:29:11,083 INFO L87 Difference]: Start difference. First operand 468 states and 567 transitions. Second operand has 52 states, 50 states have (on average 3.42) internal successors, (171), 52 states have internal predecessors, (171), 2 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2024-10-11 17:29:17,003 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 17:29:17,004 INFO L93 Difference]: Finished difference Result 495 states and 619 transitions. [2024-10-11 17:29:17,004 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 76 states. [2024-10-11 17:29:17,004 INFO L78 Accepts]: Start accepts. Automaton has has 52 states, 50 states have (on average 3.42) internal successors, (171), 52 states have internal predecessors, (171), 2 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) Word has length 194 [2024-10-11 17:29:17,005 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 17:29:17,006 INFO L225 Difference]: With dead ends: 495 [2024-10-11 17:29:17,006 INFO L226 Difference]: Without dead ends: 495 [2024-10-11 17:29:17,008 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 433 GetRequests, 336 SyntacticMatches, 0 SemanticMatches, 97 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1633 ImplicationChecksByTransitivity, 6.0s TimeCoverageRelationStatistics Valid=3146, Invalid=6556, Unknown=0, NotChecked=0, Total=9702 [2024-10-11 17:29:17,008 INFO L432 NwaCegarLoop]: 221 mSDtfsCounter, 26 mSDsluCounter, 5670 mSDsCounter, 0 mSdLazyCounter, 1456 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 5891 SdHoareTripleChecker+Invalid, 1488 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 1456 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2024-10-11 17:29:17,008 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 5891 Invalid, 1488 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 1456 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2024-10-11 17:29:17,009 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 495 states. [2024-10-11 17:29:17,013 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 495 to 493. [2024-10-11 17:29:17,014 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 493 states, 480 states have (on average 1.2541666666666667) internal successors, (602), 485 states have internal predecessors, (602), 7 states have call successors, (7), 3 states have call predecessors, (7), 4 states have return successors, (8), 7 states have call predecessors, (8), 7 states have call successors, (8) [2024-10-11 17:29:17,015 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 493 states to 493 states and 617 transitions. [2024-10-11 17:29:17,015 INFO L78 Accepts]: Start accepts. Automaton has 493 states and 617 transitions. Word has length 194 [2024-10-11 17:29:17,015 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 17:29:17,015 INFO L471 AbstractCegarLoop]: Abstraction has 493 states and 617 transitions. [2024-10-11 17:29:17,015 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 52 states, 50 states have (on average 3.42) internal successors, (171), 52 states have internal predecessors, (171), 2 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2024-10-11 17:29:17,016 INFO L276 IsEmpty]: Start isEmpty. Operand 493 states and 617 transitions. [2024-10-11 17:29:17,017 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 220 [2024-10-11 17:29:17,017 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 17:29:17,017 INFO L215 NwaCegarLoop]: trace histogram [92, 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, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 17:29:17,037 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (16)] Ended with exit code 0 [2024-10-11 17:29:17,220 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 17:29:17,220 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, __VERIFIER_assertErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2024-10-11 17:29:17,221 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:29:17,221 INFO L85 PathProgramCache]: Analyzing trace with hash 1917969768, now seen corresponding path program 2 times [2024-10-11 17:29:17,222 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 17:29:17,222 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [135533163] [2024-10-11 17:29:17,222 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-10-11 17:29:17,222 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:29:17,222 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 17:29:17,226 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-11 17:29:17,227 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (17)] Waiting until timeout for monitored process [2024-10-11 17:29:19,002 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-10-11 17:29:19,003 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-11 17:29:19,047 INFO L255 TraceCheckSpWp]: Trace formula consists of 1565 conjuncts, 51 conjuncts are in the unsatisfiable core [2024-10-11 17:29:19,051 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 17:29:20,653 INFO L134 CoverageAnalysis]: Checked inductivity of 4375 backedges. 2208 proven. 1176 refuted. 0 times theorem prover too weak. 991 trivial. 0 not checked. [2024-10-11 17:29:20,653 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 17:29:26,452 INFO L134 CoverageAnalysis]: Checked inductivity of 4375 backedges. 2208 proven. 1176 refuted. 0 times theorem prover too weak. 991 trivial. 0 not checked. [2024-10-11 17:29:26,456 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 17:29:26,456 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [135533163] [2024-10-11 17:29:26,456 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [135533163] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 17:29:26,456 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-11 17:29:26,456 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [52, 52] total 102 [2024-10-11 17:29:26,456 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1585224047] [2024-10-11 17:29:26,457 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-11 17:29:26,457 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 102 states [2024-10-11 17:29:26,457 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 17:29:26,458 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 102 interpolants. [2024-10-11 17:29:26,460 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=2701, Invalid=7601, Unknown=0, NotChecked=0, Total=10302 [2024-10-11 17:29:26,460 INFO L87 Difference]: Start difference. First operand 493 states and 617 transitions. Second operand has 102 states, 100 states have (on average 2.21) internal successors, (221), 102 states have internal predecessors, (221), 2 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3)