./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_SAX_test4-3.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_SAX_test4-3.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 f41a78d87834195eab5eb2e1b786d665ee0f261c86aa89f4e0ae15aff9e9d1ee --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-mul-div-a046e57-m [2024-10-13 10:22:37,695 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-13 10:22:37,768 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-MemCleanup-32bit-Automizer_Default.epf [2024-10-13 10:22:37,774 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-13 10:22:37,774 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-13 10:22:37,802 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-13 10:22:37,803 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-13 10:22:37,803 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-13 10:22:37,804 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-13 10:22:37,804 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-13 10:22:37,805 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-13 10:22:37,805 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-13 10:22:37,806 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-13 10:22:37,807 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-13 10:22:37,808 INFO L153 SettingsManager]: * Use SBE=true [2024-10-13 10:22:37,808 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-13 10:22:37,809 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-13 10:22:37,809 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-13 10:22:37,809 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-13 10:22:37,810 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-13 10:22:37,810 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-13 10:22:37,814 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-13 10:22:37,814 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-10-13 10:22:37,815 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-10-13 10:22:37,815 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-13 10:22:37,815 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-13 10:22:37,815 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-10-13 10:22:37,816 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-13 10:22:37,816 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-10-13 10:22:37,816 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-13 10:22:37,816 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-13 10:22:37,817 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-13 10:22:37,817 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-13 10:22:37,817 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-13 10:22:37,818 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-13 10:22:37,818 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-13 10:22:37,819 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-13 10:22:37,819 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-13 10:22:37,819 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-13 10:22:37,820 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-13 10:22:37,820 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-13 10:22:37,820 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-13 10:22:37,821 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-13 10:22:37,821 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-13 10:22:37,821 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-13 10:22:37,822 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 -> f41a78d87834195eab5eb2e1b786d665ee0f261c86aa89f4e0ae15aff9e9d1ee [2024-10-13 10:22:38,090 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-13 10:22:38,122 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-13 10:22:38,127 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-13 10:22:38,128 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-13 10:22:38,129 INFO L274 PluginConnector]: CDTParser initialized [2024-10-13 10:22:38,131 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_SAX_test4-3.i [2024-10-13 10:22:39,634 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-13 10:22:39,933 INFO L384 CDTParser]: Found 1 translation units. [2024-10-13 10:22:39,937 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_SAX_test4-3.i [2024-10-13 10:22:39,969 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3b7d17613/27b8015a47a54cb98ef51e792aae0fac/FLAG7f04e4934 [2024-10-13 10:22:39,985 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3b7d17613/27b8015a47a54cb98ef51e792aae0fac [2024-10-13 10:22:39,989 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-13 10:22:39,991 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-13 10:22:39,996 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-13 10:22:39,996 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-13 10:22:40,003 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-13 10:22:40,004 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 10:22:39" (1/1) ... [2024-10-13 10:22:40,005 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@28b4b9f5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 10:22:40, skipping insertion in model container [2024-10-13 10:22:40,005 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 10:22:39" (1/1) ... [2024-10-13 10:22:40,063 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-13 10:22:40,700 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-13 10:22:40,712 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:22:40,713 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver@72013e2a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 10:22:40, skipping insertion in model container [2024-10-13 10:22:40,713 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-13 10:22:40,714 INFO L186 ToolchainWalker]: Toolchain execution was canceled (user or tool) before executing de.uni_freiburg.informatik.ultimate.boogie.procedureinliner [2024-10-13 10:22:40,716 INFO L158 Benchmark]: Toolchain (without parser) took 724.17ms. Allocated memory is still 174.1MB. Free memory was 104.7MB in the beginning and 138.0MB in the end (delta: -33.4MB). Peak memory consumption was 21.0MB. Max. memory is 16.1GB. [2024-10-13 10:22:40,716 INFO L158 Benchmark]: CDTParser took 0.26ms. Allocated memory is still 174.1MB. Free memory was 132.0MB in the beginning and 131.9MB in the end (delta: 160.8kB). There was no memory consumed. Max. memory is 16.1GB. [2024-10-13 10:22:40,717 INFO L158 Benchmark]: CACSL2BoogieTranslator took 717.54ms. Allocated memory is still 174.1MB. Free memory was 104.5MB in the beginning and 138.0MB in the end (delta: -33.5MB). Peak memory consumption was 21.0MB. Max. memory is 16.1GB. [2024-10-13 10:22:40,718 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.26ms. Allocated memory is still 174.1MB. Free memory was 132.0MB in the beginning and 131.9MB in the end (delta: 160.8kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 717.54ms. Allocated memory is still 174.1MB. Free memory was 104.5MB in the beginning and 138.0MB in the end (delta: -33.5MB). Peak memory consumption was 21.0MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - UnsupportedSyntaxResult [Line: 752]: 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_SAX_test4-3.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 f41a78d87834195eab5eb2e1b786d665ee0f261c86aa89f4e0ae15aff9e9d1ee --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-mul-div-a046e57-m [2024-10-13 10:22:42,767 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-13 10:22:42,854 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-MemCleanup-32bit-Automizer_Bitvector.epf [2024-10-13 10:22:42,862 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-13 10:22:42,863 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-13 10:22:42,898 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-13 10:22:42,899 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-13 10:22:42,900 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-13 10:22:42,901 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-13 10:22:42,901 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-13 10:22:42,902 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-13 10:22:42,902 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-13 10:22:42,903 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-13 10:22:42,905 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-13 10:22:42,905 INFO L153 SettingsManager]: * Use SBE=true [2024-10-13 10:22:42,906 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-13 10:22:42,906 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-13 10:22:42,907 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-13 10:22:42,907 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-13 10:22:42,907 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-13 10:22:42,908 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-13 10:22:42,912 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-13 10:22:42,912 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-10-13 10:22:42,912 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-10-13 10:22:42,912 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-13 10:22:42,913 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-13 10:22:42,913 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-10-13 10:22:42,913 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-10-13 10:22:42,913 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-13 10:22:42,914 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-10-13 10:22:42,914 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-10-13 10:22:42,914 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-13 10:22:42,914 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-13 10:22:42,915 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-13 10:22:42,915 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-13 10:22:42,915 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-13 10:22:42,916 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-13 10:22:42,917 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-13 10:22:42,917 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-13 10:22:42,917 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-13 10:22:42,918 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-13 10:22:42,919 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-10-13 10:22:42,919 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-10-13 10:22:42,919 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-13 10:22:42,920 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-13 10:22:42,920 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-13 10:22:42,920 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-13 10:22:42,920 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2024-10-13 10:22:42,921 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 -> f41a78d87834195eab5eb2e1b786d665ee0f261c86aa89f4e0ae15aff9e9d1ee [2024-10-13 10:22:43,232 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-13 10:22:43,253 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-13 10:22:43,256 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-13 10:22:43,258 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-13 10:22:43,258 INFO L274 PluginConnector]: CDTParser initialized [2024-10-13 10:22:43,259 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_SAX_test4-3.i [2024-10-13 10:22:44,838 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-13 10:22:45,228 INFO L384 CDTParser]: Found 1 translation units. [2024-10-13 10:22:45,230 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_SAX_test4-3.i [2024-10-13 10:22:45,255 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a0f60256d/2b425084468b49ca83482c13638c734d/FLAG162820a24 [2024-10-13 10:22:45,425 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a0f60256d/2b425084468b49ca83482c13638c734d [2024-10-13 10:22:45,428 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-13 10:22:45,430 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-13 10:22:45,433 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-13 10:22:45,433 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-13 10:22:45,438 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-13 10:22:45,439 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 10:22:45" (1/1) ... [2024-10-13 10:22:45,442 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@79bf2f8b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 10:22:45, skipping insertion in model container [2024-10-13 10:22:45,442 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 10:22:45" (1/1) ... [2024-10-13 10:22:45,507 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-13 10:22:46,118 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-13 10:22:46,133 INFO L197 MainTranslator]: Restarting translation with changed settings: SettingsChange [mNewPreferredMemoryModel=HoenickeLindenmann_1ByteResolution] [2024-10-13 10:22:46,147 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-13 10:22:46,262 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-13 10:22:46,269 INFO L200 MainTranslator]: Completed pre-run [2024-10-13 10:22:46,365 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-13 10:22:46,420 INFO L204 MainTranslator]: Completed translation [2024-10-13 10:22:46,420 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 10:22:46 WrapperNode [2024-10-13 10:22:46,421 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-13 10:22:46,422 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-13 10:22:46,422 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-13 10:22:46,422 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-13 10:22:46,427 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:22:46" (1/1) ... [2024-10-13 10:22:46,477 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:22:46" (1/1) ... [2024-10-13 10:22:46,556 INFO L138 Inliner]: procedures = 179, calls = 435, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 1471 [2024-10-13 10:22:46,560 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-13 10:22:46,561 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-13 10:22:46,561 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-13 10:22:46,561 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-13 10:22:46,574 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 10:22:46" (1/1) ... [2024-10-13 10:22:46,575 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 10:22:46" (1/1) ... [2024-10-13 10:22:46,596 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 10:22:46" (1/1) ... [2024-10-13 10:22:46,719 INFO L175 MemorySlicer]: Split 403 memory accesses to 2 slices as follows [2, 401]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0]. The 98 writes are split as follows [0, 98]. [2024-10-13 10:22:46,719 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 10:22:46" (1/1) ... [2024-10-13 10:22:46,720 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 10:22:46" (1/1) ... [2024-10-13 10:22:46,777 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 10:22:46" (1/1) ... [2024-10-13 10:22:46,800 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 10:22:46" (1/1) ... [2024-10-13 10:22:46,806 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 10:22:46" (1/1) ... [2024-10-13 10:22:46,812 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 10:22:46" (1/1) ... [2024-10-13 10:22:46,829 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-13 10:22:46,830 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-13 10:22:46,830 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-13 10:22:46,830 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-13 10:22:46,831 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 10:22:46" (1/1) ... [2024-10-13 10:22:46,840 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-13 10:22:46,852 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 10:22:46,867 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:22:46,871 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:22:46,908 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#0 [2024-10-13 10:22:46,909 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#1 [2024-10-13 10:22:46,909 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#0 [2024-10-13 10:22:46,909 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#1 [2024-10-13 10:22:46,909 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2024-10-13 10:22:46,909 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2024-10-13 10:22:46,910 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#0 [2024-10-13 10:22:46,910 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#1 [2024-10-13 10:22:46,910 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#0 [2024-10-13 10:22:46,910 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#1 [2024-10-13 10:22:46,910 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-10-13 10:22:46,910 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-13 10:22:46,910 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2024-10-13 10:22:46,911 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2024-10-13 10:22:46,911 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2024-10-13 10:22:46,911 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2024-10-13 10:22:46,911 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-10-13 10:22:46,911 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#0 [2024-10-13 10:22:46,911 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#1 [2024-10-13 10:22:46,912 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-10-13 10:22:46,912 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2024-10-13 10:22:46,912 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-13 10:22:46,912 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-13 10:22:47,175 INFO L238 CfgBuilder]: Building ICFG [2024-10-13 10:22:47,178 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-13 10:23:00,870 INFO L? ?]: Removed 210 outVars from TransFormulas that were not future-live. [2024-10-13 10:23:00,870 INFO L287 CfgBuilder]: Performing block encoding [2024-10-13 10:23:00,917 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-13 10:23:00,918 INFO L314 CfgBuilder]: Removed 77 assume(true) statements. [2024-10-13 10:23:00,920 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 10:23:00 BoogieIcfgContainer [2024-10-13 10:23:00,920 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-13 10:23:00,922 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-13 10:23:00,922 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-13 10:23:00,925 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-13 10:23:00,925 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.10 10:22:45" (1/3) ... [2024-10-13 10:23:00,926 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@bab69cb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 10:23:00, skipping insertion in model container [2024-10-13 10:23:00,926 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 10:22:46" (2/3) ... [2024-10-13 10:23:00,927 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@bab69cb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 10:23:00, skipping insertion in model container [2024-10-13 10:23:00,927 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 10:23:00" (3/3) ... [2024-10-13 10:23:00,928 INFO L112 eAbstractionObserver]: Analyzing ICFG uthash_SAX_test4-3.i [2024-10-13 10:23:00,945 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-13 10:23:00,946 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2024-10-13 10:23:01,024 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-13 10:23:01,032 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;@29cb2639, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-13 10:23:01,033 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2024-10-13 10:23:01,039 INFO L276 IsEmpty]: Start isEmpty. Operand has 266 states, 245 states have (on average 1.6775510204081632) internal successors, (411), 257 states have internal predecessors, (411), 16 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 7 states have call predecessors, (16), 16 states have call successors, (16) [2024-10-13 10:23:01,047 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2024-10-13 10:23:01,047 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 10:23:01,048 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 10:23:01,049 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, __VERIFIER_assertErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2024-10-13 10:23:01,055 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 10:23:01,056 INFO L85 PathProgramCache]: Analyzing trace with hash -1132433880, now seen corresponding path program 1 times [2024-10-13 10:23:01,067 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 10:23:01,068 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1701097074] [2024-10-13 10:23:01,068 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 10:23:01,068 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:23:01,069 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 10:23:01,072 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:23:01,075 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2024-10-13 10:23:01,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:23:01,334 INFO L255 TraceCheckSpWp]: Trace formula consists of 39 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-10-13 10:23:01,343 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 10:23:01,353 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:23:01,354 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-13 10:23:01,355 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 10:23:01,355 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1701097074] [2024-10-13 10:23:01,356 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1701097074] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 10:23:01,356 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 10:23:01,356 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-13 10:23:01,358 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1521841364] [2024-10-13 10:23:01,359 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 10:23:01,363 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-13 10:23:01,363 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 10:23:01,385 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-13 10:23:01,385 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-13 10:23:01,388 INFO L87 Difference]: Start difference. First operand has 266 states, 245 states have (on average 1.6775510204081632) internal successors, (411), 257 states have internal predecessors, (411), 16 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 7 states have call predecessors, (16), 16 states have call successors, (16) 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:23:01,449 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 10:23:01,450 INFO L93 Difference]: Finished difference Result 265 states and 356 transitions. [2024-10-13 10:23:01,451 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-13 10:23:01,453 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:23:01,453 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 10:23:01,463 INFO L225 Difference]: With dead ends: 265 [2024-10-13 10:23:01,463 INFO L226 Difference]: Without dead ends: 264 [2024-10-13 10:23:01,464 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:23:01,467 INFO L432 NwaCegarLoop]: 351 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 351 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-13 10:23:01,468 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 351 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-13 10:23:01,492 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 264 states. [2024-10-13 10:23:01,541 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 264 to 264. [2024-10-13 10:23:01,545 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 264 states, 244 states have (on average 1.3237704918032787) internal successors, (323), 255 states have internal predecessors, (323), 16 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 7 states have call predecessors, (16), 16 states have call successors, (16) [2024-10-13 10:23:01,550 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 264 states to 264 states and 355 transitions. [2024-10-13 10:23:01,558 INFO L78 Accepts]: Start accepts. Automaton has 264 states and 355 transitions. Word has length 10 [2024-10-13 10:23:01,559 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 10:23:01,559 INFO L471 AbstractCegarLoop]: Abstraction has 264 states and 355 transitions. [2024-10-13 10:23:01,559 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:23:01,559 INFO L276 IsEmpty]: Start isEmpty. Operand 264 states and 355 transitions. [2024-10-13 10:23:01,560 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2024-10-13 10:23:01,560 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 10:23:01,561 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 10:23:01,569 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:23:01,768 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:23:01,769 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, __VERIFIER_assertErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2024-10-13 10:23:01,769 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 10:23:01,770 INFO L85 PathProgramCache]: Analyzing trace with hash -1587648931, now seen corresponding path program 1 times [2024-10-13 10:23:01,770 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 10:23:01,770 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [931943191] [2024-10-13 10:23:01,770 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 10:23:01,770 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:23:01,771 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 10:23:01,773 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:23:01,774 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:23:01,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:23:01,955 INFO L255 TraceCheckSpWp]: Trace formula consists of 39 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-13 10:23:01,958 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 10:23:01,979 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:23:01,979 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-13 10:23:01,980 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 10:23:01,980 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [931943191] [2024-10-13 10:23:01,980 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [931943191] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 10:23:01,980 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 10:23:01,981 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-13 10:23:01,981 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1299910726] [2024-10-13 10:23:01,981 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 10:23:01,982 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 10:23:01,982 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 10:23:01,982 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 10:23:01,983 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 10:23:01,983 INFO L87 Difference]: Start difference. First operand 264 states and 355 transitions. Second operand has 3 states, 3 states have (on average 3.0) 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:23:02,197 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 10:23:02,197 INFO L93 Difference]: Finished difference Result 438 states and 581 transitions. [2024-10-13 10:23:02,198 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 10:23:02,198 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.0) 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:23:02,198 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 10:23:02,203 INFO L225 Difference]: With dead ends: 438 [2024-10-13 10:23:02,207 INFO L226 Difference]: Without dead ends: 438 [2024-10-13 10:23:02,207 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 8 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:23:02,208 INFO L432 NwaCegarLoop]: 348 mSDtfsCounter, 213 mSDsluCounter, 347 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 219 SdHoareTripleChecker+Valid, 695 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-13 10:23:02,209 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [219 Valid, 695 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-13 10:23:02,210 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 438 states. [2024-10-13 10:23:02,233 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 438 to 265. [2024-10-13 10:23:02,234 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 265 states, 245 states have (on average 1.3224489795918368) internal successors, (324), 256 states have internal predecessors, (324), 16 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 7 states have call predecessors, (16), 16 states have call successors, (16) [2024-10-13 10:23:02,236 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 265 states to 265 states and 356 transitions. [2024-10-13 10:23:02,237 INFO L78 Accepts]: Start accepts. Automaton has 265 states and 356 transitions. Word has length 10 [2024-10-13 10:23:02,237 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 10:23:02,237 INFO L471 AbstractCegarLoop]: Abstraction has 265 states and 356 transitions. [2024-10-13 10:23:02,237 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.0) 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:23:02,237 INFO L276 IsEmpty]: Start isEmpty. Operand 265 states and 356 transitions. [2024-10-13 10:23:02,241 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2024-10-13 10:23:02,241 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 10:23:02,241 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:23:02,245 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:23:02,443 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:23:02,444 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, __VERIFIER_assertErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2024-10-13 10:23:02,444 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 10:23:02,444 INFO L85 PathProgramCache]: Analyzing trace with hash -1053962185, now seen corresponding path program 1 times [2024-10-13 10:23:02,446 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 10:23:02,446 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1532955521] [2024-10-13 10:23:02,447 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 10:23:02,447 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:23:02,447 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 10:23:02,450 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:23:02,451 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:23:03,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:23:03,084 INFO L255 TraceCheckSpWp]: Trace formula consists of 540 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-13 10:23:03,089 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 10:23:03,137 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 10:23:03,137 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-13 10:23:03,138 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 10:23:03,138 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1532955521] [2024-10-13 10:23:03,140 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1532955521] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 10:23:03,141 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 10:23:03,141 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-13 10:23:03,142 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1367302424] [2024-10-13 10:23:03,142 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 10:23:03,142 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-13 10:23:03,143 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 10:23:03,144 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-13 10:23:03,144 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-13 10:23:03,145 INFO L87 Difference]: Start difference. First operand 265 states and 356 transitions. Second operand has 4 states, 4 states have (on average 28.75) internal successors, (115), 4 states have internal predecessors, (115), 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:23:03,290 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 10:23:03,290 INFO L93 Difference]: Finished difference Result 268 states and 351 transitions. [2024-10-13 10:23:03,291 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-13 10:23:03,291 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 28.75) internal successors, (115), 4 states have internal predecessors, (115), 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 116 [2024-10-13 10:23:03,291 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 10:23:03,293 INFO L225 Difference]: With dead ends: 268 [2024-10-13 10:23:03,293 INFO L226 Difference]: Without dead ends: 268 [2024-10-13 10:23:03,293 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 116 GetRequests, 113 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:23:03,295 INFO L432 NwaCegarLoop]: 321 mSDtfsCounter, 30 mSDsluCounter, 625 mSDsCounter, 0 mSdLazyCounter, 53 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 946 SdHoareTripleChecker+Invalid, 75 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 53 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-13 10:23:03,296 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 946 Invalid, 75 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 53 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-13 10:23:03,297 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 268 states. [2024-10-13 10:23:03,312 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 268 to 268. [2024-10-13 10:23:03,316 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 268 states, 248 states have (on average 1.2862903225806452) internal successors, (319), 259 states have internal predecessors, (319), 16 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 7 states have call predecessors, (16), 16 states have call successors, (16) [2024-10-13 10:23:03,318 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 268 states to 268 states and 351 transitions. [2024-10-13 10:23:03,318 INFO L78 Accepts]: Start accepts. Automaton has 268 states and 351 transitions. Word has length 116 [2024-10-13 10:23:03,318 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 10:23:03,318 INFO L471 AbstractCegarLoop]: Abstraction has 268 states and 351 transitions. [2024-10-13 10:23:03,318 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 28.75) internal successors, (115), 4 states have internal predecessors, (115), 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:23:03,319 INFO L276 IsEmpty]: Start isEmpty. Operand 268 states and 351 transitions. [2024-10-13 10:23:03,324 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2024-10-13 10:23:03,324 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 10:23:03,324 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:23:03,337 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Ended with exit code 0 [2024-10-13 10:23:03,524 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:23:03,525 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, __VERIFIER_assertErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2024-10-13 10:23:03,526 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 10:23:03,526 INFO L85 PathProgramCache]: Analyzing trace with hash -1127278013, now seen corresponding path program 1 times [2024-10-13 10:23:03,527 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 10:23:03,527 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1387024720] [2024-10-13 10:23:03,527 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 10:23:03,528 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:23:03,528 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 10:23:03,531 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:23:03,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 (5)] Waiting until timeout for monitored process [2024-10-13 10:23:04,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:23:04,036 INFO L255 TraceCheckSpWp]: Trace formula consists of 528 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-10-13 10:23:04,042 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 10:23:04,191 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 10:23:04,192 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-13 10:23:04,192 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 10:23:04,192 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1387024720] [2024-10-13 10:23:04,192 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1387024720] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 10:23:04,192 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 10:23:04,192 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-13 10:23:04,193 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [434876827] [2024-10-13 10:23:04,193 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 10:23:04,193 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-13 10:23:04,193 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 10:23:04,195 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-13 10:23:04,197 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-13 10:23:04,197 INFO L87 Difference]: Start difference. First operand 268 states and 351 transitions. Second operand has 5 states, 5 states have (on average 23.0) internal successors, (115), 5 states have internal predecessors, (115), 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:23:04,299 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 10:23:04,299 INFO L93 Difference]: Finished difference Result 262 states and 341 transitions. [2024-10-13 10:23:04,300 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-13 10:23:04,300 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 23.0) internal successors, (115), 5 states have internal predecessors, (115), 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 116 [2024-10-13 10:23:04,301 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 10:23:04,302 INFO L225 Difference]: With dead ends: 262 [2024-10-13 10:23:04,302 INFO L226 Difference]: Without dead ends: 262 [2024-10-13 10:23:04,303 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 115 GetRequests, 112 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:23:04,304 INFO L432 NwaCegarLoop]: 320 mSDtfsCounter, 0 mSDsluCounter, 623 mSDsCounter, 0 mSdLazyCounter, 48 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 943 SdHoareTripleChecker+Invalid, 51 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 48 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-13 10:23:04,304 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 943 Invalid, 51 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 48 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-13 10:23:04,306 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 262 states. [2024-10-13 10:23:04,315 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 262 to 262. [2024-10-13 10:23:04,317 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 262 states, 242 states have (on average 1.2768595041322315) internal successors, (309), 253 states have internal predecessors, (309), 16 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 7 states have call predecessors, (16), 16 states have call successors, (16) [2024-10-13 10:23:04,318 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 262 states to 262 states and 341 transitions. [2024-10-13 10:23:04,318 INFO L78 Accepts]: Start accepts. Automaton has 262 states and 341 transitions. Word has length 116 [2024-10-13 10:23:04,319 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 10:23:04,319 INFO L471 AbstractCegarLoop]: Abstraction has 262 states and 341 transitions. [2024-10-13 10:23:04,319 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 23.0) internal successors, (115), 5 states have internal predecessors, (115), 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:23:04,319 INFO L276 IsEmpty]: Start isEmpty. Operand 262 states and 341 transitions. [2024-10-13 10:23:04,321 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2024-10-13 10:23:04,322 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 10:23:04,322 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:23:04,336 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:23:04,522 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:23:04,523 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, __VERIFIER_assertErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2024-10-13 10:23:04,523 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 10:23:04,524 INFO L85 PathProgramCache]: Analyzing trace with hash -541001791, now seen corresponding path program 1 times [2024-10-13 10:23:04,525 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 10:23:04,525 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1952643323] [2024-10-13 10:23:04,525 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 10:23:04,525 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:23:04,526 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 10:23:04,528 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:23:04,530 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:23:05,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:23:05,047 INFO L255 TraceCheckSpWp]: Trace formula consists of 530 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-13 10:23:05,051 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 10:23:05,356 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 10:23:05,356 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-13 10:23:05,357 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 10:23:05,357 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1952643323] [2024-10-13 10:23:05,357 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1952643323] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 10:23:05,357 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 10:23:05,357 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-13 10:23:05,357 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1458169619] [2024-10-13 10:23:05,357 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 10:23:05,358 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 10:23:05,358 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 10:23:05,358 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 10:23:05,359 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 10:23:05,359 INFO L87 Difference]: Start difference. First operand 262 states and 341 transitions. Second operand has 3 states, 3 states have (on average 38.333333333333336) internal successors, (115), 2 states have internal predecessors, (115), 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:23:05,885 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 10:23:05,886 INFO L93 Difference]: Finished difference Result 351 states and 447 transitions. [2024-10-13 10:23:05,891 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 10:23:05,892 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 38.333333333333336) internal successors, (115), 2 states have internal predecessors, (115), 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 116 [2024-10-13 10:23:05,892 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 10:23:05,893 INFO L225 Difference]: With dead ends: 351 [2024-10-13 10:23:05,894 INFO L226 Difference]: Without dead ends: 351 [2024-10-13 10:23:05,894 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 115 GetRequests, 114 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:23:05,895 INFO L432 NwaCegarLoop]: 359 mSDtfsCounter, 68 mSDsluCounter, 316 mSDsCounter, 0 mSdLazyCounter, 36 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 68 SdHoareTripleChecker+Valid, 675 SdHoareTripleChecker+Invalid, 38 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 36 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-10-13 10:23:05,895 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [68 Valid, 675 Invalid, 38 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 36 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-10-13 10:23:05,896 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 351 states. [2024-10-13 10:23:05,901 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 351 to 298. [2024-10-13 10:23:05,902 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 298 states, 278 states have (on average 1.2410071942446044) internal successors, (345), 289 states have internal predecessors, (345), 16 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 7 states have call predecessors, (16), 16 states have call successors, (16) [2024-10-13 10:23:05,904 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 298 states to 298 states and 377 transitions. [2024-10-13 10:23:05,904 INFO L78 Accepts]: Start accepts. Automaton has 298 states and 377 transitions. Word has length 116 [2024-10-13 10:23:05,904 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 10:23:05,904 INFO L471 AbstractCegarLoop]: Abstraction has 298 states and 377 transitions. [2024-10-13 10:23:05,905 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 38.333333333333336) internal successors, (115), 2 states have internal predecessors, (115), 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:23:05,905 INFO L276 IsEmpty]: Start isEmpty. Operand 298 states and 377 transitions. [2024-10-13 10:23:05,906 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2024-10-13 10:23:05,906 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 10:23:05,907 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:23:05,921 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:23:06,107 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:23:06,108 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, __VERIFIER_assertErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2024-10-13 10:23:06,108 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 10:23:06,108 INFO L85 PathProgramCache]: Analyzing trace with hash 1225554728, now seen corresponding path program 1 times [2024-10-13 10:23:06,109 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 10:23:06,109 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1973818594] [2024-10-13 10:23:06,109 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 10:23:06,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:23:06,110 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 10:23:06,111 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:23:06,112 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:23:06,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:23:06,707 INFO L255 TraceCheckSpWp]: Trace formula consists of 659 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-13 10:23:06,712 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 10:23:06,754 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 10:23:06,754 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-13 10:23:06,755 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 10:23:06,755 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1973818594] [2024-10-13 10:23:06,755 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1973818594] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 10:23:06,755 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 10:23:06,755 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-13 10:23:06,755 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [318824944] [2024-10-13 10:23:06,755 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 10:23:06,756 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-13 10:23:06,756 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 10:23:06,760 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-13 10:23:06,761 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-13 10:23:06,761 INFO L87 Difference]: Start difference. First operand 298 states and 377 transitions. Second operand has 4 states, 3 states have (on average 41.333333333333336) internal successors, (124), 4 states have internal predecessors, (124), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2024-10-13 10:23:06,861 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 10:23:06,861 INFO L93 Difference]: Finished difference Result 300 states and 381 transitions. [2024-10-13 10:23:06,862 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-13 10:23:06,862 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 41.333333333333336) internal successors, (124), 4 states have internal predecessors, (124), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) Word has length 129 [2024-10-13 10:23:06,863 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 10:23:06,864 INFO L225 Difference]: With dead ends: 300 [2024-10-13 10:23:06,864 INFO L226 Difference]: Without dead ends: 300 [2024-10-13 10:23:06,865 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 128 GetRequests, 126 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:23:06,868 INFO L432 NwaCegarLoop]: 333 mSDtfsCounter, 0 mSDsluCounter, 659 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 992 SdHoareTripleChecker+Invalid, 30 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 27 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-13 10:23:06,869 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 992 Invalid, 30 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-13 10:23:06,870 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 300 states. [2024-10-13 10:23:06,878 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 300 to 300. [2024-10-13 10:23:06,880 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 300 states, 279 states have (on average 1.2437275985663083) internal successors, (347), 291 states have internal predecessors, (347), 16 states have call successors, (16), 2 states have call predecessors, (16), 3 states have return successors, (18), 7 states have call predecessors, (18), 16 states have call successors, (18) [2024-10-13 10:23:06,882 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 300 states to 300 states and 381 transitions. [2024-10-13 10:23:06,883 INFO L78 Accepts]: Start accepts. Automaton has 300 states and 381 transitions. Word has length 129 [2024-10-13 10:23:06,883 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 10:23:06,883 INFO L471 AbstractCegarLoop]: Abstraction has 300 states and 381 transitions. [2024-10-13 10:23:06,884 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 41.333333333333336) internal successors, (124), 4 states have internal predecessors, (124), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2024-10-13 10:23:06,884 INFO L276 IsEmpty]: Start isEmpty. Operand 300 states and 381 transitions. [2024-10-13 10:23:06,886 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2024-10-13 10:23:06,886 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 10:23:06,887 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 10:23:06,902 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 (7)] Forceful destruction successful, exit code 0 [2024-10-13 10:23:07,087 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:23:07,088 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, __VERIFIER_assertErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2024-10-13 10:23:07,088 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 10:23:07,088 INFO L85 PathProgramCache]: Analyzing trace with hash -1710893514, now seen corresponding path program 1 times [2024-10-13 10:23:07,089 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 10:23:07,089 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [300198503] [2024-10-13 10:23:07,090 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 10:23:07,090 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:23:07,090 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 10:23:07,091 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:23:07,092 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:23:07,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:23:07,745 INFO L255 TraceCheckSpWp]: Trace formula consists of 681 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-10-13 10:23:07,750 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 10:23:07,793 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 7 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-10-13 10:23:07,796 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-13 10:23:07,903 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 1 proven. 6 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-10-13 10:23:07,903 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 10:23:07,903 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [300198503] [2024-10-13 10:23:07,903 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [300198503] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-13 10:23:07,903 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-13 10:23:07,903 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 8 [2024-10-13 10:23:07,904 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1519501620] [2024-10-13 10:23:07,904 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-13 10:23:07,905 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-13 10:23:07,905 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 10:23:07,905 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-13 10:23:07,906 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2024-10-13 10:23:07,906 INFO L87 Difference]: Start difference. First operand 300 states and 381 transitions. Second operand has 8 states, 6 states have (on average 22.0) internal successors, (132), 8 states have internal predecessors, (132), 2 states have call successors, (4), 2 states have call predecessors, (4), 4 states have return successors, (4), 1 states have call predecessors, (4), 2 states have call successors, (4) [2024-10-13 10:23:08,135 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 10:23:08,136 INFO L93 Difference]: Finished difference Result 309 states and 396 transitions. [2024-10-13 10:23:08,136 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-10-13 10:23:08,136 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 6 states have (on average 22.0) internal successors, (132), 8 states have internal predecessors, (132), 2 states have call successors, (4), 2 states have call predecessors, (4), 4 states have return successors, (4), 1 states have call predecessors, (4), 2 states have call successors, (4) Word has length 131 [2024-10-13 10:23:08,137 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 10:23:08,139 INFO L225 Difference]: With dead ends: 309 [2024-10-13 10:23:08,139 INFO L226 Difference]: Without dead ends: 309 [2024-10-13 10:23:08,139 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 263 GetRequests, 254 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:23:08,139 INFO L432 NwaCegarLoop]: 332 mSDtfsCounter, 5 mSDsluCounter, 1635 mSDsCounter, 0 mSdLazyCounter, 88 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 1967 SdHoareTripleChecker+Invalid, 106 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 88 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-13 10:23:08,140 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 1967 Invalid, 106 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 88 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-13 10:23:08,141 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 309 states. [2024-10-13 10:23:08,147 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 309 to 308. [2024-10-13 10:23:08,148 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 308 states, 286 states have (on average 1.2587412587412588) internal successors, (360), 298 states have internal predecessors, (360), 16 states have call successors, (16), 3 states have call predecessors, (16), 4 states have return successors, (18), 7 states have call predecessors, (18), 16 states have call successors, (18) [2024-10-13 10:23:08,149 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 308 states to 308 states and 394 transitions. [2024-10-13 10:23:08,150 INFO L78 Accepts]: Start accepts. Automaton has 308 states and 394 transitions. Word has length 131 [2024-10-13 10:23:08,150 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 10:23:08,150 INFO L471 AbstractCegarLoop]: Abstraction has 308 states and 394 transitions. [2024-10-13 10:23:08,150 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 6 states have (on average 22.0) internal successors, (132), 8 states have internal predecessors, (132), 2 states have call successors, (4), 2 states have call predecessors, (4), 4 states have return successors, (4), 1 states have call predecessors, (4), 2 states have call successors, (4) [2024-10-13 10:23:08,150 INFO L276 IsEmpty]: Start isEmpty. Operand 308 states and 394 transitions. [2024-10-13 10:23:08,152 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2024-10-13 10:23:08,152 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 10:23:08,152 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:23:08,168 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Ended with exit code 0 [2024-10-13 10:23:08,352 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:23:08,353 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, __VERIFIER_assertErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2024-10-13 10:23:08,353 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 10:23:08,354 INFO L85 PathProgramCache]: Analyzing trace with hash -886250456, now seen corresponding path program 2 times [2024-10-13 10:23:08,354 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 10:23:08,354 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [927716150] [2024-10-13 10:23:08,354 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-10-13 10:23:08,355 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:23:08,355 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 10:23:08,356 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:23:08,356 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:23:08,735 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2024-10-13 10:23:08,735 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-13 10:23:08,737 INFO L255 TraceCheckSpWp]: Trace formula consists of 39 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-10-13 10:23:08,742 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 10:23:09,574 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2024-10-13 10:23:09,575 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-13 10:23:09,575 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 10:23:09,576 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [927716150] [2024-10-13 10:23:09,576 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [927716150] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 10:23:09,576 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 10:23:09,576 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-13 10:23:09,576 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [217199708] [2024-10-13 10:23:09,576 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 10:23:09,578 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-13 10:23:09,578 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 10:23:09,579 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-13 10:23:09,579 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-13 10:23:09,579 INFO L87 Difference]: Start difference. First operand 308 states and 394 transitions. Second operand has 4 states, 4 states have (on average 30.75) internal successors, (123), 4 states have internal predecessors, (123), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-13 10:23:13,746 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-10-13 10:23:19,115 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-10-13 10:23:22,117 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.35s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-10-13 10:23:26,197 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-10-13 10:23:26,198 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 10:23:26,198 INFO L93 Difference]: Finished difference Result 391 states and 503 transitions. [2024-10-13 10:23:26,205 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 10:23:26,205 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 30.75) internal successors, (123), 4 states have internal predecessors, (123), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 135 [2024-10-13 10:23:26,206 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 10:23:26,208 INFO L225 Difference]: With dead ends: 391 [2024-10-13 10:23:26,208 INFO L226 Difference]: Without dead ends: 391 [2024-10-13 10:23:26,208 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 134 GetRequests, 132 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:23:26,208 INFO L432 NwaCegarLoop]: 335 mSDtfsCounter, 46 mSDsluCounter, 602 mSDsCounter, 0 mSdLazyCounter, 80 mSolverCounterSat, 1 mSolverCounterUnsat, 3 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 16.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 47 SdHoareTripleChecker+Valid, 937 SdHoareTripleChecker+Invalid, 84 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 80 IncrementalHoareTripleChecker+Invalid, 3 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 16.6s IncrementalHoareTripleChecker+Time [2024-10-13 10:23:26,209 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [47 Valid, 937 Invalid, 84 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 80 Invalid, 3 Unknown, 0 Unchecked, 16.6s Time] [2024-10-13 10:23:26,210 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 391 states. [2024-10-13 10:23:26,221 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 391 to 391. [2024-10-13 10:23:26,222 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 391 states, 366 states have (on average 1.2622950819672132) internal successors, (462), 378 states have internal predecessors, (462), 19 states have call successors, (19), 3 states have call predecessors, (19), 4 states have return successors, (22), 10 states have call predecessors, (22), 19 states have call successors, (22) [2024-10-13 10:23:26,223 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 391 states to 391 states and 503 transitions. [2024-10-13 10:23:26,223 INFO L78 Accepts]: Start accepts. Automaton has 391 states and 503 transitions. Word has length 135 [2024-10-13 10:23:26,224 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 10:23:26,224 INFO L471 AbstractCegarLoop]: Abstraction has 391 states and 503 transitions. [2024-10-13 10:23:26,224 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 30.75) internal successors, (123), 4 states have internal predecessors, (123), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-13 10:23:26,225 INFO L276 IsEmpty]: Start isEmpty. Operand 391 states and 503 transitions. [2024-10-13 10:23:26,226 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2024-10-13 10:23:26,226 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 10:23:26,226 INFO L215 NwaCegarLoop]: trace histogram [12, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:23:26,232 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Forceful destruction successful, exit code 0 [2024-10-13 10:23:26,427 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:23:26,428 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, __VERIFIER_assertErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2024-10-13 10:23:26,428 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 10:23:26,428 INFO L85 PathProgramCache]: Analyzing trace with hash -692824722, now seen corresponding path program 1 times [2024-10-13 10:23:26,429 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 10:23:26,429 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [298827555] [2024-10-13 10:23:26,429 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 10:23:26,429 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:23:26,429 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 10:23:26,430 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:23:26,431 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:23:27,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:23:27,219 INFO L255 TraceCheckSpWp]: Trace formula consists of 920 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-10-13 10:23:27,223 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 10:23:27,331 INFO L134 CoverageAnalysis]: Checked inductivity of 133 backedges. 62 proven. 10 refuted. 0 times theorem prover too weak. 61 trivial. 0 not checked. [2024-10-13 10:23:27,331 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-13 10:23:27,496 INFO L134 CoverageAnalysis]: Checked inductivity of 133 backedges. 1 proven. 68 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2024-10-13 10:23:27,497 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 10:23:27,497 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [298827555] [2024-10-13 10:23:27,497 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [298827555] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-13 10:23:27,497 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-13 10:23:27,497 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 14 [2024-10-13 10:23:27,497 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1495539382] [2024-10-13 10:23:27,497 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-13 10:23:27,498 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-10-13 10:23:27,498 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 10:23:27,499 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-10-13 10:23:27,499 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=121, Unknown=0, NotChecked=0, Total=182 [2024-10-13 10:23:27,500 INFO L87 Difference]: Start difference. First operand 391 states and 503 transitions. Second operand has 14 states, 12 states have (on average 11.916666666666666) internal successors, (143), 14 states have internal predecessors, (143), 2 states have call successors, (8), 2 states have call predecessors, (8), 4 states have return successors, (8), 1 states have call predecessors, (8), 2 states have call successors, (8) [2024-10-13 10:23:28,163 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 10:23:28,164 INFO L93 Difference]: Finished difference Result 403 states and 524 transitions. [2024-10-13 10:23:28,164 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2024-10-13 10:23:28,165 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 12 states have (on average 11.916666666666666) internal successors, (143), 14 states have internal predecessors, (143), 2 states have call successors, (8), 2 states have call predecessors, (8), 4 states have return successors, (8), 1 states have call predecessors, (8), 2 states have call successors, (8) Word has length 154 [2024-10-13 10:23:28,165 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 10:23:28,166 INFO L225 Difference]: With dead ends: 403 [2024-10-13 10:23:28,167 INFO L226 Difference]: Without dead ends: 401 [2024-10-13 10:23:28,167 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 315 GetRequests, 294 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=182, Invalid=324, Unknown=0, NotChecked=0, Total=506 [2024-10-13 10:23:28,167 INFO L432 NwaCegarLoop]: 332 mSDtfsCounter, 7 mSDsluCounter, 1642 mSDsCounter, 0 mSdLazyCounter, 198 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 1974 SdHoareTripleChecker+Invalid, 215 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 198 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-13 10:23:28,168 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 1974 Invalid, 215 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 198 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-13 10:23:28,169 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 401 states. [2024-10-13 10:23:28,175 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 401 to 400. [2024-10-13 10:23:28,175 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 400 states, 375 states have (on average 1.264) internal successors, (474), 387 states have internal predecessors, (474), 19 states have call successors, (19), 3 states have call predecessors, (19), 4 states have return successors, (22), 10 states have call predecessors, (22), 19 states have call successors, (22) [2024-10-13 10:23:28,177 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 400 states to 400 states and 515 transitions. [2024-10-13 10:23:28,177 INFO L78 Accepts]: Start accepts. Automaton has 400 states and 515 transitions. Word has length 154 [2024-10-13 10:23:28,177 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 10:23:28,177 INFO L471 AbstractCegarLoop]: Abstraction has 400 states and 515 transitions. [2024-10-13 10:23:28,178 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 12 states have (on average 11.916666666666666) internal successors, (143), 14 states have internal predecessors, (143), 2 states have call successors, (8), 2 states have call predecessors, (8), 4 states have return successors, (8), 1 states have call predecessors, (8), 2 states have call successors, (8) [2024-10-13 10:23:28,178 INFO L276 IsEmpty]: Start isEmpty. Operand 400 states and 515 transitions. [2024-10-13 10:23:28,179 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 173 [2024-10-13 10:23:28,179 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 10:23:28,179 INFO L215 NwaCegarLoop]: trace histogram [30, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:23:28,197 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Ended with exit code 0 [2024-10-13 10:23:28,380 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:23:28,380 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, __VERIFIER_assertErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2024-10-13 10:23:28,381 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 10:23:28,381 INFO L85 PathProgramCache]: Analyzing trace with hash 632268654, now seen corresponding path program 2 times [2024-10-13 10:23:28,382 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 10:23:28,382 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [956365462] [2024-10-13 10:23:28,382 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-10-13 10:23:28,382 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-13 10:23:28,382 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 10:23:28,385 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:23:28,386 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:23:29,162 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-10-13 10:23:29,162 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-13 10:23:29,190 INFO L255 TraceCheckSpWp]: Trace formula consists of 1118 conjuncts, 13 conjuncts are in the unsatisfiable core [2024-10-13 10:23:29,195 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 10:23:29,394 INFO L134 CoverageAnalysis]: Checked inductivity of 574 backedges. 260 proven. 55 refuted. 0 times theorem prover too weak. 259 trivial. 0 not checked. [2024-10-13 10:23:29,394 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-13 10:23:29,954 INFO L134 CoverageAnalysis]: Checked inductivity of 574 backedges. 1 proven. 311 refuted. 0 times theorem prover too weak. 262 trivial. 0 not checked. [2024-10-13 10:23:29,955 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 10:23:29,955 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [956365462] [2024-10-13 10:23:29,956 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [956365462] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-13 10:23:29,956 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-13 10:23:29,956 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 26 [2024-10-13 10:23:29,956 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1246773762] [2024-10-13 10:23:29,956 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-13 10:23:29,957 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2024-10-13 10:23:29,957 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 10:23:29,957 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2024-10-13 10:23:29,958 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=193, Invalid=457, Unknown=0, NotChecked=0, Total=650 [2024-10-13 10:23:29,960 INFO L87 Difference]: Start difference. First operand 400 states and 515 transitions. Second operand has 26 states, 24 states have (on average 6.458333333333333) internal successors, (155), 26 states have internal predecessors, (155), 2 states have call successors, (8), 2 states have call predecessors, (8), 4 states have return successors, (8), 1 states have call predecessors, (8), 2 states have call successors, (8) [2024-10-13 10:23:31,818 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 10:23:31,818 INFO L93 Difference]: Finished difference Result 421 states and 554 transitions. [2024-10-13 10:23:31,819 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2024-10-13 10:23:31,819 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 24 states have (on average 6.458333333333333) internal successors, (155), 26 states have internal predecessors, (155), 2 states have call successors, (8), 2 states have call predecessors, (8), 4 states have return successors, (8), 1 states have call predecessors, (8), 2 states have call successors, (8) Word has length 172 [2024-10-13 10:23:31,820 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 10:23:31,821 INFO L225 Difference]: With dead ends: 421 [2024-10-13 10:23:31,822 INFO L226 Difference]: Without dead ends: 419 [2024-10-13 10:23:31,823 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 363 GetRequests, 318 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 100 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=728, Invalid=1434, Unknown=0, NotChecked=0, Total=2162 [2024-10-13 10:23:31,824 INFO L432 NwaCegarLoop]: 332 mSDtfsCounter, 13 mSDsluCounter, 4911 mSDsCounter, 0 mSdLazyCounter, 656 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 5243 SdHoareTripleChecker+Invalid, 675 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 656 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-10-13 10:23:31,825 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 5243 Invalid, 675 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 656 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-10-13 10:23:31,826 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 419 states. [2024-10-13 10:23:31,835 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 419 to 418. [2024-10-13 10:23:31,836 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 418 states, 393 states have (on average 1.2671755725190839) internal successors, (498), 405 states have internal predecessors, (498), 19 states have call successors, (19), 3 states have call predecessors, (19), 4 states have return successors, (22), 10 states have call predecessors, (22), 19 states have call successors, (22) [2024-10-13 10:23:31,838 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 418 states to 418 states and 539 transitions. [2024-10-13 10:23:31,839 INFO L78 Accepts]: Start accepts. Automaton has 418 states and 539 transitions. Word has length 172 [2024-10-13 10:23:31,839 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 10:23:31,839 INFO L471 AbstractCegarLoop]: Abstraction has 418 states and 539 transitions. [2024-10-13 10:23:31,839 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 24 states have (on average 6.458333333333333) internal successors, (155), 26 states have internal predecessors, (155), 2 states have call successors, (8), 2 states have call predecessors, (8), 4 states have return successors, (8), 1 states have call predecessors, (8), 2 states have call successors, (8) [2024-10-13 10:23:31,840 INFO L276 IsEmpty]: Start isEmpty. Operand 418 states and 539 transitions. [2024-10-13 10:23:31,843 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 209 [2024-10-13 10:23:31,843 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 10:23:31,843 INFO L215 NwaCegarLoop]: trace histogram [66, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:23:31,864 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:23:32,043 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:23:32,044 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, __VERIFIER_assertErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2024-10-13 10:23:32,044 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 10:23:32,044 INFO L85 PathProgramCache]: Analyzing trace with hash 1003101294, now seen corresponding path program 3 times [2024-10-13 10:23:32,045 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 10:23:32,045 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1369480066] [2024-10-13 10:23:32,045 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-10-13 10:23:32,046 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-13 10:23:32,046 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 10:23:32,047 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:23:32,048 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (12)] Waiting until timeout for monitored process [2024-10-13 10:23:32,660 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2024-10-13 10:23:32,660 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-13 10:23:32,669 INFO L255 TraceCheckSpWp]: Trace formula consists of 317 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-13 10:23:32,675 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 10:23:33,095 INFO L134 CoverageAnalysis]: Checked inductivity of 2428 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2427 trivial. 0 not checked. [2024-10-13 10:23:33,096 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-13 10:23:33,434 INFO L134 CoverageAnalysis]: Checked inductivity of 2428 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2427 trivial. 0 not checked. [2024-10-13 10:23:33,434 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 10:23:33,434 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1369480066] [2024-10-13 10:23:33,434 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1369480066] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-13 10:23:33,434 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-13 10:23:33,434 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 6 [2024-10-13 10:23:33,434 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1725931345] [2024-10-13 10:23:33,435 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-13 10:23:33,435 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-13 10:23:33,435 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 10:23:33,436 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-13 10:23:33,436 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-10-13 10:23:33,436 INFO L87 Difference]: Start difference. First operand 418 states and 539 transitions. Second operand has 6 states, 6 states have (on average 41.0) internal successors, (246), 6 states have internal predecessors, (246), 3 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2024-10-13 10:23:33,878 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 10:23:33,878 INFO L93 Difference]: Finished difference Result 808 states and 1027 transitions. [2024-10-13 10:23:33,879 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-13 10:23:33,879 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 41.0) internal successors, (246), 6 states have internal predecessors, (246), 3 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) Word has length 208 [2024-10-13 10:23:33,879 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 10:23:33,883 INFO L225 Difference]: With dead ends: 808 [2024-10-13 10:23:33,883 INFO L226 Difference]: Without dead ends: 808 [2024-10-13 10:23:33,883 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 415 GetRequests, 410 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=23, Unknown=0, NotChecked=0, Total=42 [2024-10-13 10:23:33,884 INFO L432 NwaCegarLoop]: 589 mSDtfsCounter, 697 mSDsluCounter, 1303 mSDsCounter, 0 mSdLazyCounter, 68 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 711 SdHoareTripleChecker+Valid, 1892 SdHoareTripleChecker+Invalid, 74 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 68 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-13 10:23:33,884 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [711 Valid, 1892 Invalid, 74 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 68 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-13 10:23:33,885 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 808 states. [2024-10-13 10:23:33,909 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 808 to 808. [2024-10-13 10:23:33,911 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 808 states, 768 states have (on average 1.23828125) internal successors, (951), 780 states have internal predecessors, (951), 34 states have call successors, (34), 3 states have call predecessors, (34), 4 states have return successors, (42), 25 states have call predecessors, (42), 34 states have call successors, (42) [2024-10-13 10:23:33,915 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 808 states to 808 states and 1027 transitions. [2024-10-13 10:23:33,916 INFO L78 Accepts]: Start accepts. Automaton has 808 states and 1027 transitions. Word has length 208 [2024-10-13 10:23:33,916 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 10:23:33,917 INFO L471 AbstractCegarLoop]: Abstraction has 808 states and 1027 transitions. [2024-10-13 10:23:33,917 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 41.0) internal successors, (246), 6 states have internal predecessors, (246), 3 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2024-10-13 10:23:33,918 INFO L276 IsEmpty]: Start isEmpty. Operand 808 states and 1027 transitions. [2024-10-13 10:23:33,925 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 527 [2024-10-13 10:23:33,926 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 10:23:33,926 INFO L215 NwaCegarLoop]: trace histogram [66, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:23:33,938 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 (12)] Forceful destruction successful, exit code 0 [2024-10-13 10:23:34,126 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:23:34,127 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, __VERIFIER_assertErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2024-10-13 10:23:34,128 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 10:23:34,128 INFO L85 PathProgramCache]: Analyzing trace with hash 2026758618, now seen corresponding path program 1 times [2024-10-13 10:23:34,130 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 10:23:34,130 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1420763485] [2024-10-13 10:23:34,131 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 10:23:34,131 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:23:34,131 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 10:23:34,134 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:23:34,135 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:23:36,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:23:36,266 INFO L255 TraceCheckSpWp]: Trace formula consists of 2987 conjuncts, 25 conjuncts are in the unsatisfiable core [2024-10-13 10:23:36,273 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 10:23:36,817 INFO L134 CoverageAnalysis]: Checked inductivity of 3055 backedges. 1199 proven. 253 refuted. 0 times theorem prover too weak. 1603 trivial. 0 not checked. [2024-10-13 10:23:36,817 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-13 10:23:38,761 INFO L134 CoverageAnalysis]: Checked inductivity of 3055 backedges. 112 proven. 1337 refuted. 0 times theorem prover too weak. 1606 trivial. 0 not checked. [2024-10-13 10:23:38,761 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 10:23:38,762 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1420763485] [2024-10-13 10:23:38,762 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1420763485] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-13 10:23:38,762 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-13 10:23:38,762 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 26] total 50 [2024-10-13 10:23:38,762 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [273449897] [2024-10-13 10:23:38,762 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-13 10:23:38,763 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 50 states [2024-10-13 10:23:38,763 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 10:23:38,764 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2024-10-13 10:23:38,765 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=672, Invalid=1778, Unknown=0, NotChecked=0, Total=2450 [2024-10-13 10:23:38,766 INFO L87 Difference]: Start difference. First operand 808 states and 1027 transitions. Second operand has 50 states, 48 states have (on average 4.604166666666667) internal successors, (221), 50 states have internal predecessors, (221), 2 states have call successors, (8), 2 states have call predecessors, (8), 4 states have return successors, (8), 1 states have call predecessors, (8), 2 states have call successors, (8) [2024-10-13 10:23:45,756 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 10:23:45,756 INFO L93 Difference]: Finished difference Result 845 states and 1103 transitions. [2024-10-13 10:23:45,757 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 71 states. [2024-10-13 10:23:45,757 INFO L78 Accepts]: Start accepts. Automaton has has 50 states, 48 states have (on average 4.604166666666667) internal successors, (221), 50 states have internal predecessors, (221), 2 states have call successors, (8), 2 states have call predecessors, (8), 4 states have return successors, (8), 1 states have call predecessors, (8), 2 states have call successors, (8) Word has length 526 [2024-10-13 10:23:45,758 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 10:23:45,761 INFO L225 Difference]: With dead ends: 845 [2024-10-13 10:23:45,761 INFO L226 Difference]: Without dead ends: 843 [2024-10-13 10:23:45,764 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 1093 GetRequests, 1002 SyntacticMatches, 0 SemanticMatches, 91 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 465 ImplicationChecksByTransitivity, 5.7s TimeCoverageRelationStatistics Valid=2713, Invalid=5843, Unknown=0, NotChecked=0, Total=8556 [2024-10-13 10:23:45,765 INFO L432 NwaCegarLoop]: 332 mSDtfsCounter, 26 mSDsluCounter, 7873 mSDsCounter, 0 mSdLazyCounter, 2090 mSolverCounterSat, 108 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 8205 SdHoareTripleChecker+Invalid, 2198 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 108 IncrementalHoareTripleChecker+Valid, 2090 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.1s IncrementalHoareTripleChecker+Time [2024-10-13 10:23:45,765 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 8205 Invalid, 2198 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [108 Valid, 2090 Invalid, 0 Unknown, 0 Unchecked, 3.1s Time] [2024-10-13 10:23:45,766 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 843 states. [2024-10-13 10:23:45,811 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 843 to 842. [2024-10-13 10:23:45,814 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 842 states, 802 states have (on average 1.243142144638404) internal successors, (997), 814 states have internal predecessors, (997), 34 states have call successors, (34), 3 states have call predecessors, (34), 4 states have return successors, (42), 25 states have call predecessors, (42), 34 states have call successors, (42) [2024-10-13 10:23:45,817 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 842 states to 842 states and 1073 transitions. [2024-10-13 10:23:45,817 INFO L78 Accepts]: Start accepts. Automaton has 842 states and 1073 transitions. Word has length 526 [2024-10-13 10:23:45,817 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 10:23:45,817 INFO L471 AbstractCegarLoop]: Abstraction has 842 states and 1073 transitions. [2024-10-13 10:23:45,818 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 50 states, 48 states have (on average 4.604166666666667) internal successors, (221), 50 states have internal predecessors, (221), 2 states have call successors, (8), 2 states have call predecessors, (8), 4 states have return successors, (8), 1 states have call predecessors, (8), 2 states have call successors, (8) [2024-10-13 10:23:45,818 INFO L276 IsEmpty]: Start isEmpty. Operand 842 states and 1073 transitions. [2024-10-13 10:23:45,827 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 595 [2024-10-13 10:23:45,827 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 10:23:45,827 INFO L215 NwaCegarLoop]: trace histogram [134, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:23:45,889 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (13)] Ended with exit code 0 [2024-10-13 10:23:46,028 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:23:46,029 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, __VERIFIER_assertErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2024-10-13 10:23:46,029 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 10:23:46,030 INFO L85 PathProgramCache]: Analyzing trace with hash 423784154, now seen corresponding path program 2 times [2024-10-13 10:23:46,032 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 10:23:46,032 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [209538280] [2024-10-13 10:23:46,032 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-10-13 10:23:46,032 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:23:46,032 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 10:23:46,035 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:23:46,036 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:23:49,033 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-10-13 10:23:49,033 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-13 10:23:49,150 INFO L255 TraceCheckSpWp]: Trace formula consists of 3735 conjuncts, 26 conjuncts are in the unsatisfiable core [2024-10-13 10:23:49,158 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 10:23:49,720 INFO L134 CoverageAnalysis]: Checked inductivity of 10093 backedges. 5962 proven. 276 refuted. 0 times theorem prover too weak. 3855 trivial. 0 not checked. [2024-10-13 10:23:49,721 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-13 10:23:51,494 INFO L134 CoverageAnalysis]: Checked inductivity of 10093 backedges. 1193 proven. 1934 refuted. 0 times theorem prover too weak. 6966 trivial. 0 not checked. [2024-10-13 10:23:51,495 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 10:23:51,495 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [209538280] [2024-10-13 10:23:51,495 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [209538280] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-13 10:23:51,495 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-13 10:23:51,495 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 27] total 52 [2024-10-13 10:23:51,495 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1385405535] [2024-10-13 10:23:51,495 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-13 10:23:51,497 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 52 states [2024-10-13 10:23:51,497 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 10:23:51,498 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2024-10-13 10:23:51,499 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=726, Invalid=1926, Unknown=0, NotChecked=0, Total=2652 [2024-10-13 10:23:51,499 INFO L87 Difference]: Start difference. First operand 842 states and 1073 transitions. Second operand has 52 states, 50 states have (on average 4.46) internal successors, (223), 52 states have internal predecessors, (223), 2 states have call successors, (7), 2 states have call predecessors, (7), 4 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2024-10-13 10:23:58,915 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 10:23:58,916 INFO L93 Difference]: Finished difference Result 869 states and 1139 transitions. [2024-10-13 10:23:58,917 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 76 states. [2024-10-13 10:23:58,917 INFO L78 Accepts]: Start accepts. Automaton has has 52 states, 50 states have (on average 4.46) internal successors, (223), 52 states have internal predecessors, (223), 2 states have call successors, (7), 2 states have call predecessors, (7), 4 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 594 [2024-10-13 10:23:58,917 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 10:23:58,922 INFO L225 Difference]: With dead ends: 869 [2024-10-13 10:23:58,923 INFO L226 Difference]: Without dead ends: 869 [2024-10-13 10:23:58,925 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 1233 GetRequests, 1136 SyntacticMatches, 0 SemanticMatches, 97 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1633 ImplicationChecksByTransitivity, 7.1s TimeCoverageRelationStatistics Valid=3146, Invalid=6556, Unknown=0, NotChecked=0, Total=9702 [2024-10-13 10:23:58,926 INFO L432 NwaCegarLoop]: 331 mSDtfsCounter, 26 mSDsluCounter, 8154 mSDsCounter, 0 mSdLazyCounter, 1577 mSolverCounterSat, 60 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 8485 SdHoareTripleChecker+Invalid, 1637 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 60 IncrementalHoareTripleChecker+Valid, 1577 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2024-10-13 10:23:58,927 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 8485 Invalid, 1637 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [60 Valid, 1577 Invalid, 0 Unknown, 0 Unchecked, 2.1s Time] [2024-10-13 10:23:58,928 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 869 states. [2024-10-13 10:23:58,945 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 869 to 867. [2024-10-13 10:23:58,947 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 867 states, 827 states have (on average 1.2660217654171706) internal successors, (1047), 839 states have internal predecessors, (1047), 34 states have call successors, (34), 3 states have call predecessors, (34), 4 states have return successors, (42), 25 states have call predecessors, (42), 34 states have call successors, (42) [2024-10-13 10:23:58,950 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 867 states to 867 states and 1123 transitions. [2024-10-13 10:23:58,950 INFO L78 Accepts]: Start accepts. Automaton has 867 states and 1123 transitions. Word has length 594 [2024-10-13 10:23:58,950 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 10:23:58,950 INFO L471 AbstractCegarLoop]: Abstraction has 867 states and 1123 transitions. [2024-10-13 10:23:58,951 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 52 states, 50 states have (on average 4.46) internal successors, (223), 52 states have internal predecessors, (223), 2 states have call successors, (7), 2 states have call predecessors, (7), 4 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2024-10-13 10:23:58,951 INFO L276 IsEmpty]: Start isEmpty. Operand 867 states and 1123 transitions. [2024-10-13 10:23:58,964 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 645 [2024-10-13 10:23:58,964 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 10:23:58,965 INFO L215 NwaCegarLoop]: trace histogram [184, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:23:59,041 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:23:59,165 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:23:59,165 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, __VERIFIER_assertErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2024-10-13 10:23:59,166 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 10:23:59,166 INFO L85 PathProgramCache]: Analyzing trace with hash -1673887782, now seen corresponding path program 3 times [2024-10-13 10:23:59,168 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 10:23:59,168 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1568541365] [2024-10-13 10:23:59,168 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-10-13 10:23:59,168 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:23:59,168 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 10:23:59,169 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:23:59,171 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:24:00,336 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2024-10-13 10:24:00,336 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-13 10:24:00,355 INFO L255 TraceCheckSpWp]: Trace formula consists of 530 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-13 10:24:00,363 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 10:24:00,404 INFO L134 CoverageAnalysis]: Checked inductivity of 18218 backedges. 149 proven. 0 refuted. 0 times theorem prover too weak. 18069 trivial. 0 not checked. [2024-10-13 10:24:00,404 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-13 10:24:00,404 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 10:24:00,404 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1568541365] [2024-10-13 10:24:00,404 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1568541365] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 10:24:00,404 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 10:24:00,404 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-13 10:24:00,405 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [928084804] [2024-10-13 10:24:00,405 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 10:24:00,405 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-13 10:24:00,405 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 10:24:00,406 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-13 10:24:00,406 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-13 10:24:00,406 INFO L87 Difference]: Start difference. First operand 867 states and 1123 transitions. Second operand has 4 states, 4 states have (on average 46.0) internal successors, (184), 4 states have internal predecessors, (184), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2024-10-13 10:24:00,491 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 10:24:00,491 INFO L93 Difference]: Finished difference Result 879 states and 1103 transitions. [2024-10-13 10:24:00,492 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-13 10:24:00,492 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 46.0) internal successors, (184), 4 states have internal predecessors, (184), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 644 [2024-10-13 10:24:00,493 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 10:24:00,495 INFO L225 Difference]: With dead ends: 879 [2024-10-13 10:24:00,496 INFO L226 Difference]: Without dead ends: 879 [2024-10-13 10:24:00,496 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 645 GetRequests, 642 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:24:00,497 INFO L432 NwaCegarLoop]: 306 mSDtfsCounter, 30 mSDsluCounter, 595 mSDsCounter, 0 mSdLazyCounter, 53 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 901 SdHoareTripleChecker+Invalid, 75 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 53 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-13 10:24:00,497 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 901 Invalid, 75 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 53 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-13 10:24:00,499 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 879 states. [2024-10-13 10:24:00,512 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 879 to 879. [2024-10-13 10:24:00,513 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 879 states, 839 states have (on average 1.2240762812872468) internal successors, (1027), 851 states have internal predecessors, (1027), 34 states have call successors, (34), 3 states have call predecessors, (34), 4 states have return successors, (42), 25 states have call predecessors, (42), 34 states have call successors, (42) [2024-10-13 10:24:00,516 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 879 states to 879 states and 1103 transitions. [2024-10-13 10:24:00,516 INFO L78 Accepts]: Start accepts. Automaton has 879 states and 1103 transitions. Word has length 644 [2024-10-13 10:24:00,517 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 10:24:00,517 INFO L471 AbstractCegarLoop]: Abstraction has 879 states and 1103 transitions. [2024-10-13 10:24:00,517 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 46.0) internal successors, (184), 4 states have internal predecessors, (184), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2024-10-13 10:24:00,517 INFO L276 IsEmpty]: Start isEmpty. Operand 879 states and 1103 transitions. [2024-10-13 10:24:00,522 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 645 [2024-10-13 10:24:00,522 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 10:24:00,523 INFO L215 NwaCegarLoop]: trace histogram [184, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:24:00,537 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:24:00,723 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:24:00,724 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, __VERIFIER_assertErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2024-10-13 10:24:00,724 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 10:24:00,724 INFO L85 PathProgramCache]: Analyzing trace with hash 1980498754, now seen corresponding path program 1 times [2024-10-13 10:24:00,726 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 10:24:00,726 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [451075285] [2024-10-13 10:24:00,726 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 10:24:00,726 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:24:00,726 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 10:24:00,727 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:24:00,728 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (16)] Waiting until timeout for monitored process [2024-10-13 10:24:04,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:24:04,930 INFO L255 TraceCheckSpWp]: Trace formula consists of 4237 conjuncts, 51 conjuncts are in the unsatisfiable core [2024-10-13 10:24:04,941 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 10:24:07,065 INFO L134 CoverageAnalysis]: Checked inductivity of 18218 backedges. 11162 proven. 1176 refuted. 0 times theorem prover too weak. 5880 trivial. 0 not checked. [2024-10-13 10:24:07,065 INFO L311 TraceCheckSpWp]: Computing backward predicates...