./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_test8-1.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (memcleanup) Using default analysis Version 4a390ef5 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_test8-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 ca0a592612bf67ed64c0cb4dbe07151d7191a8039e0f3c4eacc12cd10ecaa237 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-4a390ef-m [2024-10-24 15:58:40,158 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-24 15:58:40,232 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-MemCleanup-32bit-Automizer_Default.epf [2024-10-24 15:58:40,238 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-24 15:58:40,240 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-24 15:58:40,276 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-24 15:58:40,276 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-24 15:58:40,277 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-24 15:58:40,277 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-24 15:58:40,278 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-24 15:58:40,279 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-24 15:58:40,279 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-24 15:58:40,280 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-24 15:58:40,281 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-24 15:58:40,282 INFO L153 SettingsManager]: * Use SBE=true [2024-10-24 15:58:40,283 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-24 15:58:40,283 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-24 15:58:40,283 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-24 15:58:40,284 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-24 15:58:40,284 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-24 15:58:40,284 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-24 15:58:40,288 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-24 15:58:40,289 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-10-24 15:58:40,289 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-10-24 15:58:40,289 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-24 15:58:40,290 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-24 15:58:40,290 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-10-24 15:58:40,290 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-24 15:58:40,290 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-10-24 15:58:40,291 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-24 15:58:40,291 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-24 15:58:40,291 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-24 15:58:40,291 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-24 15:58:40,292 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-24 15:58:40,292 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-24 15:58:40,292 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-24 15:58:40,292 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-24 15:58:40,292 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-24 15:58:40,293 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-24 15:58:40,293 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-24 15:58:40,293 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-24 15:58:40,294 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-24 15:58:40,294 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-24 15:58:40,294 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-24 15:58:40,295 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-24 15:58:40,296 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 -> ca0a592612bf67ed64c0cb4dbe07151d7191a8039e0f3c4eacc12cd10ecaa237 [2024-10-24 15:58:40,552 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-24 15:58:40,579 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-24 15:58:40,582 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-24 15:58:40,583 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-24 15:58:40,584 INFO L274 PluginConnector]: CDTParser initialized [2024-10-24 15:58:40,585 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_SAX_test8-1.i [2024-10-24 15:58:41,970 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-24 15:58:42,308 INFO L384 CDTParser]: Found 1 translation units. [2024-10-24 15:58:42,310 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_SAX_test8-1.i [2024-10-24 15:58:42,336 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e16ff9513/e9605b55ba6f4d698b286b8587ed4d0e/FLAG585527f10 [2024-10-24 15:58:42,353 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e16ff9513/e9605b55ba6f4d698b286b8587ed4d0e [2024-10-24 15:58:42,356 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-24 15:58:42,358 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-24 15:58:42,360 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-24 15:58:42,361 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-24 15:58:42,367 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-24 15:58:42,368 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 03:58:42" (1/1) ... [2024-10-24 15:58:42,369 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3a39cf35 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 03:58:42, skipping insertion in model container [2024-10-24 15:58:42,369 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 03:58:42" (1/1) ... [2024-10-24 15:58:42,446 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-24 15:58:43,030 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-24 15:58:43,051 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-24 15:58:43,067 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver@53840d63 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 03:58:43, skipping insertion in model container [2024-10-24 15:58:43,067 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-24 15:58:43,070 INFO L186 ToolchainWalker]: Toolchain execution was canceled (user or tool) before executing de.uni_freiburg.informatik.ultimate.boogie.procedureinliner [2024-10-24 15:58:43,072 INFO L158 Benchmark]: Toolchain (without parser) took 713.50ms. Allocated memory is still 136.3MB. Free memory was 82.3MB in the beginning and 105.4MB in the end (delta: -23.1MB). Peak memory consumption was 24.2MB. Max. memory is 16.1GB. [2024-10-24 15:58:43,072 INFO L158 Benchmark]: CDTParser took 0.15ms. Allocated memory is still 136.3MB. Free memory is still 97.5MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-24 15:58:43,073 INFO L158 Benchmark]: CACSL2BoogieTranslator took 709.95ms. Allocated memory is still 136.3MB. Free memory was 82.3MB in the beginning and 105.4MB in the end (delta: -23.1MB). Peak memory consumption was 24.2MB. Max. memory is 16.1GB. [2024-10-24 15:58:43,074 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.15ms. Allocated memory is still 136.3MB. Free memory is still 97.5MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 709.95ms. Allocated memory is still 136.3MB. Free memory was 82.3MB in the beginning and 105.4MB in the end (delta: -23.1MB). Peak memory consumption was 24.2MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - UnsupportedSyntaxResult [Line: 766]: Unsupported Syntax Found a cast between two array/pointer types of different sizes while using memory model HoenickeLindenmann_Original (while Not using bitvector translation) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_SAX_test8-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 ca0a592612bf67ed64c0cb4dbe07151d7191a8039e0f3c4eacc12cd10ecaa237 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-4a390ef-m [2024-10-24 15:58:45,089 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-24 15:58:45,176 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-MemCleanup-32bit-Automizer_Bitvector.epf [2024-10-24 15:58:45,185 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-24 15:58:45,185 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-24 15:58:45,210 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-24 15:58:45,211 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-24 15:58:45,211 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-24 15:58:45,212 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-24 15:58:45,212 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-24 15:58:45,212 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-24 15:58:45,213 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-24 15:58:45,213 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-24 15:58:45,215 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-24 15:58:45,215 INFO L153 SettingsManager]: * Use SBE=true [2024-10-24 15:58:45,216 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-24 15:58:45,216 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-24 15:58:45,216 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-24 15:58:45,216 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-24 15:58:45,217 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-24 15:58:45,217 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-24 15:58:45,221 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-24 15:58:45,221 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-10-24 15:58:45,222 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-10-24 15:58:45,222 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-24 15:58:45,222 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-24 15:58:45,222 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-10-24 15:58:45,222 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-10-24 15:58:45,222 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-24 15:58:45,223 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-10-24 15:58:45,223 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-10-24 15:58:45,223 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-24 15:58:45,223 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-24 15:58:45,223 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-24 15:58:45,224 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-24 15:58:45,224 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-24 15:58:45,224 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-24 15:58:45,225 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-24 15:58:45,227 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-24 15:58:45,227 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-24 15:58:45,228 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-24 15:58:45,228 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-10-24 15:58:45,228 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-10-24 15:58:45,228 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-24 15:58:45,229 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-24 15:58:45,229 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-24 15:58:45,229 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-24 15:58:45,230 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2024-10-24 15:58:45,230 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 -> ca0a592612bf67ed64c0cb4dbe07151d7191a8039e0f3c4eacc12cd10ecaa237 [2024-10-24 15:58:45,532 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-24 15:58:45,558 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-24 15:58:45,562 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-24 15:58:45,563 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-24 15:58:45,564 INFO L274 PluginConnector]: CDTParser initialized [2024-10-24 15:58:45,566 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_SAX_test8-1.i [2024-10-24 15:58:47,160 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-24 15:58:47,458 INFO L384 CDTParser]: Found 1 translation units. [2024-10-24 15:58:47,461 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_SAX_test8-1.i [2024-10-24 15:58:47,487 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7340eb445/3738ba6b2c944ed891b4e28746dd451e/FLAG012f977f5 [2024-10-24 15:58:47,504 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7340eb445/3738ba6b2c944ed891b4e28746dd451e [2024-10-24 15:58:47,507 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-24 15:58:47,509 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-24 15:58:47,511 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-24 15:58:47,511 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-24 15:58:47,516 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-24 15:58:47,517 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 03:58:47" (1/1) ... [2024-10-24 15:58:47,520 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5034b68b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 03:58:47, skipping insertion in model container [2024-10-24 15:58:47,520 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 03:58:47" (1/1) ... [2024-10-24 15:58:47,589 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-24 15:58:48,202 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-24 15:58:48,218 INFO L197 MainTranslator]: Restarting translation with changed settings: SettingsChange [mNewPreferredMemoryModel=HoenickeLindenmann_1ByteResolution] [2024-10-24 15:58:48,231 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-24 15:58:48,311 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-24 15:58:48,319 INFO L200 MainTranslator]: Completed pre-run [2024-10-24 15:58:48,426 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-24 15:58:48,472 INFO L204 MainTranslator]: Completed translation [2024-10-24 15:58:48,472 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 03:58:48 WrapperNode [2024-10-24 15:58:48,473 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-24 15:58:48,474 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-24 15:58:48,474 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-24 15:58:48,474 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-24 15:58:48,481 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 03:58:48" (1/1) ... [2024-10-24 15:58:48,516 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 03:58:48" (1/1) ... [2024-10-24 15:58:48,589 INFO L138 Inliner]: procedures = 180, calls = 291, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 1018 [2024-10-24 15:58:48,589 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-24 15:58:48,590 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-24 15:58:48,590 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-24 15:58:48,590 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-24 15:58:48,604 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 03:58:48" (1/1) ... [2024-10-24 15:58:48,605 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 03:58:48" (1/1) ... [2024-10-24 15:58:48,622 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 03:58:48" (1/1) ... [2024-10-24 15:58:48,692 INFO L175 MemorySlicer]: Split 256 memory accesses to 3 slices as follows [2, 34, 220]. 86 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0, 0]. The 54 writes are split as follows [0, 4, 50]. [2024-10-24 15:58:48,692 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 03:58:48" (1/1) ... [2024-10-24 15:58:48,693 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 03:58:48" (1/1) ... [2024-10-24 15:58:48,759 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 03:58:48" (1/1) ... [2024-10-24 15:58:48,775 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 03:58:48" (1/1) ... [2024-10-24 15:58:48,784 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 03:58:48" (1/1) ... [2024-10-24 15:58:48,790 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 03:58:48" (1/1) ... [2024-10-24 15:58:48,799 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-24 15:58:48,800 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-24 15:58:48,801 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-24 15:58:48,801 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-24 15:58:48,802 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 03:58:48" (1/1) ... [2024-10-24 15:58:48,812 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-24 15:58:48,824 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 15:58:48,842 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-24 15:58:48,845 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-24 15:58:48,891 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2024-10-24 15:58:48,891 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2024-10-24 15:58:48,891 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#0 [2024-10-24 15:58:48,891 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#1 [2024-10-24 15:58:48,891 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#2 [2024-10-24 15:58:48,891 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#0 [2024-10-24 15:58:48,891 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#1 [2024-10-24 15:58:48,891 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#2 [2024-10-24 15:58:48,892 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2024-10-24 15:58:48,892 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2024-10-24 15:58:48,892 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#0 [2024-10-24 15:58:48,892 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#1 [2024-10-24 15:58:48,892 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#2 [2024-10-24 15:58:48,894 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#0 [2024-10-24 15:58:48,894 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#1 [2024-10-24 15:58:48,894 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#2 [2024-10-24 15:58:48,895 INFO L130 BoogieDeclarations]: Found specification of procedure test_int [2024-10-24 15:58:48,895 INFO L138 BoogieDeclarations]: Found implementation of procedure test_int [2024-10-24 15:58:48,895 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-10-24 15:58:48,896 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-24 15:58:48,896 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2024-10-24 15:58:48,896 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2024-10-24 15:58:48,897 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2024-10-24 15:58:48,897 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-10-24 15:58:48,897 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2024-10-24 15:58:48,897 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2024-10-24 15:58:48,897 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2024-10-24 15:58:48,898 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-10-24 15:58:48,898 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#0 [2024-10-24 15:58:48,898 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#1 [2024-10-24 15:58:48,898 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#2 [2024-10-24 15:58:48,898 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-10-24 15:58:48,898 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2024-10-24 15:58:48,899 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#2 [2024-10-24 15:58:48,899 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-24 15:58:48,899 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-24 15:58:49,147 INFO L238 CfgBuilder]: Building ICFG [2024-10-24 15:58:49,149 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-24 15:58:56,897 INFO L? ?]: Removed 142 outVars from TransFormulas that were not future-live. [2024-10-24 15:58:56,897 INFO L287 CfgBuilder]: Performing block encoding [2024-10-24 15:58:56,950 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-24 15:58:56,950 INFO L314 CfgBuilder]: Removed 62 assume(true) statements. [2024-10-24 15:58:56,951 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 03:58:56 BoogieIcfgContainer [2024-10-24 15:58:56,951 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-24 15:58:56,955 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-24 15:58:56,956 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-24 15:58:56,960 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-24 15:58:56,960 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.10 03:58:47" (1/3) ... [2024-10-24 15:58:56,961 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@16bc58f0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 03:58:56, skipping insertion in model container [2024-10-24 15:58:56,961 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 03:58:48" (2/3) ... [2024-10-24 15:58:56,961 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@16bc58f0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 03:58:56, skipping insertion in model container [2024-10-24 15:58:56,962 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 03:58:56" (3/3) ... [2024-10-24 15:58:56,963 INFO L112 eAbstractionObserver]: Analyzing ICFG uthash_SAX_test8-1.i [2024-10-24 15:58:56,980 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-24 15:58:56,980 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2024-10-24 15:58:57,040 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-24 15:58:57,047 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;@6bc6e788, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-24 15:58:57,051 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2024-10-24 15:58:57,056 INFO L276 IsEmpty]: Start isEmpty. Operand has 232 states, 203 states have (on average 1.6847290640394088) internal successors, (342), 222 states have internal predecessors, (342), 22 states have call successors, (22), 4 states have call predecessors, (22), 4 states have return successors, (22), 8 states have call predecessors, (22), 22 states have call successors, (22) [2024-10-24 15:58:57,063 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2024-10-24 15:58:57,063 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 15:58:57,063 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2024-10-24 15:58:57,064 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2024-10-24 15:58:57,068 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 15:58:57,069 INFO L85 PathProgramCache]: Analyzing trace with hash -1355016513, now seen corresponding path program 1 times [2024-10-24 15:58:57,082 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 15:58:57,083 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1140833357] [2024-10-24 15:58:57,083 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 15:58:57,083 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-24 15:58:57,084 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 15:58:57,087 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-24 15:58:57,088 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-24 15:58:57,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 15:58:57,301 INFO L255 TraceCheckSpWp]: Trace formula consists of 65 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-10-24 15:58:57,307 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 15:58:57,314 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 15:58:57,315 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-24 15:58:57,316 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-24 15:58:57,316 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1140833357] [2024-10-24 15:58:57,317 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1140833357] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 15:58:57,318 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 15:58:57,318 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-24 15:58:57,320 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1297394250] [2024-10-24 15:58:57,321 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 15:58:57,325 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-24 15:58:57,325 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-24 15:58:57,354 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-24 15:58:57,355 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-24 15:58:57,358 INFO L87 Difference]: Start difference. First operand has 232 states, 203 states have (on average 1.6847290640394088) internal successors, (342), 222 states have internal predecessors, (342), 22 states have call successors, (22), 4 states have call predecessors, (22), 4 states have return successors, (22), 8 states have call predecessors, (22), 22 states have call successors, (22) Second operand has 2 states, 2 states have (on average 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-24 15:58:57,442 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 15:58:57,442 INFO L93 Difference]: Finished difference Result 230 states and 315 transitions. [2024-10-24 15:58:57,444 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-24 15:58:57,445 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-24 15:58:57,446 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 15:58:57,455 INFO L225 Difference]: With dead ends: 230 [2024-10-24 15:58:57,455 INFO L226 Difference]: Without dead ends: 229 [2024-10-24 15:58:57,457 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-24 15:58:57,460 INFO L432 NwaCegarLoop]: 310 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 310 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-24 15:58:57,462 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 310 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-24 15:58:57,479 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 229 states. [2024-10-24 15:58:57,534 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 229 to 229. [2024-10-24 15:58:57,538 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 229 states, 202 states have (on average 1.3465346534653466) internal successors, (272), 219 states have internal predecessors, (272), 22 states have call successors, (22), 4 states have call predecessors, (22), 3 states have return successors, (20), 6 states have call predecessors, (20), 20 states have call successors, (20) [2024-10-24 15:58:57,547 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 229 states to 229 states and 314 transitions. [2024-10-24 15:58:57,548 INFO L78 Accepts]: Start accepts. Automaton has 229 states and 314 transitions. Word has length 6 [2024-10-24 15:58:57,548 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 15:58:57,548 INFO L471 AbstractCegarLoop]: Abstraction has 229 states and 314 transitions. [2024-10-24 15:58:57,548 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-24 15:58:57,549 INFO L276 IsEmpty]: Start isEmpty. Operand 229 states and 314 transitions. [2024-10-24 15:58:57,549 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2024-10-24 15:58:57,549 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 15:58:57,569 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 15:58:57,576 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2024-10-24 15:58:57,772 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-24 15:58:57,773 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2024-10-24 15:58:57,774 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 15:58:57,774 INFO L85 PathProgramCache]: Analyzing trace with hash -1715409022, now seen corresponding path program 1 times [2024-10-24 15:58:57,774 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 15:58:57,774 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1655190436] [2024-10-24 15:58:57,774 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 15:58:57,775 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-24 15:58:57,775 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 15:58:57,776 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-24 15:58:57,778 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-24 15:58:57,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 15:58:57,958 INFO L255 TraceCheckSpWp]: Trace formula consists of 67 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-10-24 15:58:57,961 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 15:58:57,993 INFO L173 IndexEqualityManager]: detected equality via solver [2024-10-24 15:58:57,994 INFO L173 IndexEqualityManager]: detected equality via solver [2024-10-24 15:58:57,995 INFO L173 IndexEqualityManager]: detected equality via solver [2024-10-24 15:58:58,005 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 39 [2024-10-24 15:58:58,083 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-24 15:58:58,085 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 70 treesize of output 26 [2024-10-24 15:58:58,112 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-24 15:58:58,112 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-24 15:58:58,112 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-24 15:58:58,112 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1655190436] [2024-10-24 15:58:58,112 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1655190436] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 15:58:58,113 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 15:58:58,113 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-24 15:58:58,113 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1121668374] [2024-10-24 15:58:58,113 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 15:58:58,116 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-24 15:58:58,116 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-24 15:58:58,117 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-24 15:58:58,117 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-24 15:58:58,118 INFO L87 Difference]: Start difference. First operand 229 states and 314 transitions. Second operand has 4 states, 4 states have (on average 2.0) internal successors, (8), 3 states have internal predecessors, (8), 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-24 15:58:58,768 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 15:58:58,768 INFO L93 Difference]: Finished difference Result 410 states and 552 transitions. [2024-10-24 15:58:58,769 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-24 15:58:58,769 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.0) internal successors, (8), 3 states have internal predecessors, (8), 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 8 [2024-10-24 15:58:58,769 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 15:58:58,772 INFO L225 Difference]: With dead ends: 410 [2024-10-24 15:58:58,772 INFO L226 Difference]: Without dead ends: 410 [2024-10-24 15:58:58,773 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-24 15:58:58,774 INFO L432 NwaCegarLoop]: 291 mSDtfsCounter, 224 mSDsluCounter, 575 mSDsCounter, 0 mSdLazyCounter, 74 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 229 SdHoareTripleChecker+Valid, 866 SdHoareTripleChecker+Invalid, 75 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 74 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-10-24 15:58:58,774 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [229 Valid, 866 Invalid, 75 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 74 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-10-24 15:58:58,776 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 410 states. [2024-10-24 15:58:58,801 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 410 to 231. [2024-10-24 15:58:58,802 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 231 states, 204 states have (on average 1.3431372549019607) internal successors, (274), 221 states have internal predecessors, (274), 22 states have call successors, (22), 4 states have call predecessors, (22), 3 states have return successors, (20), 6 states have call predecessors, (20), 20 states have call successors, (20) [2024-10-24 15:58:58,805 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 231 states to 231 states and 316 transitions. [2024-10-24 15:58:58,805 INFO L78 Accepts]: Start accepts. Automaton has 231 states and 316 transitions. Word has length 8 [2024-10-24 15:58:58,805 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 15:58:58,805 INFO L471 AbstractCegarLoop]: Abstraction has 231 states and 316 transitions. [2024-10-24 15:58:58,806 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.0) internal successors, (8), 3 states have internal predecessors, (8), 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-24 15:58:58,806 INFO L276 IsEmpty]: Start isEmpty. Operand 231 states and 316 transitions. [2024-10-24 15:58:58,808 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2024-10-24 15:58:58,809 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 15:58:58,809 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 15:58:58,815 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-24 15:58:59,009 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-24 15:58:59,010 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2024-10-24 15:58:59,010 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 15:58:59,010 INFO L85 PathProgramCache]: Analyzing trace with hash -1840569330, now seen corresponding path program 1 times [2024-10-24 15:58:59,012 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 15:58:59,012 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1890997158] [2024-10-24 15:58:59,012 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 15:58:59,012 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-24 15:58:59,012 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 15:58:59,013 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-24 15:58:59,014 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-24 15:58:59,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 15:58:59,350 INFO L255 TraceCheckSpWp]: Trace formula consists of 335 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-24 15:58:59,354 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 15:58:59,385 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-24 15:58:59,386 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-24 15:58:59,386 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-24 15:58:59,386 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1890997158] [2024-10-24 15:58:59,387 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1890997158] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 15:58:59,387 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 15:58:59,387 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-24 15:58:59,387 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1209464763] [2024-10-24 15:58:59,387 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 15:58:59,388 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-24 15:58:59,388 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-24 15:58:59,388 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-24 15:58:59,389 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-24 15:58:59,389 INFO L87 Difference]: Start difference. First operand 231 states and 316 transitions. Second operand has 4 states, 4 states have (on average 15.75) internal successors, (63), 4 states have internal predecessors, (63), 1 states have call successors, (3), 1 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 15:58:59,577 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 15:58:59,578 INFO L93 Difference]: Finished difference Result 234 states and 311 transitions. [2024-10-24 15:58:59,580 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-24 15:58:59,580 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 15.75) internal successors, (63), 4 states have internal predecessors, (63), 1 states have call successors, (3), 1 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 66 [2024-10-24 15:58:59,580 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 15:58:59,581 INFO L225 Difference]: With dead ends: 234 [2024-10-24 15:58:59,581 INFO L226 Difference]: Without dead ends: 234 [2024-10-24 15:58:59,582 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 63 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-24 15:58:59,583 INFO L432 NwaCegarLoop]: 280 mSDtfsCounter, 30 mSDsluCounter, 543 mSDsCounter, 0 mSdLazyCounter, 53 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 823 SdHoareTripleChecker+Invalid, 75 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 53 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-24 15:58:59,583 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 823 Invalid, 75 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 53 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-24 15:58:59,584 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 234 states. [2024-10-24 15:58:59,595 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 234 to 234. [2024-10-24 15:58:59,596 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 234 states, 207 states have (on average 1.2995169082125604) internal successors, (269), 224 states have internal predecessors, (269), 22 states have call successors, (22), 4 states have call predecessors, (22), 3 states have return successors, (20), 6 states have call predecessors, (20), 20 states have call successors, (20) [2024-10-24 15:58:59,598 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 234 states to 234 states and 311 transitions. [2024-10-24 15:58:59,598 INFO L78 Accepts]: Start accepts. Automaton has 234 states and 311 transitions. Word has length 66 [2024-10-24 15:58:59,598 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 15:58:59,598 INFO L471 AbstractCegarLoop]: Abstraction has 234 states and 311 transitions. [2024-10-24 15:58:59,599 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.75) internal successors, (63), 4 states have internal predecessors, (63), 1 states have call successors, (3), 1 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 15:58:59,599 INFO L276 IsEmpty]: Start isEmpty. Operand 234 states and 311 transitions. [2024-10-24 15:58:59,603 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2024-10-24 15:58:59,604 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 15:58:59,604 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 15:58:59,612 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-24 15:58:59,804 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-24 15:58:59,805 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2024-10-24 15:58:59,805 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 15:58:59,805 INFO L85 PathProgramCache]: Analyzing trace with hash -1862455934, now seen corresponding path program 1 times [2024-10-24 15:58:59,806 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 15:58:59,807 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1632208346] [2024-10-24 15:58:59,807 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 15:58:59,807 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-24 15:58:59,807 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 15:58:59,810 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-24 15:58:59,814 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-24 15:59:00,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 15:59:00,179 INFO L255 TraceCheckSpWp]: Trace formula consists of 323 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-10-24 15:59:00,181 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 15:59:00,338 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-24 15:59:00,339 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-24 15:59:00,339 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-24 15:59:00,339 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1632208346] [2024-10-24 15:59:00,339 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1632208346] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 15:59:00,339 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 15:59:00,339 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-24 15:59:00,340 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [400979533] [2024-10-24 15:59:00,340 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 15:59:00,340 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-24 15:59:00,341 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-24 15:59:00,341 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-24 15:59:00,341 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-24 15:59:00,342 INFO L87 Difference]: Start difference. First operand 234 states and 311 transitions. Second operand has 5 states, 5 states have (on average 12.6) internal successors, (63), 5 states have internal predecessors, (63), 1 states have call successors, (3), 1 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 15:59:00,474 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 15:59:00,474 INFO L93 Difference]: Finished difference Result 228 states and 301 transitions. [2024-10-24 15:59:00,476 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-24 15:59:00,476 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.6) internal successors, (63), 5 states have internal predecessors, (63), 1 states have call successors, (3), 1 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 66 [2024-10-24 15:59:00,477 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 15:59:00,478 INFO L225 Difference]: With dead ends: 228 [2024-10-24 15:59:00,478 INFO L226 Difference]: Without dead ends: 228 [2024-10-24 15:59:00,478 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 62 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-24 15:59:00,479 INFO L432 NwaCegarLoop]: 279 mSDtfsCounter, 0 mSDsluCounter, 541 mSDsCounter, 0 mSdLazyCounter, 64 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 820 SdHoareTripleChecker+Invalid, 67 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 64 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-24 15:59:00,481 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 820 Invalid, 67 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 64 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-24 15:59:00,482 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 228 states. [2024-10-24 15:59:00,493 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 228 to 228. [2024-10-24 15:59:00,493 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 228 states, 201 states have (on average 1.2885572139303483) internal successors, (259), 218 states have internal predecessors, (259), 22 states have call successors, (22), 4 states have call predecessors, (22), 3 states have return successors, (20), 6 states have call predecessors, (20), 20 states have call successors, (20) [2024-10-24 15:59:00,498 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 228 states to 228 states and 301 transitions. [2024-10-24 15:59:00,498 INFO L78 Accepts]: Start accepts. Automaton has 228 states and 301 transitions. Word has length 66 [2024-10-24 15:59:00,498 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 15:59:00,498 INFO L471 AbstractCegarLoop]: Abstraction has 228 states and 301 transitions. [2024-10-24 15:59:00,499 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.6) internal successors, (63), 5 states have internal predecessors, (63), 1 states have call successors, (3), 1 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 15:59:00,499 INFO L276 IsEmpty]: Start isEmpty. Operand 228 states and 301 transitions. [2024-10-24 15:59:00,500 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2024-10-24 15:59:00,500 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 15:59:00,503 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 15:59:00,514 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-24 15:59:00,704 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-24 15:59:00,704 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2024-10-24 15:59:00,704 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 15:59:00,704 INFO L85 PathProgramCache]: Analyzing trace with hash -1468089148, now seen corresponding path program 1 times [2024-10-24 15:59:00,705 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 15:59:00,705 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [226900678] [2024-10-24 15:59:00,705 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 15:59:00,705 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-24 15:59:00,705 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 15:59:00,709 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-24 15:59:00,710 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-24 15:59:01,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 15:59:01,064 INFO L255 TraceCheckSpWp]: Trace formula consists of 325 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-24 15:59:01,067 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 15:59:01,396 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-24 15:59:01,396 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-24 15:59:01,396 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-24 15:59:01,396 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [226900678] [2024-10-24 15:59:01,396 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [226900678] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 15:59:01,396 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 15:59:01,397 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-24 15:59:01,397 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1448203546] [2024-10-24 15:59:01,397 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 15:59:01,398 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-24 15:59:01,399 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-24 15:59:01,399 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-24 15:59:01,400 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-24 15:59:01,400 INFO L87 Difference]: Start difference. First operand 228 states and 301 transitions. Second operand has 3 states, 3 states have (on average 21.0) internal successors, (63), 2 states have internal predecessors, (63), 1 states have call successors, (3), 1 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 15:59:02,066 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 15:59:02,067 INFO L93 Difference]: Finished difference Result 337 states and 432 transitions. [2024-10-24 15:59:02,067 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-24 15:59:02,067 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 21.0) internal successors, (63), 2 states have internal predecessors, (63), 1 states have call successors, (3), 1 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 66 [2024-10-24 15:59:02,068 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 15:59:02,069 INFO L225 Difference]: With dead ends: 337 [2024-10-24 15:59:02,069 INFO L226 Difference]: Without dead ends: 337 [2024-10-24 15:59:02,070 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 64 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-24 15:59:02,070 INFO L432 NwaCegarLoop]: 342 mSDtfsCounter, 89 mSDsluCounter, 273 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 90 SdHoareTripleChecker+Valid, 615 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.7s IncrementalHoareTripleChecker+Time [2024-10-24 15:59:02,071 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [90 Valid, 615 Invalid, 41 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-10-24 15:59:02,072 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 337 states. [2024-10-24 15:59:02,080 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 337 to 332. [2024-10-24 15:59:02,081 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 332 states, 304 states have (on average 1.263157894736842) internal successors, (384), 321 states have internal predecessors, (384), 23 states have call successors, (23), 4 states have call predecessors, (23), 3 states have return successors, (21), 7 states have call predecessors, (21), 21 states have call successors, (21) [2024-10-24 15:59:02,083 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 332 states to 332 states and 428 transitions. [2024-10-24 15:59:02,083 INFO L78 Accepts]: Start accepts. Automaton has 332 states and 428 transitions. Word has length 66 [2024-10-24 15:59:02,083 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 15:59:02,083 INFO L471 AbstractCegarLoop]: Abstraction has 332 states and 428 transitions. [2024-10-24 15:59:02,084 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 21.0) internal successors, (63), 2 states have internal predecessors, (63), 1 states have call successors, (3), 1 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 15:59:02,084 INFO L276 IsEmpty]: Start isEmpty. Operand 332 states and 428 transitions. [2024-10-24 15:59:02,085 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2024-10-24 15:59:02,085 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 15:59:02,085 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 15:59:02,098 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 (6)] Forceful destruction successful, exit code 0 [2024-10-24 15:59:02,286 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-24 15:59:02,286 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2024-10-24 15:59:02,287 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 15:59:02,287 INFO L85 PathProgramCache]: Analyzing trace with hash 1848326325, now seen corresponding path program 1 times [2024-10-24 15:59:02,288 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 15:59:02,288 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [326563351] [2024-10-24 15:59:02,288 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 15:59:02,288 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-24 15:59:02,288 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 15:59:02,289 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-24 15:59:02,290 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-24 15:59:02,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 15:59:02,707 INFO L255 TraceCheckSpWp]: Trace formula consists of 454 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-24 15:59:02,711 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 15:59:02,732 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 15:59:02,734 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-24 15:59:02,734 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-24 15:59:02,734 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [326563351] [2024-10-24 15:59:02,734 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [326563351] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 15:59:02,735 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 15:59:02,735 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-24 15:59:02,735 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1876389973] [2024-10-24 15:59:02,735 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 15:59:02,736 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-24 15:59:02,736 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-24 15:59:02,737 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-24 15:59:02,737 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-24 15:59:02,737 INFO L87 Difference]: Start difference. First operand 332 states and 428 transitions. Second operand has 4 states, 3 states have (on average 24.0) internal successors, (72), 4 states have internal predecessors, (72), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2024-10-24 15:59:02,841 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 15:59:02,841 INFO L93 Difference]: Finished difference Result 334 states and 431 transitions. [2024-10-24 15:59:02,843 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-24 15:59:02,843 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 24.0) internal successors, (72), 4 states have internal predecessors, (72), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) Word has length 79 [2024-10-24 15:59:02,843 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 15:59:02,845 INFO L225 Difference]: With dead ends: 334 [2024-10-24 15:59:02,845 INFO L226 Difference]: Without dead ends: 334 [2024-10-24 15:59:02,845 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 76 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-24 15:59:02,846 INFO L432 NwaCegarLoop]: 293 mSDtfsCounter, 0 mSDsluCounter, 582 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 875 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-24 15:59:02,846 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 875 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-24 15:59:02,847 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 334 states. [2024-10-24 15:59:02,854 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 334 to 334. [2024-10-24 15:59:02,854 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 334 states, 305 states have (on average 1.2655737704918033) internal successors, (386), 323 states have internal predecessors, (386), 23 states have call successors, (23), 4 states have call predecessors, (23), 4 states have return successors, (22), 7 states have call predecessors, (22), 21 states have call successors, (22) [2024-10-24 15:59:02,856 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 334 states to 334 states and 431 transitions. [2024-10-24 15:59:02,856 INFO L78 Accepts]: Start accepts. Automaton has 334 states and 431 transitions. Word has length 79 [2024-10-24 15:59:02,857 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 15:59:02,857 INFO L471 AbstractCegarLoop]: Abstraction has 334 states and 431 transitions. [2024-10-24 15:59:02,857 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 24.0) internal successors, (72), 4 states have internal predecessors, (72), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2024-10-24 15:59:02,857 INFO L276 IsEmpty]: Start isEmpty. Operand 334 states and 431 transitions. [2024-10-24 15:59:02,858 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2024-10-24 15:59:02,858 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 15:59:02,859 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 15:59:02,874 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-24 15:59:03,059 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-24 15:59:03,059 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2024-10-24 15:59:03,060 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 15:59:03,060 INFO L85 PathProgramCache]: Analyzing trace with hash -1458208439, now seen corresponding path program 1 times [2024-10-24 15:59:03,061 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 15:59:03,061 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1751057865] [2024-10-24 15:59:03,061 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 15:59:03,061 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-24 15:59:03,061 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 15:59:03,064 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-24 15:59:03,065 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-24 15:59:03,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 15:59:03,470 INFO L255 TraceCheckSpWp]: Trace formula consists of 476 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-10-24 15:59:03,472 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 15:59:03,501 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 6 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-10-24 15:59:03,501 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-24 15:59:03,597 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-10-24 15:59:03,598 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-24 15:59:03,598 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1751057865] [2024-10-24 15:59:03,598 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1751057865] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-24 15:59:03,598 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-24 15:59:03,599 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 8 [2024-10-24 15:59:03,599 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1772616912] [2024-10-24 15:59:03,599 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-24 15:59:03,599 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-24 15:59:03,600 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-24 15:59:03,600 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-24 15:59:03,600 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2024-10-24 15:59:03,600 INFO L87 Difference]: Start difference. First operand 334 states and 431 transitions. Second operand has 8 states, 6 states have (on average 13.333333333333334) internal successors, (80), 8 states have internal predecessors, (80), 2 states have call successors, (6), 2 states have call predecessors, (6), 4 states have return successors, (4), 1 states have call predecessors, (4), 2 states have call successors, (4) [2024-10-24 15:59:03,875 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 15:59:03,875 INFO L93 Difference]: Finished difference Result 343 states and 445 transitions. [2024-10-24 15:59:03,876 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-10-24 15:59:03,876 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 6 states have (on average 13.333333333333334) internal successors, (80), 8 states have internal predecessors, (80), 2 states have call successors, (6), 2 states have call predecessors, (6), 4 states have return successors, (4), 1 states have call predecessors, (4), 2 states have call successors, (4) Word has length 81 [2024-10-24 15:59:03,877 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 15:59:03,882 INFO L225 Difference]: With dead ends: 343 [2024-10-24 15:59:03,882 INFO L226 Difference]: Without dead ends: 343 [2024-10-24 15:59:03,882 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 163 GetRequests, 154 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=44, Invalid=66, Unknown=0, NotChecked=0, Total=110 [2024-10-24 15:59:03,883 INFO L432 NwaCegarLoop]: 293 mSDtfsCounter, 4 mSDsluCounter, 1159 mSDsCounter, 0 mSdLazyCounter, 65 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 1452 SdHoareTripleChecker+Invalid, 70 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 65 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-24 15:59:03,883 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 1452 Invalid, 70 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 65 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-24 15:59:03,884 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 343 states. [2024-10-24 15:59:03,899 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 343 to 342. [2024-10-24 15:59:03,900 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 342 states, 312 states have (on average 1.2788461538461537) internal successors, (399), 330 states have internal predecessors, (399), 23 states have call successors, (23), 5 states have call predecessors, (23), 5 states have return successors, (22), 7 states have call predecessors, (22), 21 states have call successors, (22) [2024-10-24 15:59:03,902 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 342 states to 342 states and 444 transitions. [2024-10-24 15:59:03,902 INFO L78 Accepts]: Start accepts. Automaton has 342 states and 444 transitions. Word has length 81 [2024-10-24 15:59:03,902 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 15:59:03,902 INFO L471 AbstractCegarLoop]: Abstraction has 342 states and 444 transitions. [2024-10-24 15:59:03,903 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 6 states have (on average 13.333333333333334) internal successors, (80), 8 states have internal predecessors, (80), 2 states have call successors, (6), 2 states have call predecessors, (6), 4 states have return successors, (4), 1 states have call predecessors, (4), 2 states have call successors, (4) [2024-10-24 15:59:03,903 INFO L276 IsEmpty]: Start isEmpty. Operand 342 states and 444 transitions. [2024-10-24 15:59:03,904 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2024-10-24 15:59:03,904 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 15:59:03,904 INFO L215 NwaCegarLoop]: trace histogram [6, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 15:59:03,916 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-24 15:59:04,105 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-24 15:59:04,105 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2024-10-24 15:59:04,106 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 15:59:04,106 INFO L85 PathProgramCache]: Analyzing trace with hash 1972245077, now seen corresponding path program 2 times [2024-10-24 15:59:04,106 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 15:59:04,106 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1374491479] [2024-10-24 15:59:04,107 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-10-24 15:59:04,107 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-24 15:59:04,107 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 15:59:04,108 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-24 15:59:04,109 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-24 15:59:05,638 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-10-24 15:59:05,639 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-24 15:59:05,660 INFO L255 TraceCheckSpWp]: Trace formula consists of 520 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-10-24 15:59:05,662 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 15:59:05,720 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 16 proven. 3 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2024-10-24 15:59:05,720 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-24 15:59:05,846 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 16 proven. 3 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2024-10-24 15:59:05,846 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-24 15:59:05,846 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1374491479] [2024-10-24 15:59:05,847 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1374491479] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-24 15:59:05,847 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-24 15:59:05,847 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 10 [2024-10-24 15:59:05,847 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [764306382] [2024-10-24 15:59:05,847 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-24 15:59:05,847 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-10-24 15:59:05,848 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-24 15:59:05,848 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-10-24 15:59:05,848 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2024-10-24 15:59:05,848 INFO L87 Difference]: Start difference. First operand 342 states and 444 transitions. Second operand has 10 states, 8 states have (on average 9.875) internal successors, (79), 10 states have internal predecessors, (79), 2 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2024-10-24 15:59:06,116 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 15:59:06,116 INFO L93 Difference]: Finished difference Result 348 states and 454 transitions. [2024-10-24 15:59:06,118 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-10-24 15:59:06,119 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 8 states have (on average 9.875) internal successors, (79), 10 states have internal predecessors, (79), 2 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) Word has length 85 [2024-10-24 15:59:06,119 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 15:59:06,121 INFO L225 Difference]: With dead ends: 348 [2024-10-24 15:59:06,121 INFO L226 Difference]: Without dead ends: 348 [2024-10-24 15:59:06,121 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 173 GetRequests, 160 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=80, Invalid=130, Unknown=0, NotChecked=0, Total=210 [2024-10-24 15:59:06,122 INFO L432 NwaCegarLoop]: 292 mSDtfsCounter, 6 mSDsluCounter, 869 mSDsCounter, 0 mSdLazyCounter, 64 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 1161 SdHoareTripleChecker+Invalid, 73 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 64 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-24 15:59:06,122 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 1161 Invalid, 73 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 64 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-24 15:59:06,127 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 348 states. [2024-10-24 15:59:06,138 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 348 to 346. [2024-10-24 15:59:06,138 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 346 states, 316 states have (on average 1.2879746835443038) internal successors, (407), 334 states have internal predecessors, (407), 23 states have call successors, (23), 5 states have call predecessors, (23), 5 states have return successors, (22), 7 states have call predecessors, (22), 21 states have call successors, (22) [2024-10-24 15:59:06,141 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 346 states to 346 states and 452 transitions. [2024-10-24 15:59:06,141 INFO L78 Accepts]: Start accepts. Automaton has 346 states and 452 transitions. Word has length 85 [2024-10-24 15:59:06,141 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 15:59:06,141 INFO L471 AbstractCegarLoop]: Abstraction has 346 states and 452 transitions. [2024-10-24 15:59:06,142 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 8 states have (on average 9.875) internal successors, (79), 10 states have internal predecessors, (79), 2 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2024-10-24 15:59:06,142 INFO L276 IsEmpty]: Start isEmpty. Operand 346 states and 452 transitions. [2024-10-24 15:59:06,143 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2024-10-24 15:59:06,145 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 15:59:06,145 INFO L215 NwaCegarLoop]: trace histogram [10, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 15:59:06,163 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-24 15:59:06,346 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-24 15:59:06,347 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2024-10-24 15:59:06,347 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 15:59:06,347 INFO L85 PathProgramCache]: Analyzing trace with hash 1294881813, now seen corresponding path program 3 times [2024-10-24 15:59:06,347 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 15:59:06,348 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [255811155] [2024-10-24 15:59:06,348 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-10-24 15:59:06,348 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-24 15:59:06,348 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 15:59:06,349 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-24 15:59:06,350 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-24 15:59:08,423 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2024-10-24 15:59:08,423 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-24 15:59:08,454 INFO L255 TraceCheckSpWp]: Trace formula consists of 564 conjuncts, 10 conjuncts are in the unsatisfiable core [2024-10-24 15:59:08,456 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 15:59:08,593 INFO L134 CoverageAnalysis]: Checked inductivity of 68 backedges. 36 proven. 21 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2024-10-24 15:59:08,594 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-24 15:59:09,072 INFO L134 CoverageAnalysis]: Checked inductivity of 68 backedges. 36 proven. 21 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2024-10-24 15:59:09,073 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-24 15:59:09,073 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [255811155] [2024-10-24 15:59:09,073 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [255811155] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-24 15:59:09,073 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-24 15:59:09,073 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 18 [2024-10-24 15:59:09,073 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [296721956] [2024-10-24 15:59:09,073 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-24 15:59:09,074 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2024-10-24 15:59:09,076 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-24 15:59:09,077 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2024-10-24 15:59:09,077 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=97, Invalid=209, Unknown=0, NotChecked=0, Total=306 [2024-10-24 15:59:09,078 INFO L87 Difference]: Start difference. First operand 346 states and 452 transitions. Second operand has 18 states, 16 states have (on average 5.4375) internal successors, (87), 18 states have internal predecessors, (87), 2 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2024-10-24 15:59:09,948 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 15:59:09,948 INFO L93 Difference]: Finished difference Result 360 states and 475 transitions. [2024-10-24 15:59:09,949 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2024-10-24 15:59:09,949 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 16 states have (on average 5.4375) internal successors, (87), 18 states have internal predecessors, (87), 2 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) Word has length 89 [2024-10-24 15:59:09,949 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 15:59:09,951 INFO L225 Difference]: With dead ends: 360 [2024-10-24 15:59:09,951 INFO L226 Difference]: Without dead ends: 358 [2024-10-24 15:59:09,951 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 189 GetRequests, 160 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 120 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=324, Invalid=606, Unknown=0, NotChecked=0, Total=930 [2024-10-24 15:59:09,952 INFO L432 NwaCegarLoop]: 292 mSDtfsCounter, 9 mSDsluCounter, 2024 mSDsCounter, 0 mSdLazyCounter, 202 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 2316 SdHoareTripleChecker+Invalid, 208 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 202 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-24 15:59:09,953 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 2316 Invalid, 208 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 202 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-24 15:59:09,954 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 358 states. [2024-10-24 15:59:09,962 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 358 to 357. [2024-10-24 15:59:09,963 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 357 states, 327 states have (on average 1.305810397553517) internal successors, (427), 345 states have internal predecessors, (427), 23 states have call successors, (23), 5 states have call predecessors, (23), 5 states have return successors, (22), 7 states have call predecessors, (22), 21 states have call successors, (22) [2024-10-24 15:59:09,964 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 357 states to 357 states and 472 transitions. [2024-10-24 15:59:09,964 INFO L78 Accepts]: Start accepts. Automaton has 357 states and 472 transitions. Word has length 89 [2024-10-24 15:59:09,965 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 15:59:09,966 INFO L471 AbstractCegarLoop]: Abstraction has 357 states and 472 transitions. [2024-10-24 15:59:09,967 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 16 states have (on average 5.4375) internal successors, (87), 18 states have internal predecessors, (87), 2 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2024-10-24 15:59:09,967 INFO L276 IsEmpty]: Start isEmpty. Operand 357 states and 472 transitions. [2024-10-24 15:59:09,968 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2024-10-24 15:59:09,968 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 15:59:09,968 INFO L215 NwaCegarLoop]: trace histogram [18, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 15:59:09,985 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Forceful destruction successful, exit code 0 [2024-10-24 15:59:10,169 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-24 15:59:10,169 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2024-10-24 15:59:10,170 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 15:59:10,170 INFO L85 PathProgramCache]: Analyzing trace with hash -1099286635, now seen corresponding path program 4 times [2024-10-24 15:59:10,170 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 15:59:10,170 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [659682815] [2024-10-24 15:59:10,170 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2024-10-24 15:59:10,171 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-24 15:59:10,171 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 15:59:10,173 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-24 15:59:10,174 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-24 15:59:10,715 INFO L227 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2024-10-24 15:59:10,715 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-24 15:59:10,734 INFO L255 TraceCheckSpWp]: Trace formula consists of 652 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-10-24 15:59:10,737 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 15:59:10,790 INFO L134 CoverageAnalysis]: Checked inductivity of 192 backedges. 77 proven. 10 refuted. 0 times theorem prover too weak. 105 trivial. 0 not checked. [2024-10-24 15:59:10,790 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-24 15:59:10,984 INFO L134 CoverageAnalysis]: Checked inductivity of 192 backedges. 0 proven. 86 refuted. 0 times theorem prover too weak. 106 trivial. 0 not checked. [2024-10-24 15:59:10,984 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-24 15:59:10,984 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [659682815] [2024-10-24 15:59:10,984 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [659682815] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-24 15:59:10,984 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-24 15:59:10,984 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 14 [2024-10-24 15:59:10,984 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1465000414] [2024-10-24 15:59:10,985 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-24 15:59:10,985 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-10-24 15:59:10,985 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-24 15:59:10,986 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-10-24 15:59:10,986 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=121, Unknown=0, NotChecked=0, Total=182 [2024-10-24 15:59:10,987 INFO L87 Difference]: Start difference. First operand 357 states and 472 transitions. Second operand has 14 states, 12 states have (on average 7.166666666666667) internal successors, (86), 14 states have internal predecessors, (86), 2 states have call successors, (6), 2 states have call predecessors, (6), 4 states have return successors, (4), 1 states have call predecessors, (4), 2 states have call successors, (4) [2024-10-24 15:59:11,483 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 15:59:11,483 INFO L93 Difference]: Finished difference Result 363 states and 479 transitions. [2024-10-24 15:59:11,484 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2024-10-24 15:59:11,484 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 12 states have (on average 7.166666666666667) internal successors, (86), 14 states have internal predecessors, (86), 2 states have call successors, (6), 2 states have call predecessors, (6), 4 states have return successors, (4), 1 states have call predecessors, (4), 2 states have call successors, (4) Word has length 97 [2024-10-24 15:59:11,485 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 15:59:11,486 INFO L225 Difference]: With dead ends: 363 [2024-10-24 15:59:11,486 INFO L226 Difference]: Without dead ends: 361 [2024-10-24 15:59:11,487 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 201 GetRequests, 180 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=182, Invalid=324, Unknown=0, NotChecked=0, Total=506 [2024-10-24 15:59:11,487 INFO L432 NwaCegarLoop]: 293 mSDtfsCounter, 7 mSDsluCounter, 1741 mSDsCounter, 0 mSdLazyCounter, 184 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 2034 SdHoareTripleChecker+Invalid, 193 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 184 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-24 15:59:11,487 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 2034 Invalid, 193 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 184 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-24 15:59:11,488 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 361 states. [2024-10-24 15:59:11,494 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 361 to 360. [2024-10-24 15:59:11,495 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 360 states, 330 states have (on average 1.2969696969696969) internal successors, (428), 348 states have internal predecessors, (428), 23 states have call successors, (23), 5 states have call predecessors, (23), 5 states have return successors, (22), 7 states have call predecessors, (22), 21 states have call successors, (22) [2024-10-24 15:59:11,496 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 360 states to 360 states and 473 transitions. [2024-10-24 15:59:11,496 INFO L78 Accepts]: Start accepts. Automaton has 360 states and 473 transitions. Word has length 97 [2024-10-24 15:59:11,496 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 15:59:11,497 INFO L471 AbstractCegarLoop]: Abstraction has 360 states and 473 transitions. [2024-10-24 15:59:11,497 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 12 states have (on average 7.166666666666667) internal successors, (86), 14 states have internal predecessors, (86), 2 states have call successors, (6), 2 states have call predecessors, (6), 4 states have return successors, (4), 1 states have call predecessors, (4), 2 states have call successors, (4) [2024-10-24 15:59:11,497 INFO L276 IsEmpty]: Start isEmpty. Operand 360 states and 473 transitions. [2024-10-24 15:59:11,498 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2024-10-24 15:59:11,498 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 15:59:11,498 INFO L215 NwaCegarLoop]: trace histogram [24, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 15:59:11,512 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Ended with exit code 0 [2024-10-24 15:59:11,698 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-24 15:59:11,699 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2024-10-24 15:59:11,699 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 15:59:11,699 INFO L85 PathProgramCache]: Analyzing trace with hash 953500341, now seen corresponding path program 5 times [2024-10-24 15:59:11,700 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 15:59:11,700 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2018826725] [2024-10-24 15:59:11,700 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2024-10-24 15:59:11,700 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-24 15:59:11,700 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 15:59:11,701 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-24 15:59:11,703 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-24 15:59:12,943 INFO L227 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 8 check-sat command(s) [2024-10-24 15:59:12,943 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-24 15:59:12,969 INFO L255 TraceCheckSpWp]: Trace formula consists of 718 conjuncts, 13 conjuncts are in the unsatisfiable core [2024-10-24 15:59:12,972 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 15:59:13,176 INFO L134 CoverageAnalysis]: Checked inductivity of 327 backedges. 167 proven. 55 refuted. 0 times theorem prover too weak. 105 trivial. 0 not checked. [2024-10-24 15:59:13,176 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-24 15:59:13,683 INFO L134 CoverageAnalysis]: Checked inductivity of 327 backedges. 0 proven. 221 refuted. 0 times theorem prover too weak. 106 trivial. 0 not checked. [2024-10-24 15:59:13,684 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-24 15:59:13,684 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2018826725] [2024-10-24 15:59:13,684 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2018826725] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-24 15:59:13,684 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-24 15:59:13,684 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 26 [2024-10-24 15:59:13,684 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [385381833] [2024-10-24 15:59:13,684 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-24 15:59:13,685 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2024-10-24 15:59:13,685 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-24 15:59:13,686 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2024-10-24 15:59:13,686 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=193, Invalid=457, Unknown=0, NotChecked=0, Total=650 [2024-10-24 15:59:13,686 INFO L87 Difference]: Start difference. First operand 360 states and 473 transitions. Second operand has 26 states, 24 states have (on average 4.083333333333333) internal successors, (98), 26 states have internal predecessors, (98), 2 states have call successors, (6), 2 states have call predecessors, (6), 4 states have return successors, (4), 1 states have call predecessors, (4), 2 states have call successors, (4) [2024-10-24 15:59:15,343 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 15:59:15,343 INFO L93 Difference]: Finished difference Result 375 states and 498 transitions. [2024-10-24 15:59:15,344 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2024-10-24 15:59:15,345 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 24 states have (on average 4.083333333333333) internal successors, (98), 26 states have internal predecessors, (98), 2 states have call successors, (6), 2 states have call predecessors, (6), 4 states have return successors, (4), 1 states have call predecessors, (4), 2 states have call successors, (4) Word has length 103 [2024-10-24 15:59:15,345 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 15:59:15,346 INFO L225 Difference]: With dead ends: 375 [2024-10-24 15:59:15,346 INFO L226 Difference]: Without dead ends: 373 [2024-10-24 15:59:15,347 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 225 GetRequests, 180 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-24 15:59:15,347 INFO L432 NwaCegarLoop]: 293 mSDtfsCounter, 14 mSDsluCounter, 4059 mSDsCounter, 0 mSdLazyCounter, 590 mSolverCounterSat, 34 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 4352 SdHoareTripleChecker+Invalid, 624 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 34 IncrementalHoareTripleChecker+Valid, 590 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-10-24 15:59:15,348 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 4352 Invalid, 624 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [34 Valid, 590 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-10-24 15:59:15,349 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 373 states. [2024-10-24 15:59:15,356 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 373 to 372. [2024-10-24 15:59:15,357 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 372 states, 342 states have (on average 1.286549707602339) internal successors, (440), 360 states have internal predecessors, (440), 23 states have call successors, (23), 5 states have call predecessors, (23), 5 states have return successors, (22), 7 states have call predecessors, (22), 21 states have call successors, (22) [2024-10-24 15:59:15,358 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 372 states to 372 states and 485 transitions. [2024-10-24 15:59:15,358 INFO L78 Accepts]: Start accepts. Automaton has 372 states and 485 transitions. Word has length 103 [2024-10-24 15:59:15,359 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 15:59:15,359 INFO L471 AbstractCegarLoop]: Abstraction has 372 states and 485 transitions. [2024-10-24 15:59:15,359 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 24 states have (on average 4.083333333333333) internal successors, (98), 26 states have internal predecessors, (98), 2 states have call successors, (6), 2 states have call predecessors, (6), 4 states have return successors, (4), 1 states have call predecessors, (4), 2 states have call successors, (4) [2024-10-24 15:59:15,359 INFO L276 IsEmpty]: Start isEmpty. Operand 372 states and 485 transitions. [2024-10-24 15:59:15,360 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2024-10-24 15:59:15,360 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 15:59:15,360 INFO L215 NwaCegarLoop]: trace histogram [36, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 15:59:15,380 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (12)] Ended with exit code 0 [2024-10-24 15:59:15,561 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-24 15:59:15,561 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2024-10-24 15:59:15,561 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 15:59:15,562 INFO L85 PathProgramCache]: Analyzing trace with hash -3747595, now seen corresponding path program 6 times [2024-10-24 15:59:15,562 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 15:59:15,562 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1261187632] [2024-10-24 15:59:15,562 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2024-10-24 15:59:15,562 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-24 15:59:15,562 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 15:59:15,564 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-24 15:59:15,564 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-24 15:59:19,872 INFO L227 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 13 check-sat command(s) [2024-10-24 15:59:19,872 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-24 15:59:19,907 INFO L255 TraceCheckSpWp]: Trace formula consists of 850 conjuncts, 26 conjuncts are in the unsatisfiable core [2024-10-24 15:59:19,910 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 15:59:20,330 INFO L134 CoverageAnalysis]: Checked inductivity of 705 backedges. 347 proven. 253 refuted. 0 times theorem prover too weak. 105 trivial. 0 not checked. [2024-10-24 15:59:20,330 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-24 15:59:21,984 INFO L134 CoverageAnalysis]: Checked inductivity of 705 backedges. 0 proven. 599 refuted. 0 times theorem prover too weak. 106 trivial. 0 not checked. [2024-10-24 15:59:21,984 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-24 15:59:21,984 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1261187632] [2024-10-24 15:59:21,985 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1261187632] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-24 15:59:21,985 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-24 15:59:21,985 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 26] total 50 [2024-10-24 15:59:21,985 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1185804355] [2024-10-24 15:59:21,985 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-24 15:59:21,985 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 50 states [2024-10-24 15:59:21,985 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-24 15:59:21,986 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2024-10-24 15:59:21,987 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=672, Invalid=1778, Unknown=0, NotChecked=0, Total=2450 [2024-10-24 15:59:21,987 INFO L87 Difference]: Start difference. First operand 372 states and 485 transitions. Second operand has 50 states, 48 states have (on average 2.5416666666666665) internal successors, (122), 50 states have internal predecessors, (122), 2 states have call successors, (6), 2 states have call predecessors, (6), 4 states have return successors, (4), 1 states have call predecessors, (4), 2 states have call successors, (4) [2024-10-24 15:59:28,521 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 15:59:28,521 INFO L93 Difference]: Finished difference Result 408 states and 551 transitions. [2024-10-24 15:59:28,522 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 73 states. [2024-10-24 15:59:28,523 INFO L78 Accepts]: Start accepts. Automaton has has 50 states, 48 states have (on average 2.5416666666666665) internal successors, (122), 50 states have internal predecessors, (122), 2 states have call successors, (6), 2 states have call predecessors, (6), 4 states have return successors, (4), 1 states have call predecessors, (4), 2 states have call successors, (4) Word has length 115 [2024-10-24 15:59:28,523 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 15:59:28,525 INFO L225 Difference]: With dead ends: 408 [2024-10-24 15:59:28,525 INFO L226 Difference]: Without dead ends: 405 [2024-10-24 15:59:28,530 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 272 GetRequests, 180 SyntacticMatches, 0 SemanticMatches, 92 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 485 ImplicationChecksByTransitivity, 5.6s TimeCoverageRelationStatistics Valid=2784, Invalid=5958, Unknown=0, NotChecked=0, Total=8742 [2024-10-24 15:59:28,531 INFO L432 NwaCegarLoop]: 293 mSDtfsCounter, 25 mSDsluCounter, 6670 mSDsCounter, 0 mSdLazyCounter, 1985 mSolverCounterSat, 39 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 6963 SdHoareTripleChecker+Invalid, 2024 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 39 IncrementalHoareTripleChecker+Valid, 1985 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.5s IncrementalHoareTripleChecker+Time [2024-10-24 15:59:28,531 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [25 Valid, 6963 Invalid, 2024 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [39 Valid, 1985 Invalid, 0 Unknown, 0 Unchecked, 2.5s Time] [2024-10-24 15:59:28,532 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 405 states. [2024-10-24 15:59:28,541 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 405 to 405. [2024-10-24 15:59:28,544 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 405 states, 375 states have (on average 1.2853333333333334) internal successors, (482), 393 states have internal predecessors, (482), 23 states have call successors, (23), 5 states have call predecessors, (23), 5 states have return successors, (22), 7 states have call predecessors, (22), 21 states have call successors, (22) [2024-10-24 15:59:28,545 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 405 states to 405 states and 527 transitions. [2024-10-24 15:59:28,546 INFO L78 Accepts]: Start accepts. Automaton has 405 states and 527 transitions. Word has length 115 [2024-10-24 15:59:28,546 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 15:59:28,546 INFO L471 AbstractCegarLoop]: Abstraction has 405 states and 527 transitions. [2024-10-24 15:59:28,546 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 50 states, 48 states have (on average 2.5416666666666665) internal successors, (122), 50 states have internal predecessors, (122), 2 states have call successors, (6), 2 states have call predecessors, (6), 4 states have return successors, (4), 1 states have call predecessors, (4), 2 states have call successors, (4) [2024-10-24 15:59:28,547 INFO L276 IsEmpty]: Start isEmpty. Operand 405 states and 527 transitions. [2024-10-24 15:59:28,548 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2024-10-24 15:59:28,548 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 15:59:28,548 INFO L215 NwaCegarLoop]: trace histogram [58, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 15:59:28,578 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-24 15:59:28,749 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-24 15:59:28,749 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2024-10-24 15:59:28,749 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 15:59:28,749 INFO L85 PathProgramCache]: Analyzing trace with hash -116136171, now seen corresponding path program 7 times [2024-10-24 15:59:28,750 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 15:59:28,750 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1582624160] [2024-10-24 15:59:28,750 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2024-10-24 15:59:28,750 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-24 15:59:28,750 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 15:59:28,752 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-24 15:59:28,759 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-24 15:59:29,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 15:59:29,631 INFO L255 TraceCheckSpWp]: Trace formula consists of 1092 conjuncts, 17 conjuncts are in the unsatisfiable core [2024-10-24 15:59:29,634 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 15:59:29,904 INFO L134 CoverageAnalysis]: Checked inductivity of 1772 backedges. 676 proven. 105 refuted. 0 times theorem prover too weak. 991 trivial. 0 not checked. [2024-10-24 15:59:29,904 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-24 15:59:30,696 INFO L134 CoverageAnalysis]: Checked inductivity of 1772 backedges. 676 proven. 105 refuted. 0 times theorem prover too weak. 991 trivial. 0 not checked. [2024-10-24 15:59:30,696 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-24 15:59:30,696 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1582624160] [2024-10-24 15:59:30,696 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1582624160] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-24 15:59:30,697 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-24 15:59:30,697 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 18] total 34 [2024-10-24 15:59:30,697 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [804249746] [2024-10-24 15:59:30,697 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-24 15:59:30,698 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2024-10-24 15:59:30,698 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-24 15:59:30,698 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2024-10-24 15:59:30,699 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=321, Invalid=801, Unknown=0, NotChecked=0, Total=1122 [2024-10-24 15:59:30,699 INFO L87 Difference]: Start difference. First operand 405 states and 527 transitions. Second operand has 34 states, 32 states have (on average 3.21875) internal successors, (103), 34 states have internal predecessors, (103), 2 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2024-10-24 15:59:33,511 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 15:59:33,511 INFO L93 Difference]: Finished difference Result 414 states and 543 transitions. [2024-10-24 15:59:33,512 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2024-10-24 15:59:33,513 INFO L78 Accepts]: Start accepts. Automaton has has 34 states, 32 states have (on average 3.21875) internal successors, (103), 34 states have internal predecessors, (103), 2 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) Word has length 137 [2024-10-24 15:59:33,513 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 15:59:33,515 INFO L225 Difference]: With dead ends: 414 [2024-10-24 15:59:33,515 INFO L226 Difference]: Without dead ends: 414 [2024-10-24 15:59:33,516 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 301 GetRequests, 240 SyntacticMatches, 0 SemanticMatches, 61 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 616 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=1292, Invalid=2614, Unknown=0, NotChecked=0, Total=3906 [2024-10-24 15:59:33,516 INFO L432 NwaCegarLoop]: 292 mSDtfsCounter, 18 mSDsluCounter, 5497 mSDsCounter, 0 mSdLazyCounter, 656 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 5789 SdHoareTripleChecker+Invalid, 682 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 656 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2024-10-24 15:59:33,517 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [18 Valid, 5789 Invalid, 682 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 656 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2024-10-24 15:59:33,518 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 414 states. [2024-10-24 15:59:33,523 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 414 to 412. [2024-10-24 15:59:33,524 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 412 states, 382 states have (on average 1.2984293193717278) internal successors, (496), 400 states have internal predecessors, (496), 23 states have call successors, (23), 5 states have call predecessors, (23), 5 states have return successors, (22), 7 states have call predecessors, (22), 21 states have call successors, (22) [2024-10-24 15:59:33,525 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 412 states to 412 states and 541 transitions. [2024-10-24 15:59:33,526 INFO L78 Accepts]: Start accepts. Automaton has 412 states and 541 transitions. Word has length 137 [2024-10-24 15:59:33,526 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 15:59:33,526 INFO L471 AbstractCegarLoop]: Abstraction has 412 states and 541 transitions. [2024-10-24 15:59:33,526 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 32 states have (on average 3.21875) internal successors, (103), 34 states have internal predecessors, (103), 2 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2024-10-24 15:59:33,527 INFO L276 IsEmpty]: Start isEmpty. Operand 412 states and 541 transitions. [2024-10-24 15:59:33,528 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2024-10-24 15:59:33,528 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 15:59:33,528 INFO L215 NwaCegarLoop]: trace histogram [74, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 15:59:33,550 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-24 15:59:33,728 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-24 15:59:33,729 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2024-10-24 15:59:33,729 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 15:59:33,730 INFO L85 PathProgramCache]: Analyzing trace with hash 1372204565, now seen corresponding path program 8 times [2024-10-24 15:59:33,730 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 15:59:33,731 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [768447808] [2024-10-24 15:59:33,731 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-10-24 15:59:33,731 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-24 15:59:33,731 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 15:59:33,734 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-24 15:59:33,736 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-24 15:59:35,401 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-10-24 15:59:35,401 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-24 15:59:35,433 INFO L255 TraceCheckSpWp]: Trace formula consists of 1268 conjuncts, 33 conjuncts are in the unsatisfiable core [2024-10-24 15:59:35,437 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 15:59:36,182 INFO L134 CoverageAnalysis]: Checked inductivity of 2852 backedges. 1396 proven. 465 refuted. 0 times theorem prover too weak. 991 trivial. 0 not checked. [2024-10-24 15:59:36,182 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-24 15:59:38,605 INFO L134 CoverageAnalysis]: Checked inductivity of 2852 backedges. 1396 proven. 465 refuted. 0 times theorem prover too weak. 991 trivial. 0 not checked. [2024-10-24 15:59:38,606 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-24 15:59:38,606 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [768447808] [2024-10-24 15:59:38,606 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [768447808] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-24 15:59:38,606 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-24 15:59:38,606 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [34, 34] total 66 [2024-10-24 15:59:38,606 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [508163861] [2024-10-24 15:59:38,606 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-24 15:59:38,606 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 66 states [2024-10-24 15:59:38,606 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-24 15:59:38,607 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 66 interpolants. [2024-10-24 15:59:38,608 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1153, Invalid=3137, Unknown=0, NotChecked=0, Total=4290 [2024-10-24 15:59:38,608 INFO L87 Difference]: Start difference. First operand 412 states and 541 transitions. Second operand has 66 states, 64 states have (on average 2.109375) internal successors, (135), 66 states have internal predecessors, (135), 2 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2024-10-24 15:59:50,926 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 15:59:50,926 INFO L93 Difference]: Finished difference Result 446 states and 607 transitions. [2024-10-24 15:59:50,927 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 97 states. [2024-10-24 15:59:50,928 INFO L78 Accepts]: Start accepts. Automaton has has 66 states, 64 states have (on average 2.109375) internal successors, (135), 66 states have internal predecessors, (135), 2 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) Word has length 153 [2024-10-24 15:59:50,928 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 15:59:50,930 INFO L225 Difference]: With dead ends: 446 [2024-10-24 15:59:50,930 INFO L226 Difference]: Without dead ends: 446 [2024-10-24 15:59:50,934 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 365 GetRequests, 240 SyntacticMatches, 0 SemanticMatches, 125 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2760 ImplicationChecksByTransitivity, 11.9s TimeCoverageRelationStatistics Valid=5148, Invalid=10854, Unknown=0, NotChecked=0, Total=16002 [2024-10-24 15:59:50,935 INFO L432 NwaCegarLoop]: 292 mSDtfsCounter, 33 mSDsluCounter, 9251 mSDsCounter, 0 mSdLazyCounter, 2273 mSolverCounterSat, 36 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 33 SdHoareTripleChecker+Valid, 9543 SdHoareTripleChecker+Invalid, 2309 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 36 IncrementalHoareTripleChecker+Valid, 2273 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.0s IncrementalHoareTripleChecker+Time [2024-10-24 15:59:50,935 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [33 Valid, 9543 Invalid, 2309 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [36 Valid, 2273 Invalid, 0 Unknown, 0 Unchecked, 3.0s Time] [2024-10-24 15:59:50,938 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 446 states. [2024-10-24 15:59:50,946 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 446 to 444. [2024-10-24 15:59:50,948 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 444 states, 414 states have (on average 1.3526570048309179) internal successors, (560), 432 states have internal predecessors, (560), 23 states have call successors, (23), 5 states have call predecessors, (23), 5 states have return successors, (22), 7 states have call predecessors, (22), 21 states have call successors, (22) [2024-10-24 15:59:50,950 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 444 states to 444 states and 605 transitions. [2024-10-24 15:59:50,950 INFO L78 Accepts]: Start accepts. Automaton has 444 states and 605 transitions. Word has length 153 [2024-10-24 15:59:50,950 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 15:59:50,950 INFO L471 AbstractCegarLoop]: Abstraction has 444 states and 605 transitions. [2024-10-24 15:59:50,951 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 66 states, 64 states have (on average 2.109375) internal successors, (135), 66 states have internal predecessors, (135), 2 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2024-10-24 15:59:50,951 INFO L276 IsEmpty]: Start isEmpty. Operand 444 states and 605 transitions. [2024-10-24 15:59:50,952 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 186 [2024-10-24 15:59:50,953 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 15:59:50,953 INFO L215 NwaCegarLoop]: trace histogram [106, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 15:59:50,982 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 (15)] Forceful destruction successful, exit code 0 [2024-10-24 15:59:51,153 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-24 15:59:51,154 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2024-10-24 15:59:51,154 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 15:59:51,155 INFO L85 PathProgramCache]: Analyzing trace with hash 1894562837, now seen corresponding path program 9 times [2024-10-24 15:59:51,156 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 15:59:51,156 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [638891167] [2024-10-24 15:59:51,156 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-10-24 15:59:51,156 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-24 15:59:51,156 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 15:59:51,157 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-24 15:59:51,158 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (16)] Waiting until timeout for monitored process