./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memcleanup.prp --file ../sv-benchmarks/c/uthash-2.0.2/uthash_SFH_test8-1.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (memcleanup) Using default analysis Version 3061b6dc Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/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 ../sv-benchmarks/c/uthash-2.0.2/uthash_SFH_test8-1.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-MemCleanup-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-memcleanup) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 7e63083161b3199c06a87ea66924e1f63d6865962e6a830baf344139b270d928 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-assert-order-craig-3061b6d-m [2024-11-19 06:28:04,731 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-19 06:28:04,801 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-MemCleanup-32bit-Automizer_Default.epf [2024-11-19 06:28:04,806 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-19 06:28:04,806 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-19 06:28:04,835 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-19 06:28:04,837 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-19 06:28:04,837 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-19 06:28:04,838 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-19 06:28:04,839 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-19 06:28:04,839 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-19 06:28:04,840 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-19 06:28:04,840 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-19 06:28:04,840 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-19 06:28:04,841 INFO L153 SettingsManager]: * Use SBE=true [2024-11-19 06:28:04,841 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-19 06:28:04,841 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-19 06:28:04,841 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-19 06:28:04,841 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-19 06:28:04,842 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-19 06:28:04,842 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-19 06:28:04,846 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-19 06:28:04,846 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-11-19 06:28:04,846 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-11-19 06:28:04,846 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-19 06:28:04,846 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-19 06:28:04,847 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-19 06:28:04,847 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-19 06:28:04,847 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-19 06:28:04,847 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-19 06:28:04,847 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-19 06:28:04,847 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-19 06:28:04,848 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-19 06:28:04,848 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-19 06:28:04,848 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-19 06:28:04,848 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-19 06:28:04,848 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-19 06:28:04,848 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-19 06:28:04,848 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-19 06:28:04,848 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-19 06:28:04,849 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-19 06:28:04,850 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-19 06:28:04,850 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-19 06:28:04,850 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-19 06:28:04,851 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-19 06:28:04,851 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 -> 7e63083161b3199c06a87ea66924e1f63d6865962e6a830baf344139b270d928 [2024-11-19 06:28:05,058 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-19 06:28:05,081 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-19 06:28:05,084 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-19 06:28:05,085 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-19 06:28:05,086 INFO L274 PluginConnector]: CDTParser initialized [2024-11-19 06:28:05,087 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/uthash-2.0.2/uthash_SFH_test8-1.i [2024-11-19 06:28:06,495 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-19 06:28:06,784 INFO L384 CDTParser]: Found 1 translation units. [2024-11-19 06:28:06,785 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_SFH_test8-1.i [2024-11-19 06:28:06,805 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/dc1823331/24a2ed3e627d4a38b3429d8c426df898/FLAGfbdd43261 [2024-11-19 06:28:07,071 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/dc1823331/24a2ed3e627d4a38b3429d8c426df898 [2024-11-19 06:28:07,073 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-19 06:28:07,074 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-19 06:28:07,075 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-19 06:28:07,075 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-19 06:28:07,079 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-19 06:28:07,080 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 06:28:07" (1/1) ... [2024-11-19 06:28:07,081 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@76565bc9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:28:07, skipping insertion in model container [2024-11-19 06:28:07,081 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 06:28:07" (1/1) ... [2024-11-19 06:28:07,125 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-19 06:28:07,545 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-19 06:28:07,577 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-19 06:28:07,586 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-19 06:28:07,588 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-19 06:28:07,596 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-19 06:28:07,634 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-19 06:28:07,634 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-19 06:28:07,638 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-19 06:28:07,638 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-19 06:28:07,641 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-19 06:28:07,643 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-19 06:28:07,645 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-19 06:28:07,646 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-19 06:28:07,657 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-19 06:28:07,669 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-11-19 06:28:07,670 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver@2c332edc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:28:07, skipping insertion in model container [2024-11-19 06:28:07,670 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-19 06:28:07,671 INFO L186 ToolchainWalker]: Toolchain execution was canceled (user or tool) before executing de.uni_freiburg.informatik.ultimate.boogie.procedureinliner [2024-11-19 06:28:07,673 INFO L158 Benchmark]: Toolchain (without parser) took 597.51ms. Allocated memory was 138.4MB in the beginning and 184.5MB in the end (delta: 46.1MB). Free memory was 65.8MB in the beginning and 141.3MB in the end (delta: -75.5MB). Peak memory consumption was 20.6MB. Max. memory is 16.1GB. [2024-11-19 06:28:07,673 INFO L158 Benchmark]: CDTParser took 0.85ms. Allocated memory is still 138.4MB. Free memory is still 100.7MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-19 06:28:07,674 INFO L158 Benchmark]: CACSL2BoogieTranslator took 595.43ms. Allocated memory was 138.4MB in the beginning and 184.5MB in the end (delta: 46.1MB). Free memory was 65.6MB in the beginning and 141.6MB in the end (delta: -76.0MB). Peak memory consumption was 20.6MB. Max. memory is 16.1GB. [2024-11-19 06:28:07,675 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.85ms. Allocated memory is still 138.4MB. Free memory is still 100.7MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 595.43ms. Allocated memory was 138.4MB in the beginning and 184.5MB in the end (delta: 46.1MB). Free memory was 65.6MB in the beginning and 141.6MB in the end (delta: -76.0MB). Peak memory consumption was 20.6MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - UnsupportedSyntaxResult [Line: 778]: 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/11.0.12-open/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 ../sv-benchmarks/c/uthash-2.0.2/uthash_SFH_test8-1.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-MemCleanup-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-memcleanup) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 7e63083161b3199c06a87ea66924e1f63d6865962e6a830baf344139b270d928 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-assert-order-craig-3061b6d-m [2024-11-19 06:28:09,616 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-19 06:28:09,668 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-MemCleanup-32bit-Automizer_Bitvector.epf [2024-11-19 06:28:09,675 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-19 06:28:09,676 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-19 06:28:09,698 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-19 06:28:09,698 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-19 06:28:09,699 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-19 06:28:09,699 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-19 06:28:09,699 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-19 06:28:09,699 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-19 06:28:09,700 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-19 06:28:09,700 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-19 06:28:09,701 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-19 06:28:09,701 INFO L153 SettingsManager]: * Use SBE=true [2024-11-19 06:28:09,701 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-19 06:28:09,701 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-19 06:28:09,702 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-19 06:28:09,702 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-19 06:28:09,702 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-19 06:28:09,702 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-19 06:28:09,706 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-19 06:28:09,706 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-11-19 06:28:09,706 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-11-19 06:28:09,706 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-19 06:28:09,706 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-19 06:28:09,707 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-19 06:28:09,707 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-19 06:28:09,707 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-19 06:28:09,707 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-19 06:28:09,708 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-19 06:28:09,708 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-19 06:28:09,708 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-19 06:28:09,708 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-19 06:28:09,708 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-19 06:28:09,709 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-19 06:28:09,709 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-19 06:28:09,709 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-19 06:28:09,709 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-19 06:28:09,709 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-19 06:28:09,710 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-19 06:28:09,710 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-19 06:28:09,710 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-19 06:28:09,710 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-19 06:28:09,710 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-19 06:28:09,710 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-19 06:28:09,711 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-19 06:28:09,711 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 -> 7e63083161b3199c06a87ea66924e1f63d6865962e6a830baf344139b270d928 [2024-11-19 06:28:09,987 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-19 06:28:10,010 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-19 06:28:10,012 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-19 06:28:10,014 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-19 06:28:10,014 INFO L274 PluginConnector]: CDTParser initialized [2024-11-19 06:28:10,016 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/uthash-2.0.2/uthash_SFH_test8-1.i [2024-11-19 06:28:11,492 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-19 06:28:11,749 INFO L384 CDTParser]: Found 1 translation units. [2024-11-19 06:28:11,750 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_SFH_test8-1.i [2024-11-19 06:28:11,768 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3c267f352/b30a02e66b674930b99522978723af9a/FLAG659416959 [2024-11-19 06:28:11,783 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3c267f352/b30a02e66b674930b99522978723af9a [2024-11-19 06:28:11,786 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-19 06:28:11,787 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-19 06:28:11,788 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-19 06:28:11,788 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-19 06:28:11,792 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-19 06:28:11,792 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 06:28:11" (1/1) ... [2024-11-19 06:28:11,794 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6a881ef0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:28:11, skipping insertion in model container [2024-11-19 06:28:11,795 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 06:28:11" (1/1) ... [2024-11-19 06:28:11,844 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-19 06:28:12,219 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-19 06:28:12,253 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-19 06:28:12,258 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-19 06:28:12,261 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-19 06:28:12,266 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-19 06:28:12,289 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-19 06:28:12,290 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-19 06:28:12,292 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-19 06:28:12,292 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-19 06:28:12,294 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-19 06:28:12,296 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-19 06:28:12,296 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-19 06:28:12,297 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-19 06:28:12,305 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-19 06:28:12,314 INFO L197 MainTranslator]: Restarting translation with changed settings: SettingsChange [mNewPreferredMemoryModel=HoenickeLindenmann_1ByteResolution] [2024-11-19 06:28:12,327 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-19 06:28:12,345 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-19 06:28:12,357 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-19 06:28:12,359 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-19 06:28:12,361 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-19 06:28:12,365 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-19 06:28:12,397 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-19 06:28:12,397 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-19 06:28:12,408 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-19 06:28:12,408 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-19 06:28:12,414 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-19 06:28:12,415 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-19 06:28:12,416 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-19 06:28:12,420 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-19 06:28:12,432 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-19 06:28:12,441 INFO L200 MainTranslator]: Completed pre-run [2024-11-19 06:28:12,527 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-19 06:28:12,563 INFO L204 MainTranslator]: Completed translation [2024-11-19 06:28:12,563 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:28:12 WrapperNode [2024-11-19 06:28:12,564 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-19 06:28:12,564 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-19 06:28:12,565 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-19 06:28:12,565 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-19 06:28:12,570 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:28:12" (1/1) ... [2024-11-19 06:28:12,601 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:28:12" (1/1) ... [2024-11-19 06:28:12,644 INFO L138 Inliner]: procedures = 180, calls = 291, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 1018 [2024-11-19 06:28:12,645 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-19 06:28:12,646 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-19 06:28:12,646 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-19 06:28:12,646 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-19 06:28:12,655 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:28:12" (1/1) ... [2024-11-19 06:28:12,655 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:28:12" (1/1) ... [2024-11-19 06:28:12,665 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:28:12" (1/1) ... [2024-11-19 06:28:12,714 INFO L175 MemorySlicer]: Split 256 memory accesses to 3 slices as follows [2, 220, 34]. 86 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0, 0]. The 54 writes are split as follows [0, 50, 4]. [2024-11-19 06:28:12,714 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:28:12" (1/1) ... [2024-11-19 06:28:12,715 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:28:12" (1/1) ... [2024-11-19 06:28:12,760 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:28:12" (1/1) ... [2024-11-19 06:28:12,766 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:28:12" (1/1) ... [2024-11-19 06:28:12,771 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:28:12" (1/1) ... [2024-11-19 06:28:12,774 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:28:12" (1/1) ... [2024-11-19 06:28:12,782 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-19 06:28:12,783 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-19 06:28:12,783 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-19 06:28:12,783 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-19 06:28:12,784 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:28:12" (1/1) ... [2024-11-19 06:28:12,792 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-19 06:28:12,803 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 06:28:12,817 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-11-19 06:28:12,822 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-11-19 06:28:12,861 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2024-11-19 06:28:12,863 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2024-11-19 06:28:12,863 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#0 [2024-11-19 06:28:12,863 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#1 [2024-11-19 06:28:12,863 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#2 [2024-11-19 06:28:12,864 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#0 [2024-11-19 06:28:12,864 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#1 [2024-11-19 06:28:12,864 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#2 [2024-11-19 06:28:12,864 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2024-11-19 06:28:12,864 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2024-11-19 06:28:12,864 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#0 [2024-11-19 06:28:12,864 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#1 [2024-11-19 06:28:12,864 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#2 [2024-11-19 06:28:12,864 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#0 [2024-11-19 06:28:12,864 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#1 [2024-11-19 06:28:12,864 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#2 [2024-11-19 06:28:12,864 INFO L130 BoogieDeclarations]: Found specification of procedure test_int [2024-11-19 06:28:12,864 INFO L138 BoogieDeclarations]: Found implementation of procedure test_int [2024-11-19 06:28:12,864 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-11-19 06:28:12,864 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-19 06:28:12,864 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2024-11-19 06:28:12,864 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2024-11-19 06:28:12,865 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2024-11-19 06:28:12,865 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-11-19 06:28:12,865 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2024-11-19 06:28:12,865 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2024-11-19 06:28:12,865 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2024-11-19 06:28:12,865 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-19 06:28:12,865 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#0 [2024-11-19 06:28:12,865 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#1 [2024-11-19 06:28:12,867 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#2 [2024-11-19 06:28:12,867 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-19 06:28:12,867 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2024-11-19 06:28:12,867 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#2 [2024-11-19 06:28:12,868 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-19 06:28:12,868 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-19 06:28:13,057 INFO L238 CfgBuilder]: Building ICFG [2024-11-19 06:28:13,059 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-19 06:28:20,456 INFO L? ?]: Removed 142 outVars from TransFormulas that were not future-live. [2024-11-19 06:28:20,456 INFO L287 CfgBuilder]: Performing block encoding [2024-11-19 06:28:20,471 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-19 06:28:20,471 INFO L316 CfgBuilder]: Removed 62 assume(true) statements. [2024-11-19 06:28:20,472 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 06:28:20 BoogieIcfgContainer [2024-11-19 06:28:20,472 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-19 06:28:20,474 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-19 06:28:20,474 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-19 06:28:20,477 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-19 06:28:20,477 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.11 06:28:11" (1/3) ... [2024-11-19 06:28:20,478 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6a10dfe1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 06:28:20, skipping insertion in model container [2024-11-19 06:28:20,478 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:28:12" (2/3) ... [2024-11-19 06:28:20,478 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6a10dfe1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 06:28:20, skipping insertion in model container [2024-11-19 06:28:20,478 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 06:28:20" (3/3) ... [2024-11-19 06:28:20,479 INFO L112 eAbstractionObserver]: Analyzing ICFG uthash_SFH_test8-1.i [2024-11-19 06:28:20,494 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-19 06:28:20,494 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2024-11-19 06:28:20,533 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-19 06:28:20,539 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;@2f13ccb, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-19 06:28:20,539 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2024-11-19 06:28:20,543 INFO L276 IsEmpty]: Start isEmpty. Operand has 237 states, 208 states have (on average 1.6682692307692308) internal successors, (347), 227 states have internal predecessors, (347), 22 states have call successors, (22), 4 states have call predecessors, (22), 4 states have return successors, (22), 8 states have call predecessors, (22), 22 states have call successors, (22) [2024-11-19 06:28:20,548 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2024-11-19 06:28:20,548 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 06:28:20,549 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2024-11-19 06:28:20,549 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-19 06:28:20,553 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 06:28:20,554 INFO L85 PathProgramCache]: Analyzing trace with hash -1628734314, now seen corresponding path program 1 times [2024-11-19 06:28:20,563 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 06:28:20,564 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1426056948] [2024-11-19 06:28:20,564 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 06:28:20,564 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-11-19 06:28:20,565 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 06:28:20,566 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-11-19 06:28:20,569 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-11-19 06:28:20,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 06:28:20,714 INFO L255 TraceCheckSpWp]: Trace formula consists of 65 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-19 06:28:20,718 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 06:28:20,724 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 06:28:20,724 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 06:28:20,724 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 06:28:20,725 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1426056948] [2024-11-19 06:28:20,725 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1426056948] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 06:28:20,726 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 06:28:20,726 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-19 06:28:20,728 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2137197754] [2024-11-19 06:28:20,728 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 06:28:20,732 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-19 06:28:20,732 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 06:28:20,752 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-19 06:28:20,753 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-19 06:28:20,755 INFO L87 Difference]: Start difference. First operand has 237 states, 208 states have (on average 1.6682692307692308) internal successors, (347), 227 states have internal predecessors, (347), 22 states have call successors, (22), 4 states have call predecessors, (22), 4 states have return successors, (22), 8 states have call predecessors, (22), 22 states have call successors, (22) Second operand has 2 states, 2 states have (on average 3.5) internal successors, (7), 2 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 06:28:20,785 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 06:28:20,785 INFO L93 Difference]: Finished difference Result 235 states and 320 transitions. [2024-11-19 06:28:20,787 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-19 06:28:20,788 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 3.5) internal successors, (7), 2 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2024-11-19 06:28:20,788 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 06:28:20,797 INFO L225 Difference]: With dead ends: 235 [2024-11-19 06:28:20,797 INFO L226 Difference]: Without dead ends: 233 [2024-11-19 06:28:20,798 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 6 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-11-19 06:28:20,803 INFO L432 NwaCegarLoop]: 320 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 320 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-19 06:28:20,805 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 320 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 06:28:20,819 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 233 states. [2024-11-19 06:28:20,841 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 233 to 233. [2024-11-19 06:28:20,864 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 233 states, 206 states have (on average 1.3398058252427185) internal successors, (276), 223 states have internal predecessors, (276), 22 states have call successors, (22), 4 states have call predecessors, (22), 3 states have return successors, (20), 6 states have call predecessors, (20), 20 states have call successors, (20) [2024-11-19 06:28:20,871 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 233 states to 233 states and 318 transitions. [2024-11-19 06:28:20,872 INFO L78 Accepts]: Start accepts. Automaton has 233 states and 318 transitions. Word has length 7 [2024-11-19 06:28:20,872 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 06:28:20,872 INFO L471 AbstractCegarLoop]: Abstraction has 233 states and 318 transitions. [2024-11-19 06:28:20,873 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 3.5) internal successors, (7), 2 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 06:28:20,873 INFO L276 IsEmpty]: Start isEmpty. Operand 233 states and 318 transitions. [2024-11-19 06:28:20,873 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2024-11-19 06:28:20,873 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 06:28:20,873 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 06:28:20,881 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-11-19 06:28:21,074 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-11-19 06:28:21,074 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-19 06:28:21,075 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 06:28:21,075 INFO L85 PathProgramCache]: Analyzing trace with hash 1529756569, now seen corresponding path program 1 times [2024-11-19 06:28:21,076 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 06:28:21,076 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1215720678] [2024-11-19 06:28:21,076 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 06:28:21,076 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-11-19 06:28:21,077 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 06:28:21,078 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-11-19 06:28:21,080 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-11-19 06:28:21,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 06:28:21,256 INFO L255 TraceCheckSpWp]: Trace formula consists of 67 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-19 06:28:21,258 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 06:28:21,281 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-19 06:28:21,282 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-19 06:28:21,283 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-19 06:28:21,290 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 39 [2024-11-19 06:28:21,365 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-19 06:28:21,366 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 70 treesize of output 26 [2024-11-19 06:28:21,384 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 06:28:21,385 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 06:28:21,385 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 06:28:21,385 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1215720678] [2024-11-19 06:28:21,386 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1215720678] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 06:28:21,386 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 06:28:21,386 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-19 06:28:21,386 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [157527600] [2024-11-19 06:28:21,387 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 06:28:21,387 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-19 06:28:21,389 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 06:28:21,389 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-19 06:28:21,389 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-19 06:28:21,390 INFO L87 Difference]: Start difference. First operand 233 states and 318 transitions. Second operand has 4 states, 4 states have (on average 2.25) internal successors, (9), 4 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 06:28:21,855 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 06:28:21,856 INFO L93 Difference]: Finished difference Result 415 states and 557 transitions. [2024-11-19 06:28:21,867 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-19 06:28:21,868 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.25) internal successors, (9), 4 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2024-11-19 06:28:21,869 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 06:28:21,871 INFO L225 Difference]: With dead ends: 415 [2024-11-19 06:28:21,872 INFO L226 Difference]: Without dead ends: 415 [2024-11-19 06:28:21,872 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-19 06:28:21,873 INFO L432 NwaCegarLoop]: 325 mSDtfsCounter, 225 mSDsluCounter, 614 mSDsCounter, 0 mSdLazyCounter, 67 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 230 SdHoareTripleChecker+Valid, 939 SdHoareTripleChecker+Invalid, 68 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 67 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-19 06:28:21,874 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [230 Valid, 939 Invalid, 68 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 67 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-19 06:28:21,875 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 415 states. [2024-11-19 06:28:21,888 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 415 to 235. [2024-11-19 06:28:21,889 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 235 states, 208 states have (on average 1.3365384615384615) internal successors, (278), 225 states have internal predecessors, (278), 22 states have call successors, (22), 4 states have call predecessors, (22), 3 states have return successors, (20), 6 states have call predecessors, (20), 20 states have call successors, (20) [2024-11-19 06:28:21,891 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 235 states to 235 states and 320 transitions. [2024-11-19 06:28:21,891 INFO L78 Accepts]: Start accepts. Automaton has 235 states and 320 transitions. Word has length 9 [2024-11-19 06:28:21,891 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 06:28:21,891 INFO L471 AbstractCegarLoop]: Abstraction has 235 states and 320 transitions. [2024-11-19 06:28:21,891 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.25) internal successors, (9), 4 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 06:28:21,891 INFO L276 IsEmpty]: Start isEmpty. Operand 235 states and 320 transitions. [2024-11-19 06:28:21,893 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2024-11-19 06:28:21,893 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 06:28:21,893 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 06:28:21,902 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2024-11-19 06:28:22,094 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-11-19 06:28:22,095 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-19 06:28:22,095 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 06:28:22,095 INFO L85 PathProgramCache]: Analyzing trace with hash -1164520091, now seen corresponding path program 1 times [2024-11-19 06:28:22,099 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 06:28:22,099 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1450281005] [2024-11-19 06:28:22,099 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 06:28:22,099 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-11-19 06:28:22,099 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 06:28:22,103 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-11-19 06:28:22,106 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-11-19 06:28:22,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 06:28:22,419 INFO L255 TraceCheckSpWp]: Trace formula consists of 335 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-19 06:28:22,423 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 06:28:22,445 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 06:28:22,445 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 06:28:22,445 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 06:28:22,445 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1450281005] [2024-11-19 06:28:22,446 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1450281005] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 06:28:22,446 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 06:28:22,446 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-19 06:28:22,446 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1800601052] [2024-11-19 06:28:22,446 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 06:28:22,446 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-19 06:28:22,446 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 06:28:22,447 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-19 06:28:22,447 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-19 06:28:22,447 INFO L87 Difference]: Start difference. First operand 235 states and 320 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, (3), 1 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 06:28:22,559 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 06:28:22,559 INFO L93 Difference]: Finished difference Result 238 states and 315 transitions. [2024-11-19 06:28:22,560 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-19 06:28:22,560 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, (3), 1 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 67 [2024-11-19 06:28:22,560 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 06:28:22,561 INFO L225 Difference]: With dead ends: 238 [2024-11-19 06:28:22,561 INFO L226 Difference]: Without dead ends: 238 [2024-11-19 06:28:22,562 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 64 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-11-19 06:28:22,562 INFO L432 NwaCegarLoop]: 288 mSDtfsCounter, 30 mSDsluCounter, 557 mSDsCounter, 0 mSdLazyCounter, 43 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 845 SdHoareTripleChecker+Invalid, 65 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 43 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-19 06:28:22,563 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 845 Invalid, 65 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 43 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-19 06:28:22,563 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 238 states. [2024-11-19 06:28:22,574 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 238 to 238. [2024-11-19 06:28:22,574 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 238 states, 211 states have (on average 1.2938388625592416) internal successors, (273), 228 states have internal predecessors, (273), 22 states have call successors, (22), 4 states have call predecessors, (22), 3 states have return successors, (20), 6 states have call predecessors, (20), 20 states have call successors, (20) [2024-11-19 06:28:22,576 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 238 states to 238 states and 315 transitions. [2024-11-19 06:28:22,576 INFO L78 Accepts]: Start accepts. Automaton has 238 states and 315 transitions. Word has length 67 [2024-11-19 06:28:22,576 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 06:28:22,577 INFO L471 AbstractCegarLoop]: Abstraction has 238 states and 315 transitions. [2024-11-19 06:28:22,577 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, (3), 1 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 06:28:22,577 INFO L276 IsEmpty]: Start isEmpty. Operand 238 states and 315 transitions. [2024-11-19 06:28:22,578 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2024-11-19 06:28:22,578 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 06:28:22,578 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 06:28:22,588 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Forceful destruction successful, exit code 0 [2024-11-19 06:28:22,780 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-11-19 06:28:22,781 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-19 06:28:22,782 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 06:28:22,782 INFO L85 PathProgramCache]: Analyzing trace with hash -1186406695, now seen corresponding path program 1 times [2024-11-19 06:28:22,782 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 06:28:22,782 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1791591612] [2024-11-19 06:28:22,783 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 06:28:22,783 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-11-19 06:28:22,783 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 06:28:22,787 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-11-19 06:28:22,789 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-11-19 06:28:23,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 06:28:23,057 INFO L255 TraceCheckSpWp]: Trace formula consists of 323 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-19 06:28:23,059 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 06:28:23,174 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 06:28:23,174 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 06:28:23,174 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 06:28:23,174 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1791591612] [2024-11-19 06:28:23,174 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1791591612] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 06:28:23,175 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 06:28:23,175 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-19 06:28:23,175 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [24983072] [2024-11-19 06:28:23,175 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 06:28:23,175 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-19 06:28:23,175 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 06:28:23,176 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-19 06:28:23,176 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-19 06:28:23,176 INFO L87 Difference]: Start difference. First operand 238 states and 315 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, (3), 1 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 06:28:23,247 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 06:28:23,248 INFO L93 Difference]: Finished difference Result 232 states and 305 transitions. [2024-11-19 06:28:23,248 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-19 06:28:23,248 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, (3), 1 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 67 [2024-11-19 06:28:23,249 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 06:28:23,250 INFO L225 Difference]: With dead ends: 232 [2024-11-19 06:28:23,250 INFO L226 Difference]: Without dead ends: 232 [2024-11-19 06:28:23,250 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 63 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-11-19 06:28:23,250 INFO L432 NwaCegarLoop]: 287 mSDtfsCounter, 0 mSDsluCounter, 831 mSDsCounter, 0 mSdLazyCounter, 59 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1118 SdHoareTripleChecker+Invalid, 62 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 59 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-19 06:28:23,251 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1118 Invalid, 62 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 59 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-19 06:28:23,252 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 232 states. [2024-11-19 06:28:23,257 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 232 to 232. [2024-11-19 06:28:23,257 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 232 states, 205 states have (on average 1.2829268292682927) internal successors, (263), 222 states have internal predecessors, (263), 22 states have call successors, (22), 4 states have call predecessors, (22), 3 states have return successors, (20), 6 states have call predecessors, (20), 20 states have call successors, (20) [2024-11-19 06:28:23,259 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 232 states to 232 states and 305 transitions. [2024-11-19 06:28:23,259 INFO L78 Accepts]: Start accepts. Automaton has 232 states and 305 transitions. Word has length 67 [2024-11-19 06:28:23,259 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 06:28:23,259 INFO L471 AbstractCegarLoop]: Abstraction has 232 states and 305 transitions. [2024-11-19 06:28:23,259 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, (3), 1 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 06:28:23,260 INFO L276 IsEmpty]: Start isEmpty. Operand 232 states and 305 transitions. [2024-11-19 06:28:23,261 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2024-11-19 06:28:23,261 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 06:28:23,261 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 06:28:23,274 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-11-19 06:28:23,466 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-19 06:28:23,467 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-19 06:28:23,467 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 06:28:23,467 INFO L85 PathProgramCache]: Analyzing trace with hash -792039909, now seen corresponding path program 1 times [2024-11-19 06:28:23,468 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 06:28:23,468 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [469500262] [2024-11-19 06:28:23,468 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 06:28:23,468 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-19 06:28:23,468 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 06:28:23,471 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-11-19 06:28:23,474 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-11-19 06:28:23,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 06:28:23,747 INFO L255 TraceCheckSpWp]: Trace formula consists of 325 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-19 06:28:23,750 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 06:28:23,996 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 06:28:23,996 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 06:28:23,997 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 06:28:23,997 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [469500262] [2024-11-19 06:28:23,997 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [469500262] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 06:28:23,997 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 06:28:23,997 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-19 06:28:23,997 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [555279230] [2024-11-19 06:28:23,997 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 06:28:23,998 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 06:28:23,998 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 06:28:23,998 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 06:28:23,998 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 06:28:23,998 INFO L87 Difference]: Start difference. First operand 232 states and 305 transitions. Second operand has 3 states, 3 states have (on average 21.333333333333332) internal successors, (64), 3 states have internal predecessors, (64), 1 states have call successors, (3), 1 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 06:28:24,677 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 06:28:24,677 INFO L93 Difference]: Finished difference Result 341 states and 436 transitions. [2024-11-19 06:28:24,677 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 06:28:24,678 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 21.333333333333332) internal successors, (64), 3 states have internal predecessors, (64), 1 states have call successors, (3), 1 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 67 [2024-11-19 06:28:24,678 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 06:28:24,679 INFO L225 Difference]: With dead ends: 341 [2024-11-19 06:28:24,679 INFO L226 Difference]: Without dead ends: 341 [2024-11-19 06:28:24,680 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 65 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-11-19 06:28:24,680 INFO L432 NwaCegarLoop]: 347 mSDtfsCounter, 89 mSDsluCounter, 280 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 90 SdHoareTripleChecker+Valid, 627 SdHoareTripleChecker+Invalid, 34 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 30 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-19 06:28:24,680 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [90 Valid, 627 Invalid, 34 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-11-19 06:28:24,683 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 341 states. [2024-11-19 06:28:24,689 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 341 to 336. [2024-11-19 06:28:24,690 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 336 states, 308 states have (on average 1.2597402597402598) internal successors, (388), 325 states have internal predecessors, (388), 23 states have call successors, (23), 4 states have call predecessors, (23), 3 states have return successors, (21), 7 states have call predecessors, (21), 21 states have call successors, (21) [2024-11-19 06:28:24,691 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 336 states to 336 states and 432 transitions. [2024-11-19 06:28:24,692 INFO L78 Accepts]: Start accepts. Automaton has 336 states and 432 transitions. Word has length 67 [2024-11-19 06:28:24,692 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 06:28:24,692 INFO L471 AbstractCegarLoop]: Abstraction has 336 states and 432 transitions. [2024-11-19 06:28:24,692 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 21.333333333333332) internal successors, (64), 3 states have internal predecessors, (64), 1 states have call successors, (3), 1 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 06:28:24,692 INFO L276 IsEmpty]: Start isEmpty. Operand 336 states and 432 transitions. [2024-11-19 06:28:24,694 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2024-11-19 06:28:24,694 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 06:28:24,694 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 06:28:24,704 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-11-19 06:28:24,898 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-11-19 06:28:24,899 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-19 06:28:24,899 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 06:28:24,900 INFO L85 PathProgramCache]: Analyzing trace with hash 963957490, now seen corresponding path program 1 times [2024-11-19 06:28:24,900 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 06:28:24,900 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1928329906] [2024-11-19 06:28:24,900 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 06:28:24,901 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-11-19 06:28:24,901 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 06:28:24,903 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-11-19 06:28:24,904 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-11-19 06:28:25,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 06:28:25,259 INFO L255 TraceCheckSpWp]: Trace formula consists of 454 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-19 06:28:25,262 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 06:28:25,282 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 06:28:25,283 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 06:28:25,283 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 06:28:25,283 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1928329906] [2024-11-19 06:28:25,283 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1928329906] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 06:28:25,283 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 06:28:25,283 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-19 06:28:25,284 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1234965042] [2024-11-19 06:28:25,284 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 06:28:25,284 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-19 06:28:25,284 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 06:28:25,285 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-19 06:28:25,285 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-19 06:28:25,285 INFO L87 Difference]: Start difference. First operand 336 states and 432 transitions. Second operand has 4 states, 4 states have (on average 18.75) internal successors, (75), 4 states have internal predecessors, (75), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-19 06:28:25,318 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 06:28:25,318 INFO L93 Difference]: Finished difference Result 339 states and 436 transitions. [2024-11-19 06:28:25,319 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-19 06:28:25,319 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 18.75) internal successors, (75), 4 states have internal predecessors, (75), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) Word has length 82 [2024-11-19 06:28:25,319 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 06:28:25,321 INFO L225 Difference]: With dead ends: 339 [2024-11-19 06:28:25,321 INFO L226 Difference]: Without dead ends: 339 [2024-11-19 06:28:25,321 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 79 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-11-19 06:28:25,321 INFO L432 NwaCegarLoop]: 300 mSDtfsCounter, 0 mSDsluCounter, 596 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 896 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-19 06:28:25,322 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 896 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 06:28:25,322 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 339 states. [2024-11-19 06:28:25,328 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 339 to 339. [2024-11-19 06:28:25,328 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 339 states, 310 states have (on average 1.261290322580645) internal successors, (391), 328 states have internal predecessors, (391), 23 states have call successors, (23), 4 states have call predecessors, (23), 4 states have return successors, (22), 7 states have call predecessors, (22), 21 states have call successors, (22) [2024-11-19 06:28:25,330 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 339 states to 339 states and 436 transitions. [2024-11-19 06:28:25,330 INFO L78 Accepts]: Start accepts. Automaton has 339 states and 436 transitions. Word has length 82 [2024-11-19 06:28:25,330 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 06:28:25,330 INFO L471 AbstractCegarLoop]: Abstraction has 339 states and 436 transitions. [2024-11-19 06:28:25,330 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 18.75) internal successors, (75), 4 states have internal predecessors, (75), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-19 06:28:25,331 INFO L276 IsEmpty]: Start isEmpty. Operand 339 states and 436 transitions. [2024-11-19 06:28:25,332 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2024-11-19 06:28:25,332 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 06:28:25,332 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 06:28:25,348 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-11-19 06:28:25,536 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-11-19 06:28:25,537 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-19 06:28:25,537 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 06:28:25,538 INFO L85 PathProgramCache]: Analyzing trace with hash -1802953744, now seen corresponding path program 1 times [2024-11-19 06:28:25,538 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 06:28:25,538 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1892522624] [2024-11-19 06:28:25,538 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 06:28:25,538 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-11-19 06:28:25,541 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 06:28:25,543 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-11-19 06:28:25,544 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-11-19 06:28:25,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 06:28:25,920 INFO L255 TraceCheckSpWp]: Trace formula consists of 476 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-19 06:28:25,922 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 06:28:25,960 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 7 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-19 06:28:25,960 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 06:28:26,033 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-19 06:28:26,034 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 06:28:26,034 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1892522624] [2024-11-19 06:28:26,034 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1892522624] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-19 06:28:26,034 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-19 06:28:26,034 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 8 [2024-11-19 06:28:26,034 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [378555074] [2024-11-19 06:28:26,034 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-19 06:28:26,035 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-19 06:28:26,035 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 06:28:26,035 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-19 06:28:26,035 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2024-11-19 06:28:26,036 INFO L87 Difference]: Start difference. First operand 339 states and 436 transitions. Second operand has 8 states, 8 states have (on average 10.625) internal successors, (85), 8 states have internal predecessors, (85), 2 states have call successors, (6), 2 states have call predecessors, (6), 4 states have return successors, (4), 1 states have call predecessors, (4), 2 states have call successors, (4) [2024-11-19 06:28:26,150 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 06:28:26,150 INFO L93 Difference]: Finished difference Result 350 states and 452 transitions. [2024-11-19 06:28:26,151 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-19 06:28:26,151 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 10.625) internal successors, (85), 8 states have internal predecessors, (85), 2 states have call successors, (6), 2 states have call predecessors, (6), 4 states have return successors, (4), 1 states have call predecessors, (4), 2 states have call successors, (4) Word has length 84 [2024-11-19 06:28:26,155 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 06:28:26,157 INFO L225 Difference]: With dead ends: 350 [2024-11-19 06:28:26,157 INFO L226 Difference]: Without dead ends: 350 [2024-11-19 06:28:26,157 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 169 GetRequests, 160 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-11-19 06:28:26,157 INFO L432 NwaCegarLoop]: 300 mSDtfsCounter, 4 mSDsluCounter, 894 mSDsCounter, 0 mSdLazyCounter, 46 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 1194 SdHoareTripleChecker+Invalid, 53 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 46 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-19 06:28:26,158 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 1194 Invalid, 53 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 46 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-19 06:28:26,158 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 350 states. [2024-11-19 06:28:26,163 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 350 to 348. [2024-11-19 06:28:26,164 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 348 states, 318 states have (on average 1.2735849056603774) internal successors, (405), 336 states have internal predecessors, (405), 23 states have call successors, (23), 5 states have call predecessors, (23), 5 states have return successors, (22), 7 states have call predecessors, (22), 21 states have call successors, (22) [2024-11-19 06:28:26,165 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 348 states to 348 states and 450 transitions. [2024-11-19 06:28:26,165 INFO L78 Accepts]: Start accepts. Automaton has 348 states and 450 transitions. Word has length 84 [2024-11-19 06:28:26,165 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 06:28:26,165 INFO L471 AbstractCegarLoop]: Abstraction has 348 states and 450 transitions. [2024-11-19 06:28:26,165 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 10.625) internal successors, (85), 8 states have internal predecessors, (85), 2 states have call successors, (6), 2 states have call predecessors, (6), 4 states have return successors, (4), 1 states have call predecessors, (4), 2 states have call successors, (4) [2024-11-19 06:28:26,166 INFO L276 IsEmpty]: Start isEmpty. Operand 348 states and 450 transitions. [2024-11-19 06:28:26,167 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2024-11-19 06:28:26,167 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 06:28:26,167 INFO L215 NwaCegarLoop]: trace histogram [6, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 06:28:26,176 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Ended with exit code 0 [2024-11-19 06:28:26,367 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-11-19 06:28:26,368 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-19 06:28:26,368 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 06:28:26,369 INFO L85 PathProgramCache]: Analyzing trace with hash 1147536658, now seen corresponding path program 2 times [2024-11-19 06:28:26,369 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 06:28:26,369 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1161707997] [2024-11-19 06:28:26,369 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-19 06:28:26,369 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-11-19 06:28:26,370 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 06:28:26,374 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-11-19 06:28:26,378 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-11-19 06:28:27,555 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-19 06:28:27,555 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-19 06:28:27,577 INFO L255 TraceCheckSpWp]: Trace formula consists of 520 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-11-19 06:28:27,581 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 06:28:27,666 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 18 proven. 10 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-19 06:28:27,666 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 06:28:27,815 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 0 proven. 27 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-19 06:28:27,816 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 06:28:27,816 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1161707997] [2024-11-19 06:28:27,816 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1161707997] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-19 06:28:27,816 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-19 06:28:27,816 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 14 [2024-11-19 06:28:27,816 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [404566021] [2024-11-19 06:28:27,817 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-19 06:28:27,817 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-11-19 06:28:27,817 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 06:28:27,817 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-11-19 06:28:27,818 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=121, Unknown=0, NotChecked=0, Total=182 [2024-11-19 06:28:27,818 INFO L87 Difference]: Start difference. First operand 348 states and 450 transitions. Second operand has 14 states, 14 states have (on average 6.5) internal successors, (91), 14 states have internal predecessors, (91), 2 states have call successors, (6), 2 states have call predecessors, (6), 4 states have return successors, (4), 1 states have call predecessors, (4), 2 states have call successors, (4) [2024-11-19 06:28:28,344 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 06:28:28,344 INFO L93 Difference]: Finished difference Result 363 states and 472 transitions. [2024-11-19 06:28:28,349 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2024-11-19 06:28:28,349 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 6.5) internal successors, (91), 14 states have internal predecessors, (91), 2 states have call successors, (6), 2 states have call predecessors, (6), 4 states have return successors, (4), 1 states have call predecessors, (4), 2 states have call successors, (4) Word has length 88 [2024-11-19 06:28:28,349 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 06:28:28,350 INFO L225 Difference]: With dead ends: 363 [2024-11-19 06:28:28,351 INFO L226 Difference]: Without dead ends: 359 [2024-11-19 06:28:28,351 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 183 GetRequests, 162 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-11-19 06:28:28,351 INFO L432 NwaCegarLoop]: 300 mSDtfsCounter, 8 mSDsluCounter, 1493 mSDsCounter, 0 mSdLazyCounter, 161 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 1793 SdHoareTripleChecker+Invalid, 175 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 161 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-19 06:28:28,352 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 1793 Invalid, 175 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 161 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-19 06:28:28,356 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 359 states. [2024-11-19 06:28:28,367 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 359 to 357. [2024-11-19 06:28:28,368 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 357 states, 327 states have (on average 1.275229357798165) internal successors, (417), 345 states have internal predecessors, (417), 23 states have call successors, (23), 5 states have call predecessors, (23), 5 states have return successors, (22), 7 states have call predecessors, (22), 21 states have call successors, (22) [2024-11-19 06:28:28,374 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 357 states to 357 states and 462 transitions. [2024-11-19 06:28:28,374 INFO L78 Accepts]: Start accepts. Automaton has 357 states and 462 transitions. Word has length 88 [2024-11-19 06:28:28,375 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 06:28:28,375 INFO L471 AbstractCegarLoop]: Abstraction has 357 states and 462 transitions. [2024-11-19 06:28:28,375 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 6.5) internal successors, (91), 14 states have internal predecessors, (91), 2 states have call successors, (6), 2 states have call predecessors, (6), 4 states have return successors, (4), 1 states have call predecessors, (4), 2 states have call successors, (4) [2024-11-19 06:28:28,375 INFO L276 IsEmpty]: Start isEmpty. Operand 357 states and 462 transitions. [2024-11-19 06:28:28,377 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2024-11-19 06:28:28,380 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 06:28:28,380 INFO L215 NwaCegarLoop]: trace histogram [15, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 06:28:28,393 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Forceful destruction successful, exit code 0 [2024-11-19 06:28:28,581 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-11-19 06:28:28,581 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-19 06:28:28,581 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 06:28:28,582 INFO L85 PathProgramCache]: Analyzing trace with hash -974156991, now seen corresponding path program 3 times [2024-11-19 06:28:28,582 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 06:28:28,582 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [476083990] [2024-11-19 06:28:28,582 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-19 06:28:28,582 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-19 06:28:28,583 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 06:28:28,585 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-11-19 06:28:28,586 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-11-19 06:28:31,039 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2024-11-19 06:28:31,040 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-19 06:28:31,071 INFO L255 TraceCheckSpWp]: Trace formula consists of 553 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-11-19 06:28:31,074 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 06:28:31,205 INFO L134 CoverageAnalysis]: Checked inductivity of 139 backedges. 68 proven. 15 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2024-11-19 06:28:31,205 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 06:28:31,475 INFO L134 CoverageAnalysis]: Checked inductivity of 139 backedges. 68 proven. 15 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2024-11-19 06:28:31,476 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 06:28:31,476 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [476083990] [2024-11-19 06:28:31,476 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [476083990] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-19 06:28:31,476 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-19 06:28:31,476 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 16 [2024-11-19 06:28:31,476 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1600757477] [2024-11-19 06:28:31,476 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-19 06:28:31,477 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2024-11-19 06:28:31,477 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 06:28:31,477 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2024-11-19 06:28:31,477 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=162, Unknown=0, NotChecked=0, Total=240 [2024-11-19 06:28:31,478 INFO L87 Difference]: Start difference. First operand 357 states and 462 transitions. Second operand has 16 states, 16 states have (on average 5.5625) internal successors, (89), 16 states have internal predecessors, (89), 2 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-19 06:28:32,078 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 06:28:32,078 INFO L93 Difference]: Finished difference Result 368 states and 479 transitions. [2024-11-19 06:28:32,079 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2024-11-19 06:28:32,079 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 5.5625) internal successors, (89), 16 states have internal predecessors, (89), 2 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) Word has length 97 [2024-11-19 06:28:32,079 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 06:28:32,080 INFO L225 Difference]: With dead ends: 368 [2024-11-19 06:28:32,081 INFO L226 Difference]: Without dead ends: 366 [2024-11-19 06:28:32,081 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 203 GetRequests, 178 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 85 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=248, Invalid=454, Unknown=0, NotChecked=0, Total=702 [2024-11-19 06:28:32,081 INFO L432 NwaCegarLoop]: 300 mSDtfsCounter, 8 mSDsluCounter, 2086 mSDsCounter, 0 mSdLazyCounter, 143 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 2386 SdHoareTripleChecker+Invalid, 147 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 143 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-19 06:28:32,082 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 2386 Invalid, 147 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 143 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-19 06:28:32,084 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 366 states. [2024-11-19 06:28:32,092 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 366 to 364. [2024-11-19 06:28:32,093 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 364 states, 334 states have (on average 1.2874251497005988) internal successors, (430), 352 states have internal predecessors, (430), 23 states have call successors, (23), 5 states have call predecessors, (23), 5 states have return successors, (22), 7 states have call predecessors, (22), 21 states have call successors, (22) [2024-11-19 06:28:32,094 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 364 states to 364 states and 475 transitions. [2024-11-19 06:28:32,094 INFO L78 Accepts]: Start accepts. Automaton has 364 states and 475 transitions. Word has length 97 [2024-11-19 06:28:32,094 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 06:28:32,095 INFO L471 AbstractCegarLoop]: Abstraction has 364 states and 475 transitions. [2024-11-19 06:28:32,095 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 5.5625) internal successors, (89), 16 states have internal predecessors, (89), 2 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-19 06:28:32,095 INFO L276 IsEmpty]: Start isEmpty. Operand 364 states and 475 transitions. [2024-11-19 06:28:32,096 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2024-11-19 06:28:32,096 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 06:28:32,096 INFO L215 NwaCegarLoop]: trace histogram [22, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 06:28:32,118 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-11-19 06:28:32,300 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-11-19 06:28:32,301 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-19 06:28:32,301 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 06:28:32,301 INFO L85 PathProgramCache]: Analyzing trace with hash 1864528082, now seen corresponding path program 4 times [2024-11-19 06:28:32,302 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 06:28:32,302 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [257722443] [2024-11-19 06:28:32,302 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2024-11-19 06:28:32,303 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-11-19 06:28:32,303 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 06:28:32,305 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-11-19 06:28:32,306 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-11-19 06:28:32,914 INFO L227 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2024-11-19 06:28:32,914 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-19 06:28:32,935 INFO L255 TraceCheckSpWp]: Trace formula consists of 696 conjuncts, 13 conjuncts are in the unsatisfiable core [2024-11-19 06:28:32,938 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 06:28:33,077 INFO L134 CoverageAnalysis]: Checked inductivity of 279 backedges. 146 proven. 55 refuted. 0 times theorem prover too weak. 78 trivial. 0 not checked. [2024-11-19 06:28:33,077 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 06:28:33,531 INFO L134 CoverageAnalysis]: Checked inductivity of 279 backedges. 0 proven. 200 refuted. 0 times theorem prover too weak. 79 trivial. 0 not checked. [2024-11-19 06:28:33,531 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 06:28:33,531 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [257722443] [2024-11-19 06:28:33,531 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [257722443] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-19 06:28:33,531 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-19 06:28:33,531 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 26 [2024-11-19 06:28:33,531 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [795876469] [2024-11-19 06:28:33,531 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-19 06:28:33,532 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2024-11-19 06:28:33,532 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 06:28:33,532 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2024-11-19 06:28:33,532 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=193, Invalid=457, Unknown=0, NotChecked=0, Total=650 [2024-11-19 06:28:33,533 INFO L87 Difference]: Start difference. First operand 364 states and 475 transitions. Second operand has 26 states, 26 states have (on average 3.9615384615384617) internal successors, (103), 26 states have internal predecessors, (103), 2 states have call successors, (6), 2 states have call predecessors, (6), 4 states have return successors, (4), 1 states have call predecessors, (4), 2 states have call successors, (4) [2024-11-19 06:28:35,320 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 06:28:35,320 INFO L93 Difference]: Finished difference Result 382 states and 503 transitions. [2024-11-19 06:28:35,321 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2024-11-19 06:28:35,321 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 26 states have (on average 3.9615384615384617) internal successors, (103), 26 states have internal predecessors, (103), 2 states have call successors, (6), 2 states have call predecessors, (6), 4 states have return successors, (4), 1 states have call predecessors, (4), 2 states have call successors, (4) Word has length 104 [2024-11-19 06:28:35,321 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 06:28:35,325 INFO L225 Difference]: With dead ends: 382 [2024-11-19 06:28:35,325 INFO L226 Difference]: Without dead ends: 378 [2024-11-19 06:28:35,326 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 227 GetRequests, 182 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-11-19 06:28:35,326 INFO L432 NwaCegarLoop]: 300 mSDtfsCounter, 13 mSDsluCounter, 3281 mSDsCounter, 0 mSdLazyCounter, 527 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 3581 SdHoareTripleChecker+Invalid, 543 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 527 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-11-19 06:28:35,327 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 3581 Invalid, 543 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 527 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-11-19 06:28:35,331 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 378 states. [2024-11-19 06:28:35,343 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 378 to 376. [2024-11-19 06:28:35,344 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 376 states, 346 states have (on average 1.277456647398844) internal successors, (442), 364 states have internal predecessors, (442), 23 states have call successors, (23), 5 states have call predecessors, (23), 5 states have return successors, (22), 7 states have call predecessors, (22), 21 states have call successors, (22) [2024-11-19 06:28:35,349 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 376 states to 376 states and 487 transitions. [2024-11-19 06:28:35,350 INFO L78 Accepts]: Start accepts. Automaton has 376 states and 487 transitions. Word has length 104 [2024-11-19 06:28:35,350 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 06:28:35,350 INFO L471 AbstractCegarLoop]: Abstraction has 376 states and 487 transitions. [2024-11-19 06:28:35,350 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 26 states have (on average 3.9615384615384617) internal successors, (103), 26 states have internal predecessors, (103), 2 states have call successors, (6), 2 states have call predecessors, (6), 4 states have return successors, (4), 1 states have call predecessors, (4), 2 states have call successors, (4) [2024-11-19 06:28:35,350 INFO L276 IsEmpty]: Start isEmpty. Operand 376 states and 487 transitions. [2024-11-19 06:28:35,351 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2024-11-19 06:28:35,351 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 06:28:35,351 INFO L215 NwaCegarLoop]: trace histogram [34, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 06:28:35,373 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Forceful destruction successful, exit code 0 [2024-11-19 06:28:35,551 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-11-19 06:28:35,552 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-19 06:28:35,553 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 06:28:35,553 INFO L85 PathProgramCache]: Analyzing trace with hash 1772012946, now seen corresponding path program 5 times [2024-11-19 06:28:35,553 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 06:28:35,554 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1391588734] [2024-11-19 06:28:35,554 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2024-11-19 06:28:35,554 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-11-19 06:28:35,554 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 06:28:35,556 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-11-19 06:28:35,557 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-11-19 06:28:36,692 INFO L227 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 13 check-sat command(s) [2024-11-19 06:28:36,692 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-19 06:28:36,723 INFO L255 TraceCheckSpWp]: Trace formula consists of 828 conjuncts, 25 conjuncts are in the unsatisfiable core [2024-11-19 06:28:36,726 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 06:28:37,289 INFO L134 CoverageAnalysis]: Checked inductivity of 633 backedges. 302 proven. 253 refuted. 0 times theorem prover too weak. 78 trivial. 0 not checked. [2024-11-19 06:28:37,290 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 06:28:39,071 INFO L134 CoverageAnalysis]: Checked inductivity of 633 backedges. 0 proven. 554 refuted. 0 times theorem prover too weak. 79 trivial. 0 not checked. [2024-11-19 06:28:39,071 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 06:28:39,071 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1391588734] [2024-11-19 06:28:39,071 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1391588734] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-19 06:28:39,072 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-19 06:28:39,072 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 26] total 50 [2024-11-19 06:28:39,072 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1225327504] [2024-11-19 06:28:39,072 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-19 06:28:39,072 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 50 states [2024-11-19 06:28:39,072 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 06:28:39,073 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2024-11-19 06:28:39,079 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=672, Invalid=1778, Unknown=0, NotChecked=0, Total=2450 [2024-11-19 06:28:39,079 INFO L87 Difference]: Start difference. First operand 376 states and 487 transitions. Second operand has 50 states, 50 states have (on average 2.54) internal successors, (127), 50 states have internal predecessors, (127), 2 states have call successors, (6), 2 states have call predecessors, (6), 4 states have return successors, (4), 1 states have call predecessors, (4), 2 states have call successors, (4) [2024-11-19 06:28:45,560 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 06:28:45,560 INFO L93 Difference]: Finished difference Result 415 states and 557 transitions. [2024-11-19 06:28:45,561 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 71 states. [2024-11-19 06:28:45,561 INFO L78 Accepts]: Start accepts. Automaton has has 50 states, 50 states have (on average 2.54) internal successors, (127), 50 states have internal predecessors, (127), 2 states have call successors, (6), 2 states have call predecessors, (6), 4 states have return successors, (4), 1 states have call predecessors, (4), 2 states have call successors, (4) Word has length 116 [2024-11-19 06:28:45,561 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 06:28:45,563 INFO L225 Difference]: With dead ends: 415 [2024-11-19 06:28:45,563 INFO L226 Difference]: Without dead ends: 411 [2024-11-19 06:28:45,564 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 273 GetRequests, 182 SyntacticMatches, 0 SemanticMatches, 91 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 465 ImplicationChecksByTransitivity, 5.7s TimeCoverageRelationStatistics Valid=2713, Invalid=5843, Unknown=0, NotChecked=0, Total=8556 [2024-11-19 06:28:45,565 INFO L432 NwaCegarLoop]: 300 mSDtfsCounter, 26 mSDsluCounter, 7447 mSDsCounter, 0 mSdLazyCounter, 1890 mSolverCounterSat, 44 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 7747 SdHoareTripleChecker+Invalid, 1934 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 44 IncrementalHoareTripleChecker+Valid, 1890 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.6s IncrementalHoareTripleChecker+Time [2024-11-19 06:28:45,565 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 7747 Invalid, 1934 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [44 Valid, 1890 Invalid, 0 Unknown, 0 Unchecked, 2.6s Time] [2024-11-19 06:28:45,565 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 411 states. [2024-11-19 06:28:45,571 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 411 to 409. [2024-11-19 06:28:45,572 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 409 states, 379 states have (on average 1.2823218997361479) internal successors, (486), 397 states have internal predecessors, (486), 23 states have call successors, (23), 5 states have call predecessors, (23), 5 states have return successors, (22), 7 states have call predecessors, (22), 21 states have call successors, (22) [2024-11-19 06:28:45,573 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 409 states to 409 states and 531 transitions. [2024-11-19 06:28:45,574 INFO L78 Accepts]: Start accepts. Automaton has 409 states and 531 transitions. Word has length 116 [2024-11-19 06:28:45,574 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 06:28:45,574 INFO L471 AbstractCegarLoop]: Abstraction has 409 states and 531 transitions. [2024-11-19 06:28:45,575 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 50 states, 50 states have (on average 2.54) internal successors, (127), 50 states have internal predecessors, (127), 2 states have call successors, (6), 2 states have call predecessors, (6), 4 states have return successors, (4), 1 states have call predecessors, (4), 2 states have call successors, (4) [2024-11-19 06:28:45,575 INFO L276 IsEmpty]: Start isEmpty. Operand 409 states and 531 transitions. [2024-11-19 06:28:45,576 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2024-11-19 06:28:45,576 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 06:28:45,576 INFO L215 NwaCegarLoop]: trace histogram [67, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 06:28:45,597 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (12)] Forceful destruction successful, exit code 0 [2024-11-19 06:28:45,780 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-11-19 06:28:45,781 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-19 06:28:45,782 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 06:28:45,782 INFO L85 PathProgramCache]: Analyzing trace with hash 1717830209, now seen corresponding path program 6 times [2024-11-19 06:28:45,782 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 06:28:45,782 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1943335998] [2024-11-19 06:28:45,783 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2024-11-19 06:28:45,783 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-11-19 06:28:45,783 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 06:28:45,788 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-11-19 06:28:45,790 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (13)] Waiting until timeout for monitored process [2024-11-19 06:28:55,511 INFO L227 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 24 check-sat command(s) [2024-11-19 06:28:55,511 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-19 06:28:55,564 INFO L255 TraceCheckSpWp]: Trace formula consists of 1191 conjuncts, 27 conjuncts are in the unsatisfiable core [2024-11-19 06:28:55,567 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 06:28:56,123 INFO L134 CoverageAnalysis]: Checked inductivity of 2349 backedges. 1082 proven. 276 refuted. 0 times theorem prover too weak. 991 trivial. 0 not checked. [2024-11-19 06:28:56,123 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 06:28:58,241 INFO L134 CoverageAnalysis]: Checked inductivity of 2349 backedges. 1082 proven. 276 refuted. 0 times theorem prover too weak. 991 trivial. 0 not checked. [2024-11-19 06:28:58,242 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 06:28:58,242 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1943335998] [2024-11-19 06:28:58,242 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1943335998] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-19 06:28:58,242 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-19 06:28:58,242 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 27] total 52 [2024-11-19 06:28:58,242 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [261088777] [2024-11-19 06:28:58,242 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-19 06:28:58,243 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 52 states [2024-11-19 06:28:58,243 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 06:28:58,244 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2024-11-19 06:28:58,244 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=726, Invalid=1926, Unknown=0, NotChecked=0, Total=2652 [2024-11-19 06:28:58,245 INFO L87 Difference]: Start difference. First operand 409 states and 531 transitions. Second operand has 52 states, 52 states have (on average 2.4038461538461537) internal successors, (125), 52 states have internal predecessors, (125), 2 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-19 06:29:05,505 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 06:29:05,505 INFO L93 Difference]: Finished difference Result 438 states and 584 transitions. [2024-11-19 06:29:05,506 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 76 states. [2024-11-19 06:29:05,506 INFO L78 Accepts]: Start accepts. Automaton has has 52 states, 52 states have (on average 2.4038461538461537) internal successors, (125), 52 states have internal predecessors, (125), 2 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) Word has length 149 [2024-11-19 06:29:05,507 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 06:29:05,508 INFO L225 Difference]: With dead ends: 438 [2024-11-19 06:29:05,508 INFO L226 Difference]: Without dead ends: 436 [2024-11-19 06:29:05,510 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 343 GetRequests, 246 SyntacticMatches, 0 SemanticMatches, 97 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1633 ImplicationChecksByTransitivity, 7.2s TimeCoverageRelationStatistics Valid=3146, Invalid=6556, Unknown=0, NotChecked=0, Total=9702 [2024-11-19 06:29:05,511 INFO L432 NwaCegarLoop]: 300 mSDtfsCounter, 27 mSDsluCounter, 7746 mSDsCounter, 0 mSdLazyCounter, 1397 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 8046 SdHoareTripleChecker+Invalid, 1405 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 1397 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2024-11-19 06:29:05,511 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [27 Valid, 8046 Invalid, 1405 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 1397 Invalid, 0 Unknown, 0 Unchecked, 2.1s Time] [2024-11-19 06:29:05,512 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 436 states. [2024-11-19 06:29:05,517 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 436 to 434. [2024-11-19 06:29:05,518 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 434 states, 404 states have (on average 1.3242574257425743) internal successors, (535), 422 states have internal predecessors, (535), 23 states have call successors, (23), 5 states have call predecessors, (23), 5 states have return successors, (22), 7 states have call predecessors, (22), 21 states have call successors, (22) [2024-11-19 06:29:05,519 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 434 states to 434 states and 580 transitions. [2024-11-19 06:29:05,520 INFO L78 Accepts]: Start accepts. Automaton has 434 states and 580 transitions. Word has length 149 [2024-11-19 06:29:05,520 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 06:29:05,520 INFO L471 AbstractCegarLoop]: Abstraction has 434 states and 580 transitions. [2024-11-19 06:29:05,520 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 52 states, 52 states have (on average 2.4038461538461537) internal successors, (125), 52 states have internal predecessors, (125), 2 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-19 06:29:05,520 INFO L276 IsEmpty]: Start isEmpty. Operand 434 states and 580 transitions. [2024-11-19 06:29:05,521 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 175 [2024-11-19 06:29:05,521 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 06:29:05,521 INFO L215 NwaCegarLoop]: trace histogram [92, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 06:29:05,559 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (13)] Ended with exit code 0 [2024-11-19 06:29:05,725 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-19 06:29:05,726 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-19 06:29:05,727 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 06:29:05,727 INFO L85 PathProgramCache]: Analyzing trace with hash -215333198, now seen corresponding path program 7 times [2024-11-19 06:29:05,728 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 06:29:05,728 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1169826907] [2024-11-19 06:29:05,728 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2024-11-19 06:29:05,728 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-11-19 06:29:05,728 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 06:29:05,732 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-19 06:29:05,738 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (14)] Waiting until timeout for monitored process [2024-11-19 06:29:07,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 06:29:07,177 INFO L255 TraceCheckSpWp]: Trace formula consists of 1466 conjuncts, 51 conjuncts are in the unsatisfiable core [2024-11-19 06:29:07,182 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 06:29:08,706 INFO L134 CoverageAnalysis]: Checked inductivity of 4374 backedges. 2207 proven. 1176 refuted. 0 times theorem prover too weak. 991 trivial. 0 not checked. [2024-11-19 06:29:08,706 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 06:29:14,509 INFO L134 CoverageAnalysis]: Checked inductivity of 4374 backedges. 2207 proven. 1176 refuted. 0 times theorem prover too weak. 991 trivial. 0 not checked. [2024-11-19 06:29:14,509 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 06:29:14,509 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1169826907] [2024-11-19 06:29:14,509 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1169826907] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-19 06:29:14,510 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-19 06:29:14,510 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [52, 52] total 102 [2024-11-19 06:29:14,510 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1429622379] [2024-11-19 06:29:14,510 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-19 06:29:14,510 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 102 states [2024-11-19 06:29:14,511 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 06:29:14,512 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 102 interpolants. [2024-11-19 06:29:14,513 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=2701, Invalid=7601, Unknown=0, NotChecked=0, Total=10302 [2024-11-19 06:29:14,514 INFO L87 Difference]: Start difference. First operand 434 states and 580 transitions. Second operand has 102 states, 102 states have (on average 1.7156862745098038) internal successors, (175), 102 states have internal predecessors, (175), 2 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-19 06:29:43,104 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 06:29:43,104 INFO L93 Difference]: Finished difference Result 492 states and 691 transitions. [2024-11-19 06:29:43,105 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 151 states. [2024-11-19 06:29:43,106 INFO L78 Accepts]: Start accepts. Automaton has has 102 states, 102 states have (on average 1.7156862745098038) internal successors, (175), 102 states have internal predecessors, (175), 2 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) Word has length 174 [2024-11-19 06:29:43,106 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 06:29:43,107 INFO L225 Difference]: With dead ends: 492 [2024-11-19 06:29:43,107 INFO L226 Difference]: Without dead ends: 492 [2024-11-19 06:29:43,115 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 443 GetRequests, 246 SyntacticMatches, 0 SemanticMatches, 197 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7008 ImplicationChecksByTransitivity, 29.3s TimeCoverageRelationStatistics Valid=12595, Invalid=26807, Unknown=0, NotChecked=0, Total=39402 [2024-11-19 06:29:43,115 INFO L432 NwaCegarLoop]: 299 mSDtfsCounter, 57 mSDsluCounter, 14556 mSDsCounter, 0 mSdLazyCounter, 5195 mSolverCounterSat, 68 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 57 SdHoareTripleChecker+Valid, 14855 SdHoareTripleChecker+Invalid, 5263 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 68 IncrementalHoareTripleChecker+Valid, 5195 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.2s IncrementalHoareTripleChecker+Time [2024-11-19 06:29:43,115 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [57 Valid, 14855 Invalid, 5263 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [68 Valid, 5195 Invalid, 0 Unknown, 0 Unchecked, 5.2s Time] [2024-11-19 06:29:43,116 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 492 states. [2024-11-19 06:29:43,122 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 492 to 488. [2024-11-19 06:29:43,122 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 488 states, 458 states have (on average 1.4017467248908297) internal successors, (642), 476 states have internal predecessors, (642), 23 states have call successors, (23), 5 states have call predecessors, (23), 5 states have return successors, (22), 7 states have call predecessors, (22), 21 states have call successors, (22) [2024-11-19 06:29:43,124 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 488 states to 488 states and 687 transitions. [2024-11-19 06:29:43,124 INFO L78 Accepts]: Start accepts. Automaton has 488 states and 687 transitions. Word has length 174 [2024-11-19 06:29:43,124 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 06:29:43,124 INFO L471 AbstractCegarLoop]: Abstraction has 488 states and 687 transitions. [2024-11-19 06:29:43,125 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 102 states, 102 states have (on average 1.7156862745098038) internal successors, (175), 102 states have internal predecessors, (175), 2 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-19 06:29:43,125 INFO L276 IsEmpty]: Start isEmpty. Operand 488 states and 687 transitions. [2024-11-19 06:29:43,127 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 225 [2024-11-19 06:29:43,127 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 06:29:43,127 INFO L215 NwaCegarLoop]: trace histogram [142, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 06:29:43,148 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (14)] Ended with exit code 0 [2024-11-19 06:29:43,331 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-19 06:29:43,332 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-19 06:29:43,332 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 06:29:43,333 INFO L85 PathProgramCache]: Analyzing trace with hash 263952786, now seen corresponding path program 8 times [2024-11-19 06:29:43,334 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 06:29:43,334 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [106457105] [2024-11-19 06:29:43,334 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-19 06:29:43,334 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-11-19 06:29:43,334 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 06:29:43,337 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-19 06:29:43,338 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (15)] Waiting until timeout for monitored process [2024-11-19 06:29:45,396 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-19 06:29:45,396 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-19 06:29:45,443 INFO L255 TraceCheckSpWp]: Trace formula consists of 2016 conjuncts, 101 conjuncts are in the unsatisfiable core [2024-11-19 06:29:45,476 INFO L278 TraceCheckSpWp]: Computing forward predicates...