./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_BER_test7-2.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (memcleanup) Using default analysis Version a046e57d Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_BER_test7-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 99f48cdcb9a25adc64e4307e90599f4e37a0b97f677ff29ab3d60f24a1c8e980 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-mul-div-a046e57-m [2024-10-13 10:10:46,390 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-13 10:10:46,460 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-MemCleanup-32bit-Automizer_Default.epf [2024-10-13 10:10:46,465 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-13 10:10:46,467 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-13 10:10:46,494 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-13 10:10:46,496 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-13 10:10:46,496 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-13 10:10:46,497 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-13 10:10:46,498 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-13 10:10:46,499 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-13 10:10:46,499 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-13 10:10:46,500 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-13 10:10:46,500 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-13 10:10:46,502 INFO L153 SettingsManager]: * Use SBE=true [2024-10-13 10:10:46,502 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-13 10:10:46,502 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-13 10:10:46,503 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-13 10:10:46,503 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-13 10:10:46,503 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-13 10:10:46,503 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-13 10:10:46,507 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-13 10:10:46,507 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-10-13 10:10:46,507 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-10-13 10:10:46,508 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-13 10:10:46,508 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-13 10:10:46,508 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-10-13 10:10:46,508 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-13 10:10:46,508 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-10-13 10:10:46,508 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-13 10:10:46,508 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-13 10:10:46,509 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-13 10:10:46,509 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-13 10:10:46,509 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-13 10:10:46,509 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-13 10:10:46,509 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-13 10:10:46,509 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-13 10:10:46,510 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-13 10:10:46,510 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-13 10:10:46,510 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-13 10:10:46,513 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-13 10:10:46,513 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-13 10:10:46,513 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-13 10:10:46,513 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-13 10:10:46,514 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-13 10:10:46,515 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 -> 99f48cdcb9a25adc64e4307e90599f4e37a0b97f677ff29ab3d60f24a1c8e980 [2024-10-13 10:10:46,789 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-13 10:10:46,819 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-13 10:10:46,824 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-13 10:10:46,825 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-13 10:10:46,826 INFO L274 PluginConnector]: CDTParser initialized [2024-10-13 10:10:46,827 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_BER_test7-2.i [2024-10-13 10:10:48,225 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-13 10:10:48,547 INFO L384 CDTParser]: Found 1 translation units. [2024-10-13 10:10:48,548 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_BER_test7-2.i [2024-10-13 10:10:48,575 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2d5002b0b/6452ed7e2ef54df9a1ac176107897f75/FLAGb276a8569 [2024-10-13 10:10:48,591 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2d5002b0b/6452ed7e2ef54df9a1ac176107897f75 [2024-10-13 10:10:48,593 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-13 10:10:48,595 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-13 10:10:48,599 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-13 10:10:48,599 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-13 10:10:48,609 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-13 10:10:48,610 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 10:10:48" (1/1) ... [2024-10-13 10:10:48,615 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1c07b795 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 10:10:48, skipping insertion in model container [2024-10-13 10:10:48,615 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 10:10:48" (1/1) ... [2024-10-13 10:10:48,683 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-13 10:10:49,155 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-13 10:10:49,164 ERROR L321 MainTranslator]: Unsupported Syntax: Found a cast between two array/pointer types of different sizes while using memory model HoenickeLindenmann_Original (while Not using bitvector translation) [2024-10-13 10:10:49,165 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver@3d5d5d0e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 10:10:49, skipping insertion in model container [2024-10-13 10:10:49,165 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-13 10:10:49,166 INFO L186 ToolchainWalker]: Toolchain execution was canceled (user or tool) before executing de.uni_freiburg.informatik.ultimate.boogie.procedureinliner [2024-10-13 10:10:49,167 INFO L158 Benchmark]: Toolchain (without parser) took 571.70ms. Allocated memory is still 153.1MB. Free memory was 80.4MB in the beginning and 58.7MB in the end (delta: 21.7MB). Peak memory consumption was 21.0MB. Max. memory is 16.1GB. [2024-10-13 10:10:49,167 INFO L158 Benchmark]: CDTParser took 0.10ms. Allocated memory is still 153.1MB. Free memory is still 123.2MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-13 10:10:49,168 INFO L158 Benchmark]: CACSL2BoogieTranslator took 566.44ms. Allocated memory is still 153.1MB. Free memory was 80.4MB in the beginning and 58.7MB in the end (delta: 21.7MB). Peak memory consumption was 21.0MB. Max. memory is 16.1GB. [2024-10-13 10:10:49,169 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.10ms. Allocated memory is still 153.1MB. Free memory is still 123.2MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 566.44ms. Allocated memory is still 153.1MB. Free memory was 80.4MB in the beginning and 58.7MB in the end (delta: 21.7MB). Peak memory consumption was 21.0MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - UnsupportedSyntaxResult [Line: 716]: 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_BER_test7-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 99f48cdcb9a25adc64e4307e90599f4e37a0b97f677ff29ab3d60f24a1c8e980 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-mul-div-a046e57-m [2024-10-13 10:10:51,250 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-13 10:10:51,308 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-MemCleanup-32bit-Automizer_Bitvector.epf [2024-10-13 10:10:51,312 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-13 10:10:51,313 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-13 10:10:51,328 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-13 10:10:51,329 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-13 10:10:51,329 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-13 10:10:51,330 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-13 10:10:51,330 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-13 10:10:51,330 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-13 10:10:51,330 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-13 10:10:51,331 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-13 10:10:51,331 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-13 10:10:51,333 INFO L153 SettingsManager]: * Use SBE=true [2024-10-13 10:10:51,334 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-13 10:10:51,334 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-13 10:10:51,334 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-13 10:10:51,335 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-13 10:10:51,337 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-13 10:10:51,337 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-13 10:10:51,337 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-13 10:10:51,338 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-10-13 10:10:51,338 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-10-13 10:10:51,338 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-13 10:10:51,341 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-13 10:10:51,341 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-10-13 10:10:51,342 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-10-13 10:10:51,342 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-13 10:10:51,342 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-10-13 10:10:51,342 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-10-13 10:10:51,342 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-13 10:10:51,342 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-13 10:10:51,343 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-13 10:10:51,343 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-13 10:10:51,343 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-13 10:10:51,351 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-13 10:10:51,352 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-13 10:10:51,352 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-13 10:10:51,352 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-13 10:10:51,352 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-13 10:10:51,353 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-10-13 10:10:51,353 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-10-13 10:10:51,353 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-13 10:10:51,354 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-13 10:10:51,354 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-13 10:10:51,354 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-13 10:10:51,354 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2024-10-13 10:10:51,354 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 -> 99f48cdcb9a25adc64e4307e90599f4e37a0b97f677ff29ab3d60f24a1c8e980 [2024-10-13 10:10:51,662 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-13 10:10:51,683 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-13 10:10:51,685 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-13 10:10:51,686 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-13 10:10:51,686 INFO L274 PluginConnector]: CDTParser initialized [2024-10-13 10:10:51,687 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_BER_test7-2.i [2024-10-13 10:10:53,125 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-13 10:10:53,459 INFO L384 CDTParser]: Found 1 translation units. [2024-10-13 10:10:53,459 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_BER_test7-2.i [2024-10-13 10:10:53,480 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c5e4c6571/ff0bee7f56a84c69832f00b9f7c1a899/FLAG847a4ab90 [2024-10-13 10:10:53,492 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c5e4c6571/ff0bee7f56a84c69832f00b9f7c1a899 [2024-10-13 10:10:53,494 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-13 10:10:53,495 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-13 10:10:53,496 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-13 10:10:53,496 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-13 10:10:53,501 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-13 10:10:53,501 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 10:10:53" (1/1) ... [2024-10-13 10:10:53,502 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6dce6f49 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 10:10:53, skipping insertion in model container [2024-10-13 10:10:53,502 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 10:10:53" (1/1) ... [2024-10-13 10:10:53,565 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-13 10:10:54,021 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-13 10:10:54,038 INFO L197 MainTranslator]: Restarting translation with changed settings: SettingsChange [mNewPreferredMemoryModel=HoenickeLindenmann_1ByteResolution] [2024-10-13 10:10:54,045 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-13 10:10:54,133 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-13 10:10:54,141 INFO L200 MainTranslator]: Completed pre-run [2024-10-13 10:10:54,226 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-13 10:10:54,262 INFO L204 MainTranslator]: Completed translation [2024-10-13 10:10:54,263 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 10:10:54 WrapperNode [2024-10-13 10:10:54,263 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-13 10:10:54,264 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-13 10:10:54,264 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-13 10:10:54,264 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-13 10:10:54,269 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 10:10:54" (1/1) ... [2024-10-13 10:10:54,298 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 10:10:54" (1/1) ... [2024-10-13 10:10:54,353 INFO L138 Inliner]: procedures = 179, calls = 323, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 1176 [2024-10-13 10:10:54,355 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-13 10:10:54,355 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-13 10:10:54,356 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-13 10:10:54,356 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-13 10:10:54,397 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 10:10:54" (1/1) ... [2024-10-13 10:10:54,397 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 10:10:54" (1/1) ... [2024-10-13 10:10:54,409 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 10:10:54" (1/1) ... [2024-10-13 10:10:54,492 INFO L175 MemorySlicer]: Split 301 memory accesses to 3 slices as follows [2, 265, 34]. 88 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0, 0]. The 62 writes are split as follows [0, 58, 4]. [2024-10-13 10:10:54,492 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 10:10:54" (1/1) ... [2024-10-13 10:10:54,493 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 10:10:54" (1/1) ... [2024-10-13 10:10:54,535 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 10:10:54" (1/1) ... [2024-10-13 10:10:54,546 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 10:10:54" (1/1) ... [2024-10-13 10:10:54,554 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 10:10:54" (1/1) ... [2024-10-13 10:10:54,562 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 10:10:54" (1/1) ... [2024-10-13 10:10:54,571 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-13 10:10:54,572 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-13 10:10:54,572 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-13 10:10:54,572 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-13 10:10:54,573 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 10:10:54" (1/1) ... [2024-10-13 10:10:54,577 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-13 10:10:54,587 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 10:10:54,603 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-13 10:10:54,613 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-13 10:10:54,663 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2024-10-13 10:10:54,663 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2024-10-13 10:10:54,664 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#0 [2024-10-13 10:10:54,665 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#1 [2024-10-13 10:10:54,665 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#2 [2024-10-13 10:10:54,665 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#0 [2024-10-13 10:10:54,665 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#1 [2024-10-13 10:10:54,666 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#2 [2024-10-13 10:10:54,666 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#0 [2024-10-13 10:10:54,666 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#1 [2024-10-13 10:10:54,666 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#2 [2024-10-13 10:10:54,666 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#0 [2024-10-13 10:10:54,666 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#1 [2024-10-13 10:10:54,666 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#2 [2024-10-13 10:10:54,667 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-10-13 10:10:54,667 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-13 10:10:54,667 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2024-10-13 10:10:54,667 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2024-10-13 10:10:54,667 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2024-10-13 10:10:54,667 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-10-13 10:10:54,668 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2024-10-13 10:10:54,668 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2024-10-13 10:10:54,668 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2024-10-13 10:10:54,668 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-10-13 10:10:54,668 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#0 [2024-10-13 10:10:54,669 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#1 [2024-10-13 10:10:54,669 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#2 [2024-10-13 10:10:54,669 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-10-13 10:10:54,669 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2024-10-13 10:10:54,669 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#2 [2024-10-13 10:10:54,669 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-13 10:10:54,670 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-13 10:10:54,900 INFO L238 CfgBuilder]: Building ICFG [2024-10-13 10:10:54,902 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-13 10:11:02,000 INFO L? ?]: Removed 140 outVars from TransFormulas that were not future-live. [2024-10-13 10:11:02,000 INFO L287 CfgBuilder]: Performing block encoding [2024-10-13 10:11:02,081 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-13 10:11:02,081 INFO L314 CfgBuilder]: Removed 72 assume(true) statements. [2024-10-13 10:11:02,081 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 10:11:02 BoogieIcfgContainer [2024-10-13 10:11:02,081 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-13 10:11:02,086 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-13 10:11:02,087 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-13 10:11:02,089 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-13 10:11:02,089 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.10 10:10:53" (1/3) ... [2024-10-13 10:11:02,090 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5df73591 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 10:11:02, skipping insertion in model container [2024-10-13 10:11:02,090 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 10:10:54" (2/3) ... [2024-10-13 10:11:02,090 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5df73591 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 10:11:02, skipping insertion in model container [2024-10-13 10:11:02,090 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 10:11:02" (3/3) ... [2024-10-13 10:11:02,091 INFO L112 eAbstractionObserver]: Analyzing ICFG uthash_BER_test7-2.i [2024-10-13 10:11:02,103 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-13 10:11:02,103 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2024-10-13 10:11:02,143 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-13 10:11:02,148 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;@7036570f, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-13 10:11:02,148 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2024-10-13 10:11:02,155 INFO L276 IsEmpty]: Start isEmpty. Operand has 224 states, 214 states have (on average 1.6775700934579438) internal successors, (359), 217 states have internal predecessors, (359), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2024-10-13 10:11:02,162 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2024-10-13 10:11:02,163 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 10:11:02,163 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 10:11:02,163 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2024-10-13 10:11:02,172 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 10:11:02,172 INFO L85 PathProgramCache]: Analyzing trace with hash -1929215884, now seen corresponding path program 1 times [2024-10-13 10:11:02,184 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 10:11:02,184 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1578085973] [2024-10-13 10:11:02,184 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 10:11:02,185 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-13 10:11:02,185 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 10:11:02,191 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-13 10:11:02,204 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2024-10-13 10:11:02,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:11:02,375 INFO L255 TraceCheckSpWp]: Trace formula consists of 68 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-10-13 10:11:02,379 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 10:11:02,387 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 10:11:02,388 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-13 10:11:02,388 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 10:11:02,388 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1578085973] [2024-10-13 10:11:02,389 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1578085973] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 10:11:02,389 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 10:11:02,389 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-13 10:11:02,390 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1850646879] [2024-10-13 10:11:02,391 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 10:11:02,394 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-13 10:11:02,394 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 10:11:02,412 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-13 10:11:02,413 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-13 10:11:02,415 INFO L87 Difference]: Start difference. First operand has 224 states, 214 states have (on average 1.6775700934579438) internal successors, (359), 217 states have internal predecessors, (359), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) Second operand has 2 states, 2 states have (on average 4.0) internal successors, (8), 2 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 10:11:02,464 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 10:11:02,464 INFO L93 Difference]: Finished difference Result 221 states and 287 transitions. [2024-10-13 10:11:02,470 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-13 10:11:02,471 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 4.0) internal successors, (8), 2 states have internal predecessors, (8), 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 9 [2024-10-13 10:11:02,471 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 10:11:02,479 INFO L225 Difference]: With dead ends: 221 [2024-10-13 10:11:02,479 INFO L226 Difference]: Without dead ends: 220 [2024-10-13 10:11:02,481 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-13 10:11:02,484 INFO L432 NwaCegarLoop]: 283 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 283 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-13 10:11:02,485 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 283 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-13 10:11:02,517 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 220 states. [2024-10-13 10:11:02,551 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 220 to 220. [2024-10-13 10:11:02,553 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 220 states, 212 states have (on average 1.3113207547169812) internal successors, (278), 214 states have internal predecessors, (278), 5 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-10-13 10:11:02,560 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 220 states to 220 states and 286 transitions. [2024-10-13 10:11:02,565 INFO L78 Accepts]: Start accepts. Automaton has 220 states and 286 transitions. Word has length 9 [2024-10-13 10:11:02,565 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 10:11:02,565 INFO L471 AbstractCegarLoop]: Abstraction has 220 states and 286 transitions. [2024-10-13 10:11:02,565 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 4.0) internal successors, (8), 2 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 10:11:02,565 INFO L276 IsEmpty]: Start isEmpty. Operand 220 states and 286 transitions. [2024-10-13 10:11:02,566 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2024-10-13 10:11:02,566 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 10:11:02,566 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 10:11:02,573 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2024-10-13 10:11:02,766 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-13 10:11:02,767 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2024-10-13 10:11:02,768 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 10:11:02,768 INFO L85 PathProgramCache]: Analyzing trace with hash -1512525233, now seen corresponding path program 1 times [2024-10-13 10:11:02,768 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 10:11:02,768 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1715865011] [2024-10-13 10:11:02,769 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 10:11:02,769 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-13 10:11:02,769 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 10:11:02,771 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-13 10:11:02,772 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2024-10-13 10:11:02,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:11:02,896 INFO L255 TraceCheckSpWp]: Trace formula consists of 70 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-10-13 10:11:02,900 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 10:11:02,993 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 10:11:02,993 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-13 10:11:02,993 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 10:11:02,993 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1715865011] [2024-10-13 10:11:02,993 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1715865011] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 10:11:02,993 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 10:11:02,994 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-13 10:11:02,994 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1776556150] [2024-10-13 10:11:02,994 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 10:11:02,997 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-13 10:11:02,997 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 10:11:02,998 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-13 10:11:02,998 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-13 10:11:02,999 INFO L87 Difference]: Start difference. First operand 220 states and 286 transitions. Second operand has 4 states, 4 states have (on average 2.5) internal successors, (10), 3 states have internal predecessors, (10), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 10:11:07,456 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-10-13 10:11:09,088 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 10:11:09,088 INFO L93 Difference]: Finished difference Result 366 states and 476 transitions. [2024-10-13 10:11:09,091 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-13 10:11:09,091 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.5) internal successors, (10), 3 states have internal predecessors, (10), 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 11 [2024-10-13 10:11:09,091 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 10:11:09,093 INFO L225 Difference]: With dead ends: 366 [2024-10-13 10:11:09,093 INFO L226 Difference]: Without dead ends: 366 [2024-10-13 10:11:09,093 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-13 10:11:09,094 INFO L432 NwaCegarLoop]: 289 mSDtfsCounter, 181 mSDsluCounter, 506 mSDsCounter, 0 mSdLazyCounter, 117 mSolverCounterSat, 10 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 181 SdHoareTripleChecker+Valid, 795 SdHoareTripleChecker+Invalid, 128 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 117 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.0s IncrementalHoareTripleChecker+Time [2024-10-13 10:11:09,094 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [181 Valid, 795 Invalid, 128 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 117 Invalid, 1 Unknown, 0 Unchecked, 6.0s Time] [2024-10-13 10:11:09,095 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 366 states. [2024-10-13 10:11:09,109 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 366 to 334. [2024-10-13 10:11:09,110 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 334 states, 326 states have (on average 1.3098159509202454) internal successors, (427), 328 states have internal predecessors, (427), 5 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-10-13 10:11:09,111 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 334 states to 334 states and 435 transitions. [2024-10-13 10:11:09,111 INFO L78 Accepts]: Start accepts. Automaton has 334 states and 435 transitions. Word has length 11 [2024-10-13 10:11:09,112 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 10:11:09,112 INFO L471 AbstractCegarLoop]: Abstraction has 334 states and 435 transitions. [2024-10-13 10:11:09,112 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.5) internal successors, (10), 3 states have internal predecessors, (10), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 10:11:09,112 INFO L276 IsEmpty]: Start isEmpty. Operand 334 states and 435 transitions. [2024-10-13 10:11:09,112 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2024-10-13 10:11:09,112 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 10:11:09,113 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 10:11:09,116 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-13 10:11:09,315 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-13 10:11:09,316 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2024-10-13 10:11:09,316 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 10:11:09,316 INFO L85 PathProgramCache]: Analyzing trace with hash -1912523919, now seen corresponding path program 1 times [2024-10-13 10:11:09,317 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 10:11:09,317 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [229117243] [2024-10-13 10:11:09,317 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 10:11:09,317 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-13 10:11:09,317 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 10:11:09,319 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-13 10:11:09,321 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2024-10-13 10:11:09,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:11:09,448 INFO L255 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-10-13 10:11:09,450 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 10:11:09,506 INFO L173 IndexEqualityManager]: detected equality via solver [2024-10-13 10:11:09,510 INFO L173 IndexEqualityManager]: detected equality via solver [2024-10-13 10:11:09,511 INFO L173 IndexEqualityManager]: detected equality via solver [2024-10-13 10:11:09,549 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 39 [2024-10-13 10:11:09,610 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-13 10:11:09,610 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 70 treesize of output 26 [2024-10-13 10:11:09,624 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 10:11:09,626 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-13 10:11:09,626 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 10:11:09,626 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [229117243] [2024-10-13 10:11:09,626 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [229117243] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 10:11:09,626 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 10:11:09,626 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-13 10:11:09,626 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1761330514] [2024-10-13 10:11:09,626 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 10:11:09,627 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-13 10:11:09,627 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 10:11:09,627 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-13 10:11:09,627 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-13 10:11:09,627 INFO L87 Difference]: Start difference. First operand 334 states and 435 transitions. Second operand has 4 states, 4 states have (on average 3.5) internal successors, (14), 3 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 10:11:09,963 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 10:11:09,964 INFO L93 Difference]: Finished difference Result 527 states and 690 transitions. [2024-10-13 10:11:09,964 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-13 10:11:09,964 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.5) internal successors, (14), 3 states have internal predecessors, (14), 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 14 [2024-10-13 10:11:09,964 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 10:11:09,966 INFO L225 Difference]: With dead ends: 527 [2024-10-13 10:11:09,966 INFO L226 Difference]: Without dead ends: 527 [2024-10-13 10:11:09,966 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-13 10:11:09,969 INFO L432 NwaCegarLoop]: 263 mSDtfsCounter, 263 mSDsluCounter, 520 mSDsCounter, 0 mSdLazyCounter, 73 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 266 SdHoareTripleChecker+Valid, 783 SdHoareTripleChecker+Invalid, 74 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 73 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-13 10:11:09,969 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [266 Valid, 783 Invalid, 74 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 73 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-13 10:11:09,970 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 527 states. [2024-10-13 10:11:09,986 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 527 to 333. [2024-10-13 10:11:09,986 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 333 states, 325 states have (on average 1.3076923076923077) internal successors, (425), 327 states have internal predecessors, (425), 5 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-10-13 10:11:09,988 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 333 states to 333 states and 433 transitions. [2024-10-13 10:11:09,988 INFO L78 Accepts]: Start accepts. Automaton has 333 states and 433 transitions. Word has length 14 [2024-10-13 10:11:09,988 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 10:11:09,988 INFO L471 AbstractCegarLoop]: Abstraction has 333 states and 433 transitions. [2024-10-13 10:11:09,988 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.5) internal successors, (14), 3 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 10:11:09,988 INFO L276 IsEmpty]: Start isEmpty. Operand 333 states and 433 transitions. [2024-10-13 10:11:09,990 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2024-10-13 10:11:09,990 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 10:11:09,990 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] [2024-10-13 10:11:09,999 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 (4)] Forceful destruction successful, exit code 0 [2024-10-13 10:11:10,191 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-13 10:11:10,192 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2024-10-13 10:11:10,192 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 10:11:10,192 INFO L85 PathProgramCache]: Analyzing trace with hash -5702684, now seen corresponding path program 1 times [2024-10-13 10:11:10,193 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 10:11:10,193 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1038702259] [2024-10-13 10:11:10,193 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 10:11:10,193 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-13 10:11:10,193 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 10:11:10,198 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-13 10:11:10,199 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2024-10-13 10:11:10,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:11:10,592 INFO L255 TraceCheckSpWp]: Trace formula consists of 492 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-13 10:11:10,595 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 10:11:10,619 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-10-13 10:11:10,619 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-13 10:11:10,619 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 10:11:10,622 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1038702259] [2024-10-13 10:11:10,623 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1038702259] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 10:11:10,623 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 10:11:10,623 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-13 10:11:10,623 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [502839871] [2024-10-13 10:11:10,623 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 10:11:10,623 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-13 10:11:10,624 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 10:11:10,624 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-13 10:11:10,625 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-13 10:11:10,625 INFO L87 Difference]: Start difference. First operand 333 states and 433 transitions. Second operand has 4 states, 4 states have (on average 18.25) internal successors, (73), 4 states have internal predecessors, (73), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-13 10:11:10,776 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 10:11:10,776 INFO L93 Difference]: Finished difference Result 339 states and 423 transitions. [2024-10-13 10:11:10,776 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-13 10:11:10,777 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 18.25) internal successors, (73), 4 states have internal predecessors, (73), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 80 [2024-10-13 10:11:10,777 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 10:11:10,778 INFO L225 Difference]: With dead ends: 339 [2024-10-13 10:11:10,778 INFO L226 Difference]: Without dead ends: 339 [2024-10-13 10:11:10,778 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 77 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-13 10:11:10,779 INFO L432 NwaCegarLoop]: 253 mSDtfsCounter, 30 mSDsluCounter, 489 mSDsCounter, 0 mSdLazyCounter, 50 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 742 SdHoareTripleChecker+Invalid, 72 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 50 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-13 10:11:10,779 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 742 Invalid, 72 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 50 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-13 10:11:10,780 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 339 states. [2024-10-13 10:11:10,785 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 339 to 339. [2024-10-13 10:11:10,786 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 339 states, 331 states have (on average 1.2537764350453173) internal successors, (415), 333 states have internal predecessors, (415), 5 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-10-13 10:11:10,787 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 339 states to 339 states and 423 transitions. [2024-10-13 10:11:10,787 INFO L78 Accepts]: Start accepts. Automaton has 339 states and 423 transitions. Word has length 80 [2024-10-13 10:11:10,787 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 10:11:10,787 INFO L471 AbstractCegarLoop]: Abstraction has 339 states and 423 transitions. [2024-10-13 10:11:10,788 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 18.25) internal successors, (73), 4 states have internal predecessors, (73), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-13 10:11:10,788 INFO L276 IsEmpty]: Start isEmpty. Operand 339 states and 423 transitions. [2024-10-13 10:11:10,789 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2024-10-13 10:11:10,789 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 10:11:10,790 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] [2024-10-13 10:11:10,800 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Ended with exit code 0 [2024-10-13 10:11:10,993 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-13 10:11:10,994 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2024-10-13 10:11:10,994 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 10:11:10,994 INFO L85 PathProgramCache]: Analyzing trace with hash -1111631016, now seen corresponding path program 1 times [2024-10-13 10:11:10,995 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 10:11:10,995 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1894593649] [2024-10-13 10:11:10,995 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 10:11:10,995 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-13 10:11:10,995 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 10:11:10,998 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-13 10:11:10,999 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2024-10-13 10:11:11,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:11:11,376 INFO L255 TraceCheckSpWp]: Trace formula consists of 480 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-13 10:11:11,379 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 10:11:11,405 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 10:11:11,405 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-13 10:11:11,405 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 10:11:11,405 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1894593649] [2024-10-13 10:11:11,405 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1894593649] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 10:11:11,407 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 10:11:11,407 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-13 10:11:11,407 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1021930980] [2024-10-13 10:11:11,407 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 10:11:11,407 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-13 10:11:11,408 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 10:11:11,408 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-13 10:11:11,408 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-13 10:11:11,408 INFO L87 Difference]: Start difference. First operand 339 states and 423 transitions. Second operand has 4 states, 3 states have (on average 25.0) internal successors, (75), 4 states have internal predecessors, (75), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2024-10-13 10:11:11,505 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 10:11:11,505 INFO L93 Difference]: Finished difference Result 341 states and 426 transitions. [2024-10-13 10:11:11,506 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-13 10:11:11,506 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 25.0) internal successors, (75), 4 states have internal predecessors, (75), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) Word has length 80 [2024-10-13 10:11:11,506 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 10:11:11,509 INFO L225 Difference]: With dead ends: 341 [2024-10-13 10:11:11,509 INFO L226 Difference]: Without dead ends: 341 [2024-10-13 10:11:11,509 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 77 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-13 10:11:11,510 INFO L432 NwaCegarLoop]: 270 mSDtfsCounter, 0 mSDsluCounter, 536 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 806 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-13 10:11:11,510 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 806 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-13 10:11:11,511 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 341 states. [2024-10-13 10:11:11,515 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 341 to 341. [2024-10-13 10:11:11,517 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 341 states, 332 states have (on average 1.2560240963855422) internal successors, (417), 335 states have internal predecessors, (417), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2024-10-13 10:11:11,518 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 341 states to 341 states and 426 transitions. [2024-10-13 10:11:11,518 INFO L78 Accepts]: Start accepts. Automaton has 341 states and 426 transitions. Word has length 80 [2024-10-13 10:11:11,519 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 10:11:11,519 INFO L471 AbstractCegarLoop]: Abstraction has 341 states and 426 transitions. [2024-10-13 10:11:11,519 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 25.0) internal successors, (75), 4 states have internal predecessors, (75), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2024-10-13 10:11:11,519 INFO L276 IsEmpty]: Start isEmpty. Operand 341 states and 426 transitions. [2024-10-13 10:11:11,521 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2024-10-13 10:11:11,521 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 10:11:11,521 INFO L215 NwaCegarLoop]: trace histogram [2, 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] [2024-10-13 10:11:11,531 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Ended with exit code 0 [2024-10-13 10:11:11,722 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-13 10:11:11,723 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2024-10-13 10:11:11,723 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 10:11:11,723 INFO L85 PathProgramCache]: Analyzing trace with hash -367712378, now seen corresponding path program 1 times [2024-10-13 10:11:11,724 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 10:11:11,725 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1967482430] [2024-10-13 10:11:11,729 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 10:11:11,729 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-13 10:11:11,730 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 10:11:11,731 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-13 10:11:11,733 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2024-10-13 10:11:12,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:11:12,175 INFO L255 TraceCheckSpWp]: Trace formula consists of 502 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-10-13 10:11:12,178 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 10:11:12,200 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 8 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-10-13 10:11:12,201 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-13 10:11:12,260 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-10-13 10:11:12,261 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 10:11:12,261 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1967482430] [2024-10-13 10:11:12,261 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1967482430] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-13 10:11:12,261 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-13 10:11:12,261 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 8 [2024-10-13 10:11:12,261 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [150430377] [2024-10-13 10:11:12,262 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-13 10:11:12,262 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-13 10:11:12,262 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 10:11:12,263 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-13 10:11:12,263 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2024-10-13 10:11:12,263 INFO L87 Difference]: Start difference. First operand 341 states and 426 transitions. Second operand has 8 states, 6 states have (on average 13.833333333333334) internal successors, (83), 8 states have internal predecessors, (83), 2 states have call successors, (4), 2 states have call predecessors, (4), 4 states have return successors, (4), 1 states have call predecessors, (4), 2 states have call successors, (4) [2024-10-13 10:11:12,450 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 10:11:12,450 INFO L93 Difference]: Finished difference Result 350 states and 440 transitions. [2024-10-13 10:11:12,451 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-10-13 10:11:12,451 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 6 states have (on average 13.833333333333334) internal successors, (83), 8 states have internal predecessors, (83), 2 states have call successors, (4), 2 states have call predecessors, (4), 4 states have return successors, (4), 1 states have call predecessors, (4), 2 states have call successors, (4) Word has length 82 [2024-10-13 10:11:12,452 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 10:11:12,453 INFO L225 Difference]: With dead ends: 350 [2024-10-13 10:11:12,453 INFO L226 Difference]: Without dead ends: 350 [2024-10-13 10:11:12,453 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 165 GetRequests, 156 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=44, Invalid=66, Unknown=0, NotChecked=0, Total=110 [2024-10-13 10:11:12,453 INFO L432 NwaCegarLoop]: 270 mSDtfsCounter, 4 mSDsluCounter, 1333 mSDsCounter, 0 mSdLazyCounter, 64 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 1603 SdHoareTripleChecker+Invalid, 69 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 64 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-13 10:11:12,454 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 1603 Invalid, 69 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 64 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-13 10:11:12,454 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 350 states. [2024-10-13 10:11:12,458 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 350 to 349. [2024-10-13 10:11:12,458 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 349 states, 339 states have (on average 1.2684365781710913) internal successors, (430), 342 states have internal predecessors, (430), 5 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2024-10-13 10:11:12,459 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 349 states to 349 states and 439 transitions. [2024-10-13 10:11:12,459 INFO L78 Accepts]: Start accepts. Automaton has 349 states and 439 transitions. Word has length 82 [2024-10-13 10:11:12,459 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 10:11:12,459 INFO L471 AbstractCegarLoop]: Abstraction has 349 states and 439 transitions. [2024-10-13 10:11:12,459 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 6 states have (on average 13.833333333333334) internal successors, (83), 8 states have internal predecessors, (83), 2 states have call successors, (4), 2 states have call predecessors, (4), 4 states have return successors, (4), 1 states have call predecessors, (4), 2 states have call successors, (4) [2024-10-13 10:11:12,460 INFO L276 IsEmpty]: Start isEmpty. Operand 349 states and 439 transitions. [2024-10-13 10:11:12,460 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2024-10-13 10:11:12,460 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 10:11:12,461 INFO L215 NwaCegarLoop]: trace histogram [6, 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] [2024-10-13 10:11:12,470 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Ended with exit code 0 [2024-10-13 10:11:12,664 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-13 10:11:12,665 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2024-10-13 10:11:12,665 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 10:11:12,665 INFO L85 PathProgramCache]: Analyzing trace with hash 144644152, now seen corresponding path program 2 times [2024-10-13 10:11:12,666 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 10:11:12,666 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1228672228] [2024-10-13 10:11:12,666 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-10-13 10:11:12,666 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-13 10:11:12,666 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 10:11:12,669 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-13 10:11:12,670 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Waiting until timeout for monitored process [2024-10-13 10:11:13,006 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2024-10-13 10:11:13,006 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-13 10:11:13,012 INFO L255 TraceCheckSpWp]: Trace formula consists of 70 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-10-13 10:11:13,015 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 10:11:13,027 INFO L173 IndexEqualityManager]: detected equality via solver [2024-10-13 10:11:13,032 INFO L173 IndexEqualityManager]: detected equality via solver [2024-10-13 10:11:13,032 INFO L173 IndexEqualityManager]: detected equality via solver [2024-10-13 10:11:13,035 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 39 [2024-10-13 10:11:13,120 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-13 10:11:13,120 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 70 treesize of output 26 [2024-10-13 10:11:13,142 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2024-10-13 10:11:13,142 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-13 10:11:13,142 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 10:11:13,143 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1228672228] [2024-10-13 10:11:13,143 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1228672228] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 10:11:13,143 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 10:11:13,143 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-13 10:11:13,143 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [897879338] [2024-10-13 10:11:13,143 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 10:11:13,143 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-13 10:11:13,144 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 10:11:13,144 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-13 10:11:13,144 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-13 10:11:13,144 INFO L87 Difference]: Start difference. First operand 349 states and 439 transitions. Second operand has 4 states, 4 states have (on average 18.25) internal successors, (73), 4 states have internal predecessors, (73), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-13 10:11:13,838 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 10:11:13,838 INFO L93 Difference]: Finished difference Result 509 states and 650 transitions. [2024-10-13 10:11:13,839 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-13 10:11:13,840 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 18.25) internal successors, (73), 4 states have internal predecessors, (73), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 86 [2024-10-13 10:11:13,840 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 10:11:13,842 INFO L225 Difference]: With dead ends: 509 [2024-10-13 10:11:13,842 INFO L226 Difference]: Without dead ends: 509 [2024-10-13 10:11:13,842 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 83 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-13 10:11:13,843 INFO L432 NwaCegarLoop]: 253 mSDtfsCounter, 207 mSDsluCounter, 500 mSDsCounter, 0 mSdLazyCounter, 70 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 210 SdHoareTripleChecker+Valid, 753 SdHoareTripleChecker+Invalid, 71 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 70 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-10-13 10:11:13,847 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [210 Valid, 753 Invalid, 71 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 70 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-10-13 10:11:13,849 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 509 states. [2024-10-13 10:11:13,858 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 509 to 351. [2024-10-13 10:11:13,859 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 351 states, 341 states have (on average 1.2668621700879765) internal successors, (432), 344 states have internal predecessors, (432), 5 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2024-10-13 10:11:13,860 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 351 states to 351 states and 441 transitions. [2024-10-13 10:11:13,860 INFO L78 Accepts]: Start accepts. Automaton has 351 states and 441 transitions. Word has length 86 [2024-10-13 10:11:13,861 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 10:11:13,861 INFO L471 AbstractCegarLoop]: Abstraction has 351 states and 441 transitions. [2024-10-13 10:11:13,861 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 18.25) internal successors, (73), 4 states have internal predecessors, (73), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-13 10:11:13,861 INFO L276 IsEmpty]: Start isEmpty. Operand 351 states and 441 transitions. [2024-10-13 10:11:13,864 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2024-10-13 10:11:13,864 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 10:11:13,864 INFO L215 NwaCegarLoop]: trace histogram [6, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 10:11:13,871 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Ended with exit code 0 [2024-10-13 10:11:14,068 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-13 10:11:14,069 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2024-10-13 10:11:14,069 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 10:11:14,069 INFO L85 PathProgramCache]: Analyzing trace with hash 1669614630, now seen corresponding path program 1 times [2024-10-13 10:11:14,070 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 10:11:14,070 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1033523978] [2024-10-13 10:11:14,070 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 10:11:14,072 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-13 10:11:14,072 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 10:11:14,075 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-13 10:11:14,078 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Waiting until timeout for monitored process [2024-10-13 10:11:14,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:11:14,617 INFO L255 TraceCheckSpWp]: Trace formula consists of 610 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-10-13 10:11:14,621 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 10:11:14,705 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 19 proven. 10 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-10-13 10:11:14,705 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-13 10:11:14,896 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 2 proven. 26 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-10-13 10:11:14,896 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 10:11:14,897 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1033523978] [2024-10-13 10:11:14,897 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1033523978] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-13 10:11:14,897 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-13 10:11:14,897 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 14 [2024-10-13 10:11:14,897 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [154646645] [2024-10-13 10:11:14,897 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-13 10:11:14,898 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-10-13 10:11:14,898 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 10:11:14,899 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-10-13 10:11:14,899 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=121, Unknown=0, NotChecked=0, Total=182 [2024-10-13 10:11:14,899 INFO L87 Difference]: Start difference. First operand 351 states and 441 transitions. Second operand has 14 states, 12 states have (on average 10.416666666666666) internal successors, (125), 14 states have internal predecessors, (125), 2 states have call successors, (4), 2 states have call predecessors, (4), 4 states have return successors, (4), 1 states have call predecessors, (4), 2 states have call successors, (4) [2024-10-13 10:11:15,559 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 10:11:15,560 INFO L93 Difference]: Finished difference Result 363 states and 460 transitions. [2024-10-13 10:11:15,561 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2024-10-13 10:11:15,561 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 12 states have (on average 10.416666666666666) internal successors, (125), 14 states have internal predecessors, (125), 2 states have call successors, (4), 2 states have call predecessors, (4), 4 states have return successors, (4), 1 states have call predecessors, (4), 2 states have call successors, (4) Word has length 122 [2024-10-13 10:11:15,561 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 10:11:15,563 INFO L225 Difference]: With dead ends: 363 [2024-10-13 10:11:15,563 INFO L226 Difference]: Without dead ends: 361 [2024-10-13 10:11:15,563 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 251 GetRequests, 230 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=182, Invalid=324, Unknown=0, NotChecked=0, Total=506 [2024-10-13 10:11:15,564 INFO L432 NwaCegarLoop]: 270 mSDtfsCounter, 8 mSDsluCounter, 1604 mSDsCounter, 0 mSdLazyCounter, 182 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 1874 SdHoareTripleChecker+Invalid, 194 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 182 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-13 10:11:15,564 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 1874 Invalid, 194 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 182 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-13 10:11:15,565 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 361 states. [2024-10-13 10:11:15,569 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 361 to 360. [2024-10-13 10:11:15,570 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 360 states, 350 states have (on average 1.2685714285714285) internal successors, (444), 353 states have internal predecessors, (444), 5 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2024-10-13 10:11:15,571 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 360 states to 360 states and 453 transitions. [2024-10-13 10:11:15,572 INFO L78 Accepts]: Start accepts. Automaton has 360 states and 453 transitions. Word has length 122 [2024-10-13 10:11:15,572 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 10:11:15,572 INFO L471 AbstractCegarLoop]: Abstraction has 360 states and 453 transitions. [2024-10-13 10:11:15,572 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 12 states have (on average 10.416666666666666) internal successors, (125), 14 states have internal predecessors, (125), 2 states have call successors, (4), 2 states have call predecessors, (4), 4 states have return successors, (4), 1 states have call predecessors, (4), 2 states have call successors, (4) [2024-10-13 10:11:15,572 INFO L276 IsEmpty]: Start isEmpty. Operand 360 states and 453 transitions. [2024-10-13 10:11:15,573 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2024-10-13 10:11:15,573 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 10:11:15,574 INFO L215 NwaCegarLoop]: trace histogram [15, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 10:11:15,613 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Ended with exit code 0 [2024-10-13 10:11:15,777 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-13 10:11:15,778 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2024-10-13 10:11:15,780 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 10:11:15,780 INFO L85 PathProgramCache]: Analyzing trace with hash -366140441, now seen corresponding path program 2 times [2024-10-13 10:11:15,781 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 10:11:15,781 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1611189468] [2024-10-13 10:11:15,781 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-10-13 10:11:15,781 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-13 10:11:15,782 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 10:11:15,784 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-13 10:11:15,786 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Waiting until timeout for monitored process [2024-10-13 10:11:16,177 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2024-10-13 10:11:16,177 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-13 10:11:16,182 INFO L255 TraceCheckSpWp]: Trace formula consists of 134 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-13 10:11:16,186 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 10:11:16,208 INFO L134 CoverageAnalysis]: Checked inductivity of 140 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 140 trivial. 0 not checked. [2024-10-13 10:11:16,208 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-13 10:11:16,208 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 10:11:16,208 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1611189468] [2024-10-13 10:11:16,208 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1611189468] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 10:11:16,209 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 10:11:16,209 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-13 10:11:16,209 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1958985130] [2024-10-13 10:11:16,209 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 10:11:16,210 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-13 10:11:16,210 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 10:11:16,210 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-13 10:11:16,210 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-13 10:11:16,211 INFO L87 Difference]: Start difference. First operand 360 states and 453 transitions. Second operand has 4 states, 4 states have (on average 27.25) internal successors, (109), 4 states have internal predecessors, (109), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-13 10:11:16,352 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 10:11:16,352 INFO L93 Difference]: Finished difference Result 366 states and 443 transitions. [2024-10-13 10:11:16,352 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-13 10:11:16,352 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 27.25) internal successors, (109), 4 states have internal predecessors, (109), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 131 [2024-10-13 10:11:16,353 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 10:11:16,354 INFO L225 Difference]: With dead ends: 366 [2024-10-13 10:11:16,354 INFO L226 Difference]: Without dead ends: 366 [2024-10-13 10:11:16,354 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 131 GetRequests, 128 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-13 10:11:16,355 INFO L432 NwaCegarLoop]: 242 mSDtfsCounter, 30 mSDsluCounter, 467 mSDsCounter, 0 mSdLazyCounter, 50 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 709 SdHoareTripleChecker+Invalid, 72 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 50 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-13 10:11:16,355 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 709 Invalid, 72 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 50 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-13 10:11:16,356 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 366 states. [2024-10-13 10:11:16,371 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 366 to 366. [2024-10-13 10:11:16,372 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 366 states, 356 states have (on average 1.2191011235955056) internal successors, (434), 359 states have internal predecessors, (434), 5 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2024-10-13 10:11:16,373 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 366 states to 366 states and 443 transitions. [2024-10-13 10:11:16,374 INFO L78 Accepts]: Start accepts. Automaton has 366 states and 443 transitions. Word has length 131 [2024-10-13 10:11:16,374 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 10:11:16,375 INFO L471 AbstractCegarLoop]: Abstraction has 366 states and 443 transitions. [2024-10-13 10:11:16,375 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 27.25) internal successors, (109), 4 states have internal predecessors, (109), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-13 10:11:16,375 INFO L276 IsEmpty]: Start isEmpty. Operand 366 states and 443 transitions. [2024-10-13 10:11:16,376 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2024-10-13 10:11:16,376 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 10:11:16,376 INFO L215 NwaCegarLoop]: trace histogram [15, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 10:11:16,382 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Ended with exit code 0 [2024-10-13 10:11:16,580 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-13 10:11:16,581 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2024-10-13 10:11:16,581 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 10:11:16,582 INFO L85 PathProgramCache]: Analyzing trace with hash 983789403, now seen corresponding path program 1 times [2024-10-13 10:11:16,582 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 10:11:16,582 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1535562575] [2024-10-13 10:11:16,582 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 10:11:16,582 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-13 10:11:16,583 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 10:11:16,585 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-13 10:11:16,590 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Waiting until timeout for monitored process [2024-10-13 10:11:17,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:11:17,107 INFO L255 TraceCheckSpWp]: Trace formula consists of 697 conjuncts, 13 conjuncts are in the unsatisfiable core [2024-10-13 10:11:17,110 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 10:11:17,330 INFO L134 CoverageAnalysis]: Checked inductivity of 140 backedges. 70 proven. 55 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2024-10-13 10:11:17,330 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-13 10:11:17,954 INFO L134 CoverageAnalysis]: Checked inductivity of 140 backedges. 2 proven. 122 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2024-10-13 10:11:17,954 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 10:11:17,954 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1535562575] [2024-10-13 10:11:17,955 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1535562575] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-13 10:11:17,955 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-13 10:11:17,955 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 26 [2024-10-13 10:11:17,955 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [853730824] [2024-10-13 10:11:17,955 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-13 10:11:17,955 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2024-10-13 10:11:17,955 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 10:11:17,956 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2024-10-13 10:11:17,956 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=193, Invalid=457, Unknown=0, NotChecked=0, Total=650 [2024-10-13 10:11:17,957 INFO L87 Difference]: Start difference. First operand 366 states and 443 transitions. Second operand has 26 states, 24 states have (on average 5.708333333333333) internal successors, (137), 26 states have internal predecessors, (137), 2 states have call successors, (4), 2 states have call predecessors, (4), 4 states have return successors, (4), 1 states have call predecessors, (4), 2 states have call successors, (4) [2024-10-13 10:11:19,946 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 10:11:19,946 INFO L93 Difference]: Finished difference Result 387 states and 480 transitions. [2024-10-13 10:11:19,947 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2024-10-13 10:11:19,947 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 24 states have (on average 5.708333333333333) internal successors, (137), 26 states have internal predecessors, (137), 2 states have call successors, (4), 2 states have call predecessors, (4), 4 states have return successors, (4), 1 states have call predecessors, (4), 2 states have call successors, (4) Word has length 131 [2024-10-13 10:11:19,947 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 10:11:19,949 INFO L225 Difference]: With dead ends: 387 [2024-10-13 10:11:19,949 INFO L226 Difference]: Without dead ends: 385 [2024-10-13 10:11:19,950 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 281 GetRequests, 236 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 100 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=728, Invalid=1434, Unknown=0, NotChecked=0, Total=2162 [2024-10-13 10:11:19,950 INFO L432 NwaCegarLoop]: 259 mSDtfsCounter, 14 mSDsluCounter, 2819 mSDsCounter, 0 mSdLazyCounter, 574 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 3078 SdHoareTripleChecker+Invalid, 594 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 574 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2024-10-13 10:11:19,950 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 3078 Invalid, 594 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 574 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2024-10-13 10:11:19,951 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 385 states. [2024-10-13 10:11:19,956 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 385 to 384. [2024-10-13 10:11:19,956 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 384 states, 374 states have (on average 1.2245989304812834) internal successors, (458), 377 states have internal predecessors, (458), 5 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2024-10-13 10:11:19,958 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 384 states to 384 states and 467 transitions. [2024-10-13 10:11:19,958 INFO L78 Accepts]: Start accepts. Automaton has 384 states and 467 transitions. Word has length 131 [2024-10-13 10:11:19,958 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 10:11:19,958 INFO L471 AbstractCegarLoop]: Abstraction has 384 states and 467 transitions. [2024-10-13 10:11:19,959 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 24 states have (on average 5.708333333333333) internal successors, (137), 26 states have internal predecessors, (137), 2 states have call successors, (4), 2 states have call predecessors, (4), 4 states have return successors, (4), 1 states have call predecessors, (4), 2 states have call successors, (4) [2024-10-13 10:11:19,959 INFO L276 IsEmpty]: Start isEmpty. Operand 384 states and 467 transitions. [2024-10-13 10:11:19,960 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2024-10-13 10:11:19,960 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 10:11:19,960 INFO L215 NwaCegarLoop]: trace histogram [33, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 10:11:19,978 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-13 10:11:20,164 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-13 10:11:20,165 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2024-10-13 10:11:20,165 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 10:11:20,165 INFO L85 PathProgramCache]: Analyzing trace with hash 1269480635, now seen corresponding path program 2 times [2024-10-13 10:11:20,166 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 10:11:20,166 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [16442783] [2024-10-13 10:11:20,166 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-10-13 10:11:20,166 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-13 10:11:20,167 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 10:11:20,170 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-13 10:11:20,171 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (12)] Waiting until timeout for monitored process [2024-10-13 10:11:20,593 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2024-10-13 10:11:20,593 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-13 10:11:20,598 INFO L255 TraceCheckSpWp]: Trace formula consists of 122 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-10-13 10:11:20,601 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 10:11:20,618 INFO L134 CoverageAnalysis]: Checked inductivity of 599 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 599 trivial. 0 not checked. [2024-10-13 10:11:20,619 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-13 10:11:20,619 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 10:11:20,619 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [16442783] [2024-10-13 10:11:20,619 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [16442783] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 10:11:20,619 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 10:11:20,620 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-13 10:11:20,620 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2109549243] [2024-10-13 10:11:20,620 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 10:11:20,620 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 10:11:20,620 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 10:11:20,621 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 10:11:20,621 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 10:11:20,621 INFO L87 Difference]: Start difference. First operand 384 states and 467 transitions. Second operand has 3 states, 3 states have (on average 36.333333333333336) internal successors, (109), 3 states have internal predecessors, (109), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-13 10:11:20,707 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 10:11:20,707 INFO L93 Difference]: Finished difference Result 384 states and 461 transitions. [2024-10-13 10:11:20,708 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 10:11:20,708 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 36.333333333333336) internal successors, (109), 3 states have internal predecessors, (109), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 149 [2024-10-13 10:11:20,708 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 10:11:20,710 INFO L225 Difference]: With dead ends: 384 [2024-10-13 10:11:20,710 INFO L226 Difference]: Without dead ends: 384 [2024-10-13 10:11:20,710 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 148 GetRequests, 147 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 10:11:20,711 INFO L432 NwaCegarLoop]: 255 mSDtfsCounter, 0 mSDsluCounter, 234 mSDsCounter, 0 mSdLazyCounter, 36 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 489 SdHoareTripleChecker+Invalid, 40 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 36 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-13 10:11:20,711 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 489 Invalid, 40 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 36 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-13 10:11:20,712 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 384 states. [2024-10-13 10:11:20,716 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 384 to 384. [2024-10-13 10:11:20,717 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 384 states, 374 states have (on average 1.2085561497326203) internal successors, (452), 377 states have internal predecessors, (452), 5 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2024-10-13 10:11:20,718 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 384 states to 384 states and 461 transitions. [2024-10-13 10:11:20,718 INFO L78 Accepts]: Start accepts. Automaton has 384 states and 461 transitions. Word has length 149 [2024-10-13 10:11:20,718 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 10:11:20,719 INFO L471 AbstractCegarLoop]: Abstraction has 384 states and 461 transitions. [2024-10-13 10:11:20,719 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 36.333333333333336) internal successors, (109), 3 states have internal predecessors, (109), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-13 10:11:20,719 INFO L276 IsEmpty]: Start isEmpty. Operand 384 states and 461 transitions. [2024-10-13 10:11:20,720 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2024-10-13 10:11:20,720 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 10:11:20,720 INFO L215 NwaCegarLoop]: trace histogram [33, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 10:11:20,726 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (12)] Forceful destruction successful, exit code 0 [2024-10-13 10:11:20,921 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-13 10:11:20,921 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2024-10-13 10:11:20,921 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 10:11:20,922 INFO L85 PathProgramCache]: Analyzing trace with hash -2004418307, now seen corresponding path program 1 times [2024-10-13 10:11:20,922 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 10:11:20,922 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1754427780] [2024-10-13 10:11:20,922 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 10:11:20,923 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-13 10:11:20,923 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 10:11:20,926 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-13 10:11:20,927 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (13)] Waiting until timeout for monitored process [2024-10-13 10:11:21,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:11:21,679 INFO L255 TraceCheckSpWp]: Trace formula consists of 897 conjuncts, 25 conjuncts are in the unsatisfiable core [2024-10-13 10:11:21,682 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 10:11:22,465 INFO L134 CoverageAnalysis]: Checked inductivity of 599 backedges. 280 proven. 253 refuted. 0 times theorem prover too weak. 66 trivial. 0 not checked. [2024-10-13 10:11:22,466 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-13 10:11:24,418 INFO L134 CoverageAnalysis]: Checked inductivity of 599 backedges. 2 proven. 530 refuted. 0 times theorem prover too weak. 67 trivial. 0 not checked. [2024-10-13 10:11:24,418 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 10:11:24,418 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1754427780] [2024-10-13 10:11:24,418 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1754427780] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-13 10:11:24,418 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-13 10:11:24,418 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 26] total 50 [2024-10-13 10:11:24,419 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1078848264] [2024-10-13 10:11:24,419 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-13 10:11:24,424 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 50 states [2024-10-13 10:11:24,425 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 10:11:24,426 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2024-10-13 10:11:24,427 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=672, Invalid=1778, Unknown=0, NotChecked=0, Total=2450 [2024-10-13 10:11:24,427 INFO L87 Difference]: Start difference. First operand 384 states and 461 transitions. Second operand has 50 states, 48 states have (on average 3.3541666666666665) internal successors, (161), 50 states have internal predecessors, (161), 2 states have call successors, (4), 2 states have call predecessors, (4), 4 states have return successors, (4), 1 states have call predecessors, (4), 2 states have call successors, (4) [2024-10-13 10:11:31,361 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 10:11:31,362 INFO L93 Difference]: Finished difference Result 421 states and 530 transitions. [2024-10-13 10:11:31,362 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 71 states. [2024-10-13 10:11:31,363 INFO L78 Accepts]: Start accepts. Automaton has has 50 states, 48 states have (on average 3.3541666666666665) internal successors, (161), 50 states have internal predecessors, (161), 2 states have call successors, (4), 2 states have call predecessors, (4), 4 states have return successors, (4), 1 states have call predecessors, (4), 2 states have call successors, (4) Word has length 149 [2024-10-13 10:11:31,363 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 10:11:31,364 INFO L225 Difference]: With dead ends: 421 [2024-10-13 10:11:31,364 INFO L226 Difference]: Without dead ends: 419 [2024-10-13 10:11:31,366 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 339 GetRequests, 248 SyntacticMatches, 0 SemanticMatches, 91 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 465 ImplicationChecksByTransitivity, 6.0s TimeCoverageRelationStatistics Valid=2713, Invalid=5843, Unknown=0, NotChecked=0, Total=8556 [2024-10-13 10:11:31,366 INFO L432 NwaCegarLoop]: 259 mSDtfsCounter, 26 mSDsluCounter, 5890 mSDsCounter, 0 mSdLazyCounter, 1972 mSolverCounterSat, 55 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 6149 SdHoareTripleChecker+Invalid, 2027 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 55 IncrementalHoareTripleChecker+Valid, 1972 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.0s IncrementalHoareTripleChecker+Time [2024-10-13 10:11:31,367 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 6149 Invalid, 2027 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [55 Valid, 1972 Invalid, 0 Unknown, 0 Unchecked, 3.0s Time] [2024-10-13 10:11:31,367 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 419 states. [2024-10-13 10:11:31,371 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 419 to 418. [2024-10-13 10:11:31,371 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 418 states, 408 states have (on average 1.2205882352941178) internal successors, (498), 411 states have internal predecessors, (498), 5 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2024-10-13 10:11:31,372 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 418 states to 418 states and 507 transitions. [2024-10-13 10:11:31,373 INFO L78 Accepts]: Start accepts. Automaton has 418 states and 507 transitions. Word has length 149 [2024-10-13 10:11:31,373 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 10:11:31,373 INFO L471 AbstractCegarLoop]: Abstraction has 418 states and 507 transitions. [2024-10-13 10:11:31,373 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 50 states, 48 states have (on average 3.3541666666666665) internal successors, (161), 50 states have internal predecessors, (161), 2 states have call successors, (4), 2 states have call predecessors, (4), 4 states have return successors, (4), 1 states have call predecessors, (4), 2 states have call successors, (4) [2024-10-13 10:11:31,373 INFO L276 IsEmpty]: Start isEmpty. Operand 418 states and 507 transitions. [2024-10-13 10:11:31,374 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 184 [2024-10-13 10:11:31,374 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 10:11:31,375 INFO L215 NwaCegarLoop]: trace histogram [67, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 10:11:31,398 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (13)] Ended with exit code 0 [2024-10-13 10:11:31,575 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-13 10:11:31,577 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2024-10-13 10:11:31,577 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 10:11:31,577 INFO L85 PathProgramCache]: Analyzing trace with hash -1176990179, now seen corresponding path program 2 times [2024-10-13 10:11:31,578 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 10:11:31,578 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [949542178] [2024-10-13 10:11:31,578 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-10-13 10:11:31,578 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-13 10:11:31,578 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 10:11:31,580 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-13 10:11:31,591 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (14)] Waiting until timeout for monitored process [2024-10-13 10:11:32,810 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-10-13 10:11:32,810 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-13 10:11:32,849 INFO L255 TraceCheckSpWp]: Trace formula consists of 1271 conjuncts, 26 conjuncts are in the unsatisfiable core [2024-10-13 10:11:32,854 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 10:11:33,582 INFO L134 CoverageAnalysis]: Checked inductivity of 2350 backedges. 1083 proven. 276 refuted. 0 times theorem prover too weak. 991 trivial. 0 not checked. [2024-10-13 10:11:33,582 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-13 10:11:35,502 INFO L134 CoverageAnalysis]: Checked inductivity of 2350 backedges. 1083 proven. 276 refuted. 0 times theorem prover too weak. 991 trivial. 0 not checked. [2024-10-13 10:11:35,502 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 10:11:35,502 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [949542178] [2024-10-13 10:11:35,502 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [949542178] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-13 10:11:35,502 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-13 10:11:35,502 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 27] total 52 [2024-10-13 10:11:35,503 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [389693355] [2024-10-13 10:11:35,503 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-13 10:11:35,503 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 52 states [2024-10-13 10:11:35,503 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 10:11:35,504 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2024-10-13 10:11:35,505 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=726, Invalid=1926, Unknown=0, NotChecked=0, Total=2652 [2024-10-13 10:11:35,506 INFO L87 Difference]: Start difference. First operand 418 states and 507 transitions. Second operand has 52 states, 50 states have (on average 3.2) internal successors, (160), 52 states have internal predecessors, (160), 2 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2024-10-13 10:11:42,649 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 10:11:42,649 INFO L93 Difference]: Finished difference Result 445 states and 559 transitions. [2024-10-13 10:11:42,650 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 76 states. [2024-10-13 10:11:42,650 INFO L78 Accepts]: Start accepts. Automaton has has 52 states, 50 states have (on average 3.2) internal successors, (160), 52 states have internal predecessors, (160), 2 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) Word has length 183 [2024-10-13 10:11:42,650 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 10:11:42,651 INFO L225 Difference]: With dead ends: 445 [2024-10-13 10:11:42,651 INFO L226 Difference]: Without dead ends: 445 [2024-10-13 10:11:42,653 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 411 GetRequests, 314 SyntacticMatches, 0 SemanticMatches, 97 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1633 ImplicationChecksByTransitivity, 7.1s TimeCoverageRelationStatistics Valid=3146, Invalid=6556, Unknown=0, NotChecked=0, Total=9702 [2024-10-13 10:11:42,654 INFO L432 NwaCegarLoop]: 258 mSDtfsCounter, 26 mSDsluCounter, 6122 mSDsCounter, 0 mSdLazyCounter, 1446 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 6380 SdHoareTripleChecker+Invalid, 1477 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 1446 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2024-10-13 10:11:42,654 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 6380 Invalid, 1477 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 1446 Invalid, 0 Unknown, 0 Unchecked, 2.2s Time] [2024-10-13 10:11:42,654 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 445 states. [2024-10-13 10:11:42,658 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 445 to 443. [2024-10-13 10:11:42,659 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 443 states, 433 states have (on average 1.2655889145496535) internal successors, (548), 436 states have internal predecessors, (548), 5 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2024-10-13 10:11:42,660 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 443 states to 443 states and 557 transitions. [2024-10-13 10:11:42,660 INFO L78 Accepts]: Start accepts. Automaton has 443 states and 557 transitions. Word has length 183 [2024-10-13 10:11:42,660 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 10:11:42,660 INFO L471 AbstractCegarLoop]: Abstraction has 443 states and 557 transitions. [2024-10-13 10:11:42,660 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 52 states, 50 states have (on average 3.2) internal successors, (160), 52 states have internal predecessors, (160), 2 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2024-10-13 10:11:42,660 INFO L276 IsEmpty]: Start isEmpty. Operand 443 states and 557 transitions. [2024-10-13 10:11:42,661 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 209 [2024-10-13 10:11:42,661 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 10:11:42,662 INFO L215 NwaCegarLoop]: trace histogram [92, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 10:11:42,683 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (14)] Ended with exit code 0 [2024-10-13 10:11:42,865 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-13 10:11:42,866 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2024-10-13 10:11:42,866 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 10:11:42,866 INFO L85 PathProgramCache]: Analyzing trace with hash 1900963388, now seen corresponding path program 3 times [2024-10-13 10:11:42,867 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 10:11:42,867 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [431879250] [2024-10-13 10:11:42,867 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-10-13 10:11:42,867 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-13 10:11:42,867 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 10:11:42,870 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-13 10:11:42,871 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (15)] Waiting until timeout for monitored process [2024-10-13 10:11:43,495 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2024-10-13 10:11:43,495 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-13 10:11:43,510 INFO L255 TraceCheckSpWp]: Trace formula consists of 420 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-13 10:11:43,517 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 10:11:43,847 INFO L134 CoverageAnalysis]: Checked inductivity of 4375 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 4373 trivial. 0 not checked. [2024-10-13 10:11:43,848 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-13 10:11:43,848 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 10:11:43,848 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [431879250] [2024-10-13 10:11:43,848 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [431879250] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 10:11:43,848 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 10:11:43,848 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-13 10:11:43,848 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2088711997] [2024-10-13 10:11:43,848 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 10:11:43,849 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-13 10:11:43,849 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 10:11:43,850 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-13 10:11:43,850 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-13 10:11:43,850 INFO L87 Difference]: Start difference. First operand 443 states and 557 transitions. Second operand has 4 states, 4 states have (on average 27.5) internal successors, (110), 4 states have internal predecessors, (110), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-13 10:11:48,592 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-10-13 10:11:52,598 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-10-13 10:11:55,244 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.38s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-10-13 10:11:55,321 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 10:11:55,321 INFO L93 Difference]: Finished difference Result 534 states and 664 transitions. [2024-10-13 10:11:55,326 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-13 10:11:55,326 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 27.5) internal successors, (110), 4 states have internal predecessors, (110), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 208 [2024-10-13 10:11:55,327 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 10:11:55,329 INFO L225 Difference]: With dead ends: 534 [2024-10-13 10:11:55,329 INFO L226 Difference]: Without dead ends: 534 [2024-10-13 10:11:55,329 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 209 GetRequests, 206 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-13 10:11:55,330 INFO L432 NwaCegarLoop]: 259 mSDtfsCounter, 398 mSDsluCounter, 218 mSDsCounter, 0 mSdLazyCounter, 100 mSolverCounterSat, 5 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 11.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 398 SdHoareTripleChecker+Valid, 477 SdHoareTripleChecker+Invalid, 107 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 100 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 11.4s IncrementalHoareTripleChecker+Time [2024-10-13 10:11:55,330 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [398 Valid, 477 Invalid, 107 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 100 Invalid, 2 Unknown, 0 Unchecked, 11.4s Time] [2024-10-13 10:11:55,331 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 534 states. [2024-10-13 10:11:55,337 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 534 to 531. [2024-10-13 10:11:55,338 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 531 states, 521 states have (on average 1.251439539347409) internal successors, (652), 524 states have internal predecessors, (652), 5 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2024-10-13 10:11:55,340 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 531 states to 531 states and 661 transitions. [2024-10-13 10:11:55,340 INFO L78 Accepts]: Start accepts. Automaton has 531 states and 661 transitions. Word has length 208 [2024-10-13 10:11:55,340 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 10:11:55,340 INFO L471 AbstractCegarLoop]: Abstraction has 531 states and 661 transitions. [2024-10-13 10:11:55,340 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 27.5) internal successors, (110), 4 states have internal predecessors, (110), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-13 10:11:55,341 INFO L276 IsEmpty]: Start isEmpty. Operand 531 states and 661 transitions. [2024-10-13 10:11:55,342 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 217 [2024-10-13 10:11:55,343 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 10:11:55,343 INFO L215 NwaCegarLoop]: trace histogram [92, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 10:11:55,361 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (15)] Ended with exit code 0 [2024-10-13 10:11:55,543 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-13 10:11:55,544 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2024-10-13 10:11:55,544 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 10:11:55,545 INFO L85 PathProgramCache]: Analyzing trace with hash -1944307706, now seen corresponding path program 1 times [2024-10-13 10:11:55,546 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 10:11:55,546 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1633844511] [2024-10-13 10:11:55,546 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 10:11:55,546 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-13 10:11:55,546 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 10:11:55,552 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-13 10:11:55,559 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (16)] Waiting until timeout for monitored process [2024-10-13 10:11:57,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:11:57,377 INFO L255 TraceCheckSpWp]: Trace formula consists of 1562 conjuncts, 51 conjuncts are in the unsatisfiable core [2024-10-13 10:11:57,382 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 10:11:59,077 INFO L134 CoverageAnalysis]: Checked inductivity of 4375 backedges. 2208 proven. 1176 refuted. 0 times theorem prover too weak. 991 trivial. 0 not checked. [2024-10-13 10:11:59,077 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-13 10:12:04,534 INFO L134 CoverageAnalysis]: Checked inductivity of 4375 backedges. 2208 proven. 1176 refuted. 0 times theorem prover too weak. 991 trivial. 0 not checked. [2024-10-13 10:12:04,535 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 10:12:04,536 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1633844511] [2024-10-13 10:12:04,536 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1633844511] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-13 10:12:04,536 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-13 10:12:04,536 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [52, 52] total 102 [2024-10-13 10:12:04,536 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1394560673] [2024-10-13 10:12:04,536 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-13 10:12:04,538 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 102 states [2024-10-13 10:12:04,538 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 10:12:04,543 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 102 interpolants. [2024-10-13 10:12:04,546 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=2701, Invalid=7601, Unknown=0, NotChecked=0, Total=10302 [2024-10-13 10:12:04,550 INFO L87 Difference]: Start difference. First operand 531 states and 661 transitions. Second operand has 102 states, 100 states have (on average 2.18) internal successors, (218), 102 states have internal predecessors, (218), 2 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3)