./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_test3-2.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_test3-2.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 6560568361eacef24363f4e5a58f5226b4c8bc2851167e042d4f8ce61eb0aa48 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-84cfde4 [2024-10-11 17:29:20,331 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-11 17:29:20,396 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:29:20,401 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-11 17:29:20,402 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-11 17:29:20,428 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-11 17:29:20,429 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-11 17:29:20,430 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-11 17:29:20,430 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-11 17:29:20,432 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-11 17:29:20,434 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-11 17:29:20,435 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-11 17:29:20,435 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-11 17:29:20,435 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-11 17:29:20,436 INFO L153 SettingsManager]: * Use SBE=true [2024-10-11 17:29:20,436 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-11 17:29:20,436 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-11 17:29:20,436 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-11 17:29:20,436 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-11 17:29:20,437 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-11 17:29:20,437 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-11 17:29:20,439 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-11 17:29:20,439 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-10-11 17:29:20,439 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-10-11 17:29:20,439 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-11 17:29:20,440 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-11 17:29:20,440 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-10-11 17:29:20,440 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-11 17:29:20,440 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-10-11 17:29:20,441 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-11 17:29:20,441 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-11 17:29:20,441 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-11 17:29:20,441 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-11 17:29:20,442 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-11 17:29:20,442 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-11 17:29:20,442 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-11 17:29:20,443 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 17:29:20,443 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-11 17:29:20,443 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-11 17:29:20,444 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-11 17:29:20,444 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-11 17:29:20,445 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-11 17:29:20,445 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-11 17:29:20,445 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-11 17:29:20,445 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-11 17:29:20,446 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 -> 6560568361eacef24363f4e5a58f5226b4c8bc2851167e042d4f8ce61eb0aa48 [2024-10-11 17:29:20,714 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-11 17:29:20,739 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-11 17:29:20,742 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-11 17:29:20,743 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-11 17:29:20,743 INFO L274 PluginConnector]: CDTParser initialized [2024-10-11 17:29:20,745 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_FNV_test3-2.i [2024-10-11 17:29:22,181 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-11 17:29:22,490 INFO L384 CDTParser]: Found 1 translation units. [2024-10-11 17:29:22,491 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_FNV_test3-2.i [2024-10-11 17:29:22,510 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/2f0a3c727/9e20a36940234bf2ab169ca51fa18022/FLAG810af45a3 [2024-10-11 17:29:22,766 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/2f0a3c727/9e20a36940234bf2ab169ca51fa18022 [2024-10-11 17:29:22,768 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-11 17:29:22,769 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-11 17:29:22,770 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-11 17:29:22,771 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-11 17:29:22,775 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-11 17:29:22,775 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 05:29:22" (1/1) ... [2024-10-11 17:29:22,776 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6473c613 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:29:22, skipping insertion in model container [2024-10-11 17:29:22,776 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 05:29:22" (1/1) ... [2024-10-11 17:29:22,826 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-11 17:29:23,345 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 17:29:23,362 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:29:23,363 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver@62a69f4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:29:23, skipping insertion in model container [2024-10-11 17:29:23,363 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-11 17:29:23,363 INFO L186 ToolchainWalker]: Toolchain execution was canceled (user or tool) before executing de.uni_freiburg.informatik.ultimate.boogie.procedureinliner [2024-10-11 17:29:23,365 INFO L158 Benchmark]: Toolchain (without parser) took 594.70ms. Allocated memory is still 132.1MB. Free memory was 101.6MB in the beginning and 79.5MB in the end (delta: 22.2MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB. [2024-10-11 17:29:23,366 INFO L158 Benchmark]: CDTParser took 0.52ms. Allocated memory is still 132.1MB. Free memory is still 104.1MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-11 17:29:23,366 INFO L158 Benchmark]: CACSL2BoogieTranslator took 592.71ms. Allocated memory is still 132.1MB. Free memory was 101.6MB in the beginning and 79.5MB in the end (delta: 22.2MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB. [2024-10-11 17:29:23,367 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.52ms. Allocated memory is still 132.1MB. Free memory is still 104.1MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 592.71ms. Allocated memory is still 132.1MB. Free memory was 101.6MB in the beginning and 79.5MB in the end (delta: 22.2MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - UnsupportedSyntaxResult [Line: 736]: 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_test3-2.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 6560568361eacef24363f4e5a58f5226b4c8bc2851167e042d4f8ce61eb0aa48 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-84cfde4 [2024-10-11 17:29:25,401 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-11 17:29:25,477 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:29:25,483 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-11 17:29:25,484 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-11 17:29:25,507 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-11 17:29:25,510 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-11 17:29:25,510 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-11 17:29:25,510 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-11 17:29:25,511 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-11 17:29:25,511 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-11 17:29:25,512 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-11 17:29:25,512 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-11 17:29:25,513 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-11 17:29:25,514 INFO L153 SettingsManager]: * Use SBE=true [2024-10-11 17:29:25,514 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-11 17:29:25,514 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-11 17:29:25,514 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-11 17:29:25,515 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-11 17:29:25,515 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-11 17:29:25,515 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-11 17:29:25,518 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-11 17:29:25,518 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-10-11 17:29:25,518 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-10-11 17:29:25,519 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-11 17:29:25,519 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-11 17:29:25,519 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-10-11 17:29:25,519 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-10-11 17:29:25,520 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-11 17:29:25,520 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-10-11 17:29:25,520 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-10-11 17:29:25,520 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-11 17:29:25,520 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-11 17:29:25,520 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-11 17:29:25,528 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-11 17:29:25,528 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-11 17:29:25,529 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-11 17:29:25,529 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-11 17:29:25,530 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 17:29:25,530 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-11 17:29:25,530 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-11 17:29:25,530 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-10-11 17:29:25,531 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-10-11 17:29:25,531 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-11 17:29:25,531 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-11 17:29:25,531 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-11 17:29:25,531 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-11 17:29:25,531 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2024-10-11 17:29:25,531 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 -> 6560568361eacef24363f4e5a58f5226b4c8bc2851167e042d4f8ce61eb0aa48 [2024-10-11 17:29:25,857 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-11 17:29:25,879 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-11 17:29:25,883 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-11 17:29:25,884 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-11 17:29:25,884 INFO L274 PluginConnector]: CDTParser initialized [2024-10-11 17:29:25,885 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_FNV_test3-2.i [2024-10-11 17:29:27,410 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-11 17:29:27,700 INFO L384 CDTParser]: Found 1 translation units. [2024-10-11 17:29:27,701 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_FNV_test3-2.i [2024-10-11 17:29:27,730 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/0427dff40/baf5144992e744468e28406c0f31a67b/FLAGf82a74b40 [2024-10-11 17:29:27,745 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/0427dff40/baf5144992e744468e28406c0f31a67b [2024-10-11 17:29:27,748 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-11 17:29:27,750 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-11 17:29:27,752 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-11 17:29:27,753 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-11 17:29:27,758 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-11 17:29:27,759 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 05:29:27" (1/1) ... [2024-10-11 17:29:27,759 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6fc31271 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:29:27, skipping insertion in model container [2024-10-11 17:29:27,760 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 05:29:27" (1/1) ... [2024-10-11 17:29:27,822 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-11 17:29:28,382 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 17:29:28,399 INFO L197 MainTranslator]: Restarting translation with changed settings: SettingsChange [mNewPreferredMemoryModel=HoenickeLindenmann_1ByteResolution] [2024-10-11 17:29:28,409 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-11 17:29:28,509 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 17:29:28,514 INFO L200 MainTranslator]: Completed pre-run [2024-10-11 17:29:28,580 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 17:29:28,642 INFO L204 MainTranslator]: Completed translation [2024-10-11 17:29:28,643 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:29:28 WrapperNode [2024-10-11 17:29:28,643 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-11 17:29:28,644 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-11 17:29:28,645 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-11 17:29:28,645 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-11 17:29:28,652 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:29:28" (1/1) ... [2024-10-11 17:29:28,698 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:29:28" (1/1) ... [2024-10-11 17:29:28,771 INFO L138 Inliner]: procedures = 180, calls = 330, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 1208 [2024-10-11 17:29:28,772 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-11 17:29:28,772 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-11 17:29:28,772 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-11 17:29:28,772 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-11 17:29:28,791 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:29:28" (1/1) ... [2024-10-11 17:29:28,792 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:29:28" (1/1) ... [2024-10-11 17:29:28,812 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:29:28" (1/1) ... [2024-10-11 17:29:28,920 INFO L175 MemorySlicer]: Split 303 memory accesses to 3 slices as follows [2, 267, 34]. 88 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0, 0]. The 62 writes are split as follows [0, 58, 4]. [2024-10-11 17:29:28,921 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:29:28" (1/1) ... [2024-10-11 17:29:28,921 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:29:28" (1/1) ... [2024-10-11 17:29:28,984 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:29:28" (1/1) ... [2024-10-11 17:29:28,997 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:29:28" (1/1) ... [2024-10-11 17:29:29,011 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:29:28" (1/1) ... [2024-10-11 17:29:29,024 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:29:28" (1/1) ... [2024-10-11 17:29:29,043 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-11 17:29:29,045 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-11 17:29:29,046 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-11 17:29:29,046 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-11 17:29:29,047 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:29:28" (1/1) ... [2024-10-11 17:29:29,052 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 17:29:29,064 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 17:29:29,085 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:29:29,090 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:29:29,147 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2024-10-11 17:29:29,148 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2024-10-11 17:29:29,149 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#0 [2024-10-11 17:29:29,149 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#1 [2024-10-11 17:29:29,149 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#2 [2024-10-11 17:29:29,150 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#0 [2024-10-11 17:29:29,150 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#1 [2024-10-11 17:29:29,151 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#2 [2024-10-11 17:29:29,151 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2024-10-11 17:29:29,151 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2024-10-11 17:29:29,151 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#0 [2024-10-11 17:29:29,151 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#1 [2024-10-11 17:29:29,151 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#2 [2024-10-11 17:29:29,152 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#0 [2024-10-11 17:29:29,152 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#1 [2024-10-11 17:29:29,152 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#2 [2024-10-11 17:29:29,152 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-10-11 17:29:29,153 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-11 17:29:29,153 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2024-10-11 17:29:29,153 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2024-10-11 17:29:29,153 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2024-10-11 17:29:29,154 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-10-11 17:29:29,154 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2024-10-11 17:29:29,154 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2024-10-11 17:29:29,154 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2024-10-11 17:29:29,154 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-10-11 17:29:29,154 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#0 [2024-10-11 17:29:29,154 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#1 [2024-10-11 17:29:29,155 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#2 [2024-10-11 17:29:29,155 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-10-11 17:29:29,155 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2024-10-11 17:29:29,155 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#2 [2024-10-11 17:29:29,155 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-11 17:29:29,155 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-11 17:29:29,419 INFO L238 CfgBuilder]: Building ICFG [2024-10-11 17:29:29,422 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-11 17:29:37,041 INFO L? ?]: Removed 153 outVars from TransFormulas that were not future-live. [2024-10-11 17:29:37,041 INFO L287 CfgBuilder]: Performing block encoding [2024-10-11 17:29:37,095 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-11 17:29:37,096 INFO L314 CfgBuilder]: Removed 72 assume(true) statements. [2024-10-11 17:29:37,096 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 05:29:37 BoogieIcfgContainer [2024-10-11 17:29:37,096 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-11 17:29:37,099 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-11 17:29:37,099 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-11 17:29:37,104 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-11 17:29:37,104 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.10 05:29:27" (1/3) ... [2024-10-11 17:29:37,105 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@34f3b993 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 05:29:37, skipping insertion in model container [2024-10-11 17:29:37,105 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:29:28" (2/3) ... [2024-10-11 17:29:37,106 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@34f3b993 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 05:29:37, skipping insertion in model container [2024-10-11 17:29:37,106 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 05:29:37" (3/3) ... [2024-10-11 17:29:37,108 INFO L112 eAbstractionObserver]: Analyzing ICFG uthash_FNV_test3-2.i [2024-10-11 17:29:37,126 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-11 17:29:37,127 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2024-10-11 17:29:37,174 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-11 17:29:37,180 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;@1bc4cf36, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-11 17:29:37,181 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2024-10-11 17:29:37,186 INFO L276 IsEmpty]: Start isEmpty. Operand has 238 states, 222 states have (on average 1.6801801801801801) internal successors, (373), 231 states have internal predecessors, (373), 10 states have call successors, (10), 3 states have call predecessors, (10), 3 states have return successors, (10), 6 states have call predecessors, (10), 10 states have call successors, (10) [2024-10-11 17:29:37,196 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2024-10-11 17:29:37,196 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 17:29:37,197 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 17:29:37,197 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2024-10-11 17:29:37,203 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:29:37,204 INFO L85 PathProgramCache]: Analyzing trace with hash 1371146654, now seen corresponding path program 1 times [2024-10-11 17:29:37,215 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 17:29:37,215 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2016772368] [2024-10-11 17:29:37,216 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:29:37,216 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:37,216 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 17:29:37,218 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:29:37,236 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:29:37,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:29:37,439 INFO L255 TraceCheckSpWp]: Trace formula consists of 70 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-10-11 17:29:37,444 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 17:29:37,453 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:29:37,454 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 17:29:37,455 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 17:29:37,455 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2016772368] [2024-10-11 17:29:37,455 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2016772368] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:29:37,456 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 17:29:37,459 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 17:29:37,460 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [179226837] [2024-10-11 17:29:37,461 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:29:37,465 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-11 17:29:37,466 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 17:29:37,493 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-11 17:29:37,494 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-11 17:29:37,497 INFO L87 Difference]: Start difference. First operand has 238 states, 222 states have (on average 1.6801801801801801) internal successors, (373), 231 states have internal predecessors, (373), 10 states have call successors, (10), 3 states have call predecessors, (10), 3 states have return successors, (10), 6 states have call predecessors, (10), 10 states have call successors, (10) Second operand has 2 states, 2 states have (on average 4.5) internal successors, (9), 2 states have internal predecessors, (9), 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:29:37,555 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 17:29:37,555 INFO L93 Difference]: Finished difference Result 236 states and 312 transitions. [2024-10-11 17:29:37,557 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-11 17:29:37,558 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 4.5) internal successors, (9), 2 states have internal predecessors, (9), 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 10 [2024-10-11 17:29:37,558 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 17:29:37,566 INFO L225 Difference]: With dead ends: 236 [2024-10-11 17:29:37,566 INFO L226 Difference]: Without dead ends: 235 [2024-10-11 17:29:37,568 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-11 17:29:37,571 INFO L432 NwaCegarLoop]: 307 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 307 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 17:29:37,571 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 307 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 17:29:37,596 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 235 states. [2024-10-11 17:29:37,618 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 235 to 235. [2024-10-11 17:29:37,620 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 235 states, 221 states have (on average 1.3257918552036199) internal successors, (293), 228 states have internal predecessors, (293), 10 states have call successors, (10), 3 states have call predecessors, (10), 2 states have return successors, (8), 4 states have call predecessors, (8), 8 states have call successors, (8) [2024-10-11 17:29:37,623 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 235 states to 235 states and 311 transitions. [2024-10-11 17:29:37,624 INFO L78 Accepts]: Start accepts. Automaton has 235 states and 311 transitions. Word has length 10 [2024-10-11 17:29:37,624 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 17:29:37,625 INFO L471 AbstractCegarLoop]: Abstraction has 235 states and 311 transitions. [2024-10-11 17:29:37,625 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 4.5) internal successors, (9), 2 states have internal predecessors, (9), 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:29:37,625 INFO L276 IsEmpty]: Start isEmpty. Operand 235 states and 311 transitions. [2024-10-11 17:29:37,626 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2024-10-11 17:29:37,626 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 17:29:37,627 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 17:29:37,631 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:29:37,830 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:29:37,830 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2024-10-11 17:29:37,831 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:29:37,831 INFO L85 PathProgramCache]: Analyzing trace with hash 1334762359, now seen corresponding path program 1 times [2024-10-11 17:29:37,832 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 17:29:37,832 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1563805485] [2024-10-11 17:29:37,832 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:29:37,832 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:37,832 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 17:29:37,835 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:29:37,837 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:29:38,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:29:38,020 INFO L255 TraceCheckSpWp]: Trace formula consists of 86 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-10-11 17:29:38,022 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 17:29:38,109 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:29:38,110 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 17:29:38,110 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 17:29:38,110 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1563805485] [2024-10-11 17:29:38,111 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1563805485] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:29:38,112 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 17:29:38,112 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 17:29:38,112 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [746447197] [2024-10-11 17:29:38,112 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:29:38,113 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 17:29:38,114 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 17:29:38,115 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 17:29:38,115 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 17:29:38,116 INFO L87 Difference]: Start difference. First operand 235 states and 311 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, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:29:42,352 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:29:44,270 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 17:29:44,270 INFO L93 Difference]: Finished difference Result 381 states and 501 transitions. [2024-10-11 17:29:44,273 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 17:29:44,273 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, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2024-10-11 17:29:44,273 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 17:29:44,275 INFO L225 Difference]: With dead ends: 381 [2024-10-11 17:29:44,275 INFO L226 Difference]: Without dead ends: 381 [2024-10-11 17:29:44,276 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 12 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:29:44,277 INFO L432 NwaCegarLoop]: 313 mSDtfsCounter, 181 mSDsluCounter, 554 mSDsCounter, 0 mSdLazyCounter, 120 mSolverCounterSat, 10 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 181 SdHoareTripleChecker+Valid, 867 SdHoareTripleChecker+Invalid, 131 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 120 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.1s IncrementalHoareTripleChecker+Time [2024-10-11 17:29:44,277 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [181 Valid, 867 Invalid, 131 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 120 Invalid, 1 Unknown, 0 Unchecked, 6.1s Time] [2024-10-11 17:29:44,278 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 381 states. [2024-10-11 17:29:44,303 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 381 to 349. [2024-10-11 17:29:44,304 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 349 states, 335 states have (on average 1.319402985074627) internal successors, (442), 342 states have internal predecessors, (442), 10 states have call successors, (10), 3 states have call predecessors, (10), 2 states have return successors, (8), 4 states have call predecessors, (8), 8 states have call successors, (8) [2024-10-11 17:29:44,306 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 349 states to 349 states and 460 transitions. [2024-10-11 17:29:44,310 INFO L78 Accepts]: Start accepts. Automaton has 349 states and 460 transitions. Word has length 15 [2024-10-11 17:29:44,310 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 17:29:44,311 INFO L471 AbstractCegarLoop]: Abstraction has 349 states and 460 transitions. [2024-10-11 17:29:44,311 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, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:29:44,311 INFO L276 IsEmpty]: Start isEmpty. Operand 349 states and 460 transitions. [2024-10-11 17:29:44,311 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2024-10-11 17:29:44,311 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 17:29:44,311 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 17:29:44,318 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:29:44,512 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:29:44,513 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2024-10-11 17:29:44,513 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:29:44,513 INFO L85 PathProgramCache]: Analyzing trace with hash -949955970, now seen corresponding path program 1 times [2024-10-11 17:29:44,514 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 17:29:44,514 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [74095058] [2024-10-11 17:29:44,514 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:29:44,514 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:44,514 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 17:29:44,516 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:29:44,517 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:29:44,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:29:44,699 INFO L255 TraceCheckSpWp]: Trace formula consists of 81 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-10-11 17:29:44,702 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 17:29:44,725 INFO L173 IndexEqualityManager]: detected equality via solver [2024-10-11 17:29:44,726 INFO L173 IndexEqualityManager]: detected equality via solver [2024-10-11 17:29:44,726 INFO L173 IndexEqualityManager]: detected equality via solver [2024-10-11 17:29:44,738 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:44,796 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-11 17:29:44,797 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:44,818 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:29:44,818 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 17:29:44,818 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 17:29:44,819 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [74095058] [2024-10-11 17:29:44,819 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [74095058] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:29:44,819 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 17:29:44,819 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 17:29:44,819 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1968203083] [2024-10-11 17:29:44,819 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:29:44,819 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 17:29:44,820 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 17:29:44,820 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 17:29:44,820 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 17:29:44,820 INFO L87 Difference]: Start difference. First operand 349 states and 460 transitions. Second operand has 4 states, 4 states have (on average 3.5) internal successors, (14), 3 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:29:45,277 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 17:29:45,277 INFO L93 Difference]: Finished difference Result 552 states and 735 transitions. [2024-10-11 17:29:45,278 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 17:29:45,278 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.5) internal successors, (14), 3 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 14 [2024-10-11 17:29:45,278 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 17:29:45,281 INFO L225 Difference]: With dead ends: 552 [2024-10-11 17:29:45,281 INFO L226 Difference]: Without dead ends: 552 [2024-10-11 17:29:45,281 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-11 17:29:45,282 INFO L432 NwaCegarLoop]: 316 mSDtfsCounter, 274 mSDsluCounter, 593 mSDsCounter, 0 mSdLazyCounter, 80 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 282 SdHoareTripleChecker+Valid, 909 SdHoareTripleChecker+Invalid, 81 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 80 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-11 17:29:45,283 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [282 Valid, 909 Invalid, 81 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 80 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-11 17:29:45,284 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 552 states. [2024-10-11 17:29:45,306 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 552 to 348. [2024-10-11 17:29:45,307 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 348 states, 334 states have (on average 1.3173652694610778) internal successors, (440), 341 states have internal predecessors, (440), 10 states have call successors, (10), 3 states have call predecessors, (10), 2 states have return successors, (8), 4 states have call predecessors, (8), 8 states have call successors, (8) [2024-10-11 17:29:45,309 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 348 states to 348 states and 458 transitions. [2024-10-11 17:29:45,309 INFO L78 Accepts]: Start accepts. Automaton has 348 states and 458 transitions. Word has length 14 [2024-10-11 17:29:45,309 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 17:29:45,309 INFO L471 AbstractCegarLoop]: Abstraction has 348 states and 458 transitions. [2024-10-11 17:29:45,309 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.5) internal successors, (14), 3 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:29:45,309 INFO L276 IsEmpty]: Start isEmpty. Operand 348 states and 458 transitions. [2024-10-11 17:29:45,314 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2024-10-11 17:29:45,316 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 17:29:45,316 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 17:29:45,321 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:29:45,516 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:29:45,517 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2024-10-11 17:29:45,518 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:29:45,518 INFO L85 PathProgramCache]: Analyzing trace with hash 1550070894, now seen corresponding path program 1 times [2024-10-11 17:29:45,519 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 17:29:45,521 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1728375678] [2024-10-11 17:29:45,521 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:29:45,522 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:45,522 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 17:29:45,523 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:29:45,524 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:29:45,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:29:45,951 INFO L255 TraceCheckSpWp]: Trace formula consists of 508 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-11 17:29:45,956 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 17:29:45,985 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:29:45,985 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 17:29:45,985 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 17:29:45,986 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1728375678] [2024-10-11 17:29:45,986 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1728375678] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:29:45,986 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 17:29:45,986 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 17:29:45,986 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [209167081] [2024-10-11 17:29:45,987 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:29:45,987 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 17:29:45,987 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 17:29:45,988 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 17:29:45,989 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 17:29:45,989 INFO L87 Difference]: Start difference. First operand 348 states and 458 transitions. Second operand has 4 states, 4 states have (on average 19.0) internal successors, (76), 4 states have internal predecessors, (76), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-11 17:29:46,139 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 17:29:46,139 INFO L93 Difference]: Finished difference Result 354 states and 448 transitions. [2024-10-11 17:29:46,141 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-11 17:29:46,141 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 19.0) internal successors, (76), 4 states have internal predecessors, (76), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 84 [2024-10-11 17:29:46,141 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 17:29:46,143 INFO L225 Difference]: With dead ends: 354 [2024-10-11 17:29:46,143 INFO L226 Difference]: Without dead ends: 354 [2024-10-11 17:29:46,143 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 81 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:29:46,144 INFO L432 NwaCegarLoop]: 277 mSDtfsCounter, 30 mSDsluCounter, 537 mSDsCounter, 0 mSdLazyCounter, 53 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 814 SdHoareTripleChecker+Invalid, 75 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 53 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 17:29:46,145 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 814 Invalid, 75 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 53 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 17:29:46,147 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 354 states. [2024-10-11 17:29:46,155 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 354 to 354. [2024-10-11 17:29:46,158 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 354 states, 340 states have (on average 1.2647058823529411) internal successors, (430), 347 states have internal predecessors, (430), 10 states have call successors, (10), 3 states have call predecessors, (10), 2 states have return successors, (8), 4 states have call predecessors, (8), 8 states have call successors, (8) [2024-10-11 17:29:46,160 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 354 states to 354 states and 448 transitions. [2024-10-11 17:29:46,160 INFO L78 Accepts]: Start accepts. Automaton has 354 states and 448 transitions. Word has length 84 [2024-10-11 17:29:46,160 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 17:29:46,160 INFO L471 AbstractCegarLoop]: Abstraction has 354 states and 448 transitions. [2024-10-11 17:29:46,161 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 19.0) internal successors, (76), 4 states have internal predecessors, (76), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-11 17:29:46,161 INFO L276 IsEmpty]: Start isEmpty. Operand 354 states and 448 transitions. [2024-10-11 17:29:46,166 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2024-10-11 17:29:46,167 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 17:29:46,167 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 17:29:46,179 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Ended with exit code 0 [2024-10-11 17:29:46,367 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:29:46,368 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2024-10-11 17:29:46,368 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:29:46,368 INFO L85 PathProgramCache]: Analyzing trace with hash 1028930018, now seen corresponding path program 1 times [2024-10-11 17:29:46,369 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 17:29:46,369 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1925504318] [2024-10-11 17:29:46,369 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:29:46,369 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:46,370 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 17:29:46,372 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:29:46,373 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:29:46,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:29:46,810 INFO L255 TraceCheckSpWp]: Trace formula consists of 496 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-11 17:29:46,814 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 17:29:46,852 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:29:46,852 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 17:29:46,852 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 17:29:46,853 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1925504318] [2024-10-11 17:29:46,853 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1925504318] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:29:46,853 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 17:29:46,854 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 17:29:46,855 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [323427779] [2024-10-11 17:29:46,855 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:29:46,857 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 17:29:46,857 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 17:29:46,858 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 17:29:46,858 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 17:29:46,858 INFO L87 Difference]: Start difference. First operand 354 states and 448 transitions. Second operand has 4 states, 3 states have (on average 26.0) internal successors, (78), 4 states have internal predecessors, (78), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2024-10-11 17:29:46,933 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 17:29:46,933 INFO L93 Difference]: Finished difference Result 356 states and 451 transitions. [2024-10-11 17:29:46,934 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 17:29:46,934 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 26.0) internal successors, (78), 4 states have internal predecessors, (78), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) Word has length 84 [2024-10-11 17:29:46,935 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 17:29:46,936 INFO L225 Difference]: With dead ends: 356 [2024-10-11 17:29:46,936 INFO L226 Difference]: Without dead ends: 356 [2024-10-11 17:29:46,937 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 81 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:29:46,937 INFO L432 NwaCegarLoop]: 294 mSDtfsCounter, 0 mSDsluCounter, 584 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 878 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 17:29:46,938 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 878 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 17:29:46,939 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 356 states. [2024-10-11 17:29:46,944 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 356 to 356. [2024-10-11 17:29:46,945 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 356 states, 341 states have (on average 1.2668621700879765) internal successors, (432), 349 states have internal predecessors, (432), 10 states have call successors, (10), 3 states have call predecessors, (10), 3 states have return successors, (9), 4 states have call predecessors, (9), 8 states have call successors, (9) [2024-10-11 17:29:46,946 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 356 states to 356 states and 451 transitions. [2024-10-11 17:29:46,946 INFO L78 Accepts]: Start accepts. Automaton has 356 states and 451 transitions. Word has length 84 [2024-10-11 17:29:46,947 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 17:29:46,948 INFO L471 AbstractCegarLoop]: Abstraction has 356 states and 451 transitions. [2024-10-11 17:29:46,948 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 26.0) internal successors, (78), 4 states have internal predecessors, (78), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2024-10-11 17:29:46,948 INFO L276 IsEmpty]: Start isEmpty. Operand 356 states and 451 transitions. [2024-10-11 17:29:46,949 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2024-10-11 17:29:46,950 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 17:29:46,951 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 17:29:46,964 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:29:47,151 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:29:47,152 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2024-10-11 17:29:47,152 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:29:47,152 INFO L85 PathProgramCache]: Analyzing trace with hash 1442483176, now seen corresponding path program 1 times [2024-10-11 17:29:47,153 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 17:29:47,153 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [794645679] [2024-10-11 17:29:47,153 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:29:47,153 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:47,154 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 17:29:47,156 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:29:47,158 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:29:47,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:29:47,658 INFO L255 TraceCheckSpWp]: Trace formula consists of 518 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-10-11 17:29:47,661 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 17:29:47,698 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:29:47,698 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 17:29:47,811 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:29:47,813 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 17:29:47,814 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [794645679] [2024-10-11 17:29:47,814 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [794645679] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 17:29:47,814 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-11 17:29:47,814 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 8 [2024-10-11 17:29:47,814 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1335793326] [2024-10-11 17:29:47,814 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-11 17:29:47,815 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-11 17:29:47,817 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 17:29:47,818 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-11 17:29:47,818 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2024-10-11 17:29:47,818 INFO L87 Difference]: Start difference. First operand 356 states and 451 transitions. Second operand has 8 states, 6 states have (on average 14.333333333333334) internal successors, (86), 8 states have internal predecessors, (86), 2 states have call successors, (5), 2 states have call predecessors, (5), 4 states have return successors, (4), 1 states have call predecessors, (4), 2 states have call successors, (4) [2024-10-11 17:29:48,025 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 17:29:48,026 INFO L93 Difference]: Finished difference Result 365 states and 465 transitions. [2024-10-11 17:29:48,027 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-10-11 17:29:48,027 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 6 states have (on average 14.333333333333334) internal successors, (86), 8 states have internal predecessors, (86), 2 states have call successors, (5), 2 states have call predecessors, (5), 4 states have return successors, (4), 1 states have call predecessors, (4), 2 states have call successors, (4) Word has length 86 [2024-10-11 17:29:48,027 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 17:29:48,029 INFO L225 Difference]: With dead ends: 365 [2024-10-11 17:29:48,029 INFO L226 Difference]: Without dead ends: 365 [2024-10-11 17:29:48,030 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 173 GetRequests, 164 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:29:48,030 INFO L432 NwaCegarLoop]: 294 mSDtfsCounter, 5 mSDsluCounter, 874 mSDsCounter, 0 mSdLazyCounter, 61 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 1168 SdHoareTripleChecker+Invalid, 70 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 61 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-11 17:29:48,030 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 1168 Invalid, 70 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 61 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-11 17:29:48,031 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 365 states. [2024-10-11 17:29:48,037 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 365 to 364. [2024-10-11 17:29:48,038 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 364 states, 348 states have (on average 1.278735632183908) internal successors, (445), 356 states have internal predecessors, (445), 10 states have call successors, (10), 4 states have call predecessors, (10), 4 states have return successors, (9), 4 states have call predecessors, (9), 8 states have call successors, (9) [2024-10-11 17:29:48,039 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 364 states to 364 states and 464 transitions. [2024-10-11 17:29:48,039 INFO L78 Accepts]: Start accepts. Automaton has 364 states and 464 transitions. Word has length 86 [2024-10-11 17:29:48,040 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 17:29:48,040 INFO L471 AbstractCegarLoop]: Abstraction has 364 states and 464 transitions. [2024-10-11 17:29:48,040 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 6 states have (on average 14.333333333333334) internal successors, (86), 8 states have internal predecessors, (86), 2 states have call successors, (5), 2 states have call predecessors, (5), 4 states have return successors, (4), 1 states have call predecessors, (4), 2 states have call successors, (4) [2024-10-11 17:29:48,040 INFO L276 IsEmpty]: Start isEmpty. Operand 364 states and 464 transitions. [2024-10-11 17:29:48,041 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2024-10-11 17:29:48,041 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 17:29:48,041 INFO L215 NwaCegarLoop]: trace histogram [6, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 17:29:48,054 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:29:48,242 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:29:48,242 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2024-10-11 17:29:48,243 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:29:48,243 INFO L85 PathProgramCache]: Analyzing trace with hash 1402064002, now seen corresponding path program 2 times [2024-10-11 17:29:48,243 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 17:29:48,243 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [260893950] [2024-10-11 17:29:48,243 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-10-11 17:29:48,244 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:48,244 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 17:29:48,245 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:29:48,246 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:29:48,560 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2024-10-11 17:29:48,560 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-11 17:29:48,564 INFO L255 TraceCheckSpWp]: Trace formula consists of 86 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-10-11 17:29:48,568 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 17:29:48,578 INFO L173 IndexEqualityManager]: detected equality via solver [2024-10-11 17:29:48,579 INFO L173 IndexEqualityManager]: detected equality via solver [2024-10-11 17:29:48,579 INFO L173 IndexEqualityManager]: detected equality via solver [2024-10-11 17:29:48,582 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:48,639 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-11 17:29:48,639 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:48,653 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2024-10-11 17:29:48,654 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 17:29:48,654 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 17:29:48,654 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [260893950] [2024-10-11 17:29:48,654 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [260893950] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:29:48,655 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 17:29:48,655 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 17:29:48,655 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1634303085] [2024-10-11 17:29:48,655 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:29:48,655 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 17:29:48,656 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 17:29:48,658 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 17:29:48,660 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 17:29:48,661 INFO L87 Difference]: Start difference. First operand 364 states and 464 transitions. Second operand has 4 states, 4 states have (on average 19.0) internal successors, (76), 4 states have internal predecessors, (76), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-11 17:29:49,170 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 17:29:49,171 INFO L93 Difference]: Finished difference Result 524 states and 675 transitions. [2024-10-11 17:29:49,171 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 17:29:49,171 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 19.0) internal successors, (76), 4 states have internal predecessors, (76), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 90 [2024-10-11 17:29:49,172 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 17:29:49,173 INFO L225 Difference]: With dead ends: 524 [2024-10-11 17:29:49,174 INFO L226 Difference]: Without dead ends: 524 [2024-10-11 17:29:49,174 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 90 GetRequests, 87 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-11 17:29:49,174 INFO L432 NwaCegarLoop]: 304 mSDtfsCounter, 207 mSDsluCounter, 575 mSDsCounter, 0 mSdLazyCounter, 73 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 210 SdHoareTripleChecker+Valid, 879 SdHoareTripleChecker+Invalid, 74 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 73 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-10-11 17:29:49,175 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [210 Valid, 879 Invalid, 74 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 73 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-10-11 17:29:49,176 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 524 states. [2024-10-11 17:29:49,182 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 524 to 366. [2024-10-11 17:29:49,183 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 366 states, 350 states have (on average 1.2771428571428571) internal successors, (447), 358 states have internal predecessors, (447), 10 states have call successors, (10), 4 states have call predecessors, (10), 4 states have return successors, (9), 4 states have call predecessors, (9), 8 states have call successors, (9) [2024-10-11 17:29:49,184 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 366 states to 366 states and 466 transitions. [2024-10-11 17:29:49,185 INFO L78 Accepts]: Start accepts. Automaton has 366 states and 466 transitions. Word has length 90 [2024-10-11 17:29:49,185 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 17:29:49,185 INFO L471 AbstractCegarLoop]: Abstraction has 366 states and 466 transitions. [2024-10-11 17:29:49,185 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 19.0) internal successors, (76), 4 states have internal predecessors, (76), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-11 17:29:49,185 INFO L276 IsEmpty]: Start isEmpty. Operand 366 states and 466 transitions. [2024-10-11 17:29:49,187 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2024-10-11 17:29:49,187 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 17:29:49,187 INFO L215 NwaCegarLoop]: trace histogram [6, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 17:29:49,194 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:29:49,387 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:29:49,388 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2024-10-11 17:29:49,388 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:29:49,388 INFO L85 PathProgramCache]: Analyzing trace with hash -1255724955, now seen corresponding path program 1 times [2024-10-11 17:29:49,389 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 17:29:49,389 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1824006047] [2024-10-11 17:29:49,389 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:29:49,389 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:49,390 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 17:29:49,391 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:29:49,391 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:29:49,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:29:49,935 INFO L255 TraceCheckSpWp]: Trace formula consists of 611 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-10-11 17:29:49,939 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 17:29:50,016 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:29:50,016 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 17:29:50,254 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:29:50,255 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 17:29:50,255 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1824006047] [2024-10-11 17:29:50,255 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1824006047] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 17:29:50,255 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-11 17:29:50,255 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 14 [2024-10-11 17:29:50,255 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1459216589] [2024-10-11 17:29:50,256 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-11 17:29:50,256 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-10-11 17:29:50,256 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 17:29:50,257 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-10-11 17:29:50,257 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=121, Unknown=0, NotChecked=0, Total=182 [2024-10-11 17:29:50,257 INFO L87 Difference]: Start difference. First operand 366 states and 466 transitions. Second operand has 14 states, 12 states have (on average 10.416666666666666) internal successors, (125), 14 states have internal predecessors, (125), 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:50,883 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 17:29:50,883 INFO L93 Difference]: Finished difference Result 378 states and 485 transitions. [2024-10-11 17:29:50,884 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2024-10-11 17:29:50,885 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 12 states have (on average 10.416666666666666) internal successors, (125), 14 states have internal predecessors, (125), 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 122 [2024-10-11 17:29:50,885 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 17:29:50,887 INFO L225 Difference]: With dead ends: 378 [2024-10-11 17:29:50,887 INFO L226 Difference]: Without dead ends: 376 [2024-10-11 17:29:50,888 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 251 GetRequests, 230 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=182, Invalid=324, Unknown=0, NotChecked=0, Total=506 [2024-10-11 17:29:50,888 INFO L432 NwaCegarLoop]: 294 mSDtfsCounter, 7 mSDsluCounter, 1457 mSDsCounter, 0 mSdLazyCounter, 179 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 1751 SdHoareTripleChecker+Invalid, 189 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 179 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-11 17:29:50,888 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 1751 Invalid, 189 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 179 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-11 17:29:50,890 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 376 states. [2024-10-11 17:29:50,895 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 376 to 375. [2024-10-11 17:29:50,896 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 375 states, 359 states have (on average 1.2785515320334262) internal successors, (459), 367 states have internal predecessors, (459), 10 states have call successors, (10), 4 states have call predecessors, (10), 4 states have return successors, (9), 4 states have call predecessors, (9), 8 states have call successors, (9) [2024-10-11 17:29:50,898 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 375 states to 375 states and 478 transitions. [2024-10-11 17:29:50,898 INFO L78 Accepts]: Start accepts. Automaton has 375 states and 478 transitions. Word has length 122 [2024-10-11 17:29:50,898 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 17:29:50,898 INFO L471 AbstractCegarLoop]: Abstraction has 375 states and 478 transitions. [2024-10-11 17:29:50,898 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 12 states have (on average 10.416666666666666) internal successors, (125), 14 states have internal predecessors, (125), 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:50,899 INFO L276 IsEmpty]: Start isEmpty. Operand 375 states and 478 transitions. [2024-10-11 17:29:50,900 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2024-10-11 17:29:50,900 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 17:29:50,900 INFO L215 NwaCegarLoop]: trace histogram [15, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 17:29:50,914 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:29:51,100 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:29:51,101 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2024-10-11 17:29:51,101 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:29:51,102 INFO L85 PathProgramCache]: Analyzing trace with hash 2001727728, now seen corresponding path program 2 times [2024-10-11 17:29:51,102 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 17:29:51,102 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1950744592] [2024-10-11 17:29:51,102 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-10-11 17:29:51,102 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:51,103 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 17:29:51,104 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:29:51,104 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:29:51,426 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2024-10-11 17:29:51,426 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-11 17:29:51,429 INFO L255 TraceCheckSpWp]: Trace formula consists of 135 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-11 17:29:51,432 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 17:29:51,461 INFO L134 CoverageAnalysis]: Checked inductivity of 140 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 140 trivial. 0 not checked. [2024-10-11 17:29:51,461 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 17:29:51,461 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 17:29:51,461 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1950744592] [2024-10-11 17:29:51,462 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1950744592] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:29:51,462 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 17:29:51,462 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 17:29:51,462 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2032615323] [2024-10-11 17:29:51,462 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:29:51,462 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 17:29:51,463 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 17:29:51,464 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 17:29:51,464 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 17:29:51,464 INFO L87 Difference]: Start difference. First operand 375 states and 478 transitions. Second operand has 4 states, 4 states have (on average 27.25) internal successors, (109), 4 states have internal predecessors, (109), 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:51,632 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 17:29:51,632 INFO L93 Difference]: Finished difference Result 381 states and 468 transitions. [2024-10-11 17:29:51,633 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-11 17:29:51,633 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 27.25) internal successors, (109), 4 states have internal predecessors, (109), 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 131 [2024-10-11 17:29:51,633 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 17:29:51,635 INFO L225 Difference]: With dead ends: 381 [2024-10-11 17:29:51,635 INFO L226 Difference]: Without dead ends: 381 [2024-10-11 17:29:51,635 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 131 GetRequests, 128 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:29:51,636 INFO L432 NwaCegarLoop]: 266 mSDtfsCounter, 30 mSDsluCounter, 515 mSDsCounter, 0 mSdLazyCounter, 53 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 781 SdHoareTripleChecker+Invalid, 75 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 53 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-11 17:29:51,636 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 781 Invalid, 75 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 53 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-11 17:29:51,637 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 381 states. [2024-10-11 17:29:51,642 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 381 to 381. [2024-10-11 17:29:51,643 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 381 states, 365 states have (on average 1.2301369863013698) internal successors, (449), 373 states have internal predecessors, (449), 10 states have call successors, (10), 4 states have call predecessors, (10), 4 states have return successors, (9), 4 states have call predecessors, (9), 8 states have call successors, (9) [2024-10-11 17:29:51,644 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 381 states to 381 states and 468 transitions. [2024-10-11 17:29:51,645 INFO L78 Accepts]: Start accepts. Automaton has 381 states and 468 transitions. Word has length 131 [2024-10-11 17:29:51,645 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 17:29:51,645 INFO L471 AbstractCegarLoop]: Abstraction has 381 states and 468 transitions. [2024-10-11 17:29:51,645 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 27.25) internal successors, (109), 4 states have internal predecessors, (109), 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:51,645 INFO L276 IsEmpty]: Start isEmpty. Operand 381 states and 468 transitions. [2024-10-11 17:29:51,647 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2024-10-11 17:29:51,647 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 17:29:51,647 INFO L215 NwaCegarLoop]: trace histogram [15, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 17:29:51,653 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:29:51,847 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:29:51,848 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2024-10-11 17:29:51,848 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:29:51,848 INFO L85 PathProgramCache]: Analyzing trace with hash -943309724, now seen corresponding path program 1 times [2024-10-11 17:29:51,849 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 17:29:51,849 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [964976293] [2024-10-11 17:29:51,849 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:29:51,849 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:51,849 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 17:29:51,850 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:29:51,851 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:29:52,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:29:52,377 INFO L255 TraceCheckSpWp]: Trace formula consists of 698 conjuncts, 13 conjuncts are in the unsatisfiable core [2024-10-11 17:29:52,380 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 17:29:52,562 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:29:52,562 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 17:29:53,160 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:29:53,160 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 17:29:53,160 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [964976293] [2024-10-11 17:29:53,161 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [964976293] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 17:29:53,161 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-11 17:29:53,161 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 26 [2024-10-11 17:29:53,161 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [808771718] [2024-10-11 17:29:53,161 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-11 17:29:53,162 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2024-10-11 17:29:53,162 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 17:29:53,162 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2024-10-11 17:29:53,163 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=193, Invalid=457, Unknown=0, NotChecked=0, Total=650 [2024-10-11 17:29:53,163 INFO L87 Difference]: Start difference. First operand 381 states and 468 transitions. Second operand has 26 states, 24 states have (on average 5.708333333333333) internal successors, (137), 26 states have internal predecessors, (137), 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:55,113 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 17:29:55,113 INFO L93 Difference]: Finished difference Result 402 states and 505 transitions. [2024-10-11 17:29:55,114 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2024-10-11 17:29:55,115 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 24 states have (on average 5.708333333333333) internal successors, (137), 26 states have internal predecessors, (137), 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 131 [2024-10-11 17:29:55,115 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 17:29:55,117 INFO L225 Difference]: With dead ends: 402 [2024-10-11 17:29:55,117 INFO L226 Difference]: Without dead ends: 400 [2024-10-11 17:29:55,117 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 281 GetRequests, 236 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 100 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=728, Invalid=1434, Unknown=0, NotChecked=0, Total=2162 [2024-10-11 17:29:55,119 INFO L432 NwaCegarLoop]: 283 mSDtfsCounter, 14 mSDsluCounter, 3083 mSDsCounter, 0 mSdLazyCounter, 586 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 3366 SdHoareTripleChecker+Invalid, 618 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 586 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2024-10-11 17:29:55,120 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 3366 Invalid, 618 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 586 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2024-10-11 17:29:55,121 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 400 states. [2024-10-11 17:29:55,126 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 400 to 399. [2024-10-11 17:29:55,128 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 399 states, 383 states have (on average 1.2349869451697129) internal successors, (473), 391 states have internal predecessors, (473), 10 states have call successors, (10), 4 states have call predecessors, (10), 4 states have return successors, (9), 4 states have call predecessors, (9), 8 states have call successors, (9) [2024-10-11 17:29:55,130 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 399 states to 399 states and 492 transitions. [2024-10-11 17:29:55,130 INFO L78 Accepts]: Start accepts. Automaton has 399 states and 492 transitions. Word has length 131 [2024-10-11 17:29:55,130 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 17:29:55,130 INFO L471 AbstractCegarLoop]: Abstraction has 399 states and 492 transitions. [2024-10-11 17:29:55,131 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 24 states have (on average 5.708333333333333) internal successors, (137), 26 states have internal predecessors, (137), 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:55,131 INFO L276 IsEmpty]: Start isEmpty. Operand 399 states and 492 transitions. [2024-10-11 17:29:55,133 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2024-10-11 17:29:55,133 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 17:29:55,134 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:55,149 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:29:55,334 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:29:55,334 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2024-10-11 17:29:55,335 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:29:55,335 INFO L85 PathProgramCache]: Analyzing trace with hash -2087665532, now seen corresponding path program 2 times [2024-10-11 17:29:55,335 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 17:29:55,335 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1706953150] [2024-10-11 17:29:55,336 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-10-11 17:29:55,336 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:55,336 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 17:29:55,337 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:29:55,338 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:29:55,707 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2024-10-11 17:29:55,708 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-11 17:29:55,712 INFO L255 TraceCheckSpWp]: Trace formula consists of 123 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-10-11 17:29:55,715 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 17:29:55,737 INFO L134 CoverageAnalysis]: Checked inductivity of 599 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 599 trivial. 0 not checked. [2024-10-11 17:29:55,738 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 17:29:55,738 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 17:29:55,738 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1706953150] [2024-10-11 17:29:55,738 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1706953150] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:29:55,738 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 17:29:55,738 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 17:29:55,739 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [4351458] [2024-10-11 17:29:55,739 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:29:55,739 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 17:29:55,739 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 17:29:55,740 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 17:29:55,741 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 17:29:55,741 INFO L87 Difference]: Start difference. First operand 399 states and 492 transitions. Second operand has 3 states, 3 states have (on average 36.333333333333336) internal successors, (109), 3 states have internal predecessors, (109), 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:55,835 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 17:29:55,836 INFO L93 Difference]: Finished difference Result 399 states and 486 transitions. [2024-10-11 17:29:55,837 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 17:29:55,837 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 36.333333333333336) internal successors, (109), 3 states have internal predecessors, (109), 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 149 [2024-10-11 17:29:55,837 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 17:29:55,839 INFO L225 Difference]: With dead ends: 399 [2024-10-11 17:29:55,839 INFO L226 Difference]: Without dead ends: 399 [2024-10-11 17:29:55,839 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 148 GetRequests, 147 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 17:29:55,839 INFO L432 NwaCegarLoop]: 279 mSDtfsCounter, 0 mSDsluCounter, 258 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 537 SdHoareTripleChecker+Invalid, 42 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 17:29:55,840 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 537 Invalid, 42 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 17:29:55,842 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 399 states. [2024-10-11 17:29:55,847 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 399 to 399. [2024-10-11 17:29:55,847 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 399 states, 383 states have (on average 1.2193211488250653) internal successors, (467), 391 states have internal predecessors, (467), 10 states have call successors, (10), 4 states have call predecessors, (10), 4 states have return successors, (9), 4 states have call predecessors, (9), 8 states have call successors, (9) [2024-10-11 17:29:55,849 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 399 states to 399 states and 486 transitions. [2024-10-11 17:29:55,849 INFO L78 Accepts]: Start accepts. Automaton has 399 states and 486 transitions. Word has length 149 [2024-10-11 17:29:55,850 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 17:29:55,850 INFO L471 AbstractCegarLoop]: Abstraction has 399 states and 486 transitions. [2024-10-11 17:29:55,851 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 36.333333333333336) internal successors, (109), 3 states have internal predecessors, (109), 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:55,851 INFO L276 IsEmpty]: Start isEmpty. Operand 399 states and 486 transitions. [2024-10-11 17:29:55,852 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2024-10-11 17:29:55,852 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 17:29:55,852 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:55,857 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 (12)] Forceful destruction successful, exit code 0 [2024-10-11 17:29:56,056 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:29:56,057 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2024-10-11 17:29:56,057 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:29:56,057 INFO L85 PathProgramCache]: Analyzing trace with hash -1066597178, now seen corresponding path program 1 times [2024-10-11 17:29:56,058 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 17:29:56,058 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1049387886] [2024-10-11 17:29:56,058 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:29:56,058 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:56,058 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 17:29:56,061 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:29:56,062 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:29:56,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:29:56,685 INFO L255 TraceCheckSpWp]: Trace formula consists of 898 conjuncts, 25 conjuncts are in the unsatisfiable core [2024-10-11 17:29:56,688 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 17:29:57,185 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:29:57,185 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 17:29:58,769 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:58,770 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 17:29:58,770 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1049387886] [2024-10-11 17:29:58,770 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1049387886] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 17:29:58,770 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-11 17:29:58,770 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 26] total 50 [2024-10-11 17:29:58,770 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2106704532] [2024-10-11 17:29:58,770 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-11 17:29:58,771 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 50 states [2024-10-11 17:29:58,771 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 17:29:58,772 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2024-10-11 17:29:58,772 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=672, Invalid=1778, Unknown=0, NotChecked=0, Total=2450 [2024-10-11 17:29:58,773 INFO L87 Difference]: Start difference. First operand 399 states and 486 transitions. Second operand has 50 states, 48 states have (on average 3.3541666666666665) internal successors, (161), 50 states have internal predecessors, (161), 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:30:04,715 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 17:30:04,715 INFO L93 Difference]: Finished difference Result 436 states and 555 transitions. [2024-10-11 17:30:04,717 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 71 states. [2024-10-11 17:30:04,717 INFO L78 Accepts]: Start accepts. Automaton has has 50 states, 48 states have (on average 3.3541666666666665) internal successors, (161), 50 states have internal predecessors, (161), 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 149 [2024-10-11 17:30:04,717 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 17:30:04,719 INFO L225 Difference]: With dead ends: 436 [2024-10-11 17:30:04,719 INFO L226 Difference]: Without dead ends: 434 [2024-10-11 17:30:04,722 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 339 GetRequests, 248 SyntacticMatches, 0 SemanticMatches, 91 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 465 ImplicationChecksByTransitivity, 5.0s TimeCoverageRelationStatistics Valid=2713, Invalid=5843, Unknown=0, NotChecked=0, Total=8556 [2024-10-11 17:30:04,723 INFO L432 NwaCegarLoop]: 283 mSDtfsCounter, 25 mSDsluCounter, 6442 mSDsCounter, 0 mSdLazyCounter, 1995 mSolverCounterSat, 43 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 6725 SdHoareTripleChecker+Invalid, 2038 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 43 IncrementalHoareTripleChecker+Valid, 1995 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.5s IncrementalHoareTripleChecker+Time [2024-10-11 17:30:04,723 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [25 Valid, 6725 Invalid, 2038 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [43 Valid, 1995 Invalid, 0 Unknown, 0 Unchecked, 2.5s Time] [2024-10-11 17:30:04,724 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 434 states. [2024-10-11 17:30:04,729 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 434 to 433. [2024-10-11 17:30:04,729 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 433 states, 417 states have (on average 1.2302158273381294) internal successors, (513), 425 states have internal predecessors, (513), 10 states have call successors, (10), 4 states have call predecessors, (10), 4 states have return successors, (9), 4 states have call predecessors, (9), 8 states have call successors, (9) [2024-10-11 17:30:04,731 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 433 states to 433 states and 532 transitions. [2024-10-11 17:30:04,731 INFO L78 Accepts]: Start accepts. Automaton has 433 states and 532 transitions. Word has length 149 [2024-10-11 17:30:04,731 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 17:30:04,732 INFO L471 AbstractCegarLoop]: Abstraction has 433 states and 532 transitions. [2024-10-11 17:30:04,732 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 50 states, 48 states have (on average 3.3541666666666665) internal successors, (161), 50 states have internal predecessors, (161), 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:30:04,732 INFO L276 IsEmpty]: Start isEmpty. Operand 433 states and 532 transitions. [2024-10-11 17:30:04,733 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 184 [2024-10-11 17:30:04,733 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 17:30:04,734 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] [2024-10-11 17:30:04,751 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:30:04,934 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:30:04,935 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2024-10-11 17:30:04,935 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:30:04,935 INFO L85 PathProgramCache]: Analyzing trace with hash 370134438, now seen corresponding path program 2 times [2024-10-11 17:30:04,936 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 17:30:04,936 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1149311382] [2024-10-11 17:30:04,936 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-10-11 17:30:04,937 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:30:04,937 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 17:30:04,940 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:30:04,942 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:30:06,178 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-10-11 17:30:06,179 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-11 17:30:06,209 INFO L255 TraceCheckSpWp]: Trace formula consists of 1272 conjuncts, 26 conjuncts are in the unsatisfiable core [2024-10-11 17:30:06,213 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 17:30:06,802 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:30:06,802 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 17:30:08,438 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:30:08,439 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 17:30:08,439 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1149311382] [2024-10-11 17:30:08,439 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1149311382] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 17:30:08,439 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-11 17:30:08,439 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 27] total 52 [2024-10-11 17:30:08,439 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1591777155] [2024-10-11 17:30:08,440 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-11 17:30:08,440 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 52 states [2024-10-11 17:30:08,440 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 17:30:08,441 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2024-10-11 17:30:08,442 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=726, Invalid=1926, Unknown=0, NotChecked=0, Total=2652 [2024-10-11 17:30:08,442 INFO L87 Difference]: Start difference. First operand 433 states and 532 transitions. Second operand has 52 states, 50 states have (on average 3.2) internal successors, (160), 52 states have internal predecessors, (160), 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:30:14,672 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 17:30:14,672 INFO L93 Difference]: Finished difference Result 460 states and 584 transitions. [2024-10-11 17:30:14,673 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 76 states. [2024-10-11 17:30:14,673 INFO L78 Accepts]: Start accepts. Automaton has has 52 states, 50 states have (on average 3.2) internal successors, (160), 52 states have internal predecessors, (160), 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 183 [2024-10-11 17:30:14,673 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 17:30:14,675 INFO L225 Difference]: With dead ends: 460 [2024-10-11 17:30:14,675 INFO L226 Difference]: Without dead ends: 460 [2024-10-11 17:30:14,677 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 411 GetRequests, 314 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:30:14,678 INFO L432 NwaCegarLoop]: 282 mSDtfsCounter, 26 mSDsluCounter, 6978 mSDsCounter, 0 mSdLazyCounter, 1476 mSolverCounterSat, 39 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 7260 SdHoareTripleChecker+Invalid, 1515 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 39 IncrementalHoareTripleChecker+Valid, 1476 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2024-10-11 17:30:14,678 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 7260 Invalid, 1515 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [39 Valid, 1476 Invalid, 0 Unknown, 0 Unchecked, 2.0s Time] [2024-10-11 17:30:14,680 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 460 states. [2024-10-11 17:30:14,686 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 460 to 458. [2024-10-11 17:30:14,687 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 458 states, 442 states have (on average 1.2737556561085972) internal successors, (563), 450 states have internal predecessors, (563), 10 states have call successors, (10), 4 states have call predecessors, (10), 4 states have return successors, (9), 4 states have call predecessors, (9), 8 states have call successors, (9) [2024-10-11 17:30:14,689 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 458 states to 458 states and 582 transitions. [2024-10-11 17:30:14,689 INFO L78 Accepts]: Start accepts. Automaton has 458 states and 582 transitions. Word has length 183 [2024-10-11 17:30:14,689 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 17:30:14,689 INFO L471 AbstractCegarLoop]: Abstraction has 458 states and 582 transitions. [2024-10-11 17:30:14,689 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 52 states, 50 states have (on average 3.2) internal successors, (160), 52 states have internal predecessors, (160), 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:30:14,690 INFO L276 IsEmpty]: Start isEmpty. Operand 458 states and 582 transitions. [2024-10-11 17:30:14,691 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 209 [2024-10-11 17:30:14,691 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 17:30:14,692 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] [2024-10-11 17:30:14,714 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 (14)] Forceful destruction successful, exit code 0 [2024-10-11 17:30:14,892 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:30:14,892 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2024-10-11 17:30:14,893 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:30:14,893 INFO L85 PathProgramCache]: Analyzing trace with hash 532206651, now seen corresponding path program 3 times [2024-10-11 17:30:14,894 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 17:30:14,894 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [89240259] [2024-10-11 17:30:14,894 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-10-11 17:30:14,894 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:30:14,894 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 17:30:14,896 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:30:14,897 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:30:15,528 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2024-10-11 17:30:15,528 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-11 17:30:15,539 INFO L255 TraceCheckSpWp]: Trace formula consists of 421 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-11 17:30:15,543 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 17:30:15,720 INFO L134 CoverageAnalysis]: Checked inductivity of 4375 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 4373 trivial. 0 not checked. [2024-10-11 17:30:15,720 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 17:30:15,720 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 17:30:15,720 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [89240259] [2024-10-11 17:30:15,720 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [89240259] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:30:15,721 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 17:30:15,721 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 17:30:15,721 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1465188959] [2024-10-11 17:30:15,721 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:30:15,721 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 17:30:15,721 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 17:30:15,722 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 17:30:15,722 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 17:30:15,722 INFO L87 Difference]: Start difference. First operand 458 states and 582 transitions. Second operand has 4 states, 4 states have (on average 27.5) internal successors, (110), 4 states have internal predecessors, (110), 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:30:19,970 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:30:23,976 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:30:25,157 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 17:30:25,158 INFO L93 Difference]: Finished difference Result 644 states and 826 transitions. [2024-10-11 17:30:25,158 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-11 17:30:25,159 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 27.5) internal successors, (110), 4 states have internal predecessors, (110), 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 208 [2024-10-11 17:30:25,159 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 17:30:25,161 INFO L225 Difference]: With dead ends: 644 [2024-10-11 17:30:25,161 INFO L226 Difference]: Without dead ends: 644 [2024-10-11 17:30:25,162 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 209 GetRequests, 206 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:30:25,163 INFO L432 NwaCegarLoop]: 320 mSDtfsCounter, 552 mSDsluCounter, 321 mSDsCounter, 0 mSdLazyCounter, 139 mSolverCounterSat, 15 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 9.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 557 SdHoareTripleChecker+Valid, 641 SdHoareTripleChecker+Invalid, 156 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 139 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 9.4s IncrementalHoareTripleChecker+Time [2024-10-11 17:30:25,164 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [557 Valid, 641 Invalid, 156 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 139 Invalid, 2 Unknown, 0 Unchecked, 9.4s Time] [2024-10-11 17:30:25,165 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 644 states. [2024-10-11 17:30:25,174 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 644 to 562. [2024-10-11 17:30:25,175 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 562 states, 541 states have (on average 1.2643253234750462) internal successors, (684), 554 states have internal predecessors, (684), 15 states have call successors, (15), 4 states have call predecessors, (15), 4 states have return successors, (14), 5 states have call predecessors, (14), 13 states have call successors, (14) [2024-10-11 17:30:25,176 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 562 states to 562 states and 713 transitions. [2024-10-11 17:30:25,177 INFO L78 Accepts]: Start accepts. Automaton has 562 states and 713 transitions. Word has length 208 [2024-10-11 17:30:25,177 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 17:30:25,177 INFO L471 AbstractCegarLoop]: Abstraction has 562 states and 713 transitions. [2024-10-11 17:30:25,177 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 27.5) internal successors, (110), 4 states have internal predecessors, (110), 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:30:25,178 INFO L276 IsEmpty]: Start isEmpty. Operand 562 states and 713 transitions. [2024-10-11 17:30:25,179 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 217 [2024-10-11 17:30:25,179 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 17:30:25,180 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] [2024-10-11 17:30:25,194 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 (15)] Forceful destruction successful, exit code 0 [2024-10-11 17:30:25,380 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:30:25,380 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2024-10-11 17:30:25,381 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:30:25,381 INFO L85 PathProgramCache]: Analyzing trace with hash -1771077371, now seen corresponding path program 1 times [2024-10-11 17:30:25,382 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 17:30:25,382 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2091961207] [2024-10-11 17:30:25,382 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:30:25,382 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 17:30:25,382 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 17:30:25,392 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:30:25,394 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:30:27,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:30:27,056 INFO L255 TraceCheckSpWp]: Trace formula consists of 1563 conjuncts, 51 conjuncts are in the unsatisfiable core [2024-10-11 17:30:27,060 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 17:30:28,665 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:30:28,665 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 17:30:35,113 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:30:35,113 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 17:30:35,113 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2091961207] [2024-10-11 17:30:35,113 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2091961207] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 17:30:35,113 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-11 17:30:35,113 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [52, 52] total 102 [2024-10-11 17:30:35,113 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [131317602] [2024-10-11 17:30:35,113 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-11 17:30:35,114 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 102 states [2024-10-11 17:30:35,114 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 17:30:35,115 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 102 interpolants. [2024-10-11 17:30:35,118 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=2701, Invalid=7601, Unknown=0, NotChecked=0, Total=10302 [2024-10-11 17:30:35,118 INFO L87 Difference]: Start difference. First operand 562 states and 713 transitions. Second operand has 102 states, 100 states have (on average 2.18) internal successors, (218), 102 states have internal predecessors, (218), 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)