./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/valid-memcleanup.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_SAX_test1-2.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (memcleanup) Using default analysis Version 4a390ef5 Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_SAX_test1-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 7f552e336cb6eb3ea16ba25a84411e1d0c8dcfaa2b088c21df87ffefed1a84a7 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-4a390ef-m [2024-10-24 15:57:02,118 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-24 15:57:02,174 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-MemCleanup-32bit-Automizer_Default.epf [2024-10-24 15:57:02,182 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-24 15:57:02,186 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-24 15:57:02,219 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-24 15:57:02,220 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-24 15:57:02,221 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-24 15:57:02,222 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-24 15:57:02,224 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-24 15:57:02,224 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-24 15:57:02,224 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-24 15:57:02,225 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-24 15:57:02,225 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-24 15:57:02,227 INFO L153 SettingsManager]: * Use SBE=true [2024-10-24 15:57:02,228 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-24 15:57:02,228 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-24 15:57:02,228 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-24 15:57:02,229 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-24 15:57:02,229 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-24 15:57:02,229 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-24 15:57:02,230 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-24 15:57:02,231 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-10-24 15:57:02,232 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-10-24 15:57:02,232 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-24 15:57:02,232 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-24 15:57:02,234 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-10-24 15:57:02,235 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-24 15:57:02,235 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-10-24 15:57:02,235 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-24 15:57:02,235 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-24 15:57:02,236 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-24 15:57:02,236 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-24 15:57:02,236 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-24 15:57:02,236 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-24 15:57:02,237 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-24 15:57:02,237 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-24 15:57:02,237 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-24 15:57:02,237 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-24 15:57:02,237 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-24 15:57:02,237 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-24 15:57:02,238 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-24 15:57:02,238 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-24 15:57:02,239 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-24 15:57:02,239 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-24 15:57:02,239 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 -> 7f552e336cb6eb3ea16ba25a84411e1d0c8dcfaa2b088c21df87ffefed1a84a7 [2024-10-24 15:57:02,466 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-24 15:57:02,495 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-24 15:57:02,498 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-24 15:57:02,499 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-24 15:57:02,499 INFO L274 PluginConnector]: CDTParser initialized [2024-10-24 15:57:02,501 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_SAX_test1-2.i [2024-10-24 15:57:03,802 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-24 15:57:04,069 INFO L384 CDTParser]: Found 1 translation units. [2024-10-24 15:57:04,070 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_SAX_test1-2.i [2024-10-24 15:57:04,088 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/049cd0f76/7fc6a0bf779340bab9328cb1eaa22b12/FLAGda4b0b2b1 [2024-10-24 15:57:04,361 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/049cd0f76/7fc6a0bf779340bab9328cb1eaa22b12 [2024-10-24 15:57:04,363 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-24 15:57:04,364 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-24 15:57:04,367 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-24 15:57:04,368 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-24 15:57:04,372 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-24 15:57:04,373 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 03:57:04" (1/1) ... [2024-10-24 15:57:04,373 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5adf83ad and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 03:57:04, skipping insertion in model container [2024-10-24 15:57:04,374 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 03:57:04" (1/1) ... [2024-10-24 15:57:04,421 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-24 15:57:04,725 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-24 15:57:04,734 ERROR L321 MainTranslator]: Unsupported Syntax: Found a cast between two array/pointer types of different sizes while using memory model HoenickeLindenmann_Original (while Not using bitvector translation) [2024-10-24 15:57:04,735 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver@1915ee3a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 03:57:04, skipping insertion in model container [2024-10-24 15:57:04,735 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-24 15:57:04,736 INFO L186 ToolchainWalker]: Toolchain execution was canceled (user or tool) before executing de.uni_freiburg.informatik.ultimate.boogie.procedureinliner [2024-10-24 15:57:04,737 INFO L158 Benchmark]: Toolchain (without parser) took 371.91ms. Allocated memory is still 180.4MB. Free memory was 107.9MB in the beginning and 88.3MB in the end (delta: 19.6MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. [2024-10-24 15:57:04,737 INFO L158 Benchmark]: CDTParser took 0.20ms. Allocated memory is still 180.4MB. Free memory is still 138.9MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-24 15:57:04,738 INFO L158 Benchmark]: CACSL2BoogieTranslator took 368.13ms. Allocated memory is still 180.4MB. Free memory was 107.6MB in the beginning and 88.3MB in the end (delta: 19.3MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. [2024-10-24 15:57:04,739 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.20ms. Allocated memory is still 180.4MB. Free memory is still 138.9MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 368.13ms. Allocated memory is still 180.4MB. Free memory was 107.6MB in the beginning and 88.3MB in the end (delta: 19.3MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - UnsupportedSyntaxResult [Line: 751]: Unsupported Syntax Found a cast between two array/pointer types of different sizes while using memory model HoenickeLindenmann_Original (while Not using bitvector translation) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_SAX_test1-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 7f552e336cb6eb3ea16ba25a84411e1d0c8dcfaa2b088c21df87ffefed1a84a7 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-4a390ef-m [2024-10-24 15:57:06,630 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-24 15:57:06,677 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-MemCleanup-32bit-Automizer_Bitvector.epf [2024-10-24 15:57:06,684 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-24 15:57:06,684 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-24 15:57:06,703 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-24 15:57:06,704 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-24 15:57:06,704 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-24 15:57:06,705 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-24 15:57:06,705 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-24 15:57:06,705 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-24 15:57:06,705 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-24 15:57:06,706 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-24 15:57:06,706 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-24 15:57:06,706 INFO L153 SettingsManager]: * Use SBE=true [2024-10-24 15:57:06,707 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-24 15:57:06,707 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-24 15:57:06,707 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-24 15:57:06,707 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-24 15:57:06,708 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-24 15:57:06,708 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-24 15:57:06,708 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-24 15:57:06,709 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-10-24 15:57:06,709 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-10-24 15:57:06,709 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-24 15:57:06,709 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-24 15:57:06,709 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-10-24 15:57:06,710 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-10-24 15:57:06,710 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-24 15:57:06,710 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-10-24 15:57:06,710 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-10-24 15:57:06,711 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-24 15:57:06,711 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-24 15:57:06,711 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-24 15:57:06,711 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-24 15:57:06,712 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-24 15:57:06,712 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-24 15:57:06,712 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-24 15:57:06,712 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-24 15:57:06,713 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-24 15:57:06,713 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-24 15:57:06,713 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-10-24 15:57:06,713 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-10-24 15:57:06,714 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-24 15:57:06,714 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-24 15:57:06,714 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-24 15:57:06,714 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-24 15:57:06,714 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2024-10-24 15:57:06,715 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 -> 7f552e336cb6eb3ea16ba25a84411e1d0c8dcfaa2b088c21df87ffefed1a84a7 [2024-10-24 15:57:06,959 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-24 15:57:06,989 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-24 15:57:06,995 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-24 15:57:06,996 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-24 15:57:06,998 INFO L274 PluginConnector]: CDTParser initialized [2024-10-24 15:57:06,999 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_SAX_test1-2.i [2024-10-24 15:57:08,542 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-24 15:57:08,780 INFO L384 CDTParser]: Found 1 translation units. [2024-10-24 15:57:08,780 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_SAX_test1-2.i [2024-10-24 15:57:08,796 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/168804b14/2d7f4a1f8dd049c29d3388b24d940616/FLAG83fbda714 [2024-10-24 15:57:09,110 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/168804b14/2d7f4a1f8dd049c29d3388b24d940616 [2024-10-24 15:57:09,112 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-24 15:57:09,113 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-24 15:57:09,114 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-24 15:57:09,114 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-24 15:57:09,119 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-24 15:57:09,120 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 03:57:09" (1/1) ... [2024-10-24 15:57:09,121 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@328dda0e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 03:57:09, skipping insertion in model container [2024-10-24 15:57:09,121 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 03:57:09" (1/1) ... [2024-10-24 15:57:09,185 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-24 15:57:09,593 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-24 15:57:09,607 INFO L197 MainTranslator]: Restarting translation with changed settings: SettingsChange [mNewPreferredMemoryModel=HoenickeLindenmann_1ByteResolution] [2024-10-24 15:57:09,619 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-24 15:57:09,691 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-24 15:57:09,694 INFO L200 MainTranslator]: Completed pre-run [2024-10-24 15:57:09,734 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-24 15:57:09,790 INFO L204 MainTranslator]: Completed translation [2024-10-24 15:57:09,791 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 03:57:09 WrapperNode [2024-10-24 15:57:09,791 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-24 15:57:09,792 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-24 15:57:09,792 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-24 15:57:09,792 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-24 15:57:09,797 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 03:57:09" (1/1) ... [2024-10-24 15:57:09,818 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 03:57:09" (1/1) ... [2024-10-24 15:57:09,856 INFO L138 Inliner]: procedures = 179, calls = 231, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 792 [2024-10-24 15:57:09,857 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-24 15:57:09,857 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-24 15:57:09,857 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-24 15:57:09,857 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-24 15:57:09,873 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 03:57:09" (1/1) ... [2024-10-24 15:57:09,873 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 03:57:09" (1/1) ... [2024-10-24 15:57:09,885 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 03:57:09" (1/1) ... [2024-10-24 15:57:09,936 INFO L175 MemorySlicer]: Split 206 memory accesses to 2 slices as follows [2, 204]. 99 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0]. The 50 writes are split as follows [0, 50]. [2024-10-24 15:57:09,940 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 03:57:09" (1/1) ... [2024-10-24 15:57:09,940 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 03:57:09" (1/1) ... [2024-10-24 15:57:09,976 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 03:57:09" (1/1) ... [2024-10-24 15:57:09,982 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 03:57:09" (1/1) ... [2024-10-24 15:57:09,992 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 03:57:09" (1/1) ... [2024-10-24 15:57:09,996 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 03:57:09" (1/1) ... [2024-10-24 15:57:10,002 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-24 15:57:10,003 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-24 15:57:10,003 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-24 15:57:10,003 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-24 15:57:10,004 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 03:57:09" (1/1) ... [2024-10-24 15:57:10,011 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-24 15:57:10,020 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 15:57:10,046 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-24 15:57:10,054 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-24 15:57:10,093 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#0 [2024-10-24 15:57:10,094 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#1 [2024-10-24 15:57:10,095 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#0 [2024-10-24 15:57:10,095 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#1 [2024-10-24 15:57:10,096 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2024-10-24 15:57:10,096 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2024-10-24 15:57:10,096 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#0 [2024-10-24 15:57:10,096 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#1 [2024-10-24 15:57:10,096 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#0 [2024-10-24 15:57:10,096 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#1 [2024-10-24 15:57:10,096 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-10-24 15:57:10,097 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-24 15:57:10,097 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2024-10-24 15:57:10,097 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2024-10-24 15:57:10,097 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2024-10-24 15:57:10,098 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2024-10-24 15:57:10,098 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-10-24 15:57:10,098 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#0 [2024-10-24 15:57:10,098 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#1 [2024-10-24 15:57:10,098 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-10-24 15:57:10,099 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2024-10-24 15:57:10,099 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-24 15:57:10,099 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-24 15:57:10,251 INFO L238 CfgBuilder]: Building ICFG [2024-10-24 15:57:10,253 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-24 15:57:17,126 INFO L? ?]: Removed 124 outVars from TransFormulas that were not future-live. [2024-10-24 15:57:17,126 INFO L287 CfgBuilder]: Performing block encoding [2024-10-24 15:57:17,172 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-24 15:57:17,176 INFO L314 CfgBuilder]: Removed 40 assume(true) statements. [2024-10-24 15:57:17,177 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 03:57:17 BoogieIcfgContainer [2024-10-24 15:57:17,177 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-24 15:57:17,179 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-24 15:57:17,179 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-24 15:57:17,184 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-24 15:57:17,185 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.10 03:57:09" (1/3) ... [2024-10-24 15:57:17,186 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4cbca255 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 03:57:17, skipping insertion in model container [2024-10-24 15:57:17,189 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 03:57:09" (2/3) ... [2024-10-24 15:57:17,189 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4cbca255 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 03:57:17, skipping insertion in model container [2024-10-24 15:57:17,189 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 03:57:17" (3/3) ... [2024-10-24 15:57:17,190 INFO L112 eAbstractionObserver]: Analyzing ICFG uthash_SAX_test1-2.i [2024-10-24 15:57:17,201 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-24 15:57:17,201 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2024-10-24 15:57:17,251 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-24 15:57:17,260 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;@6abd0ef2, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-24 15:57:17,260 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2024-10-24 15:57:17,265 INFO L276 IsEmpty]: Start isEmpty. Operand has 158 states, 140 states have (on average 1.6785714285714286) internal successors, (235), 152 states have internal predecessors, (235), 13 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (13), 4 states have call predecessors, (13), 13 states have call successors, (13) [2024-10-24 15:57:17,272 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2024-10-24 15:57:17,272 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 15:57:17,273 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 15:57:17,273 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, __VERIFIER_assertErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2024-10-24 15:57:17,278 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 15:57:17,280 INFO L85 PathProgramCache]: Analyzing trace with hash -572905081, now seen corresponding path program 1 times [2024-10-24 15:57:17,290 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 15:57:17,291 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1333631982] [2024-10-24 15:57:17,291 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 15:57:17,292 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-24 15:57:17,292 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 15:57:17,297 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-24 15:57:17,299 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2024-10-24 15:57:17,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 15:57:17,414 INFO L255 TraceCheckSpWp]: Trace formula consists of 37 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-10-24 15:57:17,417 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 15:57:17,424 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 15:57:17,424 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-24 15:57:17,424 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-24 15:57:17,425 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1333631982] [2024-10-24 15:57:17,425 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1333631982] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 15:57:17,425 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 15:57:17,425 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-24 15:57:17,426 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [58618756] [2024-10-24 15:57:17,427 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 15:57:17,430 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-24 15:57:17,430 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-24 15:57:17,449 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-24 15:57:17,449 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-24 15:57:17,451 INFO L87 Difference]: Start difference. First operand has 158 states, 140 states have (on average 1.6785714285714286) internal successors, (235), 152 states have internal predecessors, (235), 13 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (13), 4 states have call predecessors, (13), 13 states have call successors, (13) Second operand has 2 states, 2 states have (on average 4.5) internal successors, (9), 2 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 15:57:17,489 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 15:57:17,489 INFO L93 Difference]: Finished difference Result 157 states and 214 transitions. [2024-10-24 15:57:17,490 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-24 15:57:17,491 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 4.5) internal successors, (9), 2 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2024-10-24 15:57:17,492 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 15:57:17,498 INFO L225 Difference]: With dead ends: 157 [2024-10-24 15:57:17,513 INFO L226 Difference]: Without dead ends: 156 [2024-10-24 15:57:17,514 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-24 15:57:17,517 INFO L432 NwaCegarLoop]: 209 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 209 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-24 15:57:17,518 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 209 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-24 15:57:17,531 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 156 states. [2024-10-24 15:57:17,549 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 156 to 156. [2024-10-24 15:57:17,551 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 156 states, 139 states have (on average 1.3453237410071943) internal successors, (187), 150 states have internal predecessors, (187), 13 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (13), 4 states have call predecessors, (13), 13 states have call successors, (13) [2024-10-24 15:57:17,553 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 156 states to 156 states and 213 transitions. [2024-10-24 15:57:17,554 INFO L78 Accepts]: Start accepts. Automaton has 156 states and 213 transitions. Word has length 10 [2024-10-24 15:57:17,554 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 15:57:17,554 INFO L471 AbstractCegarLoop]: Abstraction has 156 states and 213 transitions. [2024-10-24 15:57:17,555 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 4.5) internal successors, (9), 2 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 15:57:17,555 INFO L276 IsEmpty]: Start isEmpty. Operand 156 states and 213 transitions. [2024-10-24 15:57:17,556 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2024-10-24 15:57:17,559 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 15:57:17,559 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 15:57:17,567 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2024-10-24 15:57:17,761 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-24 15:57:17,762 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, __VERIFIER_assertErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2024-10-24 15:57:17,763 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 15:57:17,763 INFO L85 PathProgramCache]: Analyzing trace with hash 210523163, now seen corresponding path program 1 times [2024-10-24 15:57:17,763 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 15:57:17,764 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1578178833] [2024-10-24 15:57:17,764 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 15:57:17,764 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-24 15:57:17,764 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 15:57:17,767 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-24 15:57:17,768 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2024-10-24 15:57:17,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 15:57:17,884 INFO L255 TraceCheckSpWp]: Trace formula consists of 37 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-24 15:57:17,885 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 15:57:17,899 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 15:57:17,900 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-24 15:57:17,900 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-24 15:57:17,900 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1578178833] [2024-10-24 15:57:17,900 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1578178833] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 15:57:17,900 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 15:57:17,900 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-24 15:57:17,901 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1121632594] [2024-10-24 15:57:17,901 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 15:57:17,902 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-24 15:57:17,902 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-24 15:57:17,902 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-24 15:57:17,902 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-24 15:57:17,903 INFO L87 Difference]: Start difference. First operand 156 states and 213 transitions. Second operand has 3 states, 3 states have (on average 3.0) internal successors, (9), 2 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 15:57:18,057 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 15:57:18,057 INFO L93 Difference]: Finished difference Result 245 states and 328 transitions. [2024-10-24 15:57:18,058 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-24 15:57:18,058 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.0) internal successors, (9), 2 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2024-10-24 15:57:18,058 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 15:57:18,062 INFO L225 Difference]: With dead ends: 245 [2024-10-24 15:57:18,062 INFO L226 Difference]: Without dead ends: 245 [2024-10-24 15:57:18,062 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-24 15:57:18,063 INFO L432 NwaCegarLoop]: 233 mSDtfsCounter, 108 mSDsluCounter, 205 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 111 SdHoareTripleChecker+Valid, 438 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-24 15:57:18,063 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [111 Valid, 438 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-24 15:57:18,064 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 245 states. [2024-10-24 15:57:18,077 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 245 to 157. [2024-10-24 15:57:18,078 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 157 states, 140 states have (on average 1.3428571428571427) internal successors, (188), 151 states have internal predecessors, (188), 13 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (13), 4 states have call predecessors, (13), 13 states have call successors, (13) [2024-10-24 15:57:18,079 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 157 states to 157 states and 214 transitions. [2024-10-24 15:57:18,079 INFO L78 Accepts]: Start accepts. Automaton has 157 states and 214 transitions. Word has length 10 [2024-10-24 15:57:18,079 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 15:57:18,079 INFO L471 AbstractCegarLoop]: Abstraction has 157 states and 214 transitions. [2024-10-24 15:57:18,080 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.0) internal successors, (9), 2 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 15:57:18,080 INFO L276 IsEmpty]: Start isEmpty. Operand 157 states and 214 transitions. [2024-10-24 15:57:18,082 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2024-10-24 15:57:18,082 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 15:57:18,082 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 15:57:18,086 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Ended with exit code 0 [2024-10-24 15:57:18,284 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-24 15:57:18,285 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, __VERIFIER_assertErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2024-10-24 15:57:18,286 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 15:57:18,286 INFO L85 PathProgramCache]: Analyzing trace with hash -872910680, now seen corresponding path program 1 times [2024-10-24 15:57:18,287 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 15:57:18,287 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1742519578] [2024-10-24 15:57:18,287 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 15:57:18,287 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-24 15:57:18,288 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 15:57:18,290 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-24 15:57:18,291 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2024-10-24 15:57:18,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 15:57:18,632 INFO L255 TraceCheckSpWp]: Trace formula consists of 310 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-24 15:57:18,635 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 15:57:18,661 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 15:57:18,662 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-24 15:57:18,662 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-24 15:57:18,662 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1742519578] [2024-10-24 15:57:18,662 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1742519578] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 15:57:18,662 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 15:57:18,662 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-24 15:57:18,662 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1496364629] [2024-10-24 15:57:18,663 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 15:57:18,663 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-24 15:57:18,663 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-24 15:57:18,663 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-24 15:57:18,664 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-24 15:57:18,664 INFO L87 Difference]: Start difference. First operand 157 states and 214 transitions. Second operand has 4 states, 4 states have (on average 16.0) internal successors, (64), 4 states have internal predecessors, (64), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 15:57:18,788 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 15:57:18,788 INFO L93 Difference]: Finished difference Result 160 states and 209 transitions. [2024-10-24 15:57:18,788 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-24 15:57:18,789 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 16.0) internal successors, (64), 4 states have internal predecessors, (64), 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 65 [2024-10-24 15:57:18,789 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 15:57:18,790 INFO L225 Difference]: With dead ends: 160 [2024-10-24 15:57:18,790 INFO L226 Difference]: Without dead ends: 160 [2024-10-24 15:57:18,790 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 62 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-24 15:57:18,791 INFO L432 NwaCegarLoop]: 179 mSDtfsCounter, 30 mSDsluCounter, 341 mSDsCounter, 0 mSdLazyCounter, 53 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 520 SdHoareTripleChecker+Invalid, 75 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 53 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-24 15:57:18,791 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 520 Invalid, 75 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 53 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-24 15:57:18,792 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 160 states. [2024-10-24 15:57:18,796 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 160 to 160. [2024-10-24 15:57:18,797 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 160 states, 143 states have (on average 1.2797202797202798) internal successors, (183), 154 states have internal predecessors, (183), 13 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (13), 4 states have call predecessors, (13), 13 states have call successors, (13) [2024-10-24 15:57:18,798 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 160 states to 160 states and 209 transitions. [2024-10-24 15:57:18,798 INFO L78 Accepts]: Start accepts. Automaton has 160 states and 209 transitions. Word has length 65 [2024-10-24 15:57:18,798 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 15:57:18,798 INFO L471 AbstractCegarLoop]: Abstraction has 160 states and 209 transitions. [2024-10-24 15:57:18,798 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 16.0) internal successors, (64), 4 states have internal predecessors, (64), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 15:57:18,799 INFO L276 IsEmpty]: Start isEmpty. Operand 160 states and 209 transitions. [2024-10-24 15:57:18,800 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2024-10-24 15:57:18,800 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 15:57:18,800 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 15:57:18,810 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Ended with exit code 0 [2024-10-24 15:57:19,004 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-24 15:57:19,005 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, __VERIFIER_assertErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2024-10-24 15:57:19,005 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 15:57:19,006 INFO L85 PathProgramCache]: Analyzing trace with hash -894797284, now seen corresponding path program 1 times [2024-10-24 15:57:19,006 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 15:57:19,006 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1467457029] [2024-10-24 15:57:19,006 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 15:57:19,007 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-24 15:57:19,007 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 15:57:19,010 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-24 15:57:19,011 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2024-10-24 15:57:19,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 15:57:19,251 INFO L255 TraceCheckSpWp]: Trace formula consists of 298 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-10-24 15:57:19,256 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 15:57:19,346 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 15:57:19,346 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-24 15:57:19,347 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-24 15:57:19,347 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1467457029] [2024-10-24 15:57:19,347 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1467457029] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 15:57:19,347 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 15:57:19,347 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-24 15:57:19,347 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [140472136] [2024-10-24 15:57:19,347 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 15:57:19,347 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-24 15:57:19,348 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-24 15:57:19,348 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-24 15:57:19,348 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-24 15:57:19,349 INFO L87 Difference]: Start difference. First operand 160 states and 209 transitions. Second operand has 5 states, 5 states have (on average 12.8) internal successors, (64), 5 states have internal predecessors, (64), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 15:57:19,417 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 15:57:19,417 INFO L93 Difference]: Finished difference Result 154 states and 199 transitions. [2024-10-24 15:57:19,418 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-24 15:57:19,418 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.8) internal successors, (64), 5 states have internal predecessors, (64), 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 65 [2024-10-24 15:57:19,418 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 15:57:19,419 INFO L225 Difference]: With dead ends: 154 [2024-10-24 15:57:19,419 INFO L226 Difference]: Without dead ends: 154 [2024-10-24 15:57:19,419 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 61 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-24 15:57:19,420 INFO L432 NwaCegarLoop]: 178 mSDtfsCounter, 0 mSDsluCounter, 339 mSDsCounter, 0 mSdLazyCounter, 48 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 517 SdHoareTripleChecker+Invalid, 51 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 48 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-24 15:57:19,420 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 517 Invalid, 51 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 48 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-24 15:57:19,421 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 154 states. [2024-10-24 15:57:19,425 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 154 to 154. [2024-10-24 15:57:19,425 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 154 states, 137 states have (on average 1.2627737226277371) internal successors, (173), 148 states have internal predecessors, (173), 13 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (13), 4 states have call predecessors, (13), 13 states have call successors, (13) [2024-10-24 15:57:19,426 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 154 states to 154 states and 199 transitions. [2024-10-24 15:57:19,426 INFO L78 Accepts]: Start accepts. Automaton has 154 states and 199 transitions. Word has length 65 [2024-10-24 15:57:19,426 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 15:57:19,427 INFO L471 AbstractCegarLoop]: Abstraction has 154 states and 199 transitions. [2024-10-24 15:57:19,427 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.8) internal successors, (64), 5 states have internal predecessors, (64), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 15:57:19,427 INFO L276 IsEmpty]: Start isEmpty. Operand 154 states and 199 transitions. [2024-10-24 15:57:19,428 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2024-10-24 15:57:19,428 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 15:57:19,428 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 15:57:19,443 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-24 15:57:19,629 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-24 15:57:19,629 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, __VERIFIER_assertErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2024-10-24 15:57:19,630 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 15:57:19,630 INFO L85 PathProgramCache]: Analyzing trace with hash -500430498, now seen corresponding path program 1 times [2024-10-24 15:57:19,630 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 15:57:19,631 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [508095073] [2024-10-24 15:57:19,631 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 15:57:19,631 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-24 15:57:19,631 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 15:57:19,633 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-24 15:57:19,634 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2024-10-24 15:57:19,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 15:57:19,850 INFO L255 TraceCheckSpWp]: Trace formula consists of 300 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-24 15:57:19,854 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 15:57:20,114 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 15:57:20,114 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-24 15:57:20,114 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-24 15:57:20,114 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [508095073] [2024-10-24 15:57:20,115 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [508095073] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 15:57:20,115 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 15:57:20,115 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-24 15:57:20,115 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1332320565] [2024-10-24 15:57:20,115 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 15:57:20,115 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-24 15:57:20,116 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-24 15:57:20,116 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-24 15:57:20,116 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-24 15:57:20,116 INFO L87 Difference]: Start difference. First operand 154 states and 199 transitions. Second operand has 3 states, 3 states have (on average 21.333333333333332) internal successors, (64), 2 states have internal predecessors, (64), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 15:57:21,108 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 15:57:21,108 INFO L93 Difference]: Finished difference Result 220 states and 274 transitions. [2024-10-24 15:57:21,115 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-24 15:57:21,115 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 21.333333333333332) internal successors, (64), 2 states have internal predecessors, (64), 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 65 [2024-10-24 15:57:21,116 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 15:57:21,117 INFO L225 Difference]: With dead ends: 220 [2024-10-24 15:57:21,117 INFO L226 Difference]: Without dead ends: 220 [2024-10-24 15:57:21,117 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 63 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-24 15:57:21,118 INFO L432 NwaCegarLoop]: 218 mSDtfsCounter, 37 mSDsluCounter, 174 mSDsCounter, 0 mSdLazyCounter, 35 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 37 SdHoareTripleChecker+Valid, 392 SdHoareTripleChecker+Invalid, 37 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 35 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2024-10-24 15:57:21,119 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [37 Valid, 392 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 35 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2024-10-24 15:57:21,120 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 220 states. [2024-10-24 15:57:21,127 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 220 to 190. [2024-10-24 15:57:21,127 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 190 states, 173 states have (on average 1.2080924855491328) internal successors, (209), 184 states have internal predecessors, (209), 13 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (13), 4 states have call predecessors, (13), 13 states have call successors, (13) [2024-10-24 15:57:21,129 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 190 states to 190 states and 235 transitions. [2024-10-24 15:57:21,129 INFO L78 Accepts]: Start accepts. Automaton has 190 states and 235 transitions. Word has length 65 [2024-10-24 15:57:21,129 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 15:57:21,129 INFO L471 AbstractCegarLoop]: Abstraction has 190 states and 235 transitions. [2024-10-24 15:57:21,130 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 21.333333333333332) internal successors, (64), 2 states have internal predecessors, (64), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 15:57:21,130 INFO L276 IsEmpty]: Start isEmpty. Operand 190 states and 235 transitions. [2024-10-24 15:57:21,132 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2024-10-24 15:57:21,132 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 15:57:21,132 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 15:57:21,141 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Ended with exit code 0 [2024-10-24 15:57:21,333 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-24 15:57:21,333 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, __VERIFIER_assertErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2024-10-24 15:57:21,334 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 15:57:21,334 INFO L85 PathProgramCache]: Analyzing trace with hash -204105835, now seen corresponding path program 1 times [2024-10-24 15:57:21,335 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 15:57:21,335 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [601771888] [2024-10-24 15:57:21,335 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 15:57:21,335 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-24 15:57:21,335 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 15:57:21,346 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-24 15:57:21,348 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2024-10-24 15:57:21,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 15:57:21,765 INFO L255 TraceCheckSpWp]: Trace formula consists of 429 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-24 15:57:21,767 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 15:57:21,796 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 15:57:21,797 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-24 15:57:21,797 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-24 15:57:21,797 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [601771888] [2024-10-24 15:57:21,797 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [601771888] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 15:57:21,797 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 15:57:21,798 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-24 15:57:21,800 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1331748049] [2024-10-24 15:57:21,801 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 15:57:21,801 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-24 15:57:21,801 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-24 15:57:21,803 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-24 15:57:21,803 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-24 15:57:21,803 INFO L87 Difference]: Start difference. First operand 190 states and 235 transitions. Second operand has 4 states, 3 states have (on average 24.333333333333332) internal successors, (73), 4 states have internal predecessors, (73), 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-24 15:57:21,870 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 15:57:21,870 INFO L93 Difference]: Finished difference Result 192 states and 238 transitions. [2024-10-24 15:57:21,871 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-24 15:57:21,871 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 24.333333333333332) internal successors, (73), 4 states have internal predecessors, (73), 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 78 [2024-10-24 15:57:21,872 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 15:57:21,873 INFO L225 Difference]: With dead ends: 192 [2024-10-24 15:57:21,873 INFO L226 Difference]: Without dead ends: 192 [2024-10-24 15:57:21,874 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 75 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-24 15:57:21,874 INFO L432 NwaCegarLoop]: 192 mSDtfsCounter, 0 mSDsluCounter, 380 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 572 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-24 15:57:21,875 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 572 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-24 15:57:21,875 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 192 states. [2024-10-24 15:57:21,885 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 192 to 192. [2024-10-24 15:57:21,886 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 192 states, 174 states have (on average 1.2126436781609196) internal successors, (211), 186 states have internal predecessors, (211), 13 states have call successors, (13), 2 states have call predecessors, (13), 3 states have return successors, (14), 4 states have call predecessors, (14), 13 states have call successors, (14) [2024-10-24 15:57:21,887 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 192 states to 192 states and 238 transitions. [2024-10-24 15:57:21,889 INFO L78 Accepts]: Start accepts. Automaton has 192 states and 238 transitions. Word has length 78 [2024-10-24 15:57:21,889 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 15:57:21,890 INFO L471 AbstractCegarLoop]: Abstraction has 192 states and 238 transitions. [2024-10-24 15:57:21,890 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 24.333333333333332) internal successors, (73), 4 states have internal predecessors, (73), 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-24 15:57:21,890 INFO L276 IsEmpty]: Start isEmpty. Operand 192 states and 238 transitions. [2024-10-24 15:57:21,892 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2024-10-24 15:57:21,892 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 15:57:21,893 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-24 15:57:21,905 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Forceful destruction successful, exit code 0 [2024-10-24 15:57:22,096 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-24 15:57:22,097 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, __VERIFIER_assertErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2024-10-24 15:57:22,097 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 15:57:22,097 INFO L85 PathProgramCache]: Analyzing trace with hash -1795748105, now seen corresponding path program 1 times [2024-10-24 15:57:22,098 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 15:57:22,098 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1272563902] [2024-10-24 15:57:22,098 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 15:57:22,098 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-24 15:57:22,099 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 15:57:22,102 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-24 15:57:22,103 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Waiting until timeout for monitored process [2024-10-24 15:57:22,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 15:57:22,435 INFO L255 TraceCheckSpWp]: Trace formula consists of 451 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-10-24 15:57:22,437 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 15:57:22,465 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 7 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-10-24 15:57:22,465 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-24 15:57:22,593 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 1 proven. 6 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-10-24 15:57:22,593 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-24 15:57:22,594 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1272563902] [2024-10-24 15:57:22,594 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1272563902] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-24 15:57:22,594 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-24 15:57:22,594 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 8 [2024-10-24 15:57:22,594 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1910256652] [2024-10-24 15:57:22,596 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-24 15:57:22,596 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-24 15:57:22,597 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-24 15:57:22,597 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-24 15:57:22,597 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2024-10-24 15:57:22,597 INFO L87 Difference]: Start difference. First operand 192 states and 238 transitions. Second operand has 8 states, 6 states have (on average 13.5) internal successors, (81), 8 states have internal predecessors, (81), 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-24 15:57:22,747 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 15:57:22,747 INFO L93 Difference]: Finished difference Result 201 states and 252 transitions. [2024-10-24 15:57:22,748 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-10-24 15:57:22,748 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 6 states have (on average 13.5) internal successors, (81), 8 states have internal predecessors, (81), 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 80 [2024-10-24 15:57:22,748 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 15:57:22,749 INFO L225 Difference]: With dead ends: 201 [2024-10-24 15:57:22,749 INFO L226 Difference]: Without dead ends: 201 [2024-10-24 15:57:22,749 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 161 GetRequests, 152 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=44, Invalid=66, Unknown=0, NotChecked=0, Total=110 [2024-10-24 15:57:22,750 INFO L432 NwaCegarLoop]: 192 mSDtfsCounter, 5 mSDsluCounter, 380 mSDsCounter, 0 mSdLazyCounter, 53 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 572 SdHoareTripleChecker+Invalid, 60 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 53 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-24 15:57:22,750 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 572 Invalid, 60 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 53 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-24 15:57:22,751 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 201 states. [2024-10-24 15:57:22,753 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 201 to 200. [2024-10-24 15:57:22,754 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 200 states, 181 states have (on average 1.2375690607734806) internal successors, (224), 193 states have internal predecessors, (224), 13 states have call successors, (13), 3 states have call predecessors, (13), 4 states have return successors, (14), 4 states have call predecessors, (14), 13 states have call successors, (14) [2024-10-24 15:57:22,755 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 200 states to 200 states and 251 transitions. [2024-10-24 15:57:22,755 INFO L78 Accepts]: Start accepts. Automaton has 200 states and 251 transitions. Word has length 80 [2024-10-24 15:57:22,755 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 15:57:22,755 INFO L471 AbstractCegarLoop]: Abstraction has 200 states and 251 transitions. [2024-10-24 15:57:22,755 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 6 states have (on average 13.5) internal successors, (81), 8 states have internal predecessors, (81), 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-24 15:57:22,755 INFO L276 IsEmpty]: Start isEmpty. Operand 200 states and 251 transitions. [2024-10-24 15:57:22,756 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2024-10-24 15:57:22,756 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 15:57:22,758 INFO L215 NwaCegarLoop]: trace histogram [6, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 15:57:22,768 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 (8)] Forceful destruction successful, exit code 0 [2024-10-24 15:57:22,963 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-24 15:57:22,964 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, __VERIFIER_assertErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2024-10-24 15:57:22,964 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 15:57:22,965 INFO L85 PathProgramCache]: Analyzing trace with hash -651462187, now seen corresponding path program 2 times [2024-10-24 15:57:22,965 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 15:57:22,965 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [396342016] [2024-10-24 15:57:22,965 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-10-24 15:57:22,965 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-24 15:57:22,966 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 15:57:22,968 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-24 15:57:22,971 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Waiting until timeout for monitored process [2024-10-24 15:57:23,328 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-10-24 15:57:23,329 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-24 15:57:23,342 INFO L255 TraceCheckSpWp]: Trace formula consists of 495 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-10-24 15:57:23,346 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 15:57:23,413 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 18 proven. 10 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-10-24 15:57:23,414 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-24 15:57:23,610 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 1 proven. 26 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-10-24 15:57:23,611 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-24 15:57:23,611 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [396342016] [2024-10-24 15:57:23,611 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [396342016] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-24 15:57:23,611 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-24 15:57:23,611 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 14 [2024-10-24 15:57:23,611 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1674384753] [2024-10-24 15:57:23,611 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-24 15:57:23,611 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-10-24 15:57:23,612 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-24 15:57:23,612 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-10-24 15:57:23,612 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=121, Unknown=0, NotChecked=0, Total=182 [2024-10-24 15:57:23,612 INFO L87 Difference]: Start difference. First operand 200 states and 251 transitions. Second operand has 14 states, 12 states have (on average 7.25) internal successors, (87), 14 states have internal predecessors, (87), 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-24 15:57:24,168 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 15:57:24,168 INFO L93 Difference]: Finished difference Result 212 states and 270 transitions. [2024-10-24 15:57:24,170 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2024-10-24 15:57:24,171 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 12 states have (on average 7.25) internal successors, (87), 14 states have internal predecessors, (87), 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 84 [2024-10-24 15:57:24,171 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 15:57:24,172 INFO L225 Difference]: With dead ends: 212 [2024-10-24 15:57:24,172 INFO L226 Difference]: Without dead ends: 210 [2024-10-24 15:57:24,172 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 175 GetRequests, 154 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-24 15:57:24,172 INFO L432 NwaCegarLoop]: 192 mSDtfsCounter, 8 mSDsluCounter, 948 mSDsCounter, 0 mSdLazyCounter, 184 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 1140 SdHoareTripleChecker+Invalid, 200 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 184 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-24 15:57:24,173 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 1140 Invalid, 200 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 184 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-24 15:57:24,173 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 210 states. [2024-10-24 15:57:24,179 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 210 to 209. [2024-10-24 15:57:24,180 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 209 states, 190 states have (on average 1.2421052631578948) internal successors, (236), 202 states have internal predecessors, (236), 13 states have call successors, (13), 3 states have call predecessors, (13), 4 states have return successors, (14), 4 states have call predecessors, (14), 13 states have call successors, (14) [2024-10-24 15:57:24,181 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 209 states to 209 states and 263 transitions. [2024-10-24 15:57:24,181 INFO L78 Accepts]: Start accepts. Automaton has 209 states and 263 transitions. Word has length 84 [2024-10-24 15:57:24,181 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 15:57:24,183 INFO L471 AbstractCegarLoop]: Abstraction has 209 states and 263 transitions. [2024-10-24 15:57:24,183 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 12 states have (on average 7.25) internal successors, (87), 14 states have internal predecessors, (87), 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-24 15:57:24,183 INFO L276 IsEmpty]: Start isEmpty. Operand 209 states and 263 transitions. [2024-10-24 15:57:24,184 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2024-10-24 15:57:24,184 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 15:57:24,184 INFO L215 NwaCegarLoop]: trace histogram [15, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 15:57:24,192 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Ended with exit code 0 [2024-10-24 15:57:24,384 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-24 15:57:24,385 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, __VERIFIER_assertErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2024-10-24 15:57:24,385 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 15:57:24,386 INFO L85 PathProgramCache]: Analyzing trace with hash -1817050361, now seen corresponding path program 3 times [2024-10-24 15:57:24,386 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 15:57:24,386 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1378660727] [2024-10-24 15:57:24,386 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-10-24 15:57:24,386 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-24 15:57:24,387 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 15:57:24,388 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-24 15:57:24,389 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Waiting until timeout for monitored process [2024-10-24 15:57:24,689 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2024-10-24 15:57:24,689 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-24 15:57:24,697 INFO L255 TraceCheckSpWp]: Trace formula consists of 315 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-24 15:57:24,699 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 15:57:24,820 INFO L134 CoverageAnalysis]: Checked inductivity of 139 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 138 trivial. 0 not checked. [2024-10-24 15:57:24,820 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-24 15:57:24,981 INFO L134 CoverageAnalysis]: Checked inductivity of 139 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 138 trivial. 0 not checked. [2024-10-24 15:57:24,982 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-24 15:57:24,982 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1378660727] [2024-10-24 15:57:24,982 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1378660727] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-24 15:57:24,982 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-24 15:57:24,982 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 6 [2024-10-24 15:57:24,983 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [68091163] [2024-10-24 15:57:24,983 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-24 15:57:24,983 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-24 15:57:24,983 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-24 15:57:24,984 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-24 15:57:24,984 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-10-24 15:57:24,984 INFO L87 Difference]: Start difference. First operand 209 states and 263 transitions. Second operand has 6 states, 6 states have (on average 22.333333333333332) internal successors, (134), 6 states have internal predecessors, (134), 3 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2024-10-24 15:57:25,339 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 15:57:25,340 INFO L93 Difference]: Finished difference Result 429 states and 527 transitions. [2024-10-24 15:57:25,340 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-24 15:57:25,341 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 22.333333333333332) internal successors, (134), 6 states have internal predecessors, (134), 3 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 93 [2024-10-24 15:57:25,342 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 15:57:25,343 INFO L225 Difference]: With dead ends: 429 [2024-10-24 15:57:25,343 INFO L226 Difference]: Without dead ends: 429 [2024-10-24 15:57:25,344 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 185 GetRequests, 180 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=23, Unknown=0, NotChecked=0, Total=42 [2024-10-24 15:57:25,344 INFO L432 NwaCegarLoop]: 339 mSDtfsCounter, 324 mSDsluCounter, 655 mSDsCounter, 0 mSdLazyCounter, 49 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 331 SdHoareTripleChecker+Valid, 994 SdHoareTripleChecker+Invalid, 53 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 49 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-24 15:57:25,344 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [331 Valid, 994 Invalid, 53 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 49 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-24 15:57:25,345 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 429 states. [2024-10-24 15:57:25,355 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 429 to 429. [2024-10-24 15:57:25,356 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 429 states, 401 states have (on average 1.1945137157107233) internal successors, (479), 413 states have internal predecessors, (479), 22 states have call successors, (22), 3 states have call predecessors, (22), 4 states have return successors, (26), 13 states have call predecessors, (26), 22 states have call successors, (26) [2024-10-24 15:57:25,358 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 429 states to 429 states and 527 transitions. [2024-10-24 15:57:25,358 INFO L78 Accepts]: Start accepts. Automaton has 429 states and 527 transitions. Word has length 93 [2024-10-24 15:57:25,359 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 15:57:25,359 INFO L471 AbstractCegarLoop]: Abstraction has 429 states and 527 transitions. [2024-10-24 15:57:25,359 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 22.333333333333332) internal successors, (134), 6 states have internal predecessors, (134), 3 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2024-10-24 15:57:25,360 INFO L276 IsEmpty]: Start isEmpty. Operand 429 states and 527 transitions. [2024-10-24 15:57:25,362 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 259 [2024-10-24 15:57:25,363 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 15:57:25,363 INFO L215 NwaCegarLoop]: trace histogram [15, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 15:57:25,371 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Ended with exit code 0 [2024-10-24 15:57:25,563 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-24 15:57:25,564 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, __VERIFIER_assertErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2024-10-24 15:57:25,564 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 15:57:25,565 INFO L85 PathProgramCache]: Analyzing trace with hash 35125586, now seen corresponding path program 1 times [2024-10-24 15:57:25,565 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 15:57:25,565 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [661309894] [2024-10-24 15:57:25,566 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 15:57:25,566 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-24 15:57:25,566 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 15:57:25,567 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-24 15:57:25,570 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Waiting until timeout for monitored process [2024-10-24 15:57:26,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 15:57:26,532 INFO L255 TraceCheckSpWp]: Trace formula consists of 1383 conjuncts, 13 conjuncts are in the unsatisfiable core [2024-10-24 15:57:26,536 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 15:57:26,693 INFO L134 CoverageAnalysis]: Checked inductivity of 466 backedges. 180 proven. 55 refuted. 0 times theorem prover too weak. 231 trivial. 0 not checked. [2024-10-24 15:57:26,693 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-24 15:57:27,210 INFO L134 CoverageAnalysis]: Checked inductivity of 466 backedges. 112 proven. 122 refuted. 0 times theorem prover too weak. 232 trivial. 0 not checked. [2024-10-24 15:57:27,211 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-24 15:57:27,211 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [661309894] [2024-10-24 15:57:27,211 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [661309894] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-24 15:57:27,211 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-24 15:57:27,211 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 26 [2024-10-24 15:57:27,211 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1072899934] [2024-10-24 15:57:27,212 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-24 15:57:27,212 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2024-10-24 15:57:27,212 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-24 15:57:27,213 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2024-10-24 15:57:27,213 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=193, Invalid=457, Unknown=0, NotChecked=0, Total=650 [2024-10-24 15:57:27,213 INFO L87 Difference]: Start difference. First operand 429 states and 527 transitions. Second operand has 26 states, 24 states have (on average 5.75) internal successors, (138), 26 states have internal predecessors, (138), 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-24 15:57:28,898 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 15:57:28,899 INFO L93 Difference]: Finished difference Result 450 states and 567 transitions. [2024-10-24 15:57:28,899 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2024-10-24 15:57:28,900 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 24 states have (on average 5.75) internal successors, (138), 26 states have internal predecessors, (138), 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 258 [2024-10-24 15:57:28,900 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 15:57:28,901 INFO L225 Difference]: With dead ends: 450 [2024-10-24 15:57:28,901 INFO L226 Difference]: Without dead ends: 448 [2024-10-24 15:57:28,902 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 535 GetRequests, 490 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 100 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=728, Invalid=1434, Unknown=0, NotChecked=0, Total=2162 [2024-10-24 15:57:28,902 INFO L432 NwaCegarLoop]: 192 mSDtfsCounter, 13 mSDsluCounter, 2269 mSDsCounter, 0 mSdLazyCounter, 580 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 2461 SdHoareTripleChecker+Invalid, 598 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 580 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-10-24 15:57:28,902 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 2461 Invalid, 598 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 580 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-10-24 15:57:28,903 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 448 states. [2024-10-24 15:57:28,908 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 448 to 447. [2024-10-24 15:57:28,908 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 447 states, 419 states have (on average 1.2004773269689737) internal successors, (503), 431 states have internal predecessors, (503), 22 states have call successors, (22), 3 states have call predecessors, (22), 4 states have return successors, (26), 13 states have call predecessors, (26), 22 states have call successors, (26) [2024-10-24 15:57:28,910 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 447 states to 447 states and 551 transitions. [2024-10-24 15:57:28,910 INFO L78 Accepts]: Start accepts. Automaton has 447 states and 551 transitions. Word has length 258 [2024-10-24 15:57:28,910 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 15:57:28,910 INFO L471 AbstractCegarLoop]: Abstraction has 447 states and 551 transitions. [2024-10-24 15:57:28,910 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 24 states have (on average 5.75) internal successors, (138), 26 states have internal predecessors, (138), 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-24 15:57:28,910 INFO L276 IsEmpty]: Start isEmpty. Operand 447 states and 551 transitions. [2024-10-24 15:57:28,912 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 277 [2024-10-24 15:57:28,912 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 15:57:28,913 INFO L215 NwaCegarLoop]: trace histogram [33, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 15:57:28,938 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Ended with exit code 0 [2024-10-24 15:57:29,116 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-24 15:57:29,117 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, __VERIFIER_assertErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2024-10-24 15:57:29,117 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 15:57:29,117 INFO L85 PathProgramCache]: Analyzing trace with hash -1728118766, now seen corresponding path program 2 times [2024-10-24 15:57:29,118 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 15:57:29,118 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1235961847] [2024-10-24 15:57:29,118 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-10-24 15:57:29,118 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-24 15:57:29,118 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 15:57:29,123 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-24 15:57:29,124 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (12)] Waiting until timeout for monitored process [2024-10-24 15:57:30,168 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-10-24 15:57:30,168 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-24 15:57:30,215 INFO L255 TraceCheckSpWp]: Trace formula consists of 1581 conjuncts, 25 conjuncts are in the unsatisfiable core [2024-10-24 15:57:30,221 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 15:57:30,730 INFO L134 CoverageAnalysis]: Checked inductivity of 925 backedges. 390 proven. 253 refuted. 0 times theorem prover too weak. 282 trivial. 0 not checked. [2024-10-24 15:57:30,731 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-24 15:57:32,121 INFO L134 CoverageAnalysis]: Checked inductivity of 925 backedges. 112 proven. 530 refuted. 0 times theorem prover too weak. 283 trivial. 0 not checked. [2024-10-24 15:57:32,121 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-24 15:57:32,121 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1235961847] [2024-10-24 15:57:32,121 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1235961847] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-24 15:57:32,122 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-24 15:57:32,122 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 26] total 50 [2024-10-24 15:57:32,122 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1812079715] [2024-10-24 15:57:32,122 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-24 15:57:32,122 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 50 states [2024-10-24 15:57:32,122 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-24 15:57:32,127 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2024-10-24 15:57:32,127 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=672, Invalid=1778, Unknown=0, NotChecked=0, Total=2450 [2024-10-24 15:57:32,128 INFO L87 Difference]: Start difference. First operand 447 states and 551 transitions. Second operand has 50 states, 48 states have (on average 3.375) internal successors, (162), 50 states have internal predecessors, (162), 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-24 15:57:39,548 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 15:57:39,548 INFO L93 Difference]: Finished difference Result 484 states and 623 transitions. [2024-10-24 15:57:39,549 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 71 states. [2024-10-24 15:57:39,549 INFO L78 Accepts]: Start accepts. Automaton has has 50 states, 48 states have (on average 3.375) internal successors, (162), 50 states have internal predecessors, (162), 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 276 [2024-10-24 15:57:39,550 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 15:57:39,551 INFO L225 Difference]: With dead ends: 484 [2024-10-24 15:57:39,551 INFO L226 Difference]: Without dead ends: 482 [2024-10-24 15:57:39,553 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 593 GetRequests, 502 SyntacticMatches, 0 SemanticMatches, 91 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 465 ImplicationChecksByTransitivity, 5.8s TimeCoverageRelationStatistics Valid=2713, Invalid=5843, Unknown=0, NotChecked=0, Total=8556 [2024-10-24 15:57:39,553 INFO L432 NwaCegarLoop]: 192 mSDtfsCounter, 25 mSDsluCounter, 5477 mSDsCounter, 0 mSdLazyCounter, 2037 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 5669 SdHoareTripleChecker+Invalid, 2068 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 2037 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.1s IncrementalHoareTripleChecker+Time [2024-10-24 15:57:39,554 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [25 Valid, 5669 Invalid, 2068 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 2037 Invalid, 0 Unknown, 0 Unchecked, 3.1s Time] [2024-10-24 15:57:39,554 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 482 states. [2024-10-24 15:57:39,561 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 482 to 481. [2024-10-24 15:57:39,561 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 481 states, 453 states have (on average 1.2119205298013245) internal successors, (549), 465 states have internal predecessors, (549), 22 states have call successors, (22), 3 states have call predecessors, (22), 4 states have return successors, (26), 13 states have call predecessors, (26), 22 states have call successors, (26) [2024-10-24 15:57:39,563 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 481 states to 481 states and 597 transitions. [2024-10-24 15:57:39,563 INFO L78 Accepts]: Start accepts. Automaton has 481 states and 597 transitions. Word has length 276 [2024-10-24 15:57:39,563 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 15:57:39,563 INFO L471 AbstractCegarLoop]: Abstraction has 481 states and 597 transitions. [2024-10-24 15:57:39,563 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 50 states, 48 states have (on average 3.375) internal successors, (162), 50 states have internal predecessors, (162), 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-24 15:57:39,563 INFO L276 IsEmpty]: Start isEmpty. Operand 481 states and 597 transitions. [2024-10-24 15:57:39,567 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 311 [2024-10-24 15:57:39,567 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 15:57:39,567 INFO L215 NwaCegarLoop]: trace histogram [67, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 15:57:39,593 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (12)] Ended with exit code 0 [2024-10-24 15:57:39,771 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-24 15:57:39,772 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, __VERIFIER_assertErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2024-10-24 15:57:39,772 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 15:57:39,772 INFO L85 PathProgramCache]: Analyzing trace with hash 1234848658, now seen corresponding path program 3 times [2024-10-24 15:57:39,773 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 15:57:39,774 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1099130936] [2024-10-24 15:57:39,774 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-10-24 15:57:39,774 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-24 15:57:39,774 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 15:57:39,776 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-24 15:57:39,777 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