./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_OAT_test8-2.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_OAT_test8-2.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-MemCleanup-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-memcleanup) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 3011b5baaaedb6c621e2913d841379eae3b8a9da7212e43b784fc8c1004eda96 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-4a390ef-m [2024-10-24 15:55:34,406 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-24 15:55:34,473 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-MemCleanup-32bit-Automizer_Default.epf [2024-10-24 15:55:34,476 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-24 15:55:34,477 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-24 15:55:34,495 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-24 15:55:34,496 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-24 15:55:34,496 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-24 15:55:34,497 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-24 15:55:34,497 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-24 15:55:34,497 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-24 15:55:34,498 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-24 15:55:34,498 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-24 15:55:34,499 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-24 15:55:34,499 INFO L153 SettingsManager]: * Use SBE=true [2024-10-24 15:55:34,499 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-24 15:55:34,500 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-24 15:55:34,500 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-24 15:55:34,500 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-24 15:55:34,501 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-24 15:55:34,501 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-24 15:55:34,501 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-24 15:55:34,502 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-10-24 15:55:34,502 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-10-24 15:55:34,502 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-24 15:55:34,502 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-24 15:55:34,503 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-10-24 15:55:34,503 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-24 15:55:34,503 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-10-24 15:55:34,503 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-24 15:55:34,504 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-24 15:55:34,504 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-24 15:55:34,504 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-24 15:55:34,504 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-24 15:55:34,505 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-24 15:55:34,505 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-24 15:55:34,505 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-24 15:55:34,506 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-24 15:55:34,506 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-24 15:55:34,506 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-24 15:55:34,506 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-24 15:55:34,507 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-24 15:55:34,507 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-24 15:55:34,507 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-24 15:55:34,508 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-24 15:55:34,508 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 -> 3011b5baaaedb6c621e2913d841379eae3b8a9da7212e43b784fc8c1004eda96 [2024-10-24 15:55:34,743 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-24 15:55:34,767 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-24 15:55:34,771 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-24 15:55:34,773 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-24 15:55:34,773 INFO L274 PluginConnector]: CDTParser initialized [2024-10-24 15:55:34,775 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_OAT_test8-2.i [2024-10-24 15:55:36,245 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-24 15:55:36,586 INFO L384 CDTParser]: Found 1 translation units. [2024-10-24 15:55:36,587 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_OAT_test8-2.i [2024-10-24 15:55:36,604 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ccd2918ad/8f0e49e15f70466ca7c987b780170af0/FLAGc828742ef [2024-10-24 15:55:36,626 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ccd2918ad/8f0e49e15f70466ca7c987b780170af0 [2024-10-24 15:55:36,629 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-24 15:55:36,630 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-24 15:55:36,632 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-24 15:55:36,632 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-24 15:55:36,639 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-24 15:55:36,640 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 03:55:36" (1/1) ... [2024-10-24 15:55:36,643 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@395beb81 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 03:55:36, skipping insertion in model container [2024-10-24 15:55:36,643 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 03:55:36" (1/1) ... [2024-10-24 15:55:36,708 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-24 15:55:37,335 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-24 15:55:37,347 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:55:37,348 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver@3fc47905 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 03:55:37, skipping insertion in model container [2024-10-24 15:55:37,348 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-24 15:55:37,349 INFO L186 ToolchainWalker]: Toolchain execution was canceled (user or tool) before executing de.uni_freiburg.informatik.ultimate.boogie.procedureinliner [2024-10-24 15:55:37,350 INFO L158 Benchmark]: Toolchain (without parser) took 719.61ms. Allocated memory is still 155.2MB. Free memory was 86.4MB in the beginning and 113.9MB in the end (delta: -27.5MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2024-10-24 15:55:37,351 INFO L158 Benchmark]: CDTParser took 0.20ms. Allocated memory is still 109.1MB. Free memory is still 70.6MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-24 15:55:37,351 INFO L158 Benchmark]: CACSL2BoogieTranslator took 716.82ms. Allocated memory is still 155.2MB. Free memory was 86.2MB in the beginning and 113.9MB in the end (delta: -27.7MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2024-10-24 15:55:37,352 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.20ms. Allocated memory is still 109.1MB. Free memory is still 70.6MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 716.82ms. Allocated memory is still 155.2MB. Free memory was 86.2MB in the beginning and 113.9MB in the end (delta: -27.7MB). Peak memory consumption was 10.5MB. 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_OAT_test8-2.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-MemCleanup-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-memcleanup) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 3011b5baaaedb6c621e2913d841379eae3b8a9da7212e43b784fc8c1004eda96 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-4a390ef-m [2024-10-24 15:55:39,294 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-24 15:55:39,366 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-MemCleanup-32bit-Automizer_Bitvector.epf [2024-10-24 15:55:39,374 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-24 15:55:39,375 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-24 15:55:39,403 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-24 15:55:39,403 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-24 15:55:39,404 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-24 15:55:39,404 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-24 15:55:39,405 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-24 15:55:39,405 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-24 15:55:39,406 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-24 15:55:39,406 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-24 15:55:39,407 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-24 15:55:39,407 INFO L153 SettingsManager]: * Use SBE=true [2024-10-24 15:55:39,407 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-24 15:55:39,408 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-24 15:55:39,408 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-24 15:55:39,408 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-24 15:55:39,409 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-24 15:55:39,409 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-24 15:55:39,413 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-24 15:55:39,413 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-10-24 15:55:39,413 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-10-24 15:55:39,414 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-24 15:55:39,414 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-24 15:55:39,414 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-10-24 15:55:39,414 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-10-24 15:55:39,415 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-24 15:55:39,415 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-10-24 15:55:39,415 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-10-24 15:55:39,415 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-24 15:55:39,416 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-24 15:55:39,416 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-24 15:55:39,418 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-24 15:55:39,419 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-24 15:55:39,419 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-24 15:55:39,419 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-24 15:55:39,419 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-24 15:55:39,420 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-24 15:55:39,420 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-24 15:55:39,421 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-10-24 15:55:39,421 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-10-24 15:55:39,422 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-24 15:55:39,422 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-24 15:55:39,422 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-24 15:55:39,422 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-24 15:55:39,423 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2024-10-24 15:55:39,423 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 -> 3011b5baaaedb6c621e2913d841379eae3b8a9da7212e43b784fc8c1004eda96 [2024-10-24 15:55:39,767 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-24 15:55:39,787 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-24 15:55:39,790 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-24 15:55:39,791 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-24 15:55:39,792 INFO L274 PluginConnector]: CDTParser initialized [2024-10-24 15:55:39,793 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_OAT_test8-2.i [2024-10-24 15:55:41,175 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-24 15:55:41,521 INFO L384 CDTParser]: Found 1 translation units. [2024-10-24 15:55:41,522 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_OAT_test8-2.i [2024-10-24 15:55:41,552 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/eb6f197df/f4040d61d9db46a8ad0e33b6de681288/FLAG01c95bf9b [2024-10-24 15:55:41,570 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/eb6f197df/f4040d61d9db46a8ad0e33b6de681288 [2024-10-24 15:55:41,573 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-24 15:55:41,574 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-24 15:55:41,577 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-24 15:55:41,578 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-24 15:55:41,590 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-24 15:55:41,590 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 03:55:41" (1/1) ... [2024-10-24 15:55:41,591 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@306a6df0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 03:55:41, skipping insertion in model container [2024-10-24 15:55:41,594 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 03:55:41" (1/1) ... [2024-10-24 15:55:41,655 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-24 15:55:42,176 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-24 15:55:42,191 INFO L197 MainTranslator]: Restarting translation with changed settings: SettingsChange [mNewPreferredMemoryModel=HoenickeLindenmann_1ByteResolution] [2024-10-24 15:55:42,205 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-24 15:55:42,305 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-24 15:55:42,312 INFO L200 MainTranslator]: Completed pre-run [2024-10-24 15:55:42,447 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-24 15:55:42,493 INFO L204 MainTranslator]: Completed translation [2024-10-24 15:55:42,495 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 03:55:42 WrapperNode [2024-10-24 15:55:42,495 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-24 15:55:42,496 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-24 15:55:42,496 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-24 15:55:42,496 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-24 15:55:42,503 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:55:42" (1/1) ... [2024-10-24 15:55:42,546 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:55:42" (1/1) ... [2024-10-24 15:55:42,597 INFO L138 Inliner]: procedures = 180, calls = 342, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 1176 [2024-10-24 15:55:42,598 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-24 15:55:42,598 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-24 15:55:42,598 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-24 15:55:42,599 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-24 15:55:42,617 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 03:55:42" (1/1) ... [2024-10-24 15:55:42,621 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 03:55:42" (1/1) ... [2024-10-24 15:55:42,635 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 03:55:42" (1/1) ... [2024-10-24 15:55:42,760 INFO L175 MemorySlicer]: Split 304 memory accesses to 3 slices as follows [2, 268, 34]. 88 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0, 0]. The 62 writes are split as follows [0, 58, 4]. [2024-10-24 15:55:42,761 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 03:55:42" (1/1) ... [2024-10-24 15:55:42,761 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 03:55:42" (1/1) ... [2024-10-24 15:55:42,811 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 03:55:42" (1/1) ... [2024-10-24 15:55:42,827 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 03:55:42" (1/1) ... [2024-10-24 15:55:42,838 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 03:55:42" (1/1) ... [2024-10-24 15:55:42,851 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 03:55:42" (1/1) ... [2024-10-24 15:55:42,861 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-24 15:55:42,872 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-24 15:55:42,872 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-24 15:55:42,872 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-24 15:55:42,873 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 03:55:42" (1/1) ... [2024-10-24 15:55:42,879 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-24 15:55:42,891 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 15:55:42,906 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:55:42,908 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:55:42,951 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2024-10-24 15:55:42,951 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2024-10-24 15:55:42,952 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#0 [2024-10-24 15:55:42,952 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#1 [2024-10-24 15:55:42,952 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#2 [2024-10-24 15:55:42,952 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#0 [2024-10-24 15:55:42,952 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#1 [2024-10-24 15:55:42,952 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#2 [2024-10-24 15:55:42,952 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2024-10-24 15:55:42,952 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2024-10-24 15:55:42,952 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#0 [2024-10-24 15:55:42,952 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#1 [2024-10-24 15:55:42,952 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#2 [2024-10-24 15:55:42,953 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#0 [2024-10-24 15:55:42,953 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#1 [2024-10-24 15:55:42,953 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#2 [2024-10-24 15:55:42,953 INFO L130 BoogieDeclarations]: Found specification of procedure test_int [2024-10-24 15:55:42,953 INFO L138 BoogieDeclarations]: Found implementation of procedure test_int [2024-10-24 15:55:42,953 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-10-24 15:55:42,954 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-24 15:55:42,954 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2024-10-24 15:55:42,954 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2024-10-24 15:55:42,954 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2024-10-24 15:55:42,954 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-10-24 15:55:42,954 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2024-10-24 15:55:42,954 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2024-10-24 15:55:42,955 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2024-10-24 15:55:42,955 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-10-24 15:55:42,955 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#0 [2024-10-24 15:55:42,955 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#1 [2024-10-24 15:55:42,955 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#2 [2024-10-24 15:55:42,955 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-10-24 15:55:42,955 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2024-10-24 15:55:42,956 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#2 [2024-10-24 15:55:42,956 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-24 15:55:42,956 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-24 15:55:43,184 INFO L238 CfgBuilder]: Building ICFG [2024-10-24 15:55:43,187 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-24 15:55:50,811 INFO L? ?]: Removed 161 outVars from TransFormulas that were not future-live. [2024-10-24 15:55:50,812 INFO L287 CfgBuilder]: Performing block encoding [2024-10-24 15:55:50,850 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-24 15:55:50,851 INFO L314 CfgBuilder]: Removed 71 assume(true) statements. [2024-10-24 15:55:50,851 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 03:55:50 BoogieIcfgContainer [2024-10-24 15:55:50,851 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-24 15:55:50,855 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-24 15:55:50,855 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-24 15:55:50,858 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-24 15:55:50,858 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.10 03:55:41" (1/3) ... [2024-10-24 15:55:50,859 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3d1b0d8c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 03:55:50, skipping insertion in model container [2024-10-24 15:55:50,859 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 03:55:42" (2/3) ... [2024-10-24 15:55:50,859 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3d1b0d8c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 03:55:50, skipping insertion in model container [2024-10-24 15:55:50,859 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 03:55:50" (3/3) ... [2024-10-24 15:55:50,860 INFO L112 eAbstractionObserver]: Analyzing ICFG uthash_OAT_test8-2.i [2024-10-24 15:55:50,877 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-24 15:55:50,877 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2024-10-24 15:55:50,933 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-24 15:55:50,941 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;@6d18b8d6, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-24 15:55:50,941 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2024-10-24 15:55:50,946 INFO L276 IsEmpty]: Start isEmpty. Operand has 262 states, 233 states have (on average 1.6824034334763949) internal successors, (392), 252 states have internal predecessors, (392), 22 states have call successors, (22), 4 states have call predecessors, (22), 4 states have return successors, (22), 8 states have call predecessors, (22), 22 states have call successors, (22) [2024-10-24 15:55:50,955 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2024-10-24 15:55:50,955 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 15:55:50,956 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 15:55:50,956 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2024-10-24 15:55:50,961 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 15:55:50,961 INFO L85 PathProgramCache]: Analyzing trace with hash 666562819, now seen corresponding path program 1 times [2024-10-24 15:55:50,972 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 15:55:50,972 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1977171204] [2024-10-24 15:55:50,972 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 15:55:50,973 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:55:50,973 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 15:55:50,976 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:55:50,977 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:55:51,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 15:55:51,163 INFO L255 TraceCheckSpWp]: Trace formula consists of 70 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-10-24 15:55:51,167 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 15:55:51,176 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:55:51,176 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-24 15:55:51,177 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-24 15:55:51,177 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1977171204] [2024-10-24 15:55:51,177 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1977171204] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 15:55:51,177 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 15:55:51,178 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-24 15:55:51,179 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1159035269] [2024-10-24 15:55:51,180 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 15:55:51,183 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-24 15:55:51,184 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-24 15:55:51,206 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-24 15:55:51,206 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-24 15:55:51,209 INFO L87 Difference]: Start difference. First operand has 262 states, 233 states have (on average 1.6824034334763949) internal successors, (392), 252 states have internal predecessors, (392), 22 states have call successors, (22), 4 states have call predecessors, (22), 4 states have return successors, (22), 8 states have call predecessors, (22), 22 states have call successors, (22) Second operand has 2 states, 2 states have (on average 4.5) internal successors, (9), 2 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 15:55:51,292 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 15:55:51,293 INFO L93 Difference]: Finished difference Result 260 states and 356 transitions. [2024-10-24 15:55:51,299 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-24 15:55:51,300 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 4.5) internal successors, (9), 2 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2024-10-24 15:55:51,301 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 15:55:51,321 INFO L225 Difference]: With dead ends: 260 [2024-10-24 15:55:51,321 INFO L226 Difference]: Without dead ends: 259 [2024-10-24 15:55:51,323 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-24 15:55:51,326 INFO L432 NwaCegarLoop]: 350 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 350 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-24 15:55:51,327 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 350 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-24 15:55:51,368 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 259 states. [2024-10-24 15:55:51,428 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 259 to 259. [2024-10-24 15:55:51,432 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 259 states, 232 states have (on average 1.3491379310344827) internal successors, (313), 249 states have internal predecessors, (313), 22 states have call successors, (22), 4 states have call predecessors, (22), 3 states have return successors, (20), 6 states have call predecessors, (20), 20 states have call successors, (20) [2024-10-24 15:55:51,437 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 259 states to 259 states and 355 transitions. [2024-10-24 15:55:51,442 INFO L78 Accepts]: Start accepts. Automaton has 259 states and 355 transitions. Word has length 10 [2024-10-24 15:55:51,443 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 15:55:51,443 INFO L471 AbstractCegarLoop]: Abstraction has 259 states and 355 transitions. [2024-10-24 15:55:51,443 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 4.5) internal successors, (9), 2 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 15:55:51,443 INFO L276 IsEmpty]: Start isEmpty. Operand 259 states and 355 transitions. [2024-10-24 15:55:51,444 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2024-10-24 15:55:51,444 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 15:55:51,445 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 15:55:51,450 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0 [2024-10-24 15:55:51,645 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:55:51,646 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2024-10-24 15:55:51,647 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 15:55:51,647 INFO L85 PathProgramCache]: Analyzing trace with hash -757099125, now seen corresponding path program 1 times [2024-10-24 15:55:51,647 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 15:55:51,647 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [151507689] [2024-10-24 15:55:51,647 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 15:55:51,648 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:55:51,648 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 15:55:51,675 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:55:51,676 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:55:51,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 15:55:51,950 INFO L255 TraceCheckSpWp]: Trace formula consists of 77 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-10-24 15:55:51,953 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 15:55:51,986 INFO L173 IndexEqualityManager]: detected equality via solver [2024-10-24 15:55:51,987 INFO L173 IndexEqualityManager]: detected equality via solver [2024-10-24 15:55:51,989 INFO L173 IndexEqualityManager]: detected equality via solver [2024-10-24 15:55:52,000 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:55:52,098 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-24 15:55:52,098 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:55:52,122 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:55:52,122 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-24 15:55:52,122 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-24 15:55:52,122 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [151507689] [2024-10-24 15:55:52,123 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [151507689] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 15:55:52,123 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 15:55:52,123 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-24 15:55:52,123 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1231447407] [2024-10-24 15:55:52,123 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 15:55:52,124 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-24 15:55:52,124 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-24 15:55:52,125 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-24 15:55:52,125 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-24 15:55:52,125 INFO L87 Difference]: Start difference. First operand 259 states and 355 transitions. Second operand has 4 states, 4 states have (on average 3.0) internal successors, (12), 3 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 15:55:52,888 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 15:55:52,889 INFO L93 Difference]: Finished difference Result 470 states and 634 transitions. [2024-10-24 15:55:52,889 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-24 15:55:52,890 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.0) internal successors, (12), 3 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 12 [2024-10-24 15:55:52,890 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 15:55:52,892 INFO L225 Difference]: With dead ends: 470 [2024-10-24 15:55:52,893 INFO L226 Difference]: Without dead ends: 470 [2024-10-24 15:55:52,893 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-24 15:55:52,894 INFO L432 NwaCegarLoop]: 331 mSDtfsCounter, 265 mSDsluCounter, 655 mSDsCounter, 0 mSdLazyCounter, 77 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 270 SdHoareTripleChecker+Valid, 986 SdHoareTripleChecker+Invalid, 78 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 77 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-10-24 15:55:52,894 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [270 Valid, 986 Invalid, 78 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 77 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-10-24 15:55:52,896 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 470 states. [2024-10-24 15:55:52,916 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 470 to 261. [2024-10-24 15:55:52,920 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 261 states, 234 states have (on average 1.3461538461538463) internal successors, (315), 251 states have internal predecessors, (315), 22 states have call successors, (22), 4 states have call predecessors, (22), 3 states have return successors, (20), 6 states have call predecessors, (20), 20 states have call successors, (20) [2024-10-24 15:55:52,922 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 261 states to 261 states and 357 transitions. [2024-10-24 15:55:52,926 INFO L78 Accepts]: Start accepts. Automaton has 261 states and 357 transitions. Word has length 12 [2024-10-24 15:55:52,926 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 15:55:52,926 INFO L471 AbstractCegarLoop]: Abstraction has 261 states and 357 transitions. [2024-10-24 15:55:52,927 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.0) internal successors, (12), 3 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 15:55:52,927 INFO L276 IsEmpty]: Start isEmpty. Operand 261 states and 357 transitions. [2024-10-24 15:55:52,929 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2024-10-24 15:55:52,929 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 15:55:52,929 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:55:52,937 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 (3)] Forceful destruction successful, exit code 0 [2024-10-24 15:55:53,130 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:55:53,130 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2024-10-24 15:55:53,131 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 15:55:53,131 INFO L85 PathProgramCache]: Analyzing trace with hash 409058189, now seen corresponding path program 1 times [2024-10-24 15:55:53,132 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 15:55:53,133 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1307256764] [2024-10-24 15:55:53,133 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 15:55:53,133 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:55:53,133 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 15:55:53,136 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:55:53,138 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:55:53,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 15:55:53,521 INFO L255 TraceCheckSpWp]: Trace formula consists of 335 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-24 15:55:53,525 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 15:55:53,569 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:55:53,569 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-24 15:55:53,570 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-24 15:55:53,570 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1307256764] [2024-10-24 15:55:53,570 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1307256764] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 15:55:53,570 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 15:55:53,570 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-24 15:55:53,571 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1324834654] [2024-10-24 15:55:53,571 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 15:55:53,571 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-24 15:55:53,571 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-24 15:55:53,572 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-24 15:55:53,572 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-24 15:55:53,572 INFO L87 Difference]: Start difference. First operand 261 states and 357 transitions. Second operand has 4 states, 4 states have (on average 15.75) internal successors, (63), 4 states have internal predecessors, (63), 1 states have call successors, (3), 1 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 15:55:53,802 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 15:55:53,803 INFO L93 Difference]: Finished difference Result 264 states and 352 transitions. [2024-10-24 15:55:53,803 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-24 15:55:53,804 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:55:53,804 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 15:55:53,805 INFO L225 Difference]: With dead ends: 264 [2024-10-24 15:55:53,805 INFO L226 Difference]: Without dead ends: 264 [2024-10-24 15:55:53,806 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:55:53,807 INFO L432 NwaCegarLoop]: 320 mSDtfsCounter, 30 mSDsluCounter, 623 mSDsCounter, 0 mSdLazyCounter, 56 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 943 SdHoareTripleChecker+Invalid, 78 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 56 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-24 15:55:53,807 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 943 Invalid, 78 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 56 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-24 15:55:53,810 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 264 states. [2024-10-24 15:55:53,828 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 264 to 264. [2024-10-24 15:55:53,832 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 264 states, 237 states have (on average 1.3080168776371308) internal successors, (310), 254 states have internal predecessors, (310), 22 states have call successors, (22), 4 states have call predecessors, (22), 3 states have return successors, (20), 6 states have call predecessors, (20), 20 states have call successors, (20) [2024-10-24 15:55:53,833 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 264 states to 264 states and 352 transitions. [2024-10-24 15:55:53,834 INFO L78 Accepts]: Start accepts. Automaton has 264 states and 352 transitions. Word has length 66 [2024-10-24 15:55:53,834 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 15:55:53,834 INFO L471 AbstractCegarLoop]: Abstraction has 264 states and 352 transitions. [2024-10-24 15:55:53,834 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:55:53,834 INFO L276 IsEmpty]: Start isEmpty. Operand 264 states and 352 transitions. [2024-10-24 15:55:53,840 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2024-10-24 15:55:53,840 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 15:55:53,840 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:55:53,849 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:55:54,041 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:55:54,042 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2024-10-24 15:55:54,042 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 15:55:54,042 INFO L85 PathProgramCache]: Analyzing trace with hash 387171585, now seen corresponding path program 1 times [2024-10-24 15:55:54,043 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 15:55:54,043 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [144496612] [2024-10-24 15:55:54,043 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 15:55:54,043 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:55:54,044 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 15:55:54,051 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:55:54,052 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:55:54,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 15:55:54,395 INFO L255 TraceCheckSpWp]: Trace formula consists of 323 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-10-24 15:55:54,399 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 15:55:54,558 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:55:54,558 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-24 15:55:54,559 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-24 15:55:54,559 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [144496612] [2024-10-24 15:55:54,559 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [144496612] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 15:55:54,559 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 15:55:54,559 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-24 15:55:54,559 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [831362388] [2024-10-24 15:55:54,560 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 15:55:54,560 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-24 15:55:54,560 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-24 15:55:54,561 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-24 15:55:54,561 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-24 15:55:54,561 INFO L87 Difference]: Start difference. First operand 264 states and 352 transitions. Second operand has 5 states, 5 states have (on average 12.6) internal successors, (63), 5 states have internal predecessors, (63), 1 states have call successors, (3), 1 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 15:55:54,767 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 15:55:54,767 INFO L93 Difference]: Finished difference Result 258 states and 342 transitions. [2024-10-24 15:55:54,768 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-24 15:55:54,768 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:55:54,768 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 15:55:54,770 INFO L225 Difference]: With dead ends: 258 [2024-10-24 15:55:54,770 INFO L226 Difference]: Without dead ends: 258 [2024-10-24 15:55:54,770 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:55:54,771 INFO L432 NwaCegarLoop]: 319 mSDtfsCounter, 0 mSDsluCounter, 621 mSDsCounter, 0 mSdLazyCounter, 67 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 940 SdHoareTripleChecker+Invalid, 70 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 67 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-24 15:55:54,772 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 940 Invalid, 70 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 67 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-24 15:55:54,773 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 258 states. [2024-10-24 15:55:54,779 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 258 to 258. [2024-10-24 15:55:54,780 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 258 states, 231 states have (on average 1.2987012987012987) internal successors, (300), 248 states have internal predecessors, (300), 22 states have call successors, (22), 4 states have call predecessors, (22), 3 states have return successors, (20), 6 states have call predecessors, (20), 20 states have call successors, (20) [2024-10-24 15:55:54,782 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 258 states to 258 states and 342 transitions. [2024-10-24 15:55:54,782 INFO L78 Accepts]: Start accepts. Automaton has 258 states and 342 transitions. Word has length 66 [2024-10-24 15:55:54,782 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 15:55:54,782 INFO L471 AbstractCegarLoop]: Abstraction has 258 states and 342 transitions. [2024-10-24 15:55:54,783 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:55:54,783 INFO L276 IsEmpty]: Start isEmpty. Operand 258 states and 342 transitions. [2024-10-24 15:55:54,784 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2024-10-24 15:55:54,784 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 15:55:54,785 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:55:54,794 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:55:54,985 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:55:54,985 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2024-10-24 15:55:54,986 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 15:55:54,986 INFO L85 PathProgramCache]: Analyzing trace with hash 781538371, now seen corresponding path program 1 times [2024-10-24 15:55:54,987 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 15:55:54,987 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2107273198] [2024-10-24 15:55:54,987 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 15:55:54,987 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:55:54,987 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 15:55:54,990 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:55:54,992 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:55:55,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 15:55:55,311 INFO L255 TraceCheckSpWp]: Trace formula consists of 325 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-24 15:55:55,315 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 15:55:55,597 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:55:55,597 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-24 15:55:55,597 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-24 15:55:55,597 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2107273198] [2024-10-24 15:55:55,597 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2107273198] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 15:55:55,598 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 15:55:55,598 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-24 15:55:55,598 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [453737397] [2024-10-24 15:55:55,598 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 15:55:55,598 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-24 15:55:55,599 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-24 15:55:55,599 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-24 15:55:55,599 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-24 15:55:55,599 INFO L87 Difference]: Start difference. First operand 258 states and 342 transitions. Second operand has 3 states, 3 states have (on average 21.0) internal successors, (63), 2 states have internal predecessors, (63), 1 states have call successors, (3), 1 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 15:55:56,267 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 15:55:56,267 INFO L93 Difference]: Finished difference Result 396 states and 512 transitions. [2024-10-24 15:55:56,268 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-24 15:55:56,268 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:55:56,268 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 15:55:56,270 INFO L225 Difference]: With dead ends: 396 [2024-10-24 15:55:56,270 INFO L226 Difference]: Without dead ends: 396 [2024-10-24 15:55:56,270 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:55:56,271 INFO L432 NwaCegarLoop]: 372 mSDtfsCounter, 125 mSDsluCounter, 301 mSDsCounter, 0 mSdLazyCounter, 59 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 126 SdHoareTripleChecker+Valid, 673 SdHoareTripleChecker+Invalid, 67 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 59 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-10-24 15:55:56,272 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [126 Valid, 673 Invalid, 67 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 59 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-10-24 15:55:56,273 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 396 states. [2024-10-24 15:55:56,279 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 396 to 364. [2024-10-24 15:55:56,280 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 364 states, 336 states have (on average 1.2708333333333333) internal successors, (427), 353 states have internal predecessors, (427), 23 states have call successors, (23), 4 states have call predecessors, (23), 3 states have return successors, (21), 7 states have call predecessors, (21), 21 states have call successors, (21) [2024-10-24 15:55:56,282 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 364 states to 364 states and 471 transitions. [2024-10-24 15:55:56,282 INFO L78 Accepts]: Start accepts. Automaton has 364 states and 471 transitions. Word has length 66 [2024-10-24 15:55:56,282 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 15:55:56,282 INFO L471 AbstractCegarLoop]: Abstraction has 364 states and 471 transitions. [2024-10-24 15:55:56,282 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:55:56,283 INFO L276 IsEmpty]: Start isEmpty. Operand 364 states and 471 transitions. [2024-10-24 15:55:56,284 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2024-10-24 15:55:56,284 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 15:55:56,285 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:55:56,294 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Ended with exit code 0 [2024-10-24 15:55:56,485 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:55:56,486 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2024-10-24 15:55:56,486 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 15:55:56,486 INFO L85 PathProgramCache]: Analyzing trace with hash 1917441306, now seen corresponding path program 1 times [2024-10-24 15:55:56,487 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 15:55:56,487 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [43838248] [2024-10-24 15:55:56,487 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 15:55:56,488 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:55:56,488 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 15:55:56,491 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:55:56,492 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:55:56,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 15:55:56,900 INFO L255 TraceCheckSpWp]: Trace formula consists of 454 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-24 15:55:56,903 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 15:55:56,929 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:55:56,929 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-24 15:55:56,929 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-24 15:55:56,930 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [43838248] [2024-10-24 15:55:56,930 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [43838248] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 15:55:56,930 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 15:55:56,930 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-24 15:55:56,930 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [538953563] [2024-10-24 15:55:56,930 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 15:55:56,931 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-24 15:55:56,931 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-24 15:55:56,932 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-24 15:55:56,932 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-24 15:55:56,933 INFO L87 Difference]: Start difference. First operand 364 states and 471 transitions. Second operand has 4 states, 3 states have (on average 24.0) internal successors, (72), 4 states have internal predecessors, (72), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2024-10-24 15:55:57,042 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 15:55:57,042 INFO L93 Difference]: Finished difference Result 366 states and 474 transitions. [2024-10-24 15:55:57,043 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-24 15:55:57,043 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:55:57,044 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 15:55:57,046 INFO L225 Difference]: With dead ends: 366 [2024-10-24 15:55:57,046 INFO L226 Difference]: Without dead ends: 366 [2024-10-24 15:55:57,046 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:55:57,047 INFO L432 NwaCegarLoop]: 333 mSDtfsCounter, 0 mSDsluCounter, 662 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 995 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-24 15:55:57,047 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 995 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-24 15:55:57,048 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 366 states. [2024-10-24 15:55:57,056 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 366 to 366. [2024-10-24 15:55:57,057 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 366 states, 337 states have (on average 1.2729970326409497) internal successors, (429), 355 states have internal predecessors, (429), 23 states have call successors, (23), 4 states have call predecessors, (23), 4 states have return successors, (22), 7 states have call predecessors, (22), 21 states have call successors, (22) [2024-10-24 15:55:57,058 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 366 states to 366 states and 474 transitions. [2024-10-24 15:55:57,058 INFO L78 Accepts]: Start accepts. Automaton has 366 states and 474 transitions. Word has length 79 [2024-10-24 15:55:57,059 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 15:55:57,059 INFO L471 AbstractCegarLoop]: Abstraction has 366 states and 474 transitions. [2024-10-24 15:55:57,059 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:55:57,060 INFO L276 IsEmpty]: Start isEmpty. Operand 366 states and 474 transitions. [2024-10-24 15:55:57,061 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2024-10-24 15:55:57,061 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 15:55:57,061 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:55:57,072 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Forceful destruction successful, exit code 0 [2024-10-24 15:55:57,261 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:55:57,262 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2024-10-24 15:55:57,262 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 15:55:57,263 INFO L85 PathProgramCache]: Analyzing trace with hash -1800298452, now seen corresponding path program 1 times [2024-10-24 15:55:57,263 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 15:55:57,263 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [164211363] [2024-10-24 15:55:57,263 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 15:55:57,264 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:55:57,264 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 15:55:57,265 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:55:57,266 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Waiting until timeout for monitored process [2024-10-24 15:55:57,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 15:55:57,694 INFO L255 TraceCheckSpWp]: Trace formula consists of 476 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-10-24 15:55:57,697 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 15:55:57,759 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:55:57,759 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-24 15:55:57,894 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:55:57,895 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-24 15:55:57,895 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [164211363] [2024-10-24 15:55:57,895 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [164211363] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-24 15:55:57,895 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-24 15:55:57,895 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 8 [2024-10-24 15:55:57,895 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [705158795] [2024-10-24 15:55:57,895 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-24 15:55:57,896 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-24 15:55:57,896 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-24 15:55:57,900 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-24 15:55:57,902 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2024-10-24 15:55:57,903 INFO L87 Difference]: Start difference. First operand 366 states and 474 transitions. Second operand has 8 states, 6 states have (on average 13.333333333333334) internal successors, (80), 8 states have internal predecessors, (80), 2 states have call successors, (6), 2 states have call predecessors, (6), 4 states have return successors, (4), 1 states have call predecessors, (4), 2 states have call successors, (4) [2024-10-24 15:55:58,129 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 15:55:58,130 INFO L93 Difference]: Finished difference Result 375 states and 488 transitions. [2024-10-24 15:55:58,131 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-10-24 15:55:58,131 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:55:58,131 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 15:55:58,133 INFO L225 Difference]: With dead ends: 375 [2024-10-24 15:55:58,133 INFO L226 Difference]: Without dead ends: 375 [2024-10-24 15:55:58,134 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 163 GetRequests, 154 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=44, Invalid=66, Unknown=0, NotChecked=0, Total=110 [2024-10-24 15:55:58,134 INFO L432 NwaCegarLoop]: 333 mSDtfsCounter, 5 mSDsluCounter, 662 mSDsCounter, 0 mSdLazyCounter, 56 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 995 SdHoareTripleChecker+Invalid, 65 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 56 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-24 15:55:58,134 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 995 Invalid, 65 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 56 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-24 15:55:58,135 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 375 states. [2024-10-24 15:55:58,141 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 375 to 374. [2024-10-24 15:55:58,142 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 374 states, 344 states have (on average 1.2848837209302326) internal successors, (442), 362 states have internal predecessors, (442), 23 states have call successors, (23), 5 states have call predecessors, (23), 5 states have return successors, (22), 7 states have call predecessors, (22), 21 states have call successors, (22) [2024-10-24 15:55:58,144 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 374 states to 374 states and 487 transitions. [2024-10-24 15:55:58,144 INFO L78 Accepts]: Start accepts. Automaton has 374 states and 487 transitions. Word has length 81 [2024-10-24 15:55:58,144 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 15:55:58,144 INFO L471 AbstractCegarLoop]: Abstraction has 374 states and 487 transitions. [2024-10-24 15:55:58,144 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:55:58,144 INFO L276 IsEmpty]: Start isEmpty. Operand 374 states and 487 transitions. [2024-10-24 15:55:58,145 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2024-10-24 15:55:58,145 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 15:55:58,146 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:55:58,156 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:55:58,346 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:55:58,347 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2024-10-24 15:55:58,347 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 15:55:58,347 INFO L85 PathProgramCache]: Analyzing trace with hash -1933250630, now seen corresponding path program 2 times [2024-10-24 15:55:58,348 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 15:55:58,353 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1333971786] [2024-10-24 15:55:58,353 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-10-24 15:55:58,353 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:55:58,353 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 15:55:58,356 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-24 15:55:58,356 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Waiting until timeout for monitored process [2024-10-24 15:55:59,655 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-10-24 15:55:59,655 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-24 15:55:59,680 INFO L255 TraceCheckSpWp]: Trace formula consists of 520 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-10-24 15:55:59,683 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 15:55:59,739 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:55:59,740 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-24 15:55:59,900 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:55:59,901 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-24 15:55:59,901 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1333971786] [2024-10-24 15:55:59,901 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1333971786] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-24 15:55:59,901 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-24 15:55:59,901 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 10 [2024-10-24 15:55:59,901 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1218187260] [2024-10-24 15:55:59,902 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-24 15:55:59,902 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-10-24 15:55:59,902 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-24 15:55:59,903 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-10-24 15:55:59,903 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2024-10-24 15:55:59,903 INFO L87 Difference]: Start difference. First operand 374 states and 487 transitions. Second operand has 10 states, 8 states have (on average 9.875) internal successors, (79), 10 states have internal predecessors, (79), 2 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2024-10-24 15:56:00,297 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 15:56:00,298 INFO L93 Difference]: Finished difference Result 380 states and 497 transitions. [2024-10-24 15:56:00,299 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-10-24 15:56:00,299 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:56:00,299 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 15:56:00,301 INFO L225 Difference]: With dead ends: 380 [2024-10-24 15:56:00,301 INFO L226 Difference]: Without dead ends: 380 [2024-10-24 15:56:00,307 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:56:00,308 INFO L432 NwaCegarLoop]: 332 mSDtfsCounter, 5 mSDsluCounter, 1647 mSDsCounter, 0 mSdLazyCounter, 83 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 1979 SdHoareTripleChecker+Invalid, 89 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 83 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-24 15:56:00,308 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 1979 Invalid, 89 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 83 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-24 15:56:00,309 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 380 states. [2024-10-24 15:56:00,315 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 380 to 378. [2024-10-24 15:56:00,316 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 378 states, 348 states have (on average 1.293103448275862) internal successors, (450), 366 states have internal predecessors, (450), 23 states have call successors, (23), 5 states have call predecessors, (23), 5 states have return successors, (22), 7 states have call predecessors, (22), 21 states have call successors, (22) [2024-10-24 15:56:00,318 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 378 states to 378 states and 495 transitions. [2024-10-24 15:56:00,318 INFO L78 Accepts]: Start accepts. Automaton has 378 states and 495 transitions. Word has length 85 [2024-10-24 15:56:00,318 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 15:56:00,319 INFO L471 AbstractCegarLoop]: Abstraction has 378 states and 495 transitions. [2024-10-24 15:56:00,319 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:56:00,319 INFO L276 IsEmpty]: Start isEmpty. Operand 378 states and 495 transitions. [2024-10-24 15:56:00,320 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2024-10-24 15:56:00,320 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 15:56:00,320 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:56:00,338 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Forceful destruction successful, exit code 0 [2024-10-24 15:56:00,520 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:56:00,521 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2024-10-24 15:56:00,521 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 15:56:00,522 INFO L85 PathProgramCache]: Analyzing trace with hash -1935901574, now seen corresponding path program 3 times [2024-10-24 15:56:00,522 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 15:56:00,522 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1227969484] [2024-10-24 15:56:00,522 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-10-24 15:56:00,522 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-24 15:56:00,522 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 15:56:00,523 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:56:00,525 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:56:03,592 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2024-10-24 15:56:03,592 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-24 15:56:03,620 INFO L255 TraceCheckSpWp]: Trace formula consists of 564 conjuncts, 10 conjuncts are in the unsatisfiable core [2024-10-24 15:56:03,623 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 15:56:03,736 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:56:03,736 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-24 15:56:04,097 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:56:04,098 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-24 15:56:04,098 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1227969484] [2024-10-24 15:56:04,098 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1227969484] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-24 15:56:04,098 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-24 15:56:04,098 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 18 [2024-10-24 15:56:04,098 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1912889920] [2024-10-24 15:56:04,098 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-24 15:56:04,099 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2024-10-24 15:56:04,099 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-24 15:56:04,100 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2024-10-24 15:56:04,100 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=97, Invalid=209, Unknown=0, NotChecked=0, Total=306 [2024-10-24 15:56:04,100 INFO L87 Difference]: Start difference. First operand 378 states and 495 transitions. Second operand has 18 states, 16 states have (on average 5.4375) internal successors, (87), 18 states have internal predecessors, (87), 2 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2024-10-24 15:56:05,018 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 15:56:05,018 INFO L93 Difference]: Finished difference Result 392 states and 518 transitions. [2024-10-24 15:56:05,019 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2024-10-24 15:56:05,019 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:56:05,020 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 15:56:05,021 INFO L225 Difference]: With dead ends: 392 [2024-10-24 15:56:05,021 INFO L226 Difference]: Without dead ends: 390 [2024-10-24 15:56:05,022 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:56:05,022 INFO L432 NwaCegarLoop]: 332 mSDtfsCounter, 9 mSDsluCounter, 2962 mSDsCounter, 0 mSdLazyCounter, 225 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 3294 SdHoareTripleChecker+Invalid, 229 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 225 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-24 15:56:05,024 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 3294 Invalid, 229 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 225 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-24 15:56:05,025 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 390 states. [2024-10-24 15:56:05,034 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 390 to 389. [2024-10-24 15:56:05,035 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 389 states, 359 states have (on average 1.309192200557103) internal successors, (470), 377 states have internal predecessors, (470), 23 states have call successors, (23), 5 states have call predecessors, (23), 5 states have return successors, (22), 7 states have call predecessors, (22), 21 states have call successors, (22) [2024-10-24 15:56:05,037 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 389 states to 389 states and 515 transitions. [2024-10-24 15:56:05,038 INFO L78 Accepts]: Start accepts. Automaton has 389 states and 515 transitions. Word has length 89 [2024-10-24 15:56:05,039 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 15:56:05,039 INFO L471 AbstractCegarLoop]: Abstraction has 389 states and 515 transitions. [2024-10-24 15:56:05,040 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:56:05,040 INFO L276 IsEmpty]: Start isEmpty. Operand 389 states and 515 transitions. [2024-10-24 15:56:05,044 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2024-10-24 15:56:05,044 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 15:56:05,044 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:56:05,066 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Ended with exit code 0 [2024-10-24 15:56:05,244 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:56:05,245 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2024-10-24 15:56:05,245 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 15:56:05,247 INFO L85 PathProgramCache]: Analyzing trace with hash 1631483386, now seen corresponding path program 4 times [2024-10-24 15:56:05,247 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 15:56:05,247 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [382272857] [2024-10-24 15:56:05,247 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2024-10-24 15:56:05,248 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:56:05,248 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 15:56:05,249 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:56:05,250 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:56:05,830 INFO L227 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2024-10-24 15:56:05,830 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-24 15:56:05,847 INFO L255 TraceCheckSpWp]: Trace formula consists of 652 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-10-24 15:56:05,861 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 15:56:05,941 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:56:05,941 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-24 15:56:06,107 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:56:06,108 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-24 15:56:06,108 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [382272857] [2024-10-24 15:56:06,108 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [382272857] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-24 15:56:06,108 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-24 15:56:06,108 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 14 [2024-10-24 15:56:06,108 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1583412673] [2024-10-24 15:56:06,108 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-24 15:56:06,109 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-10-24 15:56:06,109 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-24 15:56:06,109 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-10-24 15:56:06,110 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=121, Unknown=0, NotChecked=0, Total=182 [2024-10-24 15:56:06,110 INFO L87 Difference]: Start difference. First operand 389 states and 515 transitions. Second operand has 14 states, 12 states have (on average 7.166666666666667) internal successors, (86), 14 states have internal predecessors, (86), 2 states have call successors, (6), 2 states have call predecessors, (6), 4 states have return successors, (4), 1 states have call predecessors, (4), 2 states have call successors, (4) [2024-10-24 15:56:06,704 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 15:56:06,704 INFO L93 Difference]: Finished difference Result 395 states and 522 transitions. [2024-10-24 15:56:06,705 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2024-10-24 15:56:06,705 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:56:06,705 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 15:56:06,707 INFO L225 Difference]: With dead ends: 395 [2024-10-24 15:56:06,707 INFO L226 Difference]: Without dead ends: 393 [2024-10-24 15:56:06,707 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:56:06,708 INFO L432 NwaCegarLoop]: 333 mSDtfsCounter, 7 mSDsluCounter, 2309 mSDsCounter, 0 mSdLazyCounter, 199 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 2642 SdHoareTripleChecker+Invalid, 206 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 199 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-24 15:56:06,708 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 2642 Invalid, 206 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 199 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-24 15:56:06,709 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 393 states. [2024-10-24 15:56:06,715 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 393 to 392. [2024-10-24 15:56:06,716 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 392 states, 362 states have (on average 1.3011049723756907) internal successors, (471), 380 states have internal predecessors, (471), 23 states have call successors, (23), 5 states have call predecessors, (23), 5 states have return successors, (22), 7 states have call predecessors, (22), 21 states have call successors, (22) [2024-10-24 15:56:06,718 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 392 states to 392 states and 516 transitions. [2024-10-24 15:56:06,718 INFO L78 Accepts]: Start accepts. Automaton has 392 states and 516 transitions. Word has length 97 [2024-10-24 15:56:06,718 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 15:56:06,718 INFO L471 AbstractCegarLoop]: Abstraction has 392 states and 516 transitions. [2024-10-24 15:56:06,718 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:56:06,719 INFO L276 IsEmpty]: Start isEmpty. Operand 392 states and 516 transitions. [2024-10-24 15:56:06,719 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2024-10-24 15:56:06,719 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 15:56:06,719 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:56:06,734 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Forceful destruction successful, exit code 0 [2024-10-24 15:56:06,920 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:56:06,920 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2024-10-24 15:56:06,921 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 15:56:06,921 INFO L85 PathProgramCache]: Analyzing trace with hash -1555998118, now seen corresponding path program 5 times [2024-10-24 15:56:06,921 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 15:56:06,921 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1910159159] [2024-10-24 15:56:06,921 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2024-10-24 15:56:06,921 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:56:06,922 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 15:56:06,922 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:56:06,923 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:56:07,821 INFO L227 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 8 check-sat command(s) [2024-10-24 15:56:07,821 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-24 15:56:07,843 INFO L255 TraceCheckSpWp]: Trace formula consists of 718 conjuncts, 13 conjuncts are in the unsatisfiable core [2024-10-24 15:56:07,845 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 15:56:08,001 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:56:08,001 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-24 15:56:08,581 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:56:08,581 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-24 15:56:08,581 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1910159159] [2024-10-24 15:56:08,581 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1910159159] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-24 15:56:08,581 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-24 15:56:08,581 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 26 [2024-10-24 15:56:08,582 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1701918373] [2024-10-24 15:56:08,582 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-24 15:56:08,582 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2024-10-24 15:56:08,582 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-24 15:56:08,583 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2024-10-24 15:56:08,584 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=193, Invalid=457, Unknown=0, NotChecked=0, Total=650 [2024-10-24 15:56:08,584 INFO L87 Difference]: Start difference. First operand 392 states and 516 transitions. Second operand has 26 states, 24 states have (on average 4.083333333333333) internal successors, (98), 26 states have internal predecessors, (98), 2 states have call successors, (6), 2 states have call predecessors, (6), 4 states have return successors, (4), 1 states have call predecessors, (4), 2 states have call successors, (4) [2024-10-24 15:56:10,434 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 15:56:10,435 INFO L93 Difference]: Finished difference Result 407 states and 541 transitions. [2024-10-24 15:56:10,436 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2024-10-24 15:56:10,436 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:56:10,436 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 15:56:10,437 INFO L225 Difference]: With dead ends: 407 [2024-10-24 15:56:10,437 INFO L226 Difference]: Without dead ends: 405 [2024-10-24 15:56:10,438 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:56:10,439 INFO L432 NwaCegarLoop]: 333 mSDtfsCounter, 13 mSDsluCounter, 3633 mSDsCounter, 0 mSdLazyCounter, 586 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 3966 SdHoareTripleChecker+Invalid, 602 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 586 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2024-10-24 15:56:10,439 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 3966 Invalid, 602 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 586 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2024-10-24 15:56:10,440 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 405 states. [2024-10-24 15:56:10,446 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 405 to 404. [2024-10-24 15:56:10,447 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 404 states, 374 states have (on average 1.2914438502673797) internal successors, (483), 392 states have internal predecessors, (483), 23 states have call successors, (23), 5 states have call predecessors, (23), 5 states have return successors, (22), 7 states have call predecessors, (22), 21 states have call successors, (22) [2024-10-24 15:56:10,448 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 404 states to 404 states and 528 transitions. [2024-10-24 15:56:10,448 INFO L78 Accepts]: Start accepts. Automaton has 404 states and 528 transitions. Word has length 103 [2024-10-24 15:56:10,449 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 15:56:10,449 INFO L471 AbstractCegarLoop]: Abstraction has 404 states and 528 transitions. [2024-10-24 15:56:10,449 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:56:10,449 INFO L276 IsEmpty]: Start isEmpty. Operand 404 states and 528 transitions. [2024-10-24 15:56:10,450 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2024-10-24 15:56:10,450 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 15:56:10,450 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:56:10,469 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:56:10,650 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:56:10,651 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2024-10-24 15:56:10,651 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 15:56:10,651 INFO L85 PathProgramCache]: Analyzing trace with hash 818858778, now seen corresponding path program 6 times [2024-10-24 15:56:10,652 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 15:56:10,652 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1259482388] [2024-10-24 15:56:10,652 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2024-10-24 15:56:10,652 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:56:10,652 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 15:56:10,653 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:56:10,654 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:56:15,070 INFO L227 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 13 check-sat command(s) [2024-10-24 15:56:15,070 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-24 15:56:15,110 INFO L255 TraceCheckSpWp]: Trace formula consists of 850 conjuncts, 26 conjuncts are in the unsatisfiable core [2024-10-24 15:56:15,113 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 15:56:15,579 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:56:15,579 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-24 15:56:17,527 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:56:17,527 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-24 15:56:17,527 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1259482388] [2024-10-24 15:56:17,528 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1259482388] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-24 15:56:17,528 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-24 15:56:17,528 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 26] total 50 [2024-10-24 15:56:17,528 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1083157194] [2024-10-24 15:56:17,528 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-24 15:56:17,529 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 50 states [2024-10-24 15:56:17,529 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-24 15:56:17,530 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2024-10-24 15:56:17,530 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=672, Invalid=1778, Unknown=0, NotChecked=0, Total=2450 [2024-10-24 15:56:17,531 INFO L87 Difference]: Start difference. First operand 404 states and 528 transitions. Second operand has 50 states, 48 states have (on average 2.5416666666666665) internal successors, (122), 50 states have internal predecessors, (122), 2 states have call successors, (6), 2 states have call predecessors, (6), 4 states have return successors, (4), 1 states have call predecessors, (4), 2 states have call successors, (4) [2024-10-24 15:56:25,242 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 15:56:25,243 INFO L93 Difference]: Finished difference Result 440 states and 594 transitions. [2024-10-24 15:56:25,243 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 73 states. [2024-10-24 15:56:25,244 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:56:25,244 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 15:56:25,245 INFO L225 Difference]: With dead ends: 440 [2024-10-24 15:56:25,246 INFO L226 Difference]: Without dead ends: 437 [2024-10-24 15:56:25,248 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 272 GetRequests, 180 SyntacticMatches, 0 SemanticMatches, 92 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 485 ImplicationChecksByTransitivity, 6.3s TimeCoverageRelationStatistics Valid=2784, Invalid=5958, Unknown=0, NotChecked=0, Total=8742 [2024-10-24 15:56:25,249 INFO L432 NwaCegarLoop]: 333 mSDtfsCounter, 25 mSDsluCounter, 8577 mSDsCounter, 0 mSdLazyCounter, 2043 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 8910 SdHoareTripleChecker+Invalid, 2054 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 2043 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.3s IncrementalHoareTripleChecker+Time [2024-10-24 15:56:25,249 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [25 Valid, 8910 Invalid, 2054 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 2043 Invalid, 0 Unknown, 0 Unchecked, 3.3s Time] [2024-10-24 15:56:25,250 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 437 states. [2024-10-24 15:56:25,260 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 437 to 437. [2024-10-24 15:56:25,262 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 437 states, 407 states have (on average 1.28992628992629) internal successors, (525), 425 states have internal predecessors, (525), 23 states have call successors, (23), 5 states have call predecessors, (23), 5 states have return successors, (22), 7 states have call predecessors, (22), 21 states have call successors, (22) [2024-10-24 15:56:25,263 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 437 states to 437 states and 570 transitions. [2024-10-24 15:56:25,263 INFO L78 Accepts]: Start accepts. Automaton has 437 states and 570 transitions. Word has length 115 [2024-10-24 15:56:25,264 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 15:56:25,264 INFO L471 AbstractCegarLoop]: Abstraction has 437 states and 570 transitions. [2024-10-24 15:56:25,264 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:56:25,264 INFO L276 IsEmpty]: Start isEmpty. Operand 437 states and 570 transitions. [2024-10-24 15:56:25,265 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2024-10-24 15:56:25,265 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 15:56:25,266 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:56:25,298 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:56:25,466 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:56:25,467 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2024-10-24 15:56:25,467 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 15:56:25,467 INFO L85 PathProgramCache]: Analyzing trace with hash -773187462, now seen corresponding path program 7 times [2024-10-24 15:56:25,468 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 15:56:25,468 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [235995034] [2024-10-24 15:56:25,468 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2024-10-24 15:56:25,469 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:56:25,469 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 15:56:25,472 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:56:25,473 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:56:26,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 15:56:26,302 INFO L255 TraceCheckSpWp]: Trace formula consists of 1092 conjuncts, 17 conjuncts are in the unsatisfiable core [2024-10-24 15:56:26,305 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 15:56:26,607 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:56:26,608 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-24 15:56:27,352 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:56:27,352 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-24 15:56:27,352 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [235995034] [2024-10-24 15:56:27,352 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [235995034] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-24 15:56:27,352 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-24 15:56:27,352 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 18] total 34 [2024-10-24 15:56:27,352 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [94103041] [2024-10-24 15:56:27,352 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-24 15:56:27,353 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2024-10-24 15:56:27,353 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-24 15:56:27,353 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2024-10-24 15:56:27,354 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=321, Invalid=801, Unknown=0, NotChecked=0, Total=1122 [2024-10-24 15:56:27,354 INFO L87 Difference]: Start difference. First operand 437 states and 570 transitions. Second operand has 34 states, 32 states have (on average 3.21875) internal successors, (103), 34 states have internal predecessors, (103), 2 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2024-10-24 15:56:30,118 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 15:56:30,118 INFO L93 Difference]: Finished difference Result 446 states and 586 transitions. [2024-10-24 15:56:30,119 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2024-10-24 15:56:30,120 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:56:30,120 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 15:56:30,122 INFO L225 Difference]: With dead ends: 446 [2024-10-24 15:56:30,122 INFO L226 Difference]: Without dead ends: 446 [2024-10-24 15:56:30,123 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 301 GetRequests, 240 SyntacticMatches, 0 SemanticMatches, 61 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 616 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=1292, Invalid=2614, Unknown=0, NotChecked=0, Total=3906 [2024-10-24 15:56:30,126 INFO L432 NwaCegarLoop]: 332 mSDtfsCounter, 17 mSDsluCounter, 5267 mSDsCounter, 0 mSdLazyCounter, 658 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 5599 SdHoareTripleChecker+Invalid, 689 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 658 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2024-10-24 15:56:30,127 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 5599 Invalid, 689 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 658 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2024-10-24 15:56:30,128 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 446 states. [2024-10-24 15:56:30,134 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 446 to 444. [2024-10-24 15:56:30,135 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 444 states, 414 states have (on average 1.3019323671497585) internal successors, (539), 432 states have internal predecessors, (539), 23 states have call successors, (23), 5 states have call predecessors, (23), 5 states have return successors, (22), 7 states have call predecessors, (22), 21 states have call successors, (22) [2024-10-24 15:56:30,136 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 444 states to 444 states and 584 transitions. [2024-10-24 15:56:30,136 INFO L78 Accepts]: Start accepts. Automaton has 444 states and 584 transitions. Word has length 137 [2024-10-24 15:56:30,137 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 15:56:30,137 INFO L471 AbstractCegarLoop]: Abstraction has 444 states and 584 transitions. [2024-10-24 15:56:30,137 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:56:30,137 INFO L276 IsEmpty]: Start isEmpty. Operand 444 states and 584 transitions. [2024-10-24 15:56:30,138 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2024-10-24 15:56:30,138 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 15:56:30,139 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:56:30,157 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (14)] Ended with exit code 0 [2024-10-24 15:56:30,339 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:56:30,339 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2024-10-24 15:56:30,340 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 15:56:30,340 INFO L85 PathProgramCache]: Analyzing trace with hash 1168411514, now seen corresponding path program 8 times [2024-10-24 15:56:30,341 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 15:56:30,341 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [68551892] [2024-10-24 15:56:30,341 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-10-24 15:56:30,341 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:56:30,341 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 15:56:30,343 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:56:30,344 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:56:31,947 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-10-24 15:56:31,947 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-24 15:56:31,975 INFO L255 TraceCheckSpWp]: Trace formula consists of 1268 conjuncts, 33 conjuncts are in the unsatisfiable core [2024-10-24 15:56:31,980 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 15:56:32,793 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:56:32,793 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-24 15:56:35,762 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:56:35,762 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-24 15:56:35,762 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [68551892] [2024-10-24 15:56:35,762 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [68551892] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-24 15:56:35,763 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-24 15:56:35,763 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [34, 34] total 66 [2024-10-24 15:56:35,763 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1810902989] [2024-10-24 15:56:35,763 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-24 15:56:35,764 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 66 states [2024-10-24 15:56:35,764 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-24 15:56:35,765 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 66 interpolants. [2024-10-24 15:56:35,766 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1153, Invalid=3137, Unknown=0, NotChecked=0, Total=4290 [2024-10-24 15:56:35,766 INFO L87 Difference]: Start difference. First operand 444 states and 584 transitions. Second operand has 66 states, 64 states have (on average 2.109375) internal successors, (135), 66 states have internal predecessors, (135), 2 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2024-10-24 15:56:47,528 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 15:56:47,528 INFO L93 Difference]: Finished difference Result 478 states and 650 transitions. [2024-10-24 15:56:47,529 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 97 states. [2024-10-24 15:56:47,530 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:56:47,530 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 15:56:47,532 INFO L225 Difference]: With dead ends: 478 [2024-10-24 15:56:47,532 INFO L226 Difference]: Without dead ends: 478 [2024-10-24 15:56:47,536 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 365 GetRequests, 240 SyntacticMatches, 0 SemanticMatches, 125 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2760 ImplicationChecksByTransitivity, 11.4s TimeCoverageRelationStatistics Valid=5148, Invalid=10854, Unknown=0, NotChecked=0, Total=16002 [2024-10-24 15:56:47,537 INFO L432 NwaCegarLoop]: 332 mSDtfsCounter, 33 mSDsluCounter, 10201 mSDsCounter, 0 mSdLazyCounter, 2300 mSolverCounterSat, 44 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 33 SdHoareTripleChecker+Valid, 10533 SdHoareTripleChecker+Invalid, 2344 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 44 IncrementalHoareTripleChecker+Valid, 2300 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.5s IncrementalHoareTripleChecker+Time [2024-10-24 15:56:47,537 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [33 Valid, 10533 Invalid, 2344 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [44 Valid, 2300 Invalid, 0 Unknown, 0 Unchecked, 3.5s Time] [2024-10-24 15:56:47,538 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 478 states. [2024-10-24 15:56:47,546 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 478 to 476. [2024-10-24 15:56:47,546 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 476 states, 446 states have (on average 1.352017937219731) internal successors, (603), 464 states have internal predecessors, (603), 23 states have call successors, (23), 5 states have call predecessors, (23), 5 states have return successors, (22), 7 states have call predecessors, (22), 21 states have call successors, (22) [2024-10-24 15:56:47,548 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 476 states to 476 states and 648 transitions. [2024-10-24 15:56:47,548 INFO L78 Accepts]: Start accepts. Automaton has 476 states and 648 transitions. Word has length 153 [2024-10-24 15:56:47,549 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 15:56:47,549 INFO L471 AbstractCegarLoop]: Abstraction has 476 states and 648 transitions. [2024-10-24 15:56:47,549 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:56:47,549 INFO L276 IsEmpty]: Start isEmpty. Operand 476 states and 648 transitions. [2024-10-24 15:56:47,551 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 186 [2024-10-24 15:56:47,551 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 15:56:47,551 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:56:47,575 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:56:47,751 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:56:47,752 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2024-10-24 15:56:47,752 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 15:56:47,752 INFO L85 PathProgramCache]: Analyzing trace with hash 1229418874, now seen corresponding path program 9 times [2024-10-24 15:56:47,753 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 15:56:47,753 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [102153481] [2024-10-24 15:56:47,753 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-10-24 15:56:47,753 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:56:47,753 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 15:56:47,754 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:56:47,755 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