./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_test1-1.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (memcleanup) Using default analysis Version 61a67961 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_test1-1.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 a74358cfc3b57ddf641c2843362a5594690e287c76148ee1838c9104dbe09de1 --- Real Ultimate output --- This is Ultimate 0.2.5-wip.fs.cvc5-61a6796-m [2024-10-14 17:35:54,184 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-14 17:35:54,247 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-MemCleanup-32bit-Automizer_Default.epf [2024-10-14 17:35:54,252 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-14 17:35:54,253 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-14 17:35:54,297 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-14 17:35:54,298 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-14 17:35:54,299 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-14 17:35:54,300 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-14 17:35:54,301 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-14 17:35:54,302 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-14 17:35:54,302 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-14 17:35:54,303 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-14 17:35:54,303 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-14 17:35:54,306 INFO L153 SettingsManager]: * Use SBE=true [2024-10-14 17:35:54,306 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-14 17:35:54,307 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-14 17:35:54,307 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-14 17:35:54,307 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-14 17:35:54,307 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-14 17:35:54,307 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-14 17:35:54,308 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-14 17:35:54,308 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-10-14 17:35:54,309 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-10-14 17:35:54,309 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-14 17:35:54,309 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-14 17:35:54,309 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-10-14 17:35:54,310 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-14 17:35:54,310 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-10-14 17:35:54,310 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-14 17:35:54,311 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-14 17:35:54,311 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-14 17:35:54,311 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-14 17:35:54,311 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-14 17:35:54,311 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-14 17:35:54,312 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-14 17:35:54,312 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-14 17:35:54,319 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-14 17:35:54,319 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-14 17:35:54,319 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-14 17:35:54,319 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-14 17:35:54,320 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-14 17:35:54,320 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-14 17:35:54,320 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-14 17:35:54,321 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-14 17:35:54,321 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 -> a74358cfc3b57ddf641c2843362a5594690e287c76148ee1838c9104dbe09de1 [2024-10-14 17:35:54,564 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-14 17:35:54,589 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-14 17:35:54,592 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-14 17:35:54,593 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-14 17:35:54,593 INFO L274 PluginConnector]: CDTParser initialized [2024-10-14 17:35:54,595 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_SAX_test1-1.i [2024-10-14 17:35:55,952 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-14 17:35:56,248 INFO L384 CDTParser]: Found 1 translation units. [2024-10-14 17:35:56,251 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_SAX_test1-1.i [2024-10-14 17:35:56,274 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/987576d09/ddcaa8518d44460e8a58e86c645fe072/FLAG0e0ff2482 [2024-10-14 17:35:56,294 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/987576d09/ddcaa8518d44460e8a58e86c645fe072 [2024-10-14 17:35:56,297 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-14 17:35:56,298 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-14 17:35:56,299 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-14 17:35:56,299 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-14 17:35:56,304 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-14 17:35:56,305 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.10 05:35:56" (1/1) ... [2024-10-14 17:35:56,305 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@78276776 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 05:35:56, skipping insertion in model container [2024-10-14 17:35:56,306 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.10 05:35:56" (1/1) ... [2024-10-14 17:35:56,359 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-14 17:35:56,773 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-14 17:35:56,784 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-14 17:35:56,786 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver@70042d17 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 05:35:56, skipping insertion in model container [2024-10-14 17:35:56,787 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-14 17:35:56,787 INFO L186 ToolchainWalker]: Toolchain execution was canceled (user or tool) before executing de.uni_freiburg.informatik.ultimate.boogie.procedureinliner [2024-10-14 17:35:56,789 INFO L158 Benchmark]: Toolchain (without parser) took 490.12ms. Allocated memory is still 165.7MB. Free memory was 107.1MB in the beginning and 89.1MB in the end (delta: 18.1MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. [2024-10-14 17:35:56,789 INFO L158 Benchmark]: CDTParser took 0.20ms. Allocated memory is still 165.7MB. Free memory is still 132.6MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-14 17:35:56,790 INFO L158 Benchmark]: CACSL2BoogieTranslator took 488.12ms. Allocated memory is still 165.7MB. Free memory was 106.8MB in the beginning and 89.1MB in the end (delta: 17.7MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. [2024-10-14 17:35:56,794 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.20ms. Allocated memory is still 165.7MB. Free memory is still 132.6MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 488.12ms. Allocated memory is still 165.7MB. Free memory was 106.8MB in the beginning and 89.1MB in the end (delta: 17.7MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - UnsupportedSyntaxResult [Line: 751]: 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_test1-1.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 a74358cfc3b57ddf641c2843362a5594690e287c76148ee1838c9104dbe09de1 --- Real Ultimate output --- This is Ultimate 0.2.5-wip.fs.cvc5-61a6796-m [2024-10-14 17:35:58,755 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-14 17:35:58,836 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-MemCleanup-32bit-Automizer_Bitvector.epf [2024-10-14 17:35:58,841 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-14 17:35:58,841 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-14 17:35:58,872 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-14 17:35:58,873 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-14 17:35:58,873 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-14 17:35:58,874 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-14 17:35:58,875 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-14 17:35:58,875 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-14 17:35:58,875 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-14 17:35:58,876 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-14 17:35:58,878 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-14 17:35:58,878 INFO L153 SettingsManager]: * Use SBE=true [2024-10-14 17:35:58,878 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-14 17:35:58,879 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-14 17:35:58,879 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-14 17:35:58,879 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-14 17:35:58,879 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-14 17:35:58,880 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-14 17:35:58,882 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-14 17:35:58,883 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-10-14 17:35:58,883 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-10-14 17:35:58,883 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-14 17:35:58,883 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-14 17:35:58,884 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-10-14 17:35:58,884 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-10-14 17:35:58,884 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-14 17:35:58,884 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-10-14 17:35:58,885 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-10-14 17:35:58,885 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-14 17:35:58,885 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-14 17:35:58,885 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-14 17:35:58,886 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-14 17:35:58,892 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-14 17:35:58,892 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-14 17:35:58,892 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-14 17:35:58,892 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-14 17:35:58,893 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-14 17:35:58,893 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-14 17:35:58,894 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-10-14 17:35:58,894 INFO L153 SettingsManager]: * Command for external solver=cvc5 --incremental --print-success --lang smt [2024-10-14 17:35:58,894 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-14 17:35:58,894 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-14 17:35:58,894 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-14 17:35:58,894 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-14 17:35:58,895 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2024-10-14 17:35:58,895 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 -> a74358cfc3b57ddf641c2843362a5594690e287c76148ee1838c9104dbe09de1 [2024-10-14 17:35:59,211 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-14 17:35:59,236 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-14 17:35:59,240 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-14 17:35:59,241 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-14 17:35:59,242 INFO L274 PluginConnector]: CDTParser initialized [2024-10-14 17:35:59,244 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_SAX_test1-1.i [2024-10-14 17:36:00,810 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-14 17:36:01,107 INFO L384 CDTParser]: Found 1 translation units. [2024-10-14 17:36:01,108 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_SAX_test1-1.i [2024-10-14 17:36:01,123 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9bc310409/8ed6aae601824f61b3f99efe4740cf54/FLAGf52b98819 [2024-10-14 17:36:01,398 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9bc310409/8ed6aae601824f61b3f99efe4740cf54 [2024-10-14 17:36:01,401 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-14 17:36:01,403 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-14 17:36:01,405 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-14 17:36:01,406 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-14 17:36:01,411 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-14 17:36:01,411 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.10 05:36:01" (1/1) ... [2024-10-14 17:36:01,412 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5397d7da and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 05:36:01, skipping insertion in model container [2024-10-14 17:36:01,414 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.10 05:36:01" (1/1) ... [2024-10-14 17:36:01,463 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-14 17:36:01,951 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-14 17:36:01,970 INFO L197 MainTranslator]: Restarting translation with changed settings: SettingsChange [mNewPreferredMemoryModel=HoenickeLindenmann_1ByteResolution] [2024-10-14 17:36:01,982 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-14 17:36:02,062 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-14 17:36:02,069 INFO L200 MainTranslator]: Completed pre-run [2024-10-14 17:36:02,155 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-14 17:36:02,194 INFO L204 MainTranslator]: Completed translation [2024-10-14 17:36:02,195 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 05:36:02 WrapperNode [2024-10-14 17:36:02,195 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-14 17:36:02,196 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-14 17:36:02,196 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-14 17:36:02,196 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-14 17:36:02,201 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 05:36:02" (1/1) ... [2024-10-14 17:36:02,230 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 05:36:02" (1/1) ... [2024-10-14 17:36:02,271 INFO L138 Inliner]: procedures = 179, calls = 180, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 634 [2024-10-14 17:36:02,272 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-14 17:36:02,274 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-14 17:36:02,274 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-14 17:36:02,274 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-14 17:36:02,282 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 05:36:02" (1/1) ... [2024-10-14 17:36:02,283 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 05:36:02" (1/1) ... [2024-10-14 17:36:02,289 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 05:36:02" (1/1) ... [2024-10-14 17:36:02,328 INFO L175 MemorySlicer]: Split 158 memory accesses to 2 slices as follows [2, 156]. 99 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0]. The 42 writes are split as follows [0, 42]. [2024-10-14 17:36:02,328 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 05:36:02" (1/1) ... [2024-10-14 17:36:02,329 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 05:36:02" (1/1) ... [2024-10-14 17:36:02,368 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 05:36:02" (1/1) ... [2024-10-14 17:36:02,376 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 05:36:02" (1/1) ... [2024-10-14 17:36:02,381 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 05:36:02" (1/1) ... [2024-10-14 17:36:02,388 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 05:36:02" (1/1) ... [2024-10-14 17:36:02,395 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-14 17:36:02,397 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-14 17:36:02,397 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-14 17:36:02,397 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-14 17:36:02,398 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 05:36:02" (1/1) ... [2024-10-14 17:36:02,403 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-14 17:36:02,414 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 17:36:02,444 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-14 17:36:02,450 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-14 17:36:02,491 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#0 [2024-10-14 17:36:02,491 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#1 [2024-10-14 17:36:02,493 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#0 [2024-10-14 17:36:02,494 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#1 [2024-10-14 17:36:02,494 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2024-10-14 17:36:02,494 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2024-10-14 17:36:02,494 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#0 [2024-10-14 17:36:02,494 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#1 [2024-10-14 17:36:02,494 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#0 [2024-10-14 17:36:02,495 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#1 [2024-10-14 17:36:02,495 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-10-14 17:36:02,495 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-14 17:36:02,495 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2024-10-14 17:36:02,495 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2024-10-14 17:36:02,496 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2024-10-14 17:36:02,496 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2024-10-14 17:36:02,496 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-10-14 17:36:02,496 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#0 [2024-10-14 17:36:02,497 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#1 [2024-10-14 17:36:02,497 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-10-14 17:36:02,497 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2024-10-14 17:36:02,497 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-14 17:36:02,497 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-14 17:36:02,689 INFO L238 CfgBuilder]: Building ICFG [2024-10-14 17:36:02,690 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-14 17:36:09,460 INFO L? ?]: Removed 107 outVars from TransFormulas that were not future-live. [2024-10-14 17:36:09,463 INFO L287 CfgBuilder]: Performing block encoding [2024-10-14 17:36:09,510 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-14 17:36:09,510 INFO L314 CfgBuilder]: Removed 31 assume(true) statements. [2024-10-14 17:36:09,511 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 05:36:09 BoogieIcfgContainer [2024-10-14 17:36:09,511 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-14 17:36:09,513 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-14 17:36:09,513 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-14 17:36:09,516 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-14 17:36:09,517 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.10 05:36:01" (1/3) ... [2024-10-14 17:36:09,518 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@30c63b14 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.10 05:36:09, skipping insertion in model container [2024-10-14 17:36:09,518 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 05:36:02" (2/3) ... [2024-10-14 17:36:09,519 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@30c63b14 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.10 05:36:09, skipping insertion in model container [2024-10-14 17:36:09,519 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 05:36:09" (3/3) ... [2024-10-14 17:36:09,523 INFO L112 eAbstractionObserver]: Analyzing ICFG uthash_SAX_test1-1.i [2024-10-14 17:36:09,540 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-14 17:36:09,540 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2024-10-14 17:36:09,591 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-14 17:36:09,597 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;@62371e00, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-14 17:36:09,598 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2024-10-14 17:36:09,602 INFO L276 IsEmpty]: Start isEmpty. Operand has 128 states, 110 states have (on average 1.6818181818181819) internal successors, (185), 122 states have internal predecessors, (185), 13 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (13), 4 states have call predecessors, (13), 13 states have call successors, (13) [2024-10-14 17:36:09,608 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2024-10-14 17:36:09,608 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 17:36:09,609 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2024-10-14 17:36:09,609 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, __VERIFIER_assertErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2024-10-14 17:36:09,616 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 17:36:09,617 INFO L85 PathProgramCache]: Analyzing trace with hash -1034799541, now seen corresponding path program 1 times [2024-10-14 17:36:09,627 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-14 17:36:09,627 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [320793884] [2024-10-14 17:36:09,627 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 17:36:09,627 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-14 17:36:09,628 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-14 17:36:09,629 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-14 17:36:09,630 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-14 17:36:09,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 17:36:09,739 INFO L255 TraceCheckSpWp]: Trace formula consists of 22 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-10-14 17:36:09,742 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 17:36:09,747 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-14 17:36:09,747 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-14 17:36:09,748 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-14 17:36:09,748 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [320793884] [2024-10-14 17:36:09,749 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [320793884] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 17:36:09,755 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 17:36:09,756 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-14 17:36:09,757 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [393962664] [2024-10-14 17:36:09,758 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 17:36:09,763 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-14 17:36:09,764 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-14 17:36:09,787 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-14 17:36:09,787 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-14 17:36:09,789 INFO L87 Difference]: Start difference. First operand has 128 states, 110 states have (on average 1.6818181818181819) internal successors, (185), 122 states have internal predecessors, (185), 13 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (13), 4 states have call predecessors, (13), 13 states have call successors, (13) Second operand has 2 states, 2 states have (on average 3.0) internal successors, (6), 2 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 17:36:09,834 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 17:36:09,834 INFO L93 Difference]: Finished difference Result 127 states and 173 transitions. [2024-10-14 17:36:09,836 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-14 17:36:09,837 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 3.0) internal successors, (6), 2 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2024-10-14 17:36:09,837 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 17:36:09,848 INFO L225 Difference]: With dead ends: 127 [2024-10-14 17:36:09,849 INFO L226 Difference]: Without dead ends: 126 [2024-10-14 17:36:09,850 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 5 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-14 17:36:09,855 INFO L432 NwaCegarLoop]: 169 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 169 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-14 17:36:09,857 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 169 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-14 17:36:09,872 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 126 states. [2024-10-14 17:36:09,903 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 126 to 126. [2024-10-14 17:36:09,905 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 126 states, 109 states have (on average 1.3394495412844036) internal successors, (146), 120 states have internal predecessors, (146), 13 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (13), 4 states have call predecessors, (13), 13 states have call successors, (13) [2024-10-14 17:36:09,909 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126 states to 126 states and 172 transitions. [2024-10-14 17:36:09,912 INFO L78 Accepts]: Start accepts. Automaton has 126 states and 172 transitions. Word has length 6 [2024-10-14 17:36:09,913 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 17:36:09,913 INFO L471 AbstractCegarLoop]: Abstraction has 126 states and 172 transitions. [2024-10-14 17:36:09,913 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 3.0) internal successors, (6), 2 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 17:36:09,914 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 172 transitions. [2024-10-14 17:36:09,914 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2024-10-14 17:36:09,914 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 17:36:09,914 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2024-10-14 17:36:09,919 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 (2)] Forceful destruction successful, exit code 0 [2024-10-14 17:36:10,115 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-14 17:36:10,116 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, __VERIFIER_assertErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2024-10-14 17:36:10,117 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 17:36:10,117 INFO L85 PathProgramCache]: Analyzing trace with hash -1371028455, now seen corresponding path program 1 times [2024-10-14 17:36:10,117 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-14 17:36:10,117 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1036401272] [2024-10-14 17:36:10,117 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 17:36:10,117 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-14 17:36:10,118 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-14 17:36:10,121 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-14 17:36:10,122 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-14 17:36:10,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 17:36:10,220 INFO L255 TraceCheckSpWp]: Trace formula consists of 23 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-14 17:36:10,221 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 17:36:10,239 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-14 17:36:10,240 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-14 17:36:10,240 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-14 17:36:10,240 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1036401272] [2024-10-14 17:36:10,240 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1036401272] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 17:36:10,240 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 17:36:10,241 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-14 17:36:10,241 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [203880164] [2024-10-14 17:36:10,241 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 17:36:10,243 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-14 17:36:10,245 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-14 17:36:10,246 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-14 17:36:10,246 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 17:36:10,246 INFO L87 Difference]: Start difference. First operand 126 states and 172 transitions. Second operand has 3 states, 3 states have (on average 2.0) internal successors, (6), 2 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 17:36:10,437 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 17:36:10,437 INFO L93 Difference]: Finished difference Result 215 states and 287 transitions. [2024-10-14 17:36:10,440 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-14 17:36:10,441 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.0) internal successors, (6), 2 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2024-10-14 17:36:10,441 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 17:36:10,442 INFO L225 Difference]: With dead ends: 215 [2024-10-14 17:36:10,443 INFO L226 Difference]: Without dead ends: 215 [2024-10-14 17:36:10,443 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 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-14 17:36:10,444 INFO L432 NwaCegarLoop]: 166 mSDtfsCounter, 108 mSDsluCounter, 165 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 111 SdHoareTripleChecker+Valid, 331 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-14 17:36:10,446 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [111 Valid, 331 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-14 17:36:10,447 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 215 states. [2024-10-14 17:36:10,463 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 215 to 127. [2024-10-14 17:36:10,465 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 127 states, 110 states have (on average 1.3363636363636364) internal successors, (147), 121 states have internal predecessors, (147), 13 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (13), 4 states have call predecessors, (13), 13 states have call successors, (13) [2024-10-14 17:36:10,467 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127 states to 127 states and 173 transitions. [2024-10-14 17:36:10,469 INFO L78 Accepts]: Start accepts. Automaton has 127 states and 173 transitions. Word has length 6 [2024-10-14 17:36:10,470 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 17:36:10,470 INFO L471 AbstractCegarLoop]: Abstraction has 127 states and 173 transitions. [2024-10-14 17:36:10,471 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 2.0) internal successors, (6), 2 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 17:36:10,471 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 173 transitions. [2024-10-14 17:36:10,473 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2024-10-14 17:36:10,474 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 17:36:10,474 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] [2024-10-14 17:36:10,477 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-14 17:36:10,676 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-14 17:36:10,677 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, __VERIFIER_assertErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2024-10-14 17:36:10,677 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 17:36:10,678 INFO L85 PathProgramCache]: Analyzing trace with hash 2017767010, now seen corresponding path program 1 times [2024-10-14 17:36:10,680 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-14 17:36:10,680 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1957398571] [2024-10-14 17:36:10,680 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 17:36:10,680 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-14 17:36:10,681 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-14 17:36:10,683 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-14 17:36:10,684 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-14 17:36:11,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 17:36:11,047 INFO L255 TraceCheckSpWp]: Trace formula consists of 296 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-14 17:36:11,050 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 17:36:11,103 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-14 17:36:11,104 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-14 17:36:11,105 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-14 17:36:11,105 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1957398571] [2024-10-14 17:36:11,105 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1957398571] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 17:36:11,106 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 17:36:11,107 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-14 17:36:11,129 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1472199072] [2024-10-14 17:36:11,129 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 17:36:11,129 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-14 17:36:11,130 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-14 17:36:11,130 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-14 17:36:11,130 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-14 17:36:11,130 INFO L87 Difference]: Start difference. First operand 127 states and 173 transitions. Second operand has 4 states, 4 states have (on average 15.25) internal successors, (61), 4 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 17:36:11,410 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 17:36:11,412 INFO L93 Difference]: Finished difference Result 130 states and 168 transitions. [2024-10-14 17:36:11,413 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-14 17:36:11,413 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 15.25) internal successors, (61), 4 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 61 [2024-10-14 17:36:11,414 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 17:36:11,415 INFO L225 Difference]: With dead ends: 130 [2024-10-14 17:36:11,415 INFO L226 Difference]: Without dead ends: 130 [2024-10-14 17:36:11,417 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 58 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-14 17:36:11,418 INFO L432 NwaCegarLoop]: 139 mSDtfsCounter, 30 mSDsluCounter, 261 mSDsCounter, 0 mSdLazyCounter, 50 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 400 SdHoareTripleChecker+Invalid, 72 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 50 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-14 17:36:11,418 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 400 Invalid, 72 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 50 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-14 17:36:11,419 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 130 states. [2024-10-14 17:36:11,429 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 130 to 130. [2024-10-14 17:36:11,431 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 130 states, 113 states have (on average 1.2566371681415929) internal successors, (142), 124 states have internal predecessors, (142), 13 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (13), 4 states have call predecessors, (13), 13 states have call successors, (13) [2024-10-14 17:36:11,432 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 130 states to 130 states and 168 transitions. [2024-10-14 17:36:11,432 INFO L78 Accepts]: Start accepts. Automaton has 130 states and 168 transitions. Word has length 61 [2024-10-14 17:36:11,433 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 17:36:11,433 INFO L471 AbstractCegarLoop]: Abstraction has 130 states and 168 transitions. [2024-10-14 17:36:11,433 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.25) internal successors, (61), 4 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 17:36:11,433 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states and 168 transitions. [2024-10-14 17:36:11,437 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2024-10-14 17:36:11,437 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 17:36:11,437 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] [2024-10-14 17:36:11,446 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-14 17:36:11,637 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-14 17:36:11,638 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, __VERIFIER_assertErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2024-10-14 17:36:11,639 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 17:36:11,639 INFO L85 PathProgramCache]: Analyzing trace with hash 1841140182, now seen corresponding path program 1 times [2024-10-14 17:36:11,639 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-14 17:36:11,640 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [148568758] [2024-10-14 17:36:11,640 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 17:36:11,640 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-14 17:36:11,640 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-14 17:36:11,643 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-14 17:36:11,644 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-14 17:36:11,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 17:36:11,947 INFO L255 TraceCheckSpWp]: Trace formula consists of 284 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-10-14 17:36:11,950 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 17:36:12,132 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-14 17:36:12,132 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-14 17:36:12,133 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-14 17:36:12,133 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [148568758] [2024-10-14 17:36:12,133 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [148568758] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 17:36:12,133 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 17:36:12,133 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-14 17:36:12,133 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [169451358] [2024-10-14 17:36:12,133 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 17:36:12,136 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-14 17:36:12,136 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-14 17:36:12,137 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-14 17:36:12,137 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-14 17:36:12,137 INFO L87 Difference]: Start difference. First operand 130 states and 168 transitions. Second operand has 5 states, 5 states have (on average 12.2) internal successors, (61), 5 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 17:36:12,250 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 17:36:12,250 INFO L93 Difference]: Finished difference Result 124 states and 158 transitions. [2024-10-14 17:36:12,251 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-14 17:36:12,251 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.2) internal successors, (61), 5 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 61 [2024-10-14 17:36:12,251 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 17:36:12,252 INFO L225 Difference]: With dead ends: 124 [2024-10-14 17:36:12,252 INFO L226 Difference]: Without dead ends: 124 [2024-10-14 17:36:12,252 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 57 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-14 17:36:12,253 INFO L432 NwaCegarLoop]: 138 mSDtfsCounter, 0 mSDsluCounter, 259 mSDsCounter, 0 mSdLazyCounter, 45 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 397 SdHoareTripleChecker+Invalid, 48 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 45 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-14 17:36:12,254 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 397 Invalid, 48 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 45 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-14 17:36:12,254 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 124 states. [2024-10-14 17:36:12,261 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 124 to 124. [2024-10-14 17:36:12,262 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 124 states, 107 states have (on average 1.233644859813084) internal successors, (132), 118 states have internal predecessors, (132), 13 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (13), 4 states have call predecessors, (13), 13 states have call successors, (13) [2024-10-14 17:36:12,263 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 124 states to 124 states and 158 transitions. [2024-10-14 17:36:12,263 INFO L78 Accepts]: Start accepts. Automaton has 124 states and 158 transitions. Word has length 61 [2024-10-14 17:36:12,263 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 17:36:12,264 INFO L471 AbstractCegarLoop]: Abstraction has 124 states and 158 transitions. [2024-10-14 17:36:12,264 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.2) internal successors, (61), 5 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 17:36:12,264 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states and 158 transitions. [2024-10-14 17:36:12,265 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2024-10-14 17:36:12,265 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 17:36:12,265 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] [2024-10-14 17:36:12,274 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 (5)] Forceful destruction successful, exit code 0 [2024-10-14 17:36:12,466 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-14 17:36:12,466 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, __VERIFIER_assertErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2024-10-14 17:36:12,467 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 17:36:12,467 INFO L85 PathProgramCache]: Analyzing trace with hash 1566380568, now seen corresponding path program 1 times [2024-10-14 17:36:12,468 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-14 17:36:12,468 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [750858034] [2024-10-14 17:36:12,468 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 17:36:12,468 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-14 17:36:12,468 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-14 17:36:12,470 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-14 17:36:12,471 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2024-10-14 17:36:12,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 17:36:12,781 INFO L255 TraceCheckSpWp]: Trace formula consists of 286 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-14 17:36:12,784 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 17:36:13,115 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-14 17:36:13,116 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-14 17:36:13,116 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-14 17:36:13,118 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [750858034] [2024-10-14 17:36:13,118 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [750858034] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 17:36:13,119 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 17:36:13,119 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-14 17:36:13,119 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1123078909] [2024-10-14 17:36:13,119 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 17:36:13,119 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-14 17:36:13,119 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-14 17:36:13,120 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-14 17:36:13,120 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 17:36:13,120 INFO L87 Difference]: Start difference. First operand 124 states and 158 transitions. Second operand has 3 states, 3 states have (on average 20.333333333333332) internal successors, (61), 2 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 17:36:13,519 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 17:36:13,519 INFO L93 Difference]: Finished difference Result 160 states and 194 transitions. [2024-10-14 17:36:13,523 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-14 17:36:13,523 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 20.333333333333332) internal successors, (61), 2 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 61 [2024-10-14 17:36:13,523 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 17:36:13,524 INFO L225 Difference]: With dead ends: 160 [2024-10-14 17:36:13,524 INFO L226 Difference]: Without dead ends: 160 [2024-10-14 17:36:13,525 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 59 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-14 17:36:13,525 INFO L432 NwaCegarLoop]: 153 mSDtfsCounter, 0 mSDsluCounter, 146 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 299 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.4s IncrementalHoareTripleChecker+Time [2024-10-14 17:36:13,526 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 299 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-14 17:36:13,527 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 160 states. [2024-10-14 17:36:13,533 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 160 to 160. [2024-10-14 17:36:13,533 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 160 states, 143 states have (on average 1.1748251748251748) internal successors, (168), 154 states have internal predecessors, (168), 13 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (13), 4 states have call predecessors, (13), 13 states have call successors, (13) [2024-10-14 17:36:13,535 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 160 states to 160 states and 194 transitions. [2024-10-14 17:36:13,535 INFO L78 Accepts]: Start accepts. Automaton has 160 states and 194 transitions. Word has length 61 [2024-10-14 17:36:13,536 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 17:36:13,536 INFO L471 AbstractCegarLoop]: Abstraction has 160 states and 194 transitions. [2024-10-14 17:36:13,536 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 20.333333333333332) internal successors, (61), 2 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 17:36:13,536 INFO L276 IsEmpty]: Start isEmpty. Operand 160 states and 194 transitions. [2024-10-14 17:36:13,538 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2024-10-14 17:36:13,538 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 17:36:13,538 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] [2024-10-14 17:36:13,546 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-14 17:36:13,739 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-14 17:36:13,739 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, __VERIFIER_assertErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2024-10-14 17:36:13,740 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 17:36:13,740 INFO L85 PathProgramCache]: Analyzing trace with hash -536084267, now seen corresponding path program 1 times [2024-10-14 17:36:13,741 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-14 17:36:13,741 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1017426245] [2024-10-14 17:36:13,741 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 17:36:13,741 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-14 17:36:13,741 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-14 17:36:13,743 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-14 17:36:13,745 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-14 17:36:14,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 17:36:14,143 INFO L255 TraceCheckSpWp]: Trace formula consists of 415 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-14 17:36:14,145 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 17:36:14,173 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-14 17:36:14,174 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-14 17:36:14,174 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-14 17:36:14,174 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1017426245] [2024-10-14 17:36:14,174 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1017426245] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 17:36:14,174 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 17:36:14,175 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-14 17:36:14,175 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1674329423] [2024-10-14 17:36:14,175 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 17:36:14,175 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-14 17:36:14,176 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-14 17:36:14,176 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-14 17:36:14,177 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-14 17:36:14,177 INFO L87 Difference]: Start difference. First operand 160 states and 194 transitions. Second operand has 4 states, 3 states have (on average 23.333333333333332) internal successors, (70), 4 states have internal predecessors, (70), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2024-10-14 17:36:14,224 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 17:36:14,224 INFO L93 Difference]: Finished difference Result 162 states and 197 transitions. [2024-10-14 17:36:14,225 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-14 17:36:14,225 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 23.333333333333332) internal successors, (70), 4 states have internal predecessors, (70), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) Word has length 74 [2024-10-14 17:36:14,225 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 17:36:14,226 INFO L225 Difference]: With dead ends: 162 [2024-10-14 17:36:14,227 INFO L226 Difference]: Without dead ends: 162 [2024-10-14 17:36:14,227 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 71 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-14 17:36:14,228 INFO L432 NwaCegarLoop]: 152 mSDtfsCounter, 0 mSDsluCounter, 300 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 452 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-14 17:36:14,228 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 452 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-14 17:36:14,229 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 162 states. [2024-10-14 17:36:14,233 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 162 to 162. [2024-10-14 17:36:14,233 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 162 states, 144 states have (on average 1.1805555555555556) internal successors, (170), 156 states have internal predecessors, (170), 13 states have call successors, (13), 2 states have call predecessors, (13), 3 states have return successors, (14), 4 states have call predecessors, (14), 13 states have call successors, (14) [2024-10-14 17:36:14,234 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 162 states to 162 states and 197 transitions. [2024-10-14 17:36:14,234 INFO L78 Accepts]: Start accepts. Automaton has 162 states and 197 transitions. Word has length 74 [2024-10-14 17:36:14,235 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 17:36:14,235 INFO L471 AbstractCegarLoop]: Abstraction has 162 states and 197 transitions. [2024-10-14 17:36:14,235 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 23.333333333333332) internal successors, (70), 4 states have internal predecessors, (70), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2024-10-14 17:36:14,235 INFO L276 IsEmpty]: Start isEmpty. Operand 162 states and 197 transitions. [2024-10-14 17:36:14,236 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2024-10-14 17:36:14,236 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 17:36:14,237 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] [2024-10-14 17:36:14,246 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Ended with exit code 0 [2024-10-14 17:36:14,437 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-14 17:36:14,438 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, __VERIFIER_assertErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2024-10-14 17:36:14,438 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 17:36:14,438 INFO L85 PathProgramCache]: Analyzing trace with hash -1154606443, now seen corresponding path program 1 times [2024-10-14 17:36:14,439 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-14 17:36:14,439 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1655030860] [2024-10-14 17:36:14,439 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 17:36:14,439 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-14 17:36:14,439 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-14 17:36:14,440 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-14 17:36:14,441 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-14 17:36:14,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 17:36:14,820 INFO L255 TraceCheckSpWp]: Trace formula consists of 437 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-10-14 17:36:14,823 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 17:36:14,856 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-14 17:36:14,857 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-14 17:36:14,966 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-14 17:36:14,966 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-14 17:36:14,966 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1655030860] [2024-10-14 17:36:14,969 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1655030860] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-14 17:36:14,969 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-14 17:36:14,969 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 8 [2024-10-14 17:36:14,969 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1584789959] [2024-10-14 17:36:14,970 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-14 17:36:14,970 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-14 17:36:14,970 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-14 17:36:14,971 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-14 17:36:14,971 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2024-10-14 17:36:14,971 INFO L87 Difference]: Start difference. First operand 162 states and 197 transitions. Second operand has 8 states, 6 states have (on average 13.0) internal successors, (78), 8 states have internal predecessors, (78), 2 states have call successors, (3), 2 states have call predecessors, (3), 4 states have return successors, (4), 1 states have call predecessors, (4), 2 states have call successors, (4) [2024-10-14 17:36:15,164 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 17:36:15,165 INFO L93 Difference]: Finished difference Result 171 states and 211 transitions. [2024-10-14 17:36:15,165 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-10-14 17:36:15,167 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 6 states have (on average 13.0) internal successors, (78), 8 states have internal predecessors, (78), 2 states have call successors, (3), 2 states have call predecessors, (3), 4 states have return successors, (4), 1 states have call predecessors, (4), 2 states have call successors, (4) Word has length 76 [2024-10-14 17:36:15,167 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 17:36:15,168 INFO L225 Difference]: With dead ends: 171 [2024-10-14 17:36:15,170 INFO L226 Difference]: Without dead ends: 171 [2024-10-14 17:36:15,171 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 153 GetRequests, 144 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-14 17:36:15,171 INFO L432 NwaCegarLoop]: 152 mSDtfsCounter, 5 mSDsluCounter, 301 mSDsCounter, 0 mSdLazyCounter, 52 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 453 SdHoareTripleChecker+Invalid, 61 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 52 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-14 17:36:15,172 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 453 Invalid, 61 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 52 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-14 17:36:15,172 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 171 states. [2024-10-14 17:36:15,177 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 171 to 170. [2024-10-14 17:36:15,177 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 170 states, 151 states have (on average 1.2119205298013245) internal successors, (183), 163 states have internal predecessors, (183), 13 states have call successors, (13), 3 states have call predecessors, (13), 4 states have return successors, (14), 4 states have call predecessors, (14), 13 states have call successors, (14) [2024-10-14 17:36:15,178 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 170 states to 170 states and 210 transitions. [2024-10-14 17:36:15,178 INFO L78 Accepts]: Start accepts. Automaton has 170 states and 210 transitions. Word has length 76 [2024-10-14 17:36:15,179 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 17:36:15,179 INFO L471 AbstractCegarLoop]: Abstraction has 170 states and 210 transitions. [2024-10-14 17:36:15,179 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 6 states have (on average 13.0) internal successors, (78), 8 states have internal predecessors, (78), 2 states have call successors, (3), 2 states have call predecessors, (3), 4 states have return successors, (4), 1 states have call predecessors, (4), 2 states have call successors, (4) [2024-10-14 17:36:15,179 INFO L276 IsEmpty]: Start isEmpty. Operand 170 states and 210 transitions. [2024-10-14 17:36:15,181 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2024-10-14 17:36:15,184 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 17:36:15,185 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] [2024-10-14 17:36:15,196 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-14 17:36:15,385 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-14 17:36:15,386 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, __VERIFIER_assertErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2024-10-14 17:36:15,386 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 17:36:15,387 INFO L85 PathProgramCache]: Analyzing trace with hash 840237205, now seen corresponding path program 2 times [2024-10-14 17:36:15,387 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-14 17:36:15,387 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [203059863] [2024-10-14 17:36:15,387 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-10-14 17:36:15,387 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-14 17:36:15,387 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-14 17:36:15,389 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-14 17:36:15,389 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-14 17:36:15,785 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-10-14 17:36:15,785 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-14 17:36:15,796 INFO L255 TraceCheckSpWp]: Trace formula consists of 481 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-10-14 17:36:15,799 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 17:36:15,894 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 18 proven. 10 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-10-14 17:36:15,894 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-14 17:36:16,092 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 1 proven. 26 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-10-14 17:36:16,093 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-14 17:36:16,093 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [203059863] [2024-10-14 17:36:16,093 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [203059863] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-14 17:36:16,094 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-14 17:36:16,094 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 14 [2024-10-14 17:36:16,094 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [306534994] [2024-10-14 17:36:16,094 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-14 17:36:16,095 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-10-14 17:36:16,095 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-14 17:36:16,096 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-10-14 17:36:16,096 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=121, Unknown=0, NotChecked=0, Total=182 [2024-10-14 17:36:16,096 INFO L87 Difference]: Start difference. First operand 170 states and 210 transitions. Second operand has 14 states, 12 states have (on average 7.0) internal successors, (84), 14 states have internal predecessors, (84), 2 states have call successors, (3), 2 states have call predecessors, (3), 4 states have return successors, (4), 1 states have call predecessors, (4), 2 states have call successors, (4) [2024-10-14 17:36:16,696 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 17:36:16,696 INFO L93 Difference]: Finished difference Result 182 states and 229 transitions. [2024-10-14 17:36:16,697 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2024-10-14 17:36:16,697 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 12 states have (on average 7.0) internal successors, (84), 14 states have internal predecessors, (84), 2 states have call successors, (3), 2 states have call predecessors, (3), 4 states have return successors, (4), 1 states have call predecessors, (4), 2 states have call successors, (4) Word has length 80 [2024-10-14 17:36:16,697 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 17:36:16,698 INFO L225 Difference]: With dead ends: 182 [2024-10-14 17:36:16,699 INFO L226 Difference]: Without dead ends: 180 [2024-10-14 17:36:16,699 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 167 GetRequests, 146 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-14 17:36:16,700 INFO L432 NwaCegarLoop]: 152 mSDtfsCounter, 8 mSDsluCounter, 1044 mSDsCounter, 0 mSdLazyCounter, 186 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 1196 SdHoareTripleChecker+Invalid, 200 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 186 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-14 17:36:16,700 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 1196 Invalid, 200 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 186 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-14 17:36:16,701 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 180 states. [2024-10-14 17:36:16,704 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 180 to 179. [2024-10-14 17:36:16,704 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 179 states, 160 states have (on average 1.21875) internal successors, (195), 172 states have internal predecessors, (195), 13 states have call successors, (13), 3 states have call predecessors, (13), 4 states have return successors, (14), 4 states have call predecessors, (14), 13 states have call successors, (14) [2024-10-14 17:36:16,705 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 179 states to 179 states and 222 transitions. [2024-10-14 17:36:16,706 INFO L78 Accepts]: Start accepts. Automaton has 179 states and 222 transitions. Word has length 80 [2024-10-14 17:36:16,706 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 17:36:16,706 INFO L471 AbstractCegarLoop]: Abstraction has 179 states and 222 transitions. [2024-10-14 17:36:16,706 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 12 states have (on average 7.0) internal successors, (84), 14 states have internal predecessors, (84), 2 states have call successors, (3), 2 states have call predecessors, (3), 4 states have return successors, (4), 1 states have call predecessors, (4), 2 states have call successors, (4) [2024-10-14 17:36:16,707 INFO L276 IsEmpty]: Start isEmpty. Operand 179 states and 222 transitions. [2024-10-14 17:36:16,709 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2024-10-14 17:36:16,709 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 17:36:16,709 INFO L215 NwaCegarLoop]: trace histogram [15, 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] [2024-10-14 17:36:16,719 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Ended with exit code 0 [2024-10-14 17:36:16,910 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-14 17:36:16,910 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, __VERIFIER_assertErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2024-10-14 17:36:16,911 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 17:36:16,911 INFO L85 PathProgramCache]: Analyzing trace with hash -1197294529, now seen corresponding path program 3 times [2024-10-14 17:36:16,911 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-14 17:36:16,911 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1899285420] [2024-10-14 17:36:16,911 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-10-14 17:36:16,912 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-14 17:36:16,912 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-14 17:36:16,913 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-14 17:36:16,915 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-14 17:36:17,232 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2024-10-14 17:36:17,232 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-14 17:36:17,239 INFO L255 TraceCheckSpWp]: Trace formula consists of 301 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-10-14 17:36:17,242 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 17:36:17,420 INFO L134 CoverageAnalysis]: Checked inductivity of 139 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 138 trivial. 0 not checked. [2024-10-14 17:36:17,421 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-14 17:36:17,421 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-14 17:36:17,421 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1899285420] [2024-10-14 17:36:17,421 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1899285420] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 17:36:17,421 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 17:36:17,421 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-14 17:36:17,421 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1873783185] [2024-10-14 17:36:17,421 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 17:36:17,421 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-14 17:36:17,422 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-14 17:36:17,426 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-14 17:36:17,427 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-14 17:36:17,427 INFO L87 Difference]: Start difference. First operand 179 states and 222 transitions. Second operand has 4 states, 4 states have (on average 17.25) internal successors, (69), 4 states have internal predecessors, (69), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-14 17:36:21,671 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-14 17:36:25,677 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-14 17:36:26,781 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 17:36:26,781 INFO L93 Difference]: Finished difference Result 201 states and 263 transitions. [2024-10-14 17:36:26,785 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-14 17:36:26,785 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 17.25) internal successors, (69), 4 states have internal predecessors, (69), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 89 [2024-10-14 17:36:26,786 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 17:36:26,787 INFO L225 Difference]: With dead ends: 201 [2024-10-14 17:36:26,787 INFO L226 Difference]: Without dead ends: 201 [2024-10-14 17:36:26,787 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 89 GetRequests, 86 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-14 17:36:26,787 INFO L432 NwaCegarLoop]: 158 mSDtfsCounter, 143 mSDsluCounter, 147 mSDsCounter, 0 mSdLazyCounter, 56 mSolverCounterSat, 3 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 9.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 153 SdHoareTripleChecker+Valid, 305 SdHoareTripleChecker+Invalid, 61 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 56 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 9.3s IncrementalHoareTripleChecker+Time [2024-10-14 17:36:26,788 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [153 Valid, 305 Invalid, 61 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 56 Invalid, 2 Unknown, 0 Unchecked, 9.3s Time] [2024-10-14 17:36:26,790 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 201 states. [2024-10-14 17:36:26,795 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 201 to 180. [2024-10-14 17:36:26,796 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 180 states, 161 states have (on average 1.2111801242236024) internal successors, (195), 173 states have internal predecessors, (195), 13 states have call successors, (13), 3 states have call predecessors, (13), 4 states have return successors, (14), 4 states have call predecessors, (14), 13 states have call successors, (14) [2024-10-14 17:36:26,798 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 180 states to 180 states and 222 transitions. [2024-10-14 17:36:26,801 INFO L78 Accepts]: Start accepts. Automaton has 180 states and 222 transitions. Word has length 89 [2024-10-14 17:36:26,801 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 17:36:26,802 INFO L471 AbstractCegarLoop]: Abstraction has 180 states and 222 transitions. [2024-10-14 17:36:26,802 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 17.25) internal successors, (69), 4 states have internal predecessors, (69), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-14 17:36:26,802 INFO L276 IsEmpty]: Start isEmpty. Operand 180 states and 222 transitions. [2024-10-14 17:36:26,803 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2024-10-14 17:36:26,803 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 17:36:26,803 INFO L215 NwaCegarLoop]: trace histogram [15, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 17:36:26,811 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-14 17:36:27,003 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-14 17:36:27,004 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, __VERIFIER_assertErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2024-10-14 17:36:27,004 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 17:36:27,004 INFO L85 PathProgramCache]: Analyzing trace with hash -299833534, now seen corresponding path program 1 times [2024-10-14 17:36:27,005 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-14 17:36:27,005 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1223421823] [2024-10-14 17:36:27,005 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 17:36:27,005 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-14 17:36:27,005 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-14 17:36:27,006 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-14 17:36:27,007 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-14 17:36:27,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 17:36:27,513 INFO L255 TraceCheckSpWp]: Trace formula consists of 594 conjuncts, 13 conjuncts are in the unsatisfiable core [2024-10-14 17:36:27,516 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 17:36:27,678 INFO L134 CoverageAnalysis]: Checked inductivity of 139 backedges. 69 proven. 55 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2024-10-14 17:36:27,679 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-14 17:36:28,232 INFO L134 CoverageAnalysis]: Checked inductivity of 139 backedges. 1 proven. 122 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2024-10-14 17:36:28,233 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-14 17:36:28,233 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1223421823] [2024-10-14 17:36:28,233 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1223421823] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-14 17:36:28,233 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-14 17:36:28,233 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 26 [2024-10-14 17:36:28,233 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [656400862] [2024-10-14 17:36:28,234 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-14 17:36:28,234 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2024-10-14 17:36:28,234 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-14 17:36:28,235 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2024-10-14 17:36:28,235 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=193, Invalid=457, Unknown=0, NotChecked=0, Total=650 [2024-10-14 17:36:28,236 INFO L87 Difference]: Start difference. First operand 180 states and 222 transitions. Second operand has 26 states, 24 states have (on average 4.125) internal successors, (99), 26 states have internal predecessors, (99), 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-14 17:36:29,916 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 17:36:29,916 INFO L93 Difference]: Finished difference Result 201 states and 259 transitions. [2024-10-14 17:36:29,918 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2024-10-14 17:36:29,918 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 24 states have (on average 4.125) internal successors, (99), 26 states have internal predecessors, (99), 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 93 [2024-10-14 17:36:29,918 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 17:36:29,919 INFO L225 Difference]: With dead ends: 201 [2024-10-14 17:36:29,919 INFO L226 Difference]: Without dead ends: 199 [2024-10-14 17:36:29,920 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 205 GetRequests, 160 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 100 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=728, Invalid=1434, Unknown=0, NotChecked=0, Total=2162 [2024-10-14 17:36:29,921 INFO L432 NwaCegarLoop]: 152 mSDtfsCounter, 14 mSDsluCounter, 1642 mSDsCounter, 0 mSdLazyCounter, 574 mSolverCounterSat, 36 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 1794 SdHoareTripleChecker+Invalid, 610 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 36 IncrementalHoareTripleChecker+Valid, 574 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-10-14 17:36:29,921 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 1794 Invalid, 610 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [36 Valid, 574 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-10-14 17:36:29,922 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 199 states. [2024-10-14 17:36:29,925 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 199 to 198. [2024-10-14 17:36:29,926 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 198 states, 179 states have (on average 1.223463687150838) internal successors, (219), 191 states have internal predecessors, (219), 13 states have call successors, (13), 3 states have call predecessors, (13), 4 states have return successors, (14), 4 states have call predecessors, (14), 13 states have call successors, (14) [2024-10-14 17:36:29,929 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 198 states to 198 states and 246 transitions. [2024-10-14 17:36:29,929 INFO L78 Accepts]: Start accepts. Automaton has 198 states and 246 transitions. Word has length 93 [2024-10-14 17:36:29,929 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 17:36:29,929 INFO L471 AbstractCegarLoop]: Abstraction has 198 states and 246 transitions. [2024-10-14 17:36:29,930 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 24 states have (on average 4.125) internal successors, (99), 26 states have internal predecessors, (99), 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-14 17:36:29,930 INFO L276 IsEmpty]: Start isEmpty. Operand 198 states and 246 transitions. [2024-10-14 17:36:29,931 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2024-10-14 17:36:29,932 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 17:36:29,932 INFO L215 NwaCegarLoop]: trace histogram [33, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 17:36:29,943 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 (11)] Forceful destruction successful, exit code 0 [2024-10-14 17:36:30,133 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-14 17:36:30,133 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, __VERIFIER_assertErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2024-10-14 17:36:30,133 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 17:36:30,134 INFO L85 PathProgramCache]: Analyzing trace with hash -212365310, now seen corresponding path program 2 times [2024-10-14 17:36:30,134 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-14 17:36:30,134 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1376359420] [2024-10-14 17:36:30,134 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-10-14 17:36:30,134 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-14 17:36:30,135 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-14 17:36:30,136 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-14 17:36:30,136 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-14 17:36:30,674 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-10-14 17:36:30,674 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-14 17:36:30,691 INFO L255 TraceCheckSpWp]: Trace formula consists of 792 conjuncts, 25 conjuncts are in the unsatisfiable core [2024-10-14 17:36:30,693 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 17:36:31,140 INFO L134 CoverageAnalysis]: Checked inductivity of 598 backedges. 279 proven. 253 refuted. 0 times theorem prover too weak. 66 trivial. 0 not checked. [2024-10-14 17:36:31,140 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-14 17:36:32,718 INFO L134 CoverageAnalysis]: Checked inductivity of 598 backedges. 1 proven. 530 refuted. 0 times theorem prover too weak. 67 trivial. 0 not checked. [2024-10-14 17:36:32,719 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-14 17:36:32,719 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1376359420] [2024-10-14 17:36:32,719 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1376359420] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-14 17:36:32,719 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-14 17:36:32,719 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 26] total 50 [2024-10-14 17:36:32,720 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [452803512] [2024-10-14 17:36:32,720 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-14 17:36:32,720 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 50 states [2024-10-14 17:36:32,720 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-14 17:36:32,721 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2024-10-14 17:36:32,721 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=672, Invalid=1778, Unknown=0, NotChecked=0, Total=2450 [2024-10-14 17:36:32,722 INFO L87 Difference]: Start difference. First operand 198 states and 246 transitions. Second operand has 50 states, 48 states have (on average 2.5625) internal successors, (123), 50 states have internal predecessors, (123), 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-14 17:36:38,618 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 17:36:38,618 INFO L93 Difference]: Finished difference Result 235 states and 315 transitions. [2024-10-14 17:36:38,619 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 71 states. [2024-10-14 17:36:38,619 INFO L78 Accepts]: Start accepts. Automaton has has 50 states, 48 states have (on average 2.5625) internal successors, (123), 50 states have internal predecessors, (123), 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 111 [2024-10-14 17:36:38,619 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 17:36:38,621 INFO L225 Difference]: With dead ends: 235 [2024-10-14 17:36:38,621 INFO L226 Difference]: Without dead ends: 233 [2024-10-14 17:36:38,623 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 263 GetRequests, 172 SyntacticMatches, 0 SemanticMatches, 91 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 465 ImplicationChecksByTransitivity, 4.8s TimeCoverageRelationStatistics Valid=2713, Invalid=5843, Unknown=0, NotChecked=0, Total=8556 [2024-10-14 17:36:38,624 INFO L432 NwaCegarLoop]: 152 mSDtfsCounter, 25 mSDsluCounter, 3430 mSDsCounter, 0 mSdLazyCounter, 2012 mSolverCounterSat, 61 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 3582 SdHoareTripleChecker+Invalid, 2073 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 61 IncrementalHoareTripleChecker+Valid, 2012 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.6s IncrementalHoareTripleChecker+Time [2024-10-14 17:36:38,624 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [25 Valid, 3582 Invalid, 2073 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [61 Valid, 2012 Invalid, 0 Unknown, 0 Unchecked, 2.6s Time] [2024-10-14 17:36:38,625 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 233 states. [2024-10-14 17:36:38,632 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 233 to 232. [2024-10-14 17:36:38,633 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 232 states, 213 states have (on average 1.244131455399061) internal successors, (265), 225 states have internal predecessors, (265), 13 states have call successors, (13), 3 states have call predecessors, (13), 4 states have return successors, (14), 4 states have call predecessors, (14), 13 states have call successors, (14) [2024-10-14 17:36:38,634 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 232 states to 232 states and 292 transitions. [2024-10-14 17:36:38,635 INFO L78 Accepts]: Start accepts. Automaton has 232 states and 292 transitions. Word has length 111 [2024-10-14 17:36:38,635 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 17:36:38,636 INFO L471 AbstractCegarLoop]: Abstraction has 232 states and 292 transitions. [2024-10-14 17:36:38,636 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 50 states, 48 states have (on average 2.5625) internal successors, (123), 50 states have internal predecessors, (123), 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-14 17:36:38,636 INFO L276 IsEmpty]: Start isEmpty. Operand 232 states and 292 transitions. [2024-10-14 17:36:38,637 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2024-10-14 17:36:38,637 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 17:36:38,638 INFO L215 NwaCegarLoop]: trace histogram [67, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 17:36:38,654 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-14 17:36:38,838 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-14 17:36:38,838 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, __VERIFIER_assertErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2024-10-14 17:36:38,839 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 17:36:38,839 INFO L85 PathProgramCache]: Analyzing trace with hash 1672982210, now seen corresponding path program 3 times [2024-10-14 17:36:38,839 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-14 17:36:38,840 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1234824614] [2024-10-14 17:36:38,840 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-10-14 17:36:38,840 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-14 17:36:38,840 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-14 17:36:38,841 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-14 17:36:38,842 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-14 17:36:39,262 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2024-10-14 17:36:39,263 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-14 17:36:39,270 INFO L255 TraceCheckSpWp]: Trace formula consists of 315 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-14 17:36:39,273 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 17:36:39,398 INFO L134 CoverageAnalysis]: Checked inductivity of 2349 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2348 trivial. 0 not checked. [2024-10-14 17:36:39,398 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-14 17:36:39,534 INFO L134 CoverageAnalysis]: Checked inductivity of 2349 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2348 trivial. 0 not checked. [2024-10-14 17:36:39,535 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-14 17:36:39,535 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1234824614] [2024-10-14 17:36:39,535 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1234824614] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-14 17:36:39,535 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-14 17:36:39,535 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 6 [2024-10-14 17:36:39,535 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [618312865] [2024-10-14 17:36:39,535 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-14 17:36:39,536 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-14 17:36:39,536 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-14 17:36:39,536 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-14 17:36:39,536 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-10-14 17:36:39,536 INFO L87 Difference]: Start difference. First operand 232 states and 292 transitions. Second operand has 6 states, 6 states have (on average 22.333333333333332) internal successors, (134), 6 states have internal predecessors, (134), 3 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2024-10-14 17:36:39,880 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 17:36:39,880 INFO L93 Difference]: Finished difference Result 425 states and 521 transitions. [2024-10-14 17:36:39,881 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-14 17:36:39,881 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 22.333333333333332) internal successors, (134), 6 states have internal predecessors, (134), 3 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 145 [2024-10-14 17:36:39,882 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 17:36:39,884 INFO L225 Difference]: With dead ends: 425 [2024-10-14 17:36:39,884 INFO L226 Difference]: Without dead ends: 425 [2024-10-14 17:36:39,885 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 289 GetRequests, 284 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-14 17:36:39,885 INFO L432 NwaCegarLoop]: 260 mSDtfsCounter, 325 mSDsluCounter, 480 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 328 SdHoareTripleChecker+Valid, 740 SdHoareTripleChecker+Invalid, 41 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 37 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-14 17:36:39,885 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [328 Valid, 740 Invalid, 41 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-14 17:36:39,887 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 425 states. [2024-10-14 17:36:39,896 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 425 to 425. [2024-10-14 17:36:39,897 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 425 states, 403 states have (on average 1.2034739454094292) internal successors, (485), 415 states have internal predecessors, (485), 16 states have call successors, (16), 3 states have call predecessors, (16), 4 states have return successors, (20), 7 states have call predecessors, (20), 16 states have call successors, (20) [2024-10-14 17:36:39,898 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 425 states to 425 states and 521 transitions. [2024-10-14 17:36:39,899 INFO L78 Accepts]: Start accepts. Automaton has 425 states and 521 transitions. Word has length 145 [2024-10-14 17:36:39,899 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 17:36:39,899 INFO L471 AbstractCegarLoop]: Abstraction has 425 states and 521 transitions. [2024-10-14 17:36:39,899 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 22.333333333333332) internal successors, (134), 6 states have internal predecessors, (134), 3 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2024-10-14 17:36:39,900 INFO L276 IsEmpty]: Start isEmpty. Operand 425 states and 521 transitions. [2024-10-14 17:36:39,902 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 311 [2024-10-14 17:36:39,903 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 17:36:39,903 INFO L215 NwaCegarLoop]: trace histogram [67, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 17:36:39,912 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-14 17:36:40,103 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-14 17:36:40,104 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, __VERIFIER_assertErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2024-10-14 17:36:40,104 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 17:36:40,104 INFO L85 PathProgramCache]: Analyzing trace with hash -551535979, now seen corresponding path program 1 times [2024-10-14 17:36:40,105 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-14 17:36:40,105 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [969097333] [2024-10-14 17:36:40,105 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 17:36:40,105 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-14 17:36:40,105 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-14 17:36:40,106 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-14 17:36:40,108 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-14 17:36:41,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 17:36:41,707 INFO L255 TraceCheckSpWp]: Trace formula consists of 1955 conjuncts, 26 conjuncts are in the unsatisfiable core [2024-10-14 17:36:41,711 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 17:36:42,207 INFO L134 CoverageAnalysis]: Checked inductivity of 2676 backedges. 1193 proven. 276 refuted. 0 times theorem prover too weak. 1207 trivial. 0 not checked. [2024-10-14 17:36:42,208 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-14 17:36:44,115 INFO L134 CoverageAnalysis]: Checked inductivity of 2676 backedges. 1193 proven. 276 refuted. 0 times theorem prover too weak. 1207 trivial. 0 not checked. [2024-10-14 17:36:44,116 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-14 17:36:44,116 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [969097333] [2024-10-14 17:36:44,116 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [969097333] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-14 17:36:44,116 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-14 17:36:44,116 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 27] total 52 [2024-10-14 17:36:44,117 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [124670281] [2024-10-14 17:36:44,117 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-14 17:36:44,117 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 52 states [2024-10-14 17:36:44,118 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-14 17:36:44,118 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2024-10-14 17:36:44,119 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=726, Invalid=1926, Unknown=0, NotChecked=0, Total=2652 [2024-10-14 17:36:44,120 INFO L87 Difference]: Start difference. First operand 425 states and 521 transitions. Second operand has 52 states, 50 states have (on average 3.22) internal successors, (161), 52 states have internal predecessors, (161), 2 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2024-10-14 17:36:50,662 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 17:36:50,663 INFO L93 Difference]: Finished difference Result 452 states and 579 transitions. [2024-10-14 17:36:50,665 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 76 states. [2024-10-14 17:36:50,665 INFO L78 Accepts]: Start accepts. Automaton has has 52 states, 50 states have (on average 3.22) internal successors, (161), 52 states have internal predecessors, (161), 2 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) Word has length 310 [2024-10-14 17:36:50,665 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 17:36:50,667 INFO L225 Difference]: With dead ends: 452 [2024-10-14 17:36:50,667 INFO L226 Difference]: Without dead ends: 452 [2024-10-14 17:36:50,670 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 665 GetRequests, 568 SyntacticMatches, 0 SemanticMatches, 97 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1633 ImplicationChecksByTransitivity, 6.5s TimeCoverageRelationStatistics Valid=3146, Invalid=6556, Unknown=0, NotChecked=0, Total=9702 [2024-10-14 17:36:50,671 INFO L432 NwaCegarLoop]: 151 mSDtfsCounter, 26 mSDsluCounter, 3554 mSDsCounter, 0 mSdLazyCounter, 1446 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 3705 SdHoareTripleChecker+Invalid, 1476 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 1446 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2024-10-14 17:36:50,673 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 3705 Invalid, 1476 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 1446 Invalid, 0 Unknown, 0 Unchecked, 2.0s Time] [2024-10-14 17:36:50,673 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 452 states. [2024-10-14 17:36:50,683 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 452 to 450. [2024-10-14 17:36:50,684 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 450 states, 428 states have (on average 1.25) internal successors, (535), 440 states have internal predecessors, (535), 16 states have call successors, (16), 3 states have call predecessors, (16), 4 states have return successors, (20), 7 states have call predecessors, (20), 16 states have call successors, (20) [2024-10-14 17:36:50,687 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 450 states to 450 states and 571 transitions. [2024-10-14 17:36:50,687 INFO L78 Accepts]: Start accepts. Automaton has 450 states and 571 transitions. Word has length 310 [2024-10-14 17:36:50,687 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 17:36:50,687 INFO L471 AbstractCegarLoop]: Abstraction has 450 states and 571 transitions. [2024-10-14 17:36:50,688 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 52 states, 50 states have (on average 3.22) internal successors, (161), 52 states have internal predecessors, (161), 2 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2024-10-14 17:36:50,688 INFO L276 IsEmpty]: Start isEmpty. Operand 450 states and 571 transitions. [2024-10-14 17:36:50,691 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 336 [2024-10-14 17:36:50,691 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 17:36:50,691 INFO L215 NwaCegarLoop]: trace histogram [92, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 17:36:50,731 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 (14)] Forceful destruction successful, exit code 0 [2024-10-14 17:36:50,892 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-14 17:36:50,893 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, __VERIFIER_assertErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2024-10-14 17:36:50,893 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 17:36:50,893 INFO L85 PathProgramCache]: Analyzing trace with hash 433626303, now seen corresponding path program 2 times [2024-10-14 17:36:50,894 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-14 17:36:50,894 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1592763193] [2024-10-14 17:36:50,894 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-10-14 17:36:50,894 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-14 17:36:50,894 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-14 17:36:50,895 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-14 17:36:50,897 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-14 17:36:53,008 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-10-14 17:36:53,008 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-14 17:36:53,068 INFO L255 TraceCheckSpWp]: Trace formula consists of 2230 conjuncts, 51 conjuncts are in the unsatisfiable core [2024-10-14 17:36:53,073 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 17:36:54,679 INFO L134 CoverageAnalysis]: Checked inductivity of 4701 backedges. 2318 proven. 1176 refuted. 0 times theorem prover too weak. 1207 trivial. 0 not checked. [2024-10-14 17:36:54,679 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-14 17:37:00,373 INFO L134 CoverageAnalysis]: Checked inductivity of 4701 backedges. 2318 proven. 1176 refuted. 0 times theorem prover too weak. 1207 trivial. 0 not checked. [2024-10-14 17:37:00,374 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-14 17:37:00,374 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1592763193] [2024-10-14 17:37:00,374 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1592763193] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-14 17:37:00,374 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-14 17:37:00,374 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [52, 52] total 102 [2024-10-14 17:37:00,375 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [73126886] [2024-10-14 17:37:00,375 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-14 17:37:00,376 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 102 states [2024-10-14 17:37:00,376 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-14 17:37:00,377 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 102 interpolants. [2024-10-14 17:37:00,380 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=2701, Invalid=7601, Unknown=0, NotChecked=0, Total=10302 [2024-10-14 17:37:00,380 INFO L87 Difference]: Start difference. First operand 450 states and 571 transitions. Second operand has 102 states, 100 states have (on average 2.11) internal successors, (211), 102 states have internal predecessors, (211), 2 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3)