./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/valid-memcleanup.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_SFH_test8-2.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (memcleanup) Using default analysis Version a046e57d Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_SFH_test8-2.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-MemCleanup-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-memcleanup) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash dfe9cedb3fb732c747a1ef802da6fccda86efe7de6f5d2fc74063f23f28dc4dd --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-mul-div-a046e57-m [2024-10-13 10:26:31,320 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-13 10:26:31,385 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-MemCleanup-32bit-Automizer_Default.epf [2024-10-13 10:26:31,393 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-13 10:26:31,393 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-13 10:26:31,443 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-13 10:26:31,447 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-13 10:26:31,448 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-13 10:26:31,449 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-13 10:26:31,449 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-13 10:26:31,449 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-13 10:26:31,450 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-13 10:26:31,450 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-13 10:26:31,450 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-13 10:26:31,451 INFO L153 SettingsManager]: * Use SBE=true [2024-10-13 10:26:31,454 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-13 10:26:31,456 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-13 10:26:31,457 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-13 10:26:31,457 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-13 10:26:31,457 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-13 10:26:31,457 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-13 10:26:31,461 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-13 10:26:31,461 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-10-13 10:26:31,461 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-10-13 10:26:31,462 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-13 10:26:31,462 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-13 10:26:31,462 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-10-13 10:26:31,462 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-13 10:26:31,462 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-10-13 10:26:31,463 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-13 10:26:31,463 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-13 10:26:31,463 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-13 10:26:31,463 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-13 10:26:31,464 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-13 10:26:31,464 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-13 10:26:31,464 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-13 10:26:31,466 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-13 10:26:31,467 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-13 10:26:31,467 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-13 10:26:31,467 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-13 10:26:31,468 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-13 10:26:31,468 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-13 10:26:31,468 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-13 10:26:31,469 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-13 10:26:31,469 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-13 10:26:31,469 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G valid-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 -> dfe9cedb3fb732c747a1ef802da6fccda86efe7de6f5d2fc74063f23f28dc4dd [2024-10-13 10:26:31,752 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-13 10:26:31,782 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-13 10:26:31,786 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-13 10:26:31,788 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-13 10:26:31,788 INFO L274 PluginConnector]: CDTParser initialized [2024-10-13 10:26:31,791 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_SFH_test8-2.i [2024-10-13 10:26:33,399 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-13 10:26:33,726 INFO L384 CDTParser]: Found 1 translation units. [2024-10-13 10:26:33,727 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_SFH_test8-2.i [2024-10-13 10:26:33,754 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/024afd6e1/3e8401c27cc64c7eafff0e78911d3d3f/FLAG2ee2ad7d4 [2024-10-13 10:26:33,773 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/024afd6e1/3e8401c27cc64c7eafff0e78911d3d3f [2024-10-13 10:26:33,775 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-13 10:26:33,777 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-13 10:26:33,779 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-13 10:26:33,779 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-13 10:26:33,785 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-13 10:26:33,786 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 10:26:33" (1/1) ... [2024-10-13 10:26:33,787 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@26e2de89 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 10:26:33, skipping insertion in model container [2024-10-13 10:26:33,787 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 10:26:33" (1/1) ... [2024-10-13 10:26:33,856 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-13 10:26:34,555 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-13 10:26:34,575 ERROR L321 MainTranslator]: Unsupported Syntax: Found a cast between two array/pointer types of different sizes while using memory model HoenickeLindenmann_Original (while Not using bitvector translation) [2024-10-13 10:26:34,577 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver@686fa694 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 10:26:34, skipping insertion in model container [2024-10-13 10:26:34,577 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-13 10:26:34,577 INFO L186 ToolchainWalker]: Toolchain execution was canceled (user or tool) before executing de.uni_freiburg.informatik.ultimate.boogie.procedureinliner [2024-10-13 10:26:34,581 INFO L158 Benchmark]: Toolchain (without parser) took 802.39ms. Allocated memory is still 172.0MB. Free memory was 113.6MB in the beginning and 91.5MB in the end (delta: 22.1MB). Peak memory consumption was 21.0MB. Max. memory is 16.1GB. [2024-10-13 10:26:34,582 INFO L158 Benchmark]: CDTParser took 0.37ms. Allocated memory is still 172.0MB. Free memory is still 140.7MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-13 10:26:34,583 INFO L158 Benchmark]: CACSL2BoogieTranslator took 798.71ms. Allocated memory is still 172.0MB. Free memory was 113.6MB in the beginning and 91.5MB in the end (delta: 22.1MB). Peak memory consumption was 21.0MB. Max. memory is 16.1GB. [2024-10-13 10:26:34,584 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.37ms. Allocated memory is still 172.0MB. Free memory is still 140.7MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 798.71ms. Allocated memory is still 172.0MB. Free memory was 113.6MB in the beginning and 91.5MB in the end (delta: 22.1MB). Peak memory consumption was 21.0MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - UnsupportedSyntaxResult [Line: 766]: Unsupported Syntax Found a cast between two array/pointer types of different sizes while using memory model HoenickeLindenmann_Original (while Not using bitvector translation) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_SFH_test8-2.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-MemCleanup-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-memcleanup) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash dfe9cedb3fb732c747a1ef802da6fccda86efe7de6f5d2fc74063f23f28dc4dd --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-mul-div-a046e57-m [2024-10-13 10:26:36,839 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-13 10:26:36,918 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-MemCleanup-32bit-Automizer_Bitvector.epf [2024-10-13 10:26:36,927 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-13 10:26:36,928 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-13 10:26:36,964 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-13 10:26:36,965 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-13 10:26:36,965 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-13 10:26:36,966 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-13 10:26:36,966 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-13 10:26:36,967 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-13 10:26:36,967 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-13 10:26:36,968 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-13 10:26:36,968 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-13 10:26:36,970 INFO L153 SettingsManager]: * Use SBE=true [2024-10-13 10:26:36,971 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-13 10:26:36,971 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-13 10:26:36,972 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-13 10:26:36,972 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-13 10:26:36,972 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-13 10:26:36,972 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-13 10:26:36,976 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-13 10:26:36,977 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-10-13 10:26:36,977 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-10-13 10:26:36,977 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-13 10:26:36,977 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-13 10:26:36,978 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-10-13 10:26:36,978 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-10-13 10:26:36,978 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-13 10:26:36,978 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-10-13 10:26:36,979 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-10-13 10:26:36,979 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-13 10:26:36,979 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-13 10:26:36,979 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-13 10:26:36,979 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-13 10:26:36,980 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-13 10:26:36,980 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-13 10:26:36,982 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-13 10:26:36,982 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-13 10:26:36,983 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-13 10:26:36,983 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-13 10:26:36,983 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-10-13 10:26:36,983 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-10-13 10:26:36,984 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-13 10:26:36,984 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-13 10:26:36,984 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-13 10:26:36,984 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-13 10:26:36,984 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2024-10-13 10:26:36,984 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G valid-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 -> dfe9cedb3fb732c747a1ef802da6fccda86efe7de6f5d2fc74063f23f28dc4dd [2024-10-13 10:26:37,373 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-13 10:26:37,409 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-13 10:26:37,413 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-13 10:26:37,414 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-13 10:26:37,415 INFO L274 PluginConnector]: CDTParser initialized [2024-10-13 10:26:37,416 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_SFH_test8-2.i [2024-10-13 10:26:39,028 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-13 10:26:39,413 INFO L384 CDTParser]: Found 1 translation units. [2024-10-13 10:26:39,414 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_SFH_test8-2.i [2024-10-13 10:26:39,434 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/52c3a74ca/dd2b21203fd74179bf10615e71e846a3/FLAG2b6723355 [2024-10-13 10:26:39,448 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/52c3a74ca/dd2b21203fd74179bf10615e71e846a3 [2024-10-13 10:26:39,451 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-13 10:26:39,452 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-13 10:26:39,453 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-13 10:26:39,453 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-13 10:26:39,459 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-13 10:26:39,461 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 10:26:39" (1/1) ... [2024-10-13 10:26:39,463 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6a38fb11 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 10:26:39, skipping insertion in model container [2024-10-13 10:26:39,463 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 10:26:39" (1/1) ... [2024-10-13 10:26:39,532 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-13 10:26:40,198 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-13 10:26:40,219 INFO L197 MainTranslator]: Restarting translation with changed settings: SettingsChange [mNewPreferredMemoryModel=HoenickeLindenmann_1ByteResolution] [2024-10-13 10:26:40,248 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-13 10:26:40,363 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-13 10:26:40,370 INFO L200 MainTranslator]: Completed pre-run [2024-10-13 10:26:40,454 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-13 10:26:40,493 INFO L204 MainTranslator]: Completed translation [2024-10-13 10:26:40,493 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 10:26:40 WrapperNode [2024-10-13 10:26:40,494 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-13 10:26:40,495 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-13 10:26:40,495 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-13 10:26:40,495 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-13 10:26:40,502 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 10:26:40" (1/1) ... [2024-10-13 10:26:40,558 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 10:26:40" (1/1) ... [2024-10-13 10:26:40,620 INFO L138 Inliner]: procedures = 180, calls = 342, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 1176 [2024-10-13 10:26:40,621 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-13 10:26:40,621 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-13 10:26:40,622 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-13 10:26:40,622 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-13 10:26:40,636 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 10:26:40" (1/1) ... [2024-10-13 10:26:40,636 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 10:26:40" (1/1) ... [2024-10-13 10:26:40,648 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 10:26:40" (1/1) ... [2024-10-13 10:26:40,743 INFO L175 MemorySlicer]: Split 304 memory accesses to 3 slices as follows [2, 268, 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-13 10:26:40,744 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 10:26:40" (1/1) ... [2024-10-13 10:26:40,744 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 10:26:40" (1/1) ... [2024-10-13 10:26:40,813 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 10:26:40" (1/1) ... [2024-10-13 10:26:40,826 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 10:26:40" (1/1) ... [2024-10-13 10:26:40,838 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 10:26:40" (1/1) ... [2024-10-13 10:26:40,852 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 10:26:40" (1/1) ... [2024-10-13 10:26:40,872 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-13 10:26:40,873 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-13 10:26:40,873 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-13 10:26:40,874 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-13 10:26:40,875 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 10:26:40" (1/1) ... [2024-10-13 10:26:40,890 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-13 10:26:40,904 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 10:26:40,922 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-13 10:26:40,926 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-13 10:26:40,975 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2024-10-13 10:26:40,975 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2024-10-13 10:26:40,975 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#0 [2024-10-13 10:26:40,975 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#1 [2024-10-13 10:26:40,975 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#2 [2024-10-13 10:26:40,976 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#0 [2024-10-13 10:26:40,976 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#1 [2024-10-13 10:26:40,976 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#2 [2024-10-13 10:26:40,976 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2024-10-13 10:26:40,976 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2024-10-13 10:26:40,976 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#0 [2024-10-13 10:26:40,976 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#1 [2024-10-13 10:26:40,976 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#2 [2024-10-13 10:26:40,976 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#0 [2024-10-13 10:26:40,976 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#1 [2024-10-13 10:26:40,977 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#2 [2024-10-13 10:26:40,977 INFO L130 BoogieDeclarations]: Found specification of procedure test_int [2024-10-13 10:26:40,977 INFO L138 BoogieDeclarations]: Found implementation of procedure test_int [2024-10-13 10:26:40,977 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-10-13 10:26:40,977 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-13 10:26:40,977 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2024-10-13 10:26:40,977 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2024-10-13 10:26:40,979 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2024-10-13 10:26:40,979 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-10-13 10:26:40,979 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2024-10-13 10:26:40,979 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2024-10-13 10:26:40,979 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2024-10-13 10:26:40,979 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-10-13 10:26:40,979 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#0 [2024-10-13 10:26:40,979 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#1 [2024-10-13 10:26:40,979 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#2 [2024-10-13 10:26:40,979 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-10-13 10:26:40,980 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2024-10-13 10:26:40,980 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#2 [2024-10-13 10:26:40,980 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-13 10:26:40,980 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-13 10:26:41,255 INFO L238 CfgBuilder]: Building ICFG [2024-10-13 10:26:41,258 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-13 10:26:49,390 INFO L? ?]: Removed 161 outVars from TransFormulas that were not future-live. [2024-10-13 10:26:49,391 INFO L287 CfgBuilder]: Performing block encoding [2024-10-13 10:26:49,434 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-13 10:26:49,435 INFO L314 CfgBuilder]: Removed 71 assume(true) statements. [2024-10-13 10:26:49,435 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 10:26:49 BoogieIcfgContainer [2024-10-13 10:26:49,435 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-13 10:26:49,437 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-13 10:26:49,438 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-13 10:26:49,441 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-13 10:26:49,441 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.10 10:26:39" (1/3) ... [2024-10-13 10:26:49,442 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@b216d62 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 10:26:49, skipping insertion in model container [2024-10-13 10:26:49,442 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 10:26:40" (2/3) ... [2024-10-13 10:26:49,443 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@b216d62 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 10:26:49, skipping insertion in model container [2024-10-13 10:26:49,444 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 10:26:49" (3/3) ... [2024-10-13 10:26:49,445 INFO L112 eAbstractionObserver]: Analyzing ICFG uthash_SFH_test8-2.i [2024-10-13 10:26:49,458 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-13 10:26:49,458 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2024-10-13 10:26:49,511 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-13 10:26:49,519 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;@4f2f9946, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-13 10:26:49,519 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2024-10-13 10:26:49,524 INFO L276 IsEmpty]: Start isEmpty. Operand has 262 states, 233 states have (on average 1.6824034334763949) internal successors, (392), 252 states have internal predecessors, (392), 22 states have call successors, (22), 4 states have call predecessors, (22), 4 states have return successors, (22), 8 states have call predecessors, (22), 22 states have call successors, (22) [2024-10-13 10:26:49,532 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2024-10-13 10:26:49,533 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 10:26:49,533 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 10:26:49,534 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2024-10-13 10:26:49,538 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 10:26:49,539 INFO L85 PathProgramCache]: Analyzing trace with hash 666562819, now seen corresponding path program 1 times [2024-10-13 10:26:49,551 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 10:26:49,552 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [623897790] [2024-10-13 10:26:49,552 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 10:26:49,552 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-13 10:26:49,553 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 10:26:49,556 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-13 10:26:49,558 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2024-10-13 10:26:49,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:26:49,740 INFO L255 TraceCheckSpWp]: Trace formula consists of 70 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-10-13 10:26:49,745 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 10:26:49,753 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 10:26:49,754 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-13 10:26:49,754 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 10:26:49,754 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [623897790] [2024-10-13 10:26:49,755 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [623897790] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 10:26:49,755 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 10:26:49,755 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-13 10:26:49,757 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1540900890] [2024-10-13 10:26:49,758 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 10:26:49,761 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-13 10:26:49,762 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 10:26:49,786 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-13 10:26:49,787 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-13 10:26:49,794 INFO L87 Difference]: Start difference. First operand has 262 states, 233 states have (on average 1.6824034334763949) internal successors, (392), 252 states have internal predecessors, (392), 22 states have call successors, (22), 4 states have call predecessors, (22), 4 states have return successors, (22), 8 states have call predecessors, (22), 22 states have call successors, (22) Second operand has 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-13 10:26:49,880 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 10:26:49,881 INFO L93 Difference]: Finished difference Result 260 states and 356 transitions. [2024-10-13 10:26:49,884 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-13 10:26:49,885 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-13 10:26:49,885 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 10:26:49,897 INFO L225 Difference]: With dead ends: 260 [2024-10-13 10:26:49,908 INFO L226 Difference]: Without dead ends: 259 [2024-10-13 10:26:49,910 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-13 10:26:49,916 INFO L432 NwaCegarLoop]: 350 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 350 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-13 10:26:49,917 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 350 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-13 10:26:49,979 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 259 states. [2024-10-13 10:26:50,038 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 259 to 259. [2024-10-13 10:26:50,055 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 259 states, 232 states have (on average 1.3491379310344827) internal successors, (313), 249 states have internal predecessors, (313), 22 states have call successors, (22), 4 states have call predecessors, (22), 3 states have return successors, (20), 6 states have call predecessors, (20), 20 states have call successors, (20) [2024-10-13 10:26:50,060 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 259 states to 259 states and 355 transitions. [2024-10-13 10:26:50,062 INFO L78 Accepts]: Start accepts. Automaton has 259 states and 355 transitions. Word has length 10 [2024-10-13 10:26:50,062 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 10:26:50,062 INFO L471 AbstractCegarLoop]: Abstraction has 259 states and 355 transitions. [2024-10-13 10:26:50,063 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-13 10:26:50,063 INFO L276 IsEmpty]: Start isEmpty. Operand 259 states and 355 transitions. [2024-10-13 10:26:50,064 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2024-10-13 10:26:50,064 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 10:26:50,068 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 10:26:50,079 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2024-10-13 10:26:50,269 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-13 10:26:50,269 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2024-10-13 10:26:50,270 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 10:26:50,270 INFO L85 PathProgramCache]: Analyzing trace with hash -757099125, now seen corresponding path program 1 times [2024-10-13 10:26:50,271 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 10:26:50,271 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [238956039] [2024-10-13 10:26:50,271 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 10:26:50,271 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-13 10:26:50,271 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 10:26:50,273 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-13 10:26:50,274 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2024-10-13 10:26:50,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:26:50,475 INFO L255 TraceCheckSpWp]: Trace formula consists of 77 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-10-13 10:26:50,478 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 10:26:50,509 INFO L173 IndexEqualityManager]: detected equality via solver [2024-10-13 10:26:50,510 INFO L173 IndexEqualityManager]: detected equality via solver [2024-10-13 10:26:50,511 INFO L173 IndexEqualityManager]: detected equality via solver [2024-10-13 10:26:50,523 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 39 [2024-10-13 10:26:50,608 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-13 10:26:50,609 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 70 treesize of output 26 [2024-10-13 10:26:50,629 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 10:26:50,629 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-13 10:26:50,629 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 10:26:50,629 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [238956039] [2024-10-13 10:26:50,629 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [238956039] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 10:26:50,630 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 10:26:50,630 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-13 10:26:50,630 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1730276438] [2024-10-13 10:26:50,630 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 10:26:50,631 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-13 10:26:50,631 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 10:26:50,633 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-13 10:26:50,633 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-13 10:26:50,633 INFO L87 Difference]: Start difference. First operand 259 states and 355 transitions. Second operand has 4 states, 4 states have (on average 3.0) internal successors, (12), 3 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 10:26:51,330 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 10:26:51,330 INFO L93 Difference]: Finished difference Result 470 states and 634 transitions. [2024-10-13 10:26:51,331 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-13 10:26:51,331 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.0) internal successors, (12), 3 states have internal predecessors, (12), 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 12 [2024-10-13 10:26:51,332 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 10:26:51,334 INFO L225 Difference]: With dead ends: 470 [2024-10-13 10:26:51,335 INFO L226 Difference]: Without dead ends: 470 [2024-10-13 10:26:51,335 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 9 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-13 10:26:51,336 INFO L432 NwaCegarLoop]: 331 mSDtfsCounter, 265 mSDsluCounter, 655 mSDsCounter, 0 mSdLazyCounter, 77 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 270 SdHoareTripleChecker+Valid, 986 SdHoareTripleChecker+Invalid, 78 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 77 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-10-13 10:26:51,337 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [270 Valid, 986 Invalid, 78 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 77 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-10-13 10:26:51,338 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 470 states. [2024-10-13 10:26:51,356 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 470 to 261. [2024-10-13 10:26:51,357 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 261 states, 234 states have (on average 1.3461538461538463) internal successors, (315), 251 states have internal predecessors, (315), 22 states have call successors, (22), 4 states have call predecessors, (22), 3 states have return successors, (20), 6 states have call predecessors, (20), 20 states have call successors, (20) [2024-10-13 10:26:51,359 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 261 states to 261 states and 357 transitions. [2024-10-13 10:26:51,360 INFO L78 Accepts]: Start accepts. Automaton has 261 states and 357 transitions. Word has length 12 [2024-10-13 10:26:51,360 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 10:26:51,360 INFO L471 AbstractCegarLoop]: Abstraction has 261 states and 357 transitions. [2024-10-13 10:26:51,360 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.0) internal successors, (12), 3 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 10:26:51,360 INFO L276 IsEmpty]: Start isEmpty. Operand 261 states and 357 transitions. [2024-10-13 10:26:51,362 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2024-10-13 10:26:51,362 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 10:26:51,363 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 10:26:51,368 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Ended with exit code 0 [2024-10-13 10:26:51,566 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-13 10:26:51,567 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2024-10-13 10:26:51,568 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 10:26:51,568 INFO L85 PathProgramCache]: Analyzing trace with hash 409058189, now seen corresponding path program 1 times [2024-10-13 10:26:51,569 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 10:26:51,569 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [120678393] [2024-10-13 10:26:51,569 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 10:26:51,569 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-13 10:26:51,570 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 10:26:51,573 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-13 10:26:51,574 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2024-10-13 10:26:51,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:26:51,991 INFO L255 TraceCheckSpWp]: Trace formula consists of 335 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-13 10:26:51,995 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 10:26:52,022 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 10:26:52,024 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-13 10:26:52,025 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 10:26:52,025 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [120678393] [2024-10-13 10:26:52,025 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [120678393] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 10:26:52,026 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 10:26:52,026 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-13 10:26:52,026 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1386991150] [2024-10-13 10:26:52,026 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 10:26:52,027 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-13 10:26:52,027 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 10:26:52,028 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-13 10:26:52,030 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-13 10:26:52,030 INFO L87 Difference]: Start difference. First operand 261 states and 357 transitions. Second operand has 4 states, 4 states have (on average 15.75) internal successors, (63), 4 states have internal predecessors, (63), 1 states have call successors, (3), 1 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 10:26:52,228 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 10:26:52,229 INFO L93 Difference]: Finished difference Result 264 states and 352 transitions. [2024-10-13 10:26:52,229 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-13 10:26:52,230 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 15.75) internal successors, (63), 4 states have internal predecessors, (63), 1 states have call successors, (3), 1 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 66 [2024-10-13 10:26:52,230 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 10:26:52,233 INFO L225 Difference]: With dead ends: 264 [2024-10-13 10:26:52,233 INFO L226 Difference]: Without dead ends: 264 [2024-10-13 10:26:52,233 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 63 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-13 10:26:52,234 INFO L432 NwaCegarLoop]: 320 mSDtfsCounter, 30 mSDsluCounter, 623 mSDsCounter, 0 mSdLazyCounter, 56 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 943 SdHoareTripleChecker+Invalid, 78 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 56 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-13 10:26:52,236 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 943 Invalid, 78 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 56 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-13 10:26:52,239 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 264 states. [2024-10-13 10:26:52,252 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 264 to 264. [2024-10-13 10:26:52,256 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 264 states, 237 states have (on average 1.3080168776371308) internal successors, (310), 254 states have internal predecessors, (310), 22 states have call successors, (22), 4 states have call predecessors, (22), 3 states have return successors, (20), 6 states have call predecessors, (20), 20 states have call successors, (20) [2024-10-13 10:26:52,258 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 264 states to 264 states and 352 transitions. [2024-10-13 10:26:52,261 INFO L78 Accepts]: Start accepts. Automaton has 264 states and 352 transitions. Word has length 66 [2024-10-13 10:26:52,261 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 10:26:52,261 INFO L471 AbstractCegarLoop]: Abstraction has 264 states and 352 transitions. [2024-10-13 10:26:52,261 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.75) internal successors, (63), 4 states have internal predecessors, (63), 1 states have call successors, (3), 1 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 10:26:52,261 INFO L276 IsEmpty]: Start isEmpty. Operand 264 states and 352 transitions. [2024-10-13 10:26:52,263 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2024-10-13 10:26:52,263 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 10:26:52,263 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 10:26:52,273 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Ended with exit code 0 [2024-10-13 10:26:52,464 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-13 10:26:52,465 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2024-10-13 10:26:52,465 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 10:26:52,465 INFO L85 PathProgramCache]: Analyzing trace with hash 387171585, now seen corresponding path program 1 times [2024-10-13 10:26:52,466 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 10:26:52,466 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1259027672] [2024-10-13 10:26:52,466 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 10:26:52,466 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-13 10:26:52,467 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 10:26:52,469 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-13 10:26:52,471 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2024-10-13 10:26:52,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:26:52,853 INFO L255 TraceCheckSpWp]: Trace formula consists of 323 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-10-13 10:26:52,856 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 10:26:52,998 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 10:26:53,000 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-13 10:26:53,001 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 10:26:53,001 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1259027672] [2024-10-13 10:26:53,001 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1259027672] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 10:26:53,001 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 10:26:53,001 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-13 10:26:53,001 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1202305890] [2024-10-13 10:26:53,003 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 10:26:53,003 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-13 10:26:53,003 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 10:26:53,004 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-13 10:26:53,004 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-13 10:26:53,004 INFO L87 Difference]: Start difference. First operand 264 states and 352 transitions. Second operand has 5 states, 5 states have (on average 12.6) internal successors, (63), 5 states have internal predecessors, (63), 1 states have call successors, (3), 1 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 10:26:53,148 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 10:26:53,148 INFO L93 Difference]: Finished difference Result 258 states and 342 transitions. [2024-10-13 10:26:53,148 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-13 10:26:53,149 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.6) internal successors, (63), 5 states have internal predecessors, (63), 1 states have call successors, (3), 1 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 66 [2024-10-13 10:26:53,149 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 10:26:53,150 INFO L225 Difference]: With dead ends: 258 [2024-10-13 10:26:53,152 INFO L226 Difference]: Without dead ends: 258 [2024-10-13 10:26:53,152 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 62 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-13 10:26:53,153 INFO L432 NwaCegarLoop]: 319 mSDtfsCounter, 0 mSDsluCounter, 621 mSDsCounter, 0 mSdLazyCounter, 67 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 940 SdHoareTripleChecker+Invalid, 70 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 67 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-13 10:26:53,154 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 940 Invalid, 70 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 67 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-13 10:26:53,155 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 258 states. [2024-10-13 10:26:53,169 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 258 to 258. [2024-10-13 10:26:53,174 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 258 states, 231 states have (on average 1.2987012987012987) internal successors, (300), 248 states have internal predecessors, (300), 22 states have call successors, (22), 4 states have call predecessors, (22), 3 states have return successors, (20), 6 states have call predecessors, (20), 20 states have call successors, (20) [2024-10-13 10:26:53,175 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 258 states to 258 states and 342 transitions. [2024-10-13 10:26:53,175 INFO L78 Accepts]: Start accepts. Automaton has 258 states and 342 transitions. Word has length 66 [2024-10-13 10:26:53,175 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 10:26:53,175 INFO L471 AbstractCegarLoop]: Abstraction has 258 states and 342 transitions. [2024-10-13 10:26:53,176 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.6) internal successors, (63), 5 states have internal predecessors, (63), 1 states have call successors, (3), 1 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 10:26:53,176 INFO L276 IsEmpty]: Start isEmpty. Operand 258 states and 342 transitions. [2024-10-13 10:26:53,177 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2024-10-13 10:26:53,177 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 10:26:53,177 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 10:26:53,190 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Ended with exit code 0 [2024-10-13 10:26:53,383 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-13 10:26:53,383 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2024-10-13 10:26:53,384 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 10:26:53,384 INFO L85 PathProgramCache]: Analyzing trace with hash 781538371, now seen corresponding path program 1 times [2024-10-13 10:26:53,385 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 10:26:53,385 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1346810182] [2024-10-13 10:26:53,385 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 10:26:53,385 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-13 10:26:53,385 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 10:26:53,388 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-13 10:26:53,388 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2024-10-13 10:26:53,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:26:53,714 INFO L255 TraceCheckSpWp]: Trace formula consists of 325 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-13 10:26:53,717 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 10:26:53,983 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 10:26:53,983 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-13 10:26:53,983 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 10:26:53,983 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1346810182] [2024-10-13 10:26:53,984 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1346810182] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 10:26:53,984 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 10:26:53,984 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-13 10:26:53,984 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [798143448] [2024-10-13 10:26:53,984 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 10:26:53,984 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 10:26:53,985 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 10:26:53,985 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 10:26:53,985 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 10:26:53,986 INFO L87 Difference]: Start difference. First operand 258 states and 342 transitions. Second operand has 3 states, 3 states have (on average 21.0) internal successors, (63), 2 states have internal predecessors, (63), 1 states have call successors, (3), 1 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 10:26:54,781 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 10:26:54,782 INFO L93 Difference]: Finished difference Result 396 states and 512 transitions. [2024-10-13 10:26:54,782 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 10:26:54,782 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 21.0) internal successors, (63), 2 states have internal predecessors, (63), 1 states have call successors, (3), 1 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 66 [2024-10-13 10:26:54,783 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 10:26:54,784 INFO L225 Difference]: With dead ends: 396 [2024-10-13 10:26:54,784 INFO L226 Difference]: Without dead ends: 396 [2024-10-13 10:26:54,785 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 64 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 10:26:54,785 INFO L432 NwaCegarLoop]: 372 mSDtfsCounter, 125 mSDsluCounter, 301 mSDsCounter, 0 mSdLazyCounter, 59 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 126 SdHoareTripleChecker+Valid, 673 SdHoareTripleChecker+Invalid, 67 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 59 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-10-13 10:26:54,786 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [126 Valid, 673 Invalid, 67 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 59 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-10-13 10:26:54,788 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 396 states. [2024-10-13 10:26:54,796 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 396 to 364. [2024-10-13 10:26:54,797 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 364 states, 336 states have (on average 1.2708333333333333) internal successors, (427), 353 states have internal predecessors, (427), 23 states have call successors, (23), 4 states have call predecessors, (23), 3 states have return successors, (21), 7 states have call predecessors, (21), 21 states have call successors, (21) [2024-10-13 10:26:54,802 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 364 states to 364 states and 471 transitions. [2024-10-13 10:26:54,803 INFO L78 Accepts]: Start accepts. Automaton has 364 states and 471 transitions. Word has length 66 [2024-10-13 10:26:54,804 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 10:26:54,804 INFO L471 AbstractCegarLoop]: Abstraction has 364 states and 471 transitions. [2024-10-13 10:26:54,805 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 21.0) internal successors, (63), 2 states have internal predecessors, (63), 1 states have call successors, (3), 1 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 10:26:54,805 INFO L276 IsEmpty]: Start isEmpty. Operand 364 states and 471 transitions. [2024-10-13 10:26:54,808 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2024-10-13 10:26:54,808 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 10:26:54,808 INFO L215 NwaCegarLoop]: trace histogram [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] [2024-10-13 10:26:54,821 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Ended with exit code 0 [2024-10-13 10:26:55,012 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-13 10:26:55,013 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2024-10-13 10:26:55,014 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 10:26:55,014 INFO L85 PathProgramCache]: Analyzing trace with hash 1917441306, now seen corresponding path program 1 times [2024-10-13 10:26:55,014 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 10:26:55,015 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1824434687] [2024-10-13 10:26:55,015 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 10:26:55,015 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-13 10:26:55,015 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 10:26:55,018 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-13 10:26:55,019 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2024-10-13 10:26:55,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:26:55,477 INFO L255 TraceCheckSpWp]: Trace formula consists of 454 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-13 10:26:55,485 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 10:26:55,507 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 10:26:55,508 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-13 10:26:55,508 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 10:26:55,508 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1824434687] [2024-10-13 10:26:55,508 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1824434687] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 10:26:55,508 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 10:26:55,509 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-13 10:26:55,509 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1497268520] [2024-10-13 10:26:55,509 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 10:26:55,509 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-13 10:26:55,510 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 10:26:55,512 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-13 10:26:55,512 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-13 10:26:55,512 INFO L87 Difference]: Start difference. First operand 364 states and 471 transitions. Second operand has 4 states, 3 states have (on average 24.0) internal successors, (72), 4 states have internal predecessors, (72), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2024-10-13 10:26:55,608 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 10:26:55,608 INFO L93 Difference]: Finished difference Result 366 states and 474 transitions. [2024-10-13 10:26:55,610 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-13 10:26:55,611 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 24.0) internal successors, (72), 4 states have internal predecessors, (72), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) Word has length 79 [2024-10-13 10:26:55,611 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 10:26:55,613 INFO L225 Difference]: With dead ends: 366 [2024-10-13 10:26:55,613 INFO L226 Difference]: Without dead ends: 366 [2024-10-13 10:26:55,613 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 76 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-13 10:26:55,613 INFO L432 NwaCegarLoop]: 333 mSDtfsCounter, 0 mSDsluCounter, 662 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 995 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-13 10:26:55,614 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 995 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-13 10:26:55,615 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 366 states. [2024-10-13 10:26:55,622 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 366 to 366. [2024-10-13 10:26:55,624 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 366 states, 337 states have (on average 1.2729970326409497) internal successors, (429), 355 states have internal predecessors, (429), 23 states have call successors, (23), 4 states have call predecessors, (23), 4 states have return successors, (22), 7 states have call predecessors, (22), 21 states have call successors, (22) [2024-10-13 10:26:55,626 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 366 states to 366 states and 474 transitions. [2024-10-13 10:26:55,627 INFO L78 Accepts]: Start accepts. Automaton has 366 states and 474 transitions. Word has length 79 [2024-10-13 10:26:55,627 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 10:26:55,627 INFO L471 AbstractCegarLoop]: Abstraction has 366 states and 474 transitions. [2024-10-13 10:26:55,628 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 24.0) internal successors, (72), 4 states have internal predecessors, (72), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2024-10-13 10:26:55,628 INFO L276 IsEmpty]: Start isEmpty. Operand 366 states and 474 transitions. [2024-10-13 10:26:55,629 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2024-10-13 10:26:55,630 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 10:26:55,631 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] [2024-10-13 10:26:55,642 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Ended with exit code 0 [2024-10-13 10:26:55,832 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-13 10:26:55,832 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2024-10-13 10:26:55,833 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 10:26:55,833 INFO L85 PathProgramCache]: Analyzing trace with hash -1800298452, now seen corresponding path program 1 times [2024-10-13 10:26:55,833 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 10:26:55,833 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [631548272] [2024-10-13 10:26:55,833 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 10:26:55,833 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-13 10:26:55,834 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 10:26:55,835 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-13 10:26:55,836 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Waiting until timeout for monitored process [2024-10-13 10:26:56,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:26:56,260 INFO L255 TraceCheckSpWp]: Trace formula consists of 476 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-10-13 10:26:56,263 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 10:26:56,299 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 6 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-10-13 10:26:56,299 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-13 10:26:56,421 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-10-13 10:26:56,421 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 10:26:56,422 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [631548272] [2024-10-13 10:26:56,422 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [631548272] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-13 10:26:56,422 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-13 10:26:56,422 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 8 [2024-10-13 10:26:56,422 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [28861541] [2024-10-13 10:26:56,422 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-13 10:26:56,423 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-13 10:26:56,423 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 10:26:56,424 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-13 10:26:56,424 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2024-10-13 10:26:56,424 INFO L87 Difference]: Start difference. First operand 366 states and 474 transitions. Second operand has 8 states, 6 states have (on average 13.333333333333334) internal successors, (80), 8 states have internal predecessors, (80), 2 states have call successors, (6), 2 states have call predecessors, (6), 4 states have return successors, (4), 1 states have call predecessors, (4), 2 states have call successors, (4) [2024-10-13 10:26:56,669 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 10:26:56,669 INFO L93 Difference]: Finished difference Result 375 states and 488 transitions. [2024-10-13 10:26:56,670 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-10-13 10:26:56,670 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 6 states have (on average 13.333333333333334) internal successors, (80), 8 states have internal predecessors, (80), 2 states have call successors, (6), 2 states have call predecessors, (6), 4 states have return successors, (4), 1 states have call predecessors, (4), 2 states have call successors, (4) Word has length 81 [2024-10-13 10:26:56,671 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 10:26:56,672 INFO L225 Difference]: With dead ends: 375 [2024-10-13 10:26:56,672 INFO L226 Difference]: Without dead ends: 375 [2024-10-13 10:26:56,673 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 163 GetRequests, 154 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-13 10:26:56,673 INFO L432 NwaCegarLoop]: 333 mSDtfsCounter, 5 mSDsluCounter, 662 mSDsCounter, 0 mSdLazyCounter, 56 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 995 SdHoareTripleChecker+Invalid, 65 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 56 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-13 10:26:56,674 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 995 Invalid, 65 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 56 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-13 10:26:56,674 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 375 states. [2024-10-13 10:26:56,680 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 375 to 374. [2024-10-13 10:26:56,681 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 374 states, 344 states have (on average 1.2848837209302326) internal successors, (442), 362 states have internal predecessors, (442), 23 states have call successors, (23), 5 states have call predecessors, (23), 5 states have return successors, (22), 7 states have call predecessors, (22), 21 states have call successors, (22) [2024-10-13 10:26:56,682 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 374 states to 374 states and 487 transitions. [2024-10-13 10:26:56,682 INFO L78 Accepts]: Start accepts. Automaton has 374 states and 487 transitions. Word has length 81 [2024-10-13 10:26:56,683 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 10:26:56,683 INFO L471 AbstractCegarLoop]: Abstraction has 374 states and 487 transitions. [2024-10-13 10:26:56,683 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 6 states have (on average 13.333333333333334) internal successors, (80), 8 states have internal predecessors, (80), 2 states have call successors, (6), 2 states have call predecessors, (6), 4 states have return successors, (4), 1 states have call predecessors, (4), 2 states have call successors, (4) [2024-10-13 10:26:56,683 INFO L276 IsEmpty]: Start isEmpty. Operand 374 states and 487 transitions. [2024-10-13 10:26:56,684 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2024-10-13 10:26:56,686 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 10:26:56,687 INFO L215 NwaCegarLoop]: trace histogram [6, 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] [2024-10-13 10:26:56,703 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Forceful destruction successful, exit code 0 [2024-10-13 10:26:56,887 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-13 10:26:56,888 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2024-10-13 10:26:56,888 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 10:26:56,888 INFO L85 PathProgramCache]: Analyzing trace with hash -1933250630, now seen corresponding path program 2 times [2024-10-13 10:26:56,889 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 10:26:56,889 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [97648671] [2024-10-13 10:26:56,889 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-10-13 10:26:56,889 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-13 10:26:56,889 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 10:26:56,890 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-13 10:26:56,891 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Waiting until timeout for monitored process [2024-10-13 10:26:58,320 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-10-13 10:26:58,320 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-13 10:26:58,347 INFO L255 TraceCheckSpWp]: Trace formula consists of 520 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-10-13 10:26:58,350 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 10:26:58,412 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 16 proven. 3 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2024-10-13 10:26:58,412 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-13 10:26:58,547 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 16 proven. 3 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2024-10-13 10:26:58,547 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 10:26:58,547 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [97648671] [2024-10-13 10:26:58,547 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [97648671] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-13 10:26:58,547 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-13 10:26:58,548 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 10 [2024-10-13 10:26:58,548 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1432141801] [2024-10-13 10:26:58,548 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-13 10:26:58,548 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-10-13 10:26:58,548 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 10:26:58,549 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-10-13 10:26:58,549 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2024-10-13 10:26:58,550 INFO L87 Difference]: Start difference. First operand 374 states and 487 transitions. Second operand has 10 states, 8 states have (on average 9.875) internal successors, (79), 10 states have internal predecessors, (79), 2 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2024-10-13 10:26:58,879 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 10:26:58,880 INFO L93 Difference]: Finished difference Result 380 states and 497 transitions. [2024-10-13 10:26:58,882 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-10-13 10:26:58,882 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 8 states have (on average 9.875) internal successors, (79), 10 states have internal predecessors, (79), 2 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) Word has length 85 [2024-10-13 10:26:58,882 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 10:26:58,884 INFO L225 Difference]: With dead ends: 380 [2024-10-13 10:26:58,886 INFO L226 Difference]: Without dead ends: 380 [2024-10-13 10:26:58,886 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 173 GetRequests, 160 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=80, Invalid=130, Unknown=0, NotChecked=0, Total=210 [2024-10-13 10:26:58,887 INFO L432 NwaCegarLoop]: 332 mSDtfsCounter, 5 mSDsluCounter, 1647 mSDsCounter, 0 mSdLazyCounter, 83 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 1979 SdHoareTripleChecker+Invalid, 89 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 83 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-13 10:26:58,887 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 1979 Invalid, 89 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 83 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-13 10:26:58,888 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 380 states. [2024-10-13 10:26:58,898 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 380 to 378. [2024-10-13 10:26:58,899 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 378 states, 348 states have (on average 1.293103448275862) internal successors, (450), 366 states have internal predecessors, (450), 23 states have call successors, (23), 5 states have call predecessors, (23), 5 states have return successors, (22), 7 states have call predecessors, (22), 21 states have call successors, (22) [2024-10-13 10:26:58,900 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 378 states to 378 states and 495 transitions. [2024-10-13 10:26:58,901 INFO L78 Accepts]: Start accepts. Automaton has 378 states and 495 transitions. Word has length 85 [2024-10-13 10:26:58,901 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 10:26:58,901 INFO L471 AbstractCegarLoop]: Abstraction has 378 states and 495 transitions. [2024-10-13 10:26:58,903 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 8 states have (on average 9.875) internal successors, (79), 10 states have internal predecessors, (79), 2 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2024-10-13 10:26:58,904 INFO L276 IsEmpty]: Start isEmpty. Operand 378 states and 495 transitions. [2024-10-13 10:26:58,905 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2024-10-13 10:26:58,906 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 10:26:58,907 INFO L215 NwaCegarLoop]: trace histogram [10, 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] [2024-10-13 10:26:58,925 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Ended with exit code 0 [2024-10-13 10:26:59,107 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-13 10:26:59,108 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2024-10-13 10:26:59,108 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 10:26:59,108 INFO L85 PathProgramCache]: Analyzing trace with hash -1935901574, now seen corresponding path program 3 times [2024-10-13 10:26:59,109 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 10:26:59,109 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [128750942] [2024-10-13 10:26:59,109 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-10-13 10:26:59,109 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-13 10:26:59,109 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 10:26:59,110 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-13 10:26:59,111 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Waiting until timeout for monitored process [2024-10-13 10:27:02,197 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2024-10-13 10:27:02,198 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-13 10:27:02,228 INFO L255 TraceCheckSpWp]: Trace formula consists of 564 conjuncts, 10 conjuncts are in the unsatisfiable core [2024-10-13 10:27:02,232 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 10:27:02,337 INFO L134 CoverageAnalysis]: Checked inductivity of 68 backedges. 36 proven. 21 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2024-10-13 10:27:02,337 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-13 10:27:02,757 INFO L134 CoverageAnalysis]: Checked inductivity of 68 backedges. 36 proven. 21 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2024-10-13 10:27:02,757 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 10:27:02,757 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [128750942] [2024-10-13 10:27:02,757 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [128750942] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-13 10:27:02,758 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-13 10:27:02,758 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 18 [2024-10-13 10:27:02,758 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [139476811] [2024-10-13 10:27:02,758 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-13 10:27:02,758 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2024-10-13 10:27:02,758 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 10:27:02,759 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2024-10-13 10:27:02,760 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=97, Invalid=209, Unknown=0, NotChecked=0, Total=306 [2024-10-13 10:27:02,760 INFO L87 Difference]: Start difference. First operand 378 states and 495 transitions. Second operand has 18 states, 16 states have (on average 5.4375) internal successors, (87), 18 states have internal predecessors, (87), 2 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2024-10-13 10:27:03,645 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 10:27:03,645 INFO L93 Difference]: Finished difference Result 392 states and 518 transitions. [2024-10-13 10:27:03,646 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2024-10-13 10:27:03,646 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 16 states have (on average 5.4375) internal successors, (87), 18 states have internal predecessors, (87), 2 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) Word has length 89 [2024-10-13 10:27:03,646 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 10:27:03,648 INFO L225 Difference]: With dead ends: 392 [2024-10-13 10:27:03,648 INFO L226 Difference]: Without dead ends: 390 [2024-10-13 10:27:03,649 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 189 GetRequests, 160 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 120 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=324, Invalid=606, Unknown=0, NotChecked=0, Total=930 [2024-10-13 10:27:03,650 INFO L432 NwaCegarLoop]: 332 mSDtfsCounter, 9 mSDsluCounter, 2962 mSDsCounter, 0 mSdLazyCounter, 225 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 3294 SdHoareTripleChecker+Invalid, 229 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 225 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-10-13 10:27:03,650 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 3294 Invalid, 229 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 225 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-10-13 10:27:03,652 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 390 states. [2024-10-13 10:27:03,659 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 390 to 389. [2024-10-13 10:27:03,661 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 389 states, 359 states have (on average 1.309192200557103) internal successors, (470), 377 states have internal predecessors, (470), 23 states have call successors, (23), 5 states have call predecessors, (23), 5 states have return successors, (22), 7 states have call predecessors, (22), 21 states have call successors, (22) [2024-10-13 10:27:03,663 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 389 states to 389 states and 515 transitions. [2024-10-13 10:27:03,663 INFO L78 Accepts]: Start accepts. Automaton has 389 states and 515 transitions. Word has length 89 [2024-10-13 10:27:03,665 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 10:27:03,665 INFO L471 AbstractCegarLoop]: Abstraction has 389 states and 515 transitions. [2024-10-13 10:27:03,665 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 16 states have (on average 5.4375) internal successors, (87), 18 states have internal predecessors, (87), 2 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2024-10-13 10:27:03,665 INFO L276 IsEmpty]: Start isEmpty. Operand 389 states and 515 transitions. [2024-10-13 10:27:03,669 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2024-10-13 10:27:03,669 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 10:27:03,669 INFO L215 NwaCegarLoop]: trace histogram [18, 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] [2024-10-13 10:27:03,690 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Forceful destruction successful, exit code 0 [2024-10-13 10:27:03,870 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-13 10:27:03,870 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2024-10-13 10:27:03,870 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 10:27:03,871 INFO L85 PathProgramCache]: Analyzing trace with hash 1631483386, now seen corresponding path program 4 times [2024-10-13 10:27:03,871 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 10:27:03,871 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [917630099] [2024-10-13 10:27:03,872 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2024-10-13 10:27:03,872 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-13 10:27:03,872 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 10:27:03,873 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-13 10:27:03,875 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Waiting until timeout for monitored process [2024-10-13 10:27:04,515 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2024-10-13 10:27:04,515 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-13 10:27:04,533 INFO L255 TraceCheckSpWp]: Trace formula consists of 652 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-10-13 10:27:04,536 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 10:27:04,612 INFO L134 CoverageAnalysis]: Checked inductivity of 192 backedges. 77 proven. 10 refuted. 0 times theorem prover too weak. 105 trivial. 0 not checked. [2024-10-13 10:27:04,612 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-13 10:27:04,771 INFO L134 CoverageAnalysis]: Checked inductivity of 192 backedges. 0 proven. 86 refuted. 0 times theorem prover too weak. 106 trivial. 0 not checked. [2024-10-13 10:27:04,771 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 10:27:04,772 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [917630099] [2024-10-13 10:27:04,772 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [917630099] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-13 10:27:04,772 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-13 10:27:04,772 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 14 [2024-10-13 10:27:04,772 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [130616598] [2024-10-13 10:27:04,772 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-13 10:27:04,772 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-10-13 10:27:04,772 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 10:27:04,773 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-10-13 10:27:04,773 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=121, Unknown=0, NotChecked=0, Total=182 [2024-10-13 10:27:04,773 INFO L87 Difference]: Start difference. First operand 389 states and 515 transitions. Second operand has 14 states, 12 states have (on average 7.166666666666667) internal successors, (86), 14 states have internal predecessors, (86), 2 states have call successors, (6), 2 states have call predecessors, (6), 4 states have return successors, (4), 1 states have call predecessors, (4), 2 states have call successors, (4) [2024-10-13 10:27:05,312 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 10:27:05,312 INFO L93 Difference]: Finished difference Result 395 states and 522 transitions. [2024-10-13 10:27:05,313 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2024-10-13 10:27:05,313 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 12 states have (on average 7.166666666666667) internal successors, (86), 14 states have internal predecessors, (86), 2 states have call successors, (6), 2 states have call predecessors, (6), 4 states have return successors, (4), 1 states have call predecessors, (4), 2 states have call successors, (4) Word has length 97 [2024-10-13 10:27:05,313 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 10:27:05,314 INFO L225 Difference]: With dead ends: 395 [2024-10-13 10:27:05,314 INFO L226 Difference]: Without dead ends: 393 [2024-10-13 10:27:05,315 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 201 GetRequests, 180 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=182, Invalid=324, Unknown=0, NotChecked=0, Total=506 [2024-10-13 10:27:05,315 INFO L432 NwaCegarLoop]: 333 mSDtfsCounter, 7 mSDsluCounter, 2309 mSDsCounter, 0 mSdLazyCounter, 199 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 2642 SdHoareTripleChecker+Invalid, 206 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 199 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-13 10:27:05,316 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 2642 Invalid, 206 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 199 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-13 10:27:05,317 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 393 states. [2024-10-13 10:27:05,322 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 393 to 392. [2024-10-13 10:27:05,323 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 392 states, 362 states have (on average 1.3011049723756907) internal successors, (471), 380 states have internal predecessors, (471), 23 states have call successors, (23), 5 states have call predecessors, (23), 5 states have return successors, (22), 7 states have call predecessors, (22), 21 states have call successors, (22) [2024-10-13 10:27:05,326 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 392 states to 392 states and 516 transitions. [2024-10-13 10:27:05,326 INFO L78 Accepts]: Start accepts. Automaton has 392 states and 516 transitions. Word has length 97 [2024-10-13 10:27:05,326 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 10:27:05,326 INFO L471 AbstractCegarLoop]: Abstraction has 392 states and 516 transitions. [2024-10-13 10:27:05,327 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 12 states have (on average 7.166666666666667) internal successors, (86), 14 states have internal predecessors, (86), 2 states have call successors, (6), 2 states have call predecessors, (6), 4 states have return successors, (4), 1 states have call predecessors, (4), 2 states have call successors, (4) [2024-10-13 10:27:05,327 INFO L276 IsEmpty]: Start isEmpty. Operand 392 states and 516 transitions. [2024-10-13 10:27:05,327 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2024-10-13 10:27:05,328 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 10:27:05,328 INFO L215 NwaCegarLoop]: trace histogram [24, 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] [2024-10-13 10:27:05,343 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Ended with exit code 0 [2024-10-13 10:27:05,528 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-13 10:27:05,529 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2024-10-13 10:27:05,529 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 10:27:05,529 INFO L85 PathProgramCache]: Analyzing trace with hash -1555998118, now seen corresponding path program 5 times [2024-10-13 10:27:05,530 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 10:27:05,530 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [790573061] [2024-10-13 10:27:05,530 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2024-10-13 10:27:05,530 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-13 10:27:05,530 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 10:27:05,531 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-13 10:27:05,532 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (12)] Waiting until timeout for monitored process [2024-10-13 10:27:06,418 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 8 check-sat command(s) [2024-10-13 10:27:06,418 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-13 10:27:06,442 INFO L255 TraceCheckSpWp]: Trace formula consists of 718 conjuncts, 13 conjuncts are in the unsatisfiable core [2024-10-13 10:27:06,444 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 10:27:06,597 INFO L134 CoverageAnalysis]: Checked inductivity of 327 backedges. 167 proven. 55 refuted. 0 times theorem prover too weak. 105 trivial. 0 not checked. [2024-10-13 10:27:06,597 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-13 10:27:07,054 INFO L134 CoverageAnalysis]: Checked inductivity of 327 backedges. 0 proven. 221 refuted. 0 times theorem prover too weak. 106 trivial. 0 not checked. [2024-10-13 10:27:07,055 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 10:27:07,055 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [790573061] [2024-10-13 10:27:07,055 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [790573061] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-13 10:27:07,055 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-13 10:27:07,055 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 26 [2024-10-13 10:27:07,056 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1418839614] [2024-10-13 10:27:07,056 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-13 10:27:07,056 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2024-10-13 10:27:07,056 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 10:27:07,057 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2024-10-13 10:27:07,057 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=193, Invalid=457, Unknown=0, NotChecked=0, Total=650 [2024-10-13 10:27:07,058 INFO L87 Difference]: Start difference. First operand 392 states and 516 transitions. Second operand has 26 states, 24 states have (on average 4.083333333333333) internal successors, (98), 26 states have internal predecessors, (98), 2 states have call successors, (6), 2 states have call predecessors, (6), 4 states have return successors, (4), 1 states have call predecessors, (4), 2 states have call successors, (4) [2024-10-13 10:27:08,612 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 10:27:08,612 INFO L93 Difference]: Finished difference Result 407 states and 541 transitions. [2024-10-13 10:27:08,613 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2024-10-13 10:27:08,613 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 24 states have (on average 4.083333333333333) internal successors, (98), 26 states have internal predecessors, (98), 2 states have call successors, (6), 2 states have call predecessors, (6), 4 states have return successors, (4), 1 states have call predecessors, (4), 2 states have call successors, (4) Word has length 103 [2024-10-13 10:27:08,614 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 10:27:08,616 INFO L225 Difference]: With dead ends: 407 [2024-10-13 10:27:08,616 INFO L226 Difference]: Without dead ends: 405 [2024-10-13 10:27:08,617 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 225 GetRequests, 180 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 100 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=728, Invalid=1434, Unknown=0, NotChecked=0, Total=2162 [2024-10-13 10:27:08,617 INFO L432 NwaCegarLoop]: 333 mSDtfsCounter, 13 mSDsluCounter, 3633 mSDsCounter, 0 mSdLazyCounter, 586 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 3966 SdHoareTripleChecker+Invalid, 602 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 586 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-10-13 10:27:08,618 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 3966 Invalid, 602 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 586 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-10-13 10:27:08,618 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 405 states. [2024-10-13 10:27:08,626 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 405 to 404. [2024-10-13 10:27:08,627 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 404 states, 374 states have (on average 1.2914438502673797) internal successors, (483), 392 states have internal predecessors, (483), 23 states have call successors, (23), 5 states have call predecessors, (23), 5 states have return successors, (22), 7 states have call predecessors, (22), 21 states have call successors, (22) [2024-10-13 10:27:08,629 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 404 states to 404 states and 528 transitions. [2024-10-13 10:27:08,630 INFO L78 Accepts]: Start accepts. Automaton has 404 states and 528 transitions. Word has length 103 [2024-10-13 10:27:08,631 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 10:27:08,631 INFO L471 AbstractCegarLoop]: Abstraction has 404 states and 528 transitions. [2024-10-13 10:27:08,631 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 24 states have (on average 4.083333333333333) internal successors, (98), 26 states have internal predecessors, (98), 2 states have call successors, (6), 2 states have call predecessors, (6), 4 states have return successors, (4), 1 states have call predecessors, (4), 2 states have call successors, (4) [2024-10-13 10:27:08,631 INFO L276 IsEmpty]: Start isEmpty. Operand 404 states and 528 transitions. [2024-10-13 10:27:08,632 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2024-10-13 10:27:08,632 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 10:27:08,632 INFO L215 NwaCegarLoop]: trace histogram [36, 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] [2024-10-13 10:27:08,649 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (12)] Ended with exit code 0 [2024-10-13 10:27:08,833 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-13 10:27:08,833 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2024-10-13 10:27:08,833 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 10:27:08,834 INFO L85 PathProgramCache]: Analyzing trace with hash 818858778, now seen corresponding path program 6 times [2024-10-13 10:27:08,834 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 10:27:08,834 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [366634889] [2024-10-13 10:27:08,834 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2024-10-13 10:27:08,834 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-13 10:27:08,834 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 10:27:08,835 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-13 10:27:08,836 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (13)] Waiting until timeout for monitored process [2024-10-13 10:27:13,088 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 13 check-sat command(s) [2024-10-13 10:27:13,088 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-13 10:27:13,126 INFO L255 TraceCheckSpWp]: Trace formula consists of 850 conjuncts, 26 conjuncts are in the unsatisfiable core [2024-10-13 10:27:13,130 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 10:27:13,599 INFO L134 CoverageAnalysis]: Checked inductivity of 705 backedges. 347 proven. 253 refuted. 0 times theorem prover too weak. 105 trivial. 0 not checked. [2024-10-13 10:27:13,600 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-13 10:27:15,205 INFO L134 CoverageAnalysis]: Checked inductivity of 705 backedges. 0 proven. 599 refuted. 0 times theorem prover too weak. 106 trivial. 0 not checked. [2024-10-13 10:27:15,205 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 10:27:15,206 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [366634889] [2024-10-13 10:27:15,206 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [366634889] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-13 10:27:15,206 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-13 10:27:15,206 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 26] total 50 [2024-10-13 10:27:15,206 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [765184744] [2024-10-13 10:27:15,206 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-13 10:27:15,206 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 50 states [2024-10-13 10:27:15,207 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 10:27:15,207 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2024-10-13 10:27:15,208 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=672, Invalid=1778, Unknown=0, NotChecked=0, Total=2450 [2024-10-13 10:27:15,208 INFO L87 Difference]: Start difference. First operand 404 states and 528 transitions. Second operand has 50 states, 48 states have (on average 2.5416666666666665) internal successors, (122), 50 states have internal predecessors, (122), 2 states have call successors, (6), 2 states have call predecessors, (6), 4 states have return successors, (4), 1 states have call predecessors, (4), 2 states have call successors, (4) [2024-10-13 10:27:22,270 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 10:27:22,270 INFO L93 Difference]: Finished difference Result 440 states and 594 transitions. [2024-10-13 10:27:22,271 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 73 states. [2024-10-13 10:27:22,272 INFO L78 Accepts]: Start accepts. Automaton has has 50 states, 48 states have (on average 2.5416666666666665) internal successors, (122), 50 states have internal predecessors, (122), 2 states have call successors, (6), 2 states have call predecessors, (6), 4 states have return successors, (4), 1 states have call predecessors, (4), 2 states have call successors, (4) Word has length 115 [2024-10-13 10:27:22,272 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 10:27:22,274 INFO L225 Difference]: With dead ends: 440 [2024-10-13 10:27:22,274 INFO L226 Difference]: Without dead ends: 437 [2024-10-13 10:27:22,277 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 272 GetRequests, 180 SyntacticMatches, 0 SemanticMatches, 92 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 485 ImplicationChecksByTransitivity, 6.0s TimeCoverageRelationStatistics Valid=2784, Invalid=5958, Unknown=0, NotChecked=0, Total=8742 [2024-10-13 10:27:22,278 INFO L432 NwaCegarLoop]: 333 mSDtfsCounter, 25 mSDsluCounter, 8577 mSDsCounter, 0 mSdLazyCounter, 2043 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 8910 SdHoareTripleChecker+Invalid, 2054 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 2043 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.6s IncrementalHoareTripleChecker+Time [2024-10-13 10:27:22,278 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [25 Valid, 8910 Invalid, 2054 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 2043 Invalid, 0 Unknown, 0 Unchecked, 2.6s Time] [2024-10-13 10:27:22,279 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 437 states. [2024-10-13 10:27:22,290 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 437 to 437. [2024-10-13 10:27:22,292 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 437 states, 407 states have (on average 1.28992628992629) internal successors, (525), 425 states have internal predecessors, (525), 23 states have call successors, (23), 5 states have call predecessors, (23), 5 states have return successors, (22), 7 states have call predecessors, (22), 21 states have call successors, (22) [2024-10-13 10:27:22,293 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 437 states to 437 states and 570 transitions. [2024-10-13 10:27:22,293 INFO L78 Accepts]: Start accepts. Automaton has 437 states and 570 transitions. Word has length 115 [2024-10-13 10:27:22,294 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 10:27:22,294 INFO L471 AbstractCegarLoop]: Abstraction has 437 states and 570 transitions. [2024-10-13 10:27:22,294 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 50 states, 48 states have (on average 2.5416666666666665) internal successors, (122), 50 states have internal predecessors, (122), 2 states have call successors, (6), 2 states have call predecessors, (6), 4 states have return successors, (4), 1 states have call predecessors, (4), 2 states have call successors, (4) [2024-10-13 10:27:22,294 INFO L276 IsEmpty]: Start isEmpty. Operand 437 states and 570 transitions. [2024-10-13 10:27:22,295 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2024-10-13 10:27:22,295 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 10:27:22,296 INFO L215 NwaCegarLoop]: trace histogram [58, 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] [2024-10-13 10:27:22,328 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (13)] Forceful destruction successful, exit code 0 [2024-10-13 10:27:22,496 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-13 10:27:22,497 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2024-10-13 10:27:22,497 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 10:27:22,497 INFO L85 PathProgramCache]: Analyzing trace with hash -773187462, now seen corresponding path program 7 times [2024-10-13 10:27:22,498 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 10:27:22,498 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [866437194] [2024-10-13 10:27:22,499 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2024-10-13 10:27:22,499 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-13 10:27:22,499 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 10:27:22,502 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-13 10:27:22,503 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (14)] Waiting until timeout for monitored process [2024-10-13 10:27:23,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:27:23,379 INFO L255 TraceCheckSpWp]: Trace formula consists of 1092 conjuncts, 17 conjuncts are in the unsatisfiable core [2024-10-13 10:27:23,382 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 10:27:23,596 INFO L134 CoverageAnalysis]: Checked inductivity of 1772 backedges. 676 proven. 105 refuted. 0 times theorem prover too weak. 991 trivial. 0 not checked. [2024-10-13 10:27:23,596 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-13 10:27:24,308 INFO L134 CoverageAnalysis]: Checked inductivity of 1772 backedges. 676 proven. 105 refuted. 0 times theorem prover too weak. 991 trivial. 0 not checked. [2024-10-13 10:27:24,308 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 10:27:24,308 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [866437194] [2024-10-13 10:27:24,308 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [866437194] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-13 10:27:24,309 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-13 10:27:24,309 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 18] total 34 [2024-10-13 10:27:24,309 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2043328816] [2024-10-13 10:27:24,309 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-13 10:27:24,310 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2024-10-13 10:27:24,310 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 10:27:24,310 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2024-10-13 10:27:24,311 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=321, Invalid=801, Unknown=0, NotChecked=0, Total=1122 [2024-10-13 10:27:24,311 INFO L87 Difference]: Start difference. First operand 437 states and 570 transitions. Second operand has 34 states, 32 states have (on average 3.21875) internal successors, (103), 34 states have internal predecessors, (103), 2 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2024-10-13 10:27:26,902 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 10:27:26,903 INFO L93 Difference]: Finished difference Result 446 states and 586 transitions. [2024-10-13 10:27:26,903 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2024-10-13 10:27:26,904 INFO L78 Accepts]: Start accepts. Automaton has has 34 states, 32 states have (on average 3.21875) internal successors, (103), 34 states have internal predecessors, (103), 2 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) Word has length 137 [2024-10-13 10:27:26,904 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 10:27:26,908 INFO L225 Difference]: With dead ends: 446 [2024-10-13 10:27:26,908 INFO L226 Difference]: Without dead ends: 446 [2024-10-13 10:27:26,909 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 301 GetRequests, 240 SyntacticMatches, 0 SemanticMatches, 61 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 616 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=1292, Invalid=2614, Unknown=0, NotChecked=0, Total=3906 [2024-10-13 10:27:26,909 INFO L432 NwaCegarLoop]: 332 mSDtfsCounter, 17 mSDsluCounter, 5267 mSDsCounter, 0 mSdLazyCounter, 658 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 5599 SdHoareTripleChecker+Invalid, 689 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 658 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2024-10-13 10:27:26,910 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 5599 Invalid, 689 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 658 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2024-10-13 10:27:26,910 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 446 states. [2024-10-13 10:27:26,919 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 446 to 444. [2024-10-13 10:27:26,919 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 444 states, 414 states have (on average 1.3019323671497585) internal successors, (539), 432 states have internal predecessors, (539), 23 states have call successors, (23), 5 states have call predecessors, (23), 5 states have return successors, (22), 7 states have call predecessors, (22), 21 states have call successors, (22) [2024-10-13 10:27:26,921 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 444 states to 444 states and 584 transitions. [2024-10-13 10:27:26,921 INFO L78 Accepts]: Start accepts. Automaton has 444 states and 584 transitions. Word has length 137 [2024-10-13 10:27:26,921 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 10:27:26,921 INFO L471 AbstractCegarLoop]: Abstraction has 444 states and 584 transitions. [2024-10-13 10:27:26,921 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 32 states have (on average 3.21875) internal successors, (103), 34 states have internal predecessors, (103), 2 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2024-10-13 10:27:26,922 INFO L276 IsEmpty]: Start isEmpty. Operand 444 states and 584 transitions. [2024-10-13 10:27:26,923 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2024-10-13 10:27:26,923 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 10:27:26,923 INFO L215 NwaCegarLoop]: trace histogram [74, 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] [2024-10-13 10:27:26,940 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (14)] Ended with exit code 0 [2024-10-13 10:27:27,123 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-13 10:27:27,124 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2024-10-13 10:27:27,124 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 10:27:27,124 INFO L85 PathProgramCache]: Analyzing trace with hash 1168411514, now seen corresponding path program 8 times [2024-10-13 10:27:27,125 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 10:27:27,125 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1846628257] [2024-10-13 10:27:27,125 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-10-13 10:27:27,125 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-13 10:27:27,125 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 10:27:27,126 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-13 10:27:27,128 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (15)] Waiting until timeout for monitored process [2024-10-13 10:27:28,748 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-10-13 10:27:28,748 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-13 10:27:28,779 INFO L255 TraceCheckSpWp]: Trace formula consists of 1268 conjuncts, 33 conjuncts are in the unsatisfiable core [2024-10-13 10:27:28,782 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 10:27:29,589 INFO L134 CoverageAnalysis]: Checked inductivity of 2852 backedges. 1396 proven. 465 refuted. 0 times theorem prover too weak. 991 trivial. 0 not checked. [2024-10-13 10:27:29,589 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-13 10:27:32,049 INFO L134 CoverageAnalysis]: Checked inductivity of 2852 backedges. 1396 proven. 465 refuted. 0 times theorem prover too weak. 991 trivial. 0 not checked. [2024-10-13 10:27:32,049 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 10:27:32,049 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1846628257] [2024-10-13 10:27:32,049 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1846628257] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-13 10:27:32,049 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-13 10:27:32,049 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [34, 34] total 66 [2024-10-13 10:27:32,050 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [466795619] [2024-10-13 10:27:32,050 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-13 10:27:32,050 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 66 states [2024-10-13 10:27:32,050 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 10:27:32,051 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 66 interpolants. [2024-10-13 10:27:32,052 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1153, Invalid=3137, Unknown=0, NotChecked=0, Total=4290 [2024-10-13 10:27:32,053 INFO L87 Difference]: Start difference. First operand 444 states and 584 transitions. Second operand has 66 states, 64 states have (on average 2.109375) internal successors, (135), 66 states have internal predecessors, (135), 2 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2024-10-13 10:27:44,035 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 10:27:44,035 INFO L93 Difference]: Finished difference Result 478 states and 650 transitions. [2024-10-13 10:27:44,036 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 97 states. [2024-10-13 10:27:44,037 INFO L78 Accepts]: Start accepts. Automaton has has 66 states, 64 states have (on average 2.109375) internal successors, (135), 66 states have internal predecessors, (135), 2 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) Word has length 153 [2024-10-13 10:27:44,037 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 10:27:44,039 INFO L225 Difference]: With dead ends: 478 [2024-10-13 10:27:44,039 INFO L226 Difference]: Without dead ends: 478 [2024-10-13 10:27:44,043 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 365 GetRequests, 240 SyntacticMatches, 0 SemanticMatches, 125 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2760 ImplicationChecksByTransitivity, 10.9s TimeCoverageRelationStatistics Valid=5148, Invalid=10854, Unknown=0, NotChecked=0, Total=16002 [2024-10-13 10:27:44,044 INFO L432 NwaCegarLoop]: 332 mSDtfsCounter, 33 mSDsluCounter, 10201 mSDsCounter, 0 mSdLazyCounter, 2300 mSolverCounterSat, 44 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 33 SdHoareTripleChecker+Valid, 10533 SdHoareTripleChecker+Invalid, 2344 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 44 IncrementalHoareTripleChecker+Valid, 2300 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.7s IncrementalHoareTripleChecker+Time [2024-10-13 10:27:44,044 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [33 Valid, 10533 Invalid, 2344 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [44 Valid, 2300 Invalid, 0 Unknown, 0 Unchecked, 3.7s Time] [2024-10-13 10:27:44,045 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 478 states. [2024-10-13 10:27:44,051 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 478 to 476. [2024-10-13 10:27:44,052 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 476 states, 446 states have (on average 1.352017937219731) internal successors, (603), 464 states have internal predecessors, (603), 23 states have call successors, (23), 5 states have call predecessors, (23), 5 states have return successors, (22), 7 states have call predecessors, (22), 21 states have call successors, (22) [2024-10-13 10:27:44,054 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 476 states to 476 states and 648 transitions. [2024-10-13 10:27:44,054 INFO L78 Accepts]: Start accepts. Automaton has 476 states and 648 transitions. Word has length 153 [2024-10-13 10:27:44,055 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 10:27:44,055 INFO L471 AbstractCegarLoop]: Abstraction has 476 states and 648 transitions. [2024-10-13 10:27:44,055 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 66 states, 64 states have (on average 2.109375) internal successors, (135), 66 states have internal predecessors, (135), 2 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2024-10-13 10:27:44,055 INFO L276 IsEmpty]: Start isEmpty. Operand 476 states and 648 transitions. [2024-10-13 10:27:44,057 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 186 [2024-10-13 10:27:44,057 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 10:27:44,057 INFO L215 NwaCegarLoop]: trace histogram [106, 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] [2024-10-13 10:27:44,085 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (15)] Ended with exit code 0 [2024-10-13 10:27:44,257 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-13 10:27:44,258 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2024-10-13 10:27:44,259 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 10:27:44,259 INFO L85 PathProgramCache]: Analyzing trace with hash 1229418874, now seen corresponding path program 9 times [2024-10-13 10:27:44,260 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 10:27:44,260 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [911793335] [2024-10-13 10:27:44,260 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-10-13 10:27:44,260 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-13 10:27:44,261 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 10:27:44,263 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-13 10:27:44,266 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (16)] Waiting until timeout for monitored process