./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/uthash-2.0.2/uthash_SFH_test7-1.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) 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_test7-1.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-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-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash c2bb9f0c15e3c3296f863c26b4377b27546cf1c417a60e9663a6ff48eb617ef8 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-assert-order-craig-3061b6d-m [2024-11-19 09:16:39,746 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-19 09:16:39,842 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2024-11-19 09:16:39,849 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-19 09:16:39,852 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-19 09:16:39,883 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-19 09:16:39,884 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-19 09:16:39,884 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-19 09:16:39,885 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-19 09:16:39,885 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-19 09:16:39,886 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-19 09:16:39,888 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-19 09:16:39,890 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-19 09:16:39,890 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-19 09:16:39,892 INFO L153 SettingsManager]: * Use SBE=true [2024-11-19 09:16:39,893 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-19 09:16:39,893 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-19 09:16:39,893 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-19 09:16:39,894 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-19 09:16:39,894 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-19 09:16:39,897 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-11-19 09:16:39,898 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-11-19 09:16:39,899 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-11-19 09:16:39,899 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-19 09:16:39,899 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-19 09:16:39,899 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-19 09:16:39,900 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-19 09:16:39,900 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-19 09:16:39,900 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-19 09:16:39,901 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-19 09:16:39,901 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-19 09:16:39,901 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-19 09:16:39,901 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-19 09:16:39,901 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-19 09:16:39,902 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-19 09:16:39,902 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-19 09:16:39,902 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-19 09:16:39,902 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-19 09:16:39,903 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-19 09:16:39,903 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-19 09:16:39,903 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-19 09:16:39,904 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-19 09:16:39,905 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-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) 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 -> c2bb9f0c15e3c3296f863c26b4377b27546cf1c417a60e9663a6ff48eb617ef8 [2024-11-19 09:16:40,189 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-19 09:16:40,213 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-19 09:16:40,216 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-19 09:16:40,217 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-19 09:16:40,218 INFO L274 PluginConnector]: CDTParser initialized [2024-11-19 09:16:40,219 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_test7-1.i [2024-11-19 09:16:41,692 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-19 09:16:41,964 INFO L384 CDTParser]: Found 1 translation units. [2024-11-19 09:16:41,965 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_SFH_test7-1.i [2024-11-19 09:16:41,986 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d99f1d01b/fdef7f8ebeec4ad5a55a1e4a7af01dc7/FLAGeaf79e68b [2024-11-19 09:16:41,999 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d99f1d01b/fdef7f8ebeec4ad5a55a1e4a7af01dc7 [2024-11-19 09:16:42,001 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-19 09:16:42,002 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-19 09:16:42,003 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-19 09:16:42,003 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-19 09:16:42,008 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-19 09:16:42,008 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 09:16:42" (1/1) ... [2024-11-19 09:16:42,009 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@63ab11e5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:16:42, skipping insertion in model container [2024-11-19 09:16:42,009 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 09:16:42" (1/1) ... [2024-11-19 09:16:42,069 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-19 09:16:42,491 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 09:16:42,534 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 09:16:42,543 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 09:16:42,548 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 09:16:42,557 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 09:16:42,585 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 09:16:42,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 09:16:42,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 09:16:42,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 09:16:42,593 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 09:16:42,595 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 09:16:42,597 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 09:16:42,597 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 09:16:42,601 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 09:16:42,609 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-19 09:16:42,628 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 09:16:42,629 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver@2f89393 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:16:42, skipping insertion in model container [2024-11-19 09:16:42,629 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-19 09:16:42,630 INFO L186 ToolchainWalker]: Toolchain execution was canceled (user or tool) before executing de.uni_freiburg.informatik.ultimate.boogie.procedureinliner [2024-11-19 09:16:42,632 INFO L158 Benchmark]: Toolchain (without parser) took 628.44ms. Allocated memory is still 146.8MB. Free memory was 87.6MB in the beginning and 64.5MB in the end (delta: 23.1MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB. [2024-11-19 09:16:42,632 INFO L158 Benchmark]: CDTParser took 0.19ms. Allocated memory is still 146.8MB. Free memory is still 107.5MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-19 09:16:42,633 INFO L158 Benchmark]: CACSL2BoogieTranslator took 626.34ms. Allocated memory is still 146.8MB. Free memory was 87.6MB in the beginning and 64.5MB in the end (delta: 23.1MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB. [2024-11-19 09:16:42,634 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.19ms. Allocated memory is still 146.8MB. Free memory is still 107.5MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 626.34ms. Allocated memory is still 146.8MB. Free memory was 87.6MB in the beginning and 64.5MB in the end (delta: 23.1MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - UnsupportedSyntaxResult [Line: 727]: 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_test7-1.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-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-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash c2bb9f0c15e3c3296f863c26b4377b27546cf1c417a60e9663a6ff48eb617ef8 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-assert-order-craig-3061b6d-m [2024-11-19 09:16:44,710 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-19 09:16:44,785 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf [2024-11-19 09:16:44,792 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-19 09:16:44,793 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-19 09:16:44,822 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-19 09:16:44,823 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-19 09:16:44,823 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-19 09:16:44,824 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-19 09:16:44,824 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-19 09:16:44,825 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-19 09:16:44,825 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-19 09:16:44,826 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-19 09:16:44,826 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-19 09:16:44,826 INFO L153 SettingsManager]: * Use SBE=true [2024-11-19 09:16:44,827 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-19 09:16:44,827 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-19 09:16:44,828 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-19 09:16:44,828 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-19 09:16:44,828 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-19 09:16:44,829 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-11-19 09:16:44,829 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-11-19 09:16:44,829 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-11-19 09:16:44,830 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-19 09:16:44,830 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-19 09:16:44,830 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-19 09:16:44,831 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-19 09:16:44,831 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-19 09:16:44,831 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-19 09:16:44,832 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-19 09:16:44,832 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-19 09:16:44,832 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-19 09:16:44,833 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-19 09:16:44,833 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-19 09:16:44,833 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-19 09:16:44,834 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-19 09:16:44,834 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-19 09:16:44,834 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-19 09:16:44,835 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-19 09:16:44,835 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-19 09:16:44,835 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-19 09:16:44,837 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-19 09:16:44,837 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-19 09:16:44,838 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-19 09:16:44,838 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-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) 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 -> c2bb9f0c15e3c3296f863c26b4377b27546cf1c417a60e9663a6ff48eb617ef8 [2024-11-19 09:16:45,182 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-19 09:16:45,206 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-19 09:16:45,209 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-19 09:16:45,210 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-19 09:16:45,210 INFO L274 PluginConnector]: CDTParser initialized [2024-11-19 09:16:45,212 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_test7-1.i [2024-11-19 09:16:46,718 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-19 09:16:47,047 INFO L384 CDTParser]: Found 1 translation units. [2024-11-19 09:16:47,048 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_SFH_test7-1.i [2024-11-19 09:16:47,070 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/572dffd23/7a1a21c1c6e543d4b02be47130264acd/FLAG66bae1493 [2024-11-19 09:16:47,286 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/572dffd23/7a1a21c1c6e543d4b02be47130264acd [2024-11-19 09:16:47,289 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-19 09:16:47,291 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-19 09:16:47,293 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-19 09:16:47,294 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-19 09:16:47,299 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-19 09:16:47,301 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 09:16:47" (1/1) ... [2024-11-19 09:16:47,302 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@46e98436 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:16:47, skipping insertion in model container [2024-11-19 09:16:47,302 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 09:16:47" (1/1) ... [2024-11-19 09:16:47,359 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-19 09:16:47,787 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 09:16:47,838 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 09:16:47,843 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 09:16:47,852 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 09:16:47,864 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 09:16:47,904 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 09:16:47,905 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 09:16:47,910 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 09:16:47,912 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 09:16:47,915 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 09:16:47,920 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 09:16:47,921 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 09:16:47,926 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 09:16:47,929 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 09:16:47,942 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-19 09:16:47,965 INFO L197 MainTranslator]: Restarting translation with changed settings: SettingsChange [mNewPreferredMemoryModel=HoenickeLindenmann_1ByteResolution] [2024-11-19 09:16:47,976 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-19 09:16:48,005 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 09:16:48,025 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 09:16:48,027 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 09:16:48,029 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 09:16:48,031 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 09:16:48,045 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 09:16:48,046 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 09:16:48,047 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 09:16:48,048 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 09:16:48,050 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 09:16:48,050 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 09:16:48,051 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 09:16:48,052 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 09:16:48,054 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 09:16:48,057 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-19 09:16:48,064 INFO L200 MainTranslator]: Completed pre-run [2024-11-19 09:16:48,189 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-19 09:16:48,237 INFO L204 MainTranslator]: Completed translation [2024-11-19 09:16:48,238 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:16:48 WrapperNode [2024-11-19 09:16:48,238 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-19 09:16:48,239 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-19 09:16:48,240 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-19 09:16:48,240 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-19 09:16:48,246 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:16:48" (1/1) ... [2024-11-19 09:16:48,290 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:16:48" (1/1) ... [2024-11-19 09:16:48,361 INFO L138 Inliner]: procedures = 179, calls = 272, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 1037 [2024-11-19 09:16:48,362 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-19 09:16:48,363 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-19 09:16:48,363 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-19 09:16:48,363 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-19 09:16:48,374 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:16:48" (1/1) ... [2024-11-19 09:16:48,374 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:16:48" (1/1) ... [2024-11-19 09:16:48,391 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:16:48" (1/1) ... [2024-11-19 09:16:48,477 INFO L175 MemorySlicer]: Split 253 memory accesses to 3 slices as follows [2, 217, 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 09:16:48,477 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:16:48" (1/1) ... [2024-11-19 09:16:48,477 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:16:48" (1/1) ... [2024-11-19 09:16:48,518 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:16:48" (1/1) ... [2024-11-19 09:16:48,526 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:16:48" (1/1) ... [2024-11-19 09:16:48,531 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:16:48" (1/1) ... [2024-11-19 09:16:48,536 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:16:48" (1/1) ... [2024-11-19 09:16:48,545 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-19 09:16:48,546 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-19 09:16:48,546 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-19 09:16:48,546 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-19 09:16:48,547 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:16:48" (1/1) ... [2024-11-19 09:16:48,554 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-19 09:16:48,571 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 09:16:48,585 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 09:16:48,588 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 09:16:48,627 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2024-11-19 09:16:48,628 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2024-11-19 09:16:48,628 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#0 [2024-11-19 09:16:48,628 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#1 [2024-11-19 09:16:48,628 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#2 [2024-11-19 09:16:48,628 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#0 [2024-11-19 09:16:48,628 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#1 [2024-11-19 09:16:48,628 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#2 [2024-11-19 09:16:48,628 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#0 [2024-11-19 09:16:48,628 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#1 [2024-11-19 09:16:48,628 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#2 [2024-11-19 09:16:48,629 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#0 [2024-11-19 09:16:48,629 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#1 [2024-11-19 09:16:48,629 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#2 [2024-11-19 09:16:48,629 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-11-19 09:16:48,629 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-19 09:16:48,629 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2024-11-19 09:16:48,629 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2024-11-19 09:16:48,629 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2024-11-19 09:16:48,629 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-11-19 09:16:48,629 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2024-11-19 09:16:48,629 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2024-11-19 09:16:48,629 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2024-11-19 09:16:48,629 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-19 09:16:48,630 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#0 [2024-11-19 09:16:48,630 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#1 [2024-11-19 09:16:48,630 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#2 [2024-11-19 09:16:48,630 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-19 09:16:48,630 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2024-11-19 09:16:48,630 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#2 [2024-11-19 09:16:48,630 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-19 09:16:48,630 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-19 09:16:48,889 INFO L238 CfgBuilder]: Building ICFG [2024-11-19 09:16:48,891 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-19 09:16:48,916 WARN L781 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2024-11-19 09:16:48,960 WARN L781 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2024-11-19 09:16:48,985 WARN L781 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2024-11-19 09:16:52,418 INFO L? ?]: Removed 1074 outVars from TransFormulas that were not future-live. [2024-11-19 09:16:52,421 INFO L287 CfgBuilder]: Performing block encoding [2024-11-19 09:16:52,458 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-19 09:16:52,458 INFO L316 CfgBuilder]: Removed 63 assume(true) statements. [2024-11-19 09:16:52,459 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 09:16:52 BoogieIcfgContainer [2024-11-19 09:16:52,459 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-19 09:16:52,461 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-19 09:16:52,461 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-19 09:16:52,464 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-19 09:16:52,464 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.11 09:16:47" (1/3) ... [2024-11-19 09:16:52,465 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@611e9d71 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 09:16:52, skipping insertion in model container [2024-11-19 09:16:52,465 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:16:48" (2/3) ... [2024-11-19 09:16:52,465 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@611e9d71 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 09:16:52, skipping insertion in model container [2024-11-19 09:16:52,465 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 09:16:52" (3/3) ... [2024-11-19 09:16:52,466 INFO L112 eAbstractionObserver]: Analyzing ICFG uthash_SFH_test7-1.i [2024-11-19 09:16:52,483 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-19 09:16:52,483 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 523 error locations. [2024-11-19 09:16:52,551 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-19 09:16:52,558 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;@6f6625ee, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-19 09:16:52,558 INFO L334 AbstractCegarLoop]: Starting to check reachability of 523 error locations. [2024-11-19 09:16:52,566 INFO L276 IsEmpty]: Start isEmpty. Operand has 1052 states, 524 states have (on average 2.2270992366412212) internal successors, (1167), 1045 states have internal predecessors, (1167), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2024-11-19 09:16:52,575 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2024-11-19 09:16:52,576 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 09:16:52,576 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1] [2024-11-19 09:16:52,577 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 520 more)] === [2024-11-19 09:16:52,581 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 09:16:52,582 INFO L85 PathProgramCache]: Analyzing trace with hash 65605, now seen corresponding path program 1 times [2024-11-19 09:16:52,599 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 09:16:52,600 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [38232347] [2024-11-19 09:16:52,600 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 09:16:52,600 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 09:16:52,600 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 09:16:52,602 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 09:16:52,615 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 09:16:52,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 09:16:52,765 INFO L255 TraceCheckSpWp]: Trace formula consists of 23 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-19 09:16:52,771 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 09:16:52,810 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 6 treesize of output 7 [2024-11-19 09:16:52,823 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 09:16:52,823 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 09:16:52,824 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 09:16:52,825 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [38232347] [2024-11-19 09:16:52,826 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [38232347] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 09:16:52,827 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 09:16:52,827 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-19 09:16:52,829 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [11947492] [2024-11-19 09:16:52,830 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 09:16:52,834 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 09:16:52,834 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 09:16:52,883 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 09:16:52,884 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 09:16:52,894 INFO L87 Difference]: Start difference. First operand has 1052 states, 524 states have (on average 2.2270992366412212) internal successors, (1167), 1045 states have internal predecessors, (1167), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) Second operand has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 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 09:16:54,282 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 09:16:54,282 INFO L93 Difference]: Finished difference Result 1043 states and 1099 transitions. [2024-11-19 09:16:54,284 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 09:16:54,285 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 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 3 [2024-11-19 09:16:54,286 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 09:16:54,311 INFO L225 Difference]: With dead ends: 1043 [2024-11-19 09:16:54,311 INFO L226 Difference]: Without dead ends: 1041 [2024-11-19 09:16:54,313 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 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 09:16:54,316 INFO L432 NwaCegarLoop]: 622 mSDtfsCounter, 957 mSDsluCounter, 58 mSDsCounter, 0 mSdLazyCounter, 541 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 960 SdHoareTripleChecker+Valid, 680 SdHoareTripleChecker+Invalid, 557 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 541 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2024-11-19 09:16:54,317 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [960 Valid, 680 Invalid, 557 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 541 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2024-11-19 09:16:54,335 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1041 states. [2024-11-19 09:16:54,396 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1041 to 1033. [2024-11-19 09:16:54,399 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1033 states, 524 states have (on average 2.062977099236641) internal successors, (1081), 1027 states have internal predecessors, (1081), 5 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-19 09:16:54,403 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1033 states to 1033 states and 1089 transitions. [2024-11-19 09:16:54,405 INFO L78 Accepts]: Start accepts. Automaton has 1033 states and 1089 transitions. Word has length 3 [2024-11-19 09:16:54,405 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 09:16:54,405 INFO L471 AbstractCegarLoop]: Abstraction has 1033 states and 1089 transitions. [2024-11-19 09:16:54,405 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 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 09:16:54,406 INFO L276 IsEmpty]: Start isEmpty. Operand 1033 states and 1089 transitions. [2024-11-19 09:16:54,406 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2024-11-19 09:16:54,406 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 09:16:54,406 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1] [2024-11-19 09:16:54,410 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 09:16:54,607 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 09:16:54,608 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 520 more)] === [2024-11-19 09:16:54,609 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 09:16:54,609 INFO L85 PathProgramCache]: Analyzing trace with hash 65606, now seen corresponding path program 1 times [2024-11-19 09:16:54,609 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 09:16:54,609 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [495472121] [2024-11-19 09:16:54,610 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 09:16:54,610 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 09:16:54,610 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 09:16:54,611 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 09:16:54,613 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 09:16:54,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 09:16:54,722 INFO L255 TraceCheckSpWp]: Trace formula consists of 23 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-19 09:16:54,724 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 09:16:54,734 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 6 treesize of output 5 [2024-11-19 09:16:54,750 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 09:16:54,751 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 09:16:54,752 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 09:16:54,752 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [495472121] [2024-11-19 09:16:54,752 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [495472121] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 09:16:54,752 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 09:16:54,752 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-19 09:16:54,753 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1791757768] [2024-11-19 09:16:54,753 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 09:16:54,754 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 09:16:54,756 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 09:16:54,757 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 09:16:54,757 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 09:16:54,757 INFO L87 Difference]: Start difference. First operand 1033 states and 1089 transitions. Second operand has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 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 09:16:56,611 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 09:16:56,611 INFO L93 Difference]: Finished difference Result 1430 states and 1518 transitions. [2024-11-19 09:16:56,611 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 09:16:56,612 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 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 3 [2024-11-19 09:16:56,612 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 09:16:56,617 INFO L225 Difference]: With dead ends: 1430 [2024-11-19 09:16:56,617 INFO L226 Difference]: Without dead ends: 1430 [2024-11-19 09:16:56,618 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 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 09:16:56,618 INFO L432 NwaCegarLoop]: 893 mSDtfsCounter, 426 mSDsluCounter, 567 mSDsCounter, 0 mSdLazyCounter, 696 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 426 SdHoareTripleChecker+Valid, 1460 SdHoareTripleChecker+Invalid, 702 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 696 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2024-11-19 09:16:56,619 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [426 Valid, 1460 Invalid, 702 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 696 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2024-11-19 09:16:56,621 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1430 states. [2024-11-19 09:16:56,643 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1430 to 1242. [2024-11-19 09:16:56,645 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1242 states, 734 states have (on average 2.0490463215258856) internal successors, (1504), 1236 states have internal predecessors, (1504), 5 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-19 09:16:56,650 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1242 states to 1242 states and 1512 transitions. [2024-11-19 09:16:56,650 INFO L78 Accepts]: Start accepts. Automaton has 1242 states and 1512 transitions. Word has length 3 [2024-11-19 09:16:56,650 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 09:16:56,651 INFO L471 AbstractCegarLoop]: Abstraction has 1242 states and 1512 transitions. [2024-11-19 09:16:56,651 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 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 09:16:56,651 INFO L276 IsEmpty]: Start isEmpty. Operand 1242 states and 1512 transitions. [2024-11-19 09:16:56,651 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2024-11-19 09:16:56,651 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 09:16:56,651 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2024-11-19 09:16:56,655 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Ended with exit code 0 [2024-11-19 09:16:56,855 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 09:16:56,856 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 520 more)] === [2024-11-19 09:16:56,856 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 09:16:56,856 INFO L85 PathProgramCache]: Analyzing trace with hash 458521935, now seen corresponding path program 1 times [2024-11-19 09:16:56,857 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 09:16:56,857 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [589194880] [2024-11-19 09:16:56,857 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 09:16:56,857 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 09:16:56,857 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 09:16:56,860 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 09:16:56,862 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 09:16:56,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 09:16:57,000 INFO L255 TraceCheckSpWp]: Trace formula consists of 60 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-19 09:16:57,002 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 09:16:57,018 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 6 treesize of output 5 [2024-11-19 09:16:57,026 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 6 treesize of output 7 [2024-11-19 09:16:57,083 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-19 09:16:57,085 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 9 [2024-11-19 09:16:57,103 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2024-11-19 09:16:57,103 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 13 [2024-11-19 09:16:57,133 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 09:16:57,134 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 09:16:57,134 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 09:16:57,135 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [589194880] [2024-11-19 09:16:57,135 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [589194880] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 09:16:57,135 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 09:16:57,135 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-19 09:16:57,136 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1760003253] [2024-11-19 09:16:57,136 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 09:16:57,136 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-19 09:16:57,136 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 09:16:57,137 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-19 09:16:57,137 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-19 09:16:57,137 INFO L87 Difference]: Start difference. First operand 1242 states and 1512 transitions. Second operand has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 4 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 09:16:58,960 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 09:16:58,960 INFO L93 Difference]: Finished difference Result 1244 states and 1516 transitions. [2024-11-19 09:16:58,961 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-19 09:16:58,961 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 4 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 09:16:58,961 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 09:16:58,965 INFO L225 Difference]: With dead ends: 1244 [2024-11-19 09:16:58,965 INFO L226 Difference]: Without dead ends: 1244 [2024-11-19 09:16:58,965 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-19 09:16:58,966 INFO L432 NwaCegarLoop]: 355 mSDtfsCounter, 1054 mSDsluCounter, 43 mSDsCounter, 0 mSdLazyCounter, 812 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1057 SdHoareTripleChecker+Valid, 398 SdHoareTripleChecker+Invalid, 829 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 812 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2024-11-19 09:16:58,967 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1057 Valid, 398 Invalid, 829 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 812 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2024-11-19 09:16:58,969 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1244 states. [2024-11-19 09:16:58,984 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1244 to 1021. [2024-11-19 09:16:58,986 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1021 states, 524 states have (on average 2.0381679389312977) internal successors, (1068), 1015 states have internal predecessors, (1068), 5 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-19 09:16:58,989 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1021 states to 1021 states and 1076 transitions. [2024-11-19 09:16:58,989 INFO L78 Accepts]: Start accepts. Automaton has 1021 states and 1076 transitions. Word has length 7 [2024-11-19 09:16:58,989 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 09:16:58,990 INFO L471 AbstractCegarLoop]: Abstraction has 1021 states and 1076 transitions. [2024-11-19 09:16:58,990 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 4 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 09:16:58,990 INFO L276 IsEmpty]: Start isEmpty. Operand 1021 states and 1076 transitions. [2024-11-19 09:16:58,990 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2024-11-19 09:16:58,991 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 09:16:58,991 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 09:16:58,996 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Ended with exit code 0 [2024-11-19 09:16:59,191 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-19 09:16:59,192 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 520 more)] === [2024-11-19 09:16:59,194 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 09:16:59,194 INFO L85 PathProgramCache]: Analyzing trace with hash 1329278099, now seen corresponding path program 1 times [2024-11-19 09:16:59,195 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 09:16:59,195 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1760271641] [2024-11-19 09:16:59,195 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 09:16:59,195 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 09:16:59,196 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 09:16:59,199 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 09:16:59,200 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 09:16:59,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 09:16:59,310 INFO L255 TraceCheckSpWp]: Trace formula consists of 65 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-19 09:16:59,312 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 09:16:59,320 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 6 treesize of output 5 [2024-11-19 09:16:59,342 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 09:16:59,343 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 09:16:59,343 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 09:16:59,343 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1760271641] [2024-11-19 09:16:59,343 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1760271641] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 09:16:59,344 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 09:16:59,344 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-19 09:16:59,344 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1637223905] [2024-11-19 09:16:59,345 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 09:16:59,345 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 09:16:59,347 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 09:16:59,348 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 09:16:59,348 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 09:16:59,348 INFO L87 Difference]: Start difference. First operand 1021 states and 1076 transitions. Second operand has 3 states, 2 states have (on average 4.0) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 09:17:01,409 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 09:17:01,410 INFO L93 Difference]: Finished difference Result 1493 states and 1585 transitions. [2024-11-19 09:17:01,410 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 09:17:01,410 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 4.0) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 8 [2024-11-19 09:17:01,410 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 09:17:01,415 INFO L225 Difference]: With dead ends: 1493 [2024-11-19 09:17:01,415 INFO L226 Difference]: Without dead ends: 1493 [2024-11-19 09:17:01,416 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 6 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 09:17:01,416 INFO L432 NwaCegarLoop]: 1164 mSDtfsCounter, 692 mSDsluCounter, 418 mSDsCounter, 0 mSdLazyCounter, 778 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 692 SdHoareTripleChecker+Valid, 1582 SdHoareTripleChecker+Invalid, 791 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 778 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2024-11-19 09:17:01,417 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [692 Valid, 1582 Invalid, 791 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 778 Invalid, 0 Unknown, 0 Unchecked, 2.0s Time] [2024-11-19 09:17:01,419 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1493 states. [2024-11-19 09:17:01,434 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1493 to 1048. [2024-11-19 09:17:01,435 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1048 states, 561 states have (on average 2.0249554367201426) internal successors, (1136), 1042 states have internal predecessors, (1136), 5 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-19 09:17:01,438 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1048 states to 1048 states and 1144 transitions. [2024-11-19 09:17:01,438 INFO L78 Accepts]: Start accepts. Automaton has 1048 states and 1144 transitions. Word has length 8 [2024-11-19 09:17:01,439 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 09:17:01,439 INFO L471 AbstractCegarLoop]: Abstraction has 1048 states and 1144 transitions. [2024-11-19 09:17:01,439 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 4.0) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 09:17:01,439 INFO L276 IsEmpty]: Start isEmpty. Operand 1048 states and 1144 transitions. [2024-11-19 09:17:01,440 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2024-11-19 09:17:01,440 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 09:17:01,440 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 09:17:01,444 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 09:17:01,640 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 09:17:01,641 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 520 more)] === [2024-11-19 09:17:01,641 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 09:17:01,641 INFO L85 PathProgramCache]: Analyzing trace with hash 1329278098, now seen corresponding path program 1 times [2024-11-19 09:17:01,642 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 09:17:01,642 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2122943771] [2024-11-19 09:17:01,642 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 09:17:01,642 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 09:17:01,642 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 09:17:01,643 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 09:17:01,644 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 09:17:01,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 09:17:01,751 INFO L255 TraceCheckSpWp]: Trace formula consists of 65 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-19 09:17:01,753 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 09:17:01,767 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 6 treesize of output 7 [2024-11-19 09:17:01,780 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 09:17:01,781 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 09:17:01,781 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 09:17:01,781 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2122943771] [2024-11-19 09:17:01,781 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2122943771] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 09:17:01,781 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 09:17:01,781 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-19 09:17:01,782 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2021726258] [2024-11-19 09:17:01,782 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 09:17:01,782 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 09:17:01,782 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 09:17:01,783 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 09:17:01,783 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 09:17:01,783 INFO L87 Difference]: Start difference. First operand 1048 states and 1144 transitions. Second operand has 3 states, 2 states have (on average 4.0) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 09:17:02,978 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 09:17:02,979 INFO L93 Difference]: Finished difference Result 1383 states and 1505 transitions. [2024-11-19 09:17:02,979 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 09:17:02,979 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 4.0) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 8 [2024-11-19 09:17:02,979 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 09:17:02,983 INFO L225 Difference]: With dead ends: 1383 [2024-11-19 09:17:02,983 INFO L226 Difference]: Without dead ends: 1383 [2024-11-19 09:17:02,983 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 6 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 09:17:02,984 INFO L432 NwaCegarLoop]: 939 mSDtfsCounter, 925 mSDsluCounter, 244 mSDsCounter, 0 mSdLazyCounter, 727 mSolverCounterSat, 50 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 928 SdHoareTripleChecker+Valid, 1183 SdHoareTripleChecker+Invalid, 777 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 50 IncrementalHoareTripleChecker+Valid, 727 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2024-11-19 09:17:02,984 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [928 Valid, 1183 Invalid, 777 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [50 Valid, 727 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2024-11-19 09:17:02,986 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1383 states. [2024-11-19 09:17:02,998 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1383 to 1001. [2024-11-19 09:17:02,999 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1001 states, 561 states have (on average 1.9340463458110517) internal successors, (1085), 995 states have internal predecessors, (1085), 5 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-19 09:17:03,001 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1001 states to 1001 states and 1093 transitions. [2024-11-19 09:17:03,002 INFO L78 Accepts]: Start accepts. Automaton has 1001 states and 1093 transitions. Word has length 8 [2024-11-19 09:17:03,002 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 09:17:03,002 INFO L471 AbstractCegarLoop]: Abstraction has 1001 states and 1093 transitions. [2024-11-19 09:17:03,002 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 4.0) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 09:17:03,002 INFO L276 IsEmpty]: Start isEmpty. Operand 1001 states and 1093 transitions. [2024-11-19 09:17:03,003 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2024-11-19 09:17:03,003 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 09:17:03,003 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 09:17:03,008 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 09:17:03,206 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 09:17:03,207 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr521ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 520 more)] === [2024-11-19 09:17:03,207 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 09:17:03,208 INFO L85 PathProgramCache]: Analyzing trace with hash -263475945, now seen corresponding path program 1 times [2024-11-19 09:17:03,208 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 09:17:03,208 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1266831551] [2024-11-19 09:17:03,208 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 09:17:03,209 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 09:17:03,209 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 09:17:03,210 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 09:17:03,211 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 09:17:03,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 09:17:03,348 INFO L255 TraceCheckSpWp]: Trace formula consists of 86 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-19 09:17:03,350 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 09:17:03,360 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-19 09:17:03,361 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-19 09:17:03,367 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 33 treesize of output 31 [2024-11-19 09:17:03,414 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-19 09:17:03,415 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 62 treesize of output 22 [2024-11-19 09:17:03,444 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 09:17:03,445 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 09:17:03,445 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 09:17:03,445 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1266831551] [2024-11-19 09:17:03,445 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1266831551] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 09:17:03,445 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 09:17:03,445 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-19 09:17:03,445 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [575012401] [2024-11-19 09:17:03,445 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 09:17:03,446 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-19 09:17:03,446 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 09:17:03,446 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-19 09:17:03,446 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-19 09:17:03,446 INFO L87 Difference]: Start difference. First operand 1001 states and 1093 transitions. Second operand has 4 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 09:17:03,952 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 09:17:03,953 INFO L93 Difference]: Finished difference Result 1984 states and 2171 transitions. [2024-11-19 09:17:03,953 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-19 09:17:03,953 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 12 [2024-11-19 09:17:03,954 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 09:17:03,959 INFO L225 Difference]: With dead ends: 1984 [2024-11-19 09:17:03,959 INFO L226 Difference]: Without dead ends: 1984 [2024-11-19 09:17:03,960 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-19 09:17:03,962 INFO L432 NwaCegarLoop]: 1188 mSDtfsCounter, 983 mSDsluCounter, 2151 mSDsCounter, 0 mSdLazyCounter, 125 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 986 SdHoareTripleChecker+Valid, 3339 SdHoareTripleChecker+Invalid, 126 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 125 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-19 09:17:03,962 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [986 Valid, 3339 Invalid, 126 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 125 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-19 09:17:03,965 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1984 states. [2024-11-19 09:17:03,982 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1984 to 1003. [2024-11-19 09:17:03,983 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1003 states, 563 states have (on average 1.9307282415630551) internal successors, (1087), 997 states have internal predecessors, (1087), 5 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-19 09:17:03,986 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1003 states to 1003 states and 1095 transitions. [2024-11-19 09:17:03,987 INFO L78 Accepts]: Start accepts. Automaton has 1003 states and 1095 transitions. Word has length 12 [2024-11-19 09:17:03,987 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 09:17:03,988 INFO L471 AbstractCegarLoop]: Abstraction has 1003 states and 1095 transitions. [2024-11-19 09:17:03,988 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 09:17:03,988 INFO L276 IsEmpty]: Start isEmpty. Operand 1003 states and 1095 transitions. [2024-11-19 09:17:03,989 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2024-11-19 09:17:03,989 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 09:17:03,989 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 09:17:03,996 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Ended with exit code 0 [2024-11-19 09:17:04,189 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 09:17:04,192 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 520 more)] === [2024-11-19 09:17:04,193 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 09:17:04,193 INFO L85 PathProgramCache]: Analyzing trace with hash 183846334, now seen corresponding path program 1 times [2024-11-19 09:17:04,193 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 09:17:04,194 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1838590159] [2024-11-19 09:17:04,194 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 09:17:04,194 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 09:17:04,194 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 09:17:04,197 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 09:17:04,198 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 09:17:04,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 09:17:04,356 INFO L255 TraceCheckSpWp]: Trace formula consists of 130 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-19 09:17:04,357 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 09:17:04,369 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 09:17:04,369 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 09:17:04,370 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 09:17:04,370 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1838590159] [2024-11-19 09:17:04,370 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1838590159] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 09:17:04,370 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 09:17:04,370 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-19 09:17:04,370 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [292360517] [2024-11-19 09:17:04,371 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 09:17:04,371 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 09:17:04,371 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 09:17:04,371 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 09:17:04,372 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 09:17:04,372 INFO L87 Difference]: Start difference. First operand 1003 states and 1095 transitions. Second operand has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 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 09:17:04,399 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 09:17:04,400 INFO L93 Difference]: Finished difference Result 961 states and 1052 transitions. [2024-11-19 09:17:04,400 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 09:17:04,400 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 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 18 [2024-11-19 09:17:04,401 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 09:17:04,403 INFO L225 Difference]: With dead ends: 961 [2024-11-19 09:17:04,404 INFO L226 Difference]: Without dead ends: 961 [2024-11-19 09:17:04,404 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 16 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 09:17:04,405 INFO L432 NwaCegarLoop]: 956 mSDtfsCounter, 71 mSDsluCounter, 893 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 71 SdHoareTripleChecker+Valid, 1849 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-19 09:17:04,405 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [71 Valid, 1849 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 09:17:04,408 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 961 states. [2024-11-19 09:17:04,418 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 961 to 961. [2024-11-19 09:17:04,419 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 961 states, 545 states have (on average 1.9155963302752295) internal successors, (1044), 955 states have internal predecessors, (1044), 5 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-19 09:17:04,422 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 961 states to 961 states and 1052 transitions. [2024-11-19 09:17:04,422 INFO L78 Accepts]: Start accepts. Automaton has 961 states and 1052 transitions. Word has length 18 [2024-11-19 09:17:04,422 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 09:17:04,422 INFO L471 AbstractCegarLoop]: Abstraction has 961 states and 1052 transitions. [2024-11-19 09:17:04,422 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 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 09:17:04,422 INFO L276 IsEmpty]: Start isEmpty. Operand 961 states and 1052 transitions. [2024-11-19 09:17:04,423 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2024-11-19 09:17:04,423 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 09:17:04,424 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] [2024-11-19 09:17:04,431 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Forceful destruction successful, exit code 0 [2024-11-19 09:17:04,624 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 09:17:04,625 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr38REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 520 more)] === [2024-11-19 09:17:04,625 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 09:17:04,625 INFO L85 PathProgramCache]: Analyzing trace with hash 582665080, now seen corresponding path program 1 times [2024-11-19 09:17:04,625 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 09:17:04,625 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2038234757] [2024-11-19 09:17:04,625 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 09:17:04,626 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 09:17:04,626 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 09:17:04,627 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 09:17:04,628 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 09:17:04,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 09:17:04,768 INFO L255 TraceCheckSpWp]: Trace formula consists of 133 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-19 09:17:04,769 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 09:17:04,783 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 09:17:04,784 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 09:17:04,784 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 09:17:04,784 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2038234757] [2024-11-19 09:17:04,784 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2038234757] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 09:17:04,784 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 09:17:04,784 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-19 09:17:04,784 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1373922197] [2024-11-19 09:17:04,784 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 09:17:04,784 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-19 09:17:04,785 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 09:17:04,785 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-19 09:17:04,785 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-19 09:17:04,785 INFO L87 Difference]: Start difference. First operand 961 states and 1052 transitions. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 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 09:17:04,840 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 09:17:04,840 INFO L93 Difference]: Finished difference Result 939 states and 1023 transitions. [2024-11-19 09:17:04,840 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-19 09:17:04,840 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 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 20 [2024-11-19 09:17:04,841 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 09:17:04,843 INFO L225 Difference]: With dead ends: 939 [2024-11-19 09:17:04,843 INFO L226 Difference]: Without dead ends: 939 [2024-11-19 09:17:04,843 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 17 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 09:17:04,844 INFO L432 NwaCegarLoop]: 911 mSDtfsCounter, 48 mSDsluCounter, 1796 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 48 SdHoareTripleChecker+Valid, 2707 SdHoareTripleChecker+Invalid, 59 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-19 09:17:04,844 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [48 Valid, 2707 Invalid, 59 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 09:17:04,847 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 939 states. [2024-11-19 09:17:04,863 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 939 to 939. [2024-11-19 09:17:04,865 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 939 states, 537 states have (on average 1.8901303538175047) internal successors, (1015), 933 states have internal predecessors, (1015), 5 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-19 09:17:04,867 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 939 states to 939 states and 1023 transitions. [2024-11-19 09:17:04,867 INFO L78 Accepts]: Start accepts. Automaton has 939 states and 1023 transitions. Word has length 20 [2024-11-19 09:17:04,868 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 09:17:04,868 INFO L471 AbstractCegarLoop]: Abstraction has 939 states and 1023 transitions. [2024-11-19 09:17:04,868 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 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 09:17:04,868 INFO L276 IsEmpty]: Start isEmpty. Operand 939 states and 1023 transitions. [2024-11-19 09:17:04,869 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2024-11-19 09:17:04,869 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 09:17:04,869 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] [2024-11-19 09:17:04,875 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Ended with exit code 0 [2024-11-19 09:17:05,070 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 09:17:05,070 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr52REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 520 more)] === [2024-11-19 09:17:05,071 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 09:17:05,071 INFO L85 PathProgramCache]: Analyzing trace with hash -195006074, now seen corresponding path program 1 times [2024-11-19 09:17:05,071 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 09:17:05,071 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [216467915] [2024-11-19 09:17:05,071 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 09:17:05,072 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-19 09:17:05,072 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 09:17:05,073 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 09:17:05,075 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 09:17:05,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 09:17:05,242 INFO L255 TraceCheckSpWp]: Trace formula consists of 147 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-19 09:17:05,245 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 09:17:05,258 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 6 treesize of output 7 [2024-11-19 09:17:05,355 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 09:17:05,356 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 09:17:05,356 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 09:17:05,356 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [216467915] [2024-11-19 09:17:05,356 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [216467915] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 09:17:05,356 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 09:17:05,356 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-19 09:17:05,356 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1646660496] [2024-11-19 09:17:05,356 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 09:17:05,357 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-19 09:17:05,357 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 09:17:05,357 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-19 09:17:05,357 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-19 09:17:05,357 INFO L87 Difference]: Start difference. First operand 939 states and 1023 transitions. Second operand has 4 states, 3 states have (on average 11.333333333333334) internal successors, (34), 4 states have internal predecessors, (34), 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 09:17:06,890 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 09:17:06,890 INFO L93 Difference]: Finished difference Result 1318 states and 1431 transitions. [2024-11-19 09:17:06,891 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-19 09:17:06,891 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 11.333333333333334) internal successors, (34), 4 states have internal predecessors, (34), 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 34 [2024-11-19 09:17:06,891 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 09:17:06,895 INFO L225 Difference]: With dead ends: 1318 [2024-11-19 09:17:06,895 INFO L226 Difference]: Without dead ends: 1318 [2024-11-19 09:17:06,895 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 31 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 09:17:06,896 INFO L432 NwaCegarLoop]: 493 mSDtfsCounter, 858 mSDsluCounter, 678 mSDsCounter, 0 mSdLazyCounter, 1155 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 861 SdHoareTripleChecker+Valid, 1171 SdHoareTripleChecker+Invalid, 1162 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 1155 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2024-11-19 09:17:06,896 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [861 Valid, 1171 Invalid, 1162 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 1155 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2024-11-19 09:17:06,898 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1318 states. [2024-11-19 09:17:06,909 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1318 to 935. [2024-11-19 09:17:06,911 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 935 states, 537 states have (on average 1.8826815642458101) internal successors, (1011), 929 states have internal predecessors, (1011), 5 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-19 09:17:06,913 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 935 states to 935 states and 1019 transitions. [2024-11-19 09:17:06,913 INFO L78 Accepts]: Start accepts. Automaton has 935 states and 1019 transitions. Word has length 34 [2024-11-19 09:17:06,914 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 09:17:06,914 INFO L471 AbstractCegarLoop]: Abstraction has 935 states and 1019 transitions. [2024-11-19 09:17:06,914 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 11.333333333333334) internal successors, (34), 4 states have internal predecessors, (34), 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 09:17:06,914 INFO L276 IsEmpty]: Start isEmpty. Operand 935 states and 1019 transitions. [2024-11-19 09:17:06,915 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2024-11-19 09:17:06,915 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 09:17:06,915 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] [2024-11-19 09:17:06,921 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 09:17:07,119 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 09:17:07,120 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr53REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 520 more)] === [2024-11-19 09:17:07,120 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 09:17:07,120 INFO L85 PathProgramCache]: Analyzing trace with hash -195006073, now seen corresponding path program 1 times [2024-11-19 09:17:07,121 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 09:17:07,121 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [91014237] [2024-11-19 09:17:07,121 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 09:17:07,121 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 09:17:07,121 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 09:17:07,122 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 09:17:07,124 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Waiting until timeout for monitored process [2024-11-19 09:17:07,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 09:17:07,281 INFO L255 TraceCheckSpWp]: Trace formula consists of 147 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-19 09:17:07,284 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 09:17:07,300 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 6 treesize of output 5 [2024-11-19 09:17:07,526 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 09:17:07,526 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 09:17:07,526 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 09:17:07,526 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [91014237] [2024-11-19 09:17:07,526 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [91014237] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 09:17:07,526 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 09:17:07,526 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-19 09:17:07,526 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [929104311] [2024-11-19 09:17:07,527 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 09:17:07,527 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-19 09:17:07,527 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 09:17:07,527 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-19 09:17:07,527 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-19 09:17:07,528 INFO L87 Difference]: Start difference. First operand 935 states and 1019 transitions. Second operand has 4 states, 3 states have (on average 11.333333333333334) internal successors, (34), 4 states have internal predecessors, (34), 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 09:17:09,645 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 09:17:09,645 INFO L93 Difference]: Finished difference Result 1380 states and 1460 transitions. [2024-11-19 09:17:09,645 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-19 09:17:09,645 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 11.333333333333334) internal successors, (34), 4 states have internal predecessors, (34), 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 34 [2024-11-19 09:17:09,646 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 09:17:09,648 INFO L225 Difference]: With dead ends: 1380 [2024-11-19 09:17:09,649 INFO L226 Difference]: Without dead ends: 1380 [2024-11-19 09:17:09,649 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 31 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 09:17:09,649 INFO L432 NwaCegarLoop]: 663 mSDtfsCounter, 621 mSDsluCounter, 866 mSDsCounter, 0 mSdLazyCounter, 1118 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 621 SdHoareTripleChecker+Valid, 1529 SdHoareTripleChecker+Invalid, 1121 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 1118 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2024-11-19 09:17:09,650 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [621 Valid, 1529 Invalid, 1121 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 1118 Invalid, 0 Unknown, 0 Unchecked, 2.1s Time] [2024-11-19 09:17:09,651 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1380 states. [2024-11-19 09:17:09,661 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1380 to 931. [2024-11-19 09:17:09,662 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 931 states, 537 states have (on average 1.8752327746741155) internal successors, (1007), 925 states have internal predecessors, (1007), 5 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-19 09:17:09,664 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 931 states to 931 states and 1015 transitions. [2024-11-19 09:17:09,664 INFO L78 Accepts]: Start accepts. Automaton has 931 states and 1015 transitions. Word has length 34 [2024-11-19 09:17:09,665 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 09:17:09,665 INFO L471 AbstractCegarLoop]: Abstraction has 931 states and 1015 transitions. [2024-11-19 09:17:09,665 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 11.333333333333334) internal successors, (34), 4 states have internal predecessors, (34), 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 09:17:09,665 INFO L276 IsEmpty]: Start isEmpty. Operand 931 states and 1015 transitions. [2024-11-19 09:17:09,666 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2024-11-19 09:17:09,666 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 09:17:09,666 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] [2024-11-19 09:17:09,673 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 09:17:09,867 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 09:17:09,867 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr117REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 520 more)] === [2024-11-19 09:17:09,868 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 09:17:09,868 INFO L85 PathProgramCache]: Analyzing trace with hash 512632320, now seen corresponding path program 1 times [2024-11-19 09:17:09,868 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 09:17:09,868 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1974649487] [2024-11-19 09:17:09,868 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 09:17:09,869 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 09:17:09,869 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 09:17:09,872 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 09:17:09,873 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 09:17:10,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 09:17:10,088 INFO L255 TraceCheckSpWp]: Trace formula consists of 219 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-19 09:17:10,091 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 09:17:10,136 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 09:17:10,137 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 09:17:10,137 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 09:17:10,137 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1974649487] [2024-11-19 09:17:10,137 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1974649487] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 09:17:10,138 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 09:17:10,138 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-19 09:17:10,138 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [349605053] [2024-11-19 09:17:10,138 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 09:17:10,138 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-19 09:17:10,139 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 09:17:10,140 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-19 09:17:10,140 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-19 09:17:10,140 INFO L87 Difference]: Start difference. First operand 931 states and 1015 transitions. Second operand has 4 states, 4 states have (on average 12.5) internal successors, (50), 4 states have internal predecessors, (50), 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 09:17:10,195 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 09:17:10,195 INFO L93 Difference]: Finished difference Result 925 states and 1005 transitions. [2024-11-19 09:17:10,196 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-19 09:17:10,196 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.5) internal successors, (50), 4 states have internal predecessors, (50), 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 50 [2024-11-19 09:17:10,196 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 09:17:10,199 INFO L225 Difference]: With dead ends: 925 [2024-11-19 09:17:10,199 INFO L226 Difference]: Without dead ends: 925 [2024-11-19 09:17:10,199 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 47 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 09:17:10,200 INFO L432 NwaCegarLoop]: 905 mSDtfsCounter, 21 mSDsluCounter, 1779 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 2684 SdHoareTripleChecker+Invalid, 44 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-19 09:17:10,200 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 2684 Invalid, 44 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 09:17:10,202 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 925 states. [2024-11-19 09:17:10,210 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 925 to 925. [2024-11-19 09:17:10,211 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 925 states, 531 states have (on average 1.8775894538606404) internal successors, (997), 919 states have internal predecessors, (997), 5 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-19 09:17:10,213 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 925 states to 925 states and 1005 transitions. [2024-11-19 09:17:10,214 INFO L78 Accepts]: Start accepts. Automaton has 925 states and 1005 transitions. Word has length 50 [2024-11-19 09:17:10,214 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 09:17:10,214 INFO L471 AbstractCegarLoop]: Abstraction has 925 states and 1005 transitions. [2024-11-19 09:17:10,214 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.5) internal successors, (50), 4 states have internal predecessors, (50), 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 09:17:10,214 INFO L276 IsEmpty]: Start isEmpty. Operand 925 states and 1005 transitions. [2024-11-19 09:17:10,216 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2024-11-19 09:17:10,216 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 09:17:10,216 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] [2024-11-19 09:17:10,225 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (12)] Ended with exit code 0 [2024-11-19 09:17:10,421 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 09:17:10,422 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr117REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 520 more)] === [2024-11-19 09:17:10,422 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 09:17:10,422 INFO L85 PathProgramCache]: Analyzing trace with hash 1557557452, now seen corresponding path program 1 times [2024-11-19 09:17:10,423 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 09:17:10,423 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2073906660] [2024-11-19 09:17:10,423 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 09:17:10,423 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 09:17:10,423 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 09:17:10,427 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 09:17:10,428 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 09:17:10,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 09:17:10,673 INFO L255 TraceCheckSpWp]: Trace formula consists of 243 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-19 09:17:10,676 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 09:17:10,913 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 09:17:10,913 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 09:17:10,914 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 09:17:10,914 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2073906660] [2024-11-19 09:17:10,915 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2073906660] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 09:17:10,915 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 09:17:10,915 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-19 09:17:10,915 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1947891051] [2024-11-19 09:17:10,915 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 09:17:10,915 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 09:17:10,916 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 09:17:10,916 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 09:17:10,916 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 09:17:10,916 INFO L87 Difference]: Start difference. First operand 925 states and 1005 transitions. Second operand has 3 states, 3 states have (on average 19.333333333333332) internal successors, (58), 3 states have internal predecessors, (58), 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 09:17:11,120 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 09:17:11,120 INFO L93 Difference]: Finished difference Result 1269 states and 1391 transitions. [2024-11-19 09:17:11,121 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 09:17:11,121 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 19.333333333333332) internal successors, (58), 3 states have internal predecessors, (58), 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 58 [2024-11-19 09:17:11,122 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 09:17:11,125 INFO L225 Difference]: With dead ends: 1269 [2024-11-19 09:17:11,125 INFO L226 Difference]: Without dead ends: 1269 [2024-11-19 09:17:11,126 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 56 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 09:17:11,127 INFO L432 NwaCegarLoop]: 1126 mSDtfsCounter, 309 mSDsluCounter, 842 mSDsCounter, 0 mSdLazyCounter, 117 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 309 SdHoareTripleChecker+Valid, 1968 SdHoareTripleChecker+Invalid, 120 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 117 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-19 09:17:11,127 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [309 Valid, 1968 Invalid, 120 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 117 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-19 09:17:11,128 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1269 states. [2024-11-19 09:17:11,139 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1269 to 1134. [2024-11-19 09:17:11,141 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1134 states, 740 states have (on average 1.8405405405405406) internal successors, (1362), 1128 states have internal predecessors, (1362), 5 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-19 09:17:11,145 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1134 states to 1134 states and 1370 transitions. [2024-11-19 09:17:11,146 INFO L78 Accepts]: Start accepts. Automaton has 1134 states and 1370 transitions. Word has length 58 [2024-11-19 09:17:11,146 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 09:17:11,146 INFO L471 AbstractCegarLoop]: Abstraction has 1134 states and 1370 transitions. [2024-11-19 09:17:11,146 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 19.333333333333332) internal successors, (58), 3 states have internal predecessors, (58), 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 09:17:11,147 INFO L276 IsEmpty]: Start isEmpty. Operand 1134 states and 1370 transitions. [2024-11-19 09:17:11,149 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2024-11-19 09:17:11,149 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 09:17:11,149 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] [2024-11-19 09:17:11,159 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 (13)] Forceful destruction successful, exit code 0 [2024-11-19 09:17:11,349 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 09:17:11,350 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr71REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 520 more)] === [2024-11-19 09:17:11,351 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 09:17:11,351 INFO L85 PathProgramCache]: Analyzing trace with hash -1740051530, now seen corresponding path program 1 times [2024-11-19 09:17:11,351 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 09:17:11,351 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [989952906] [2024-11-19 09:17:11,352 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 09:17:11,352 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 09:17:11,352 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 09:17:11,355 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 09:17:11,356 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (14)] Waiting until timeout for monitored process [2024-11-19 09:17:11,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 09:17:11,648 INFO L255 TraceCheckSpWp]: Trace formula consists of 278 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-19 09:17:11,651 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 09:17:11,665 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 6 treesize of output 7 [2024-11-19 09:17:11,674 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 6 treesize of output 5 [2024-11-19 09:17:12,178 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-19 09:17:12,179 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 9 [2024-11-19 09:17:12,194 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2024-11-19 09:17:12,195 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 13 [2024-11-19 09:17:12,209 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 09:17:12,209 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 09:17:12,209 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 09:17:12,209 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [989952906] [2024-11-19 09:17:12,209 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [989952906] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 09:17:12,209 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 09:17:12,209 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-19 09:17:12,210 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1067576346] [2024-11-19 09:17:12,210 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 09:17:12,210 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-19 09:17:12,210 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 09:17:12,210 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-19 09:17:12,211 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-19 09:17:12,211 INFO L87 Difference]: Start difference. First operand 1134 states and 1370 transitions. Second operand has 4 states, 3 states have (on average 20.333333333333332) internal successors, (61), 4 states have internal predecessors, (61), 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 09:17:13,890 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 09:17:13,890 INFO L93 Difference]: Finished difference Result 1552 states and 1913 transitions. [2024-11-19 09:17:13,890 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-19 09:17:13,890 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 20.333333333333332) internal successors, (61), 4 states have internal predecessors, (61), 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 61 [2024-11-19 09:17:13,890 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 09:17:13,894 INFO L225 Difference]: With dead ends: 1552 [2024-11-19 09:17:13,894 INFO L226 Difference]: Without dead ends: 1552 [2024-11-19 09:17:13,894 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 58 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-19 09:17:13,895 INFO L432 NwaCegarLoop]: 313 mSDtfsCounter, 1205 mSDsluCounter, 162 mSDsCounter, 0 mSdLazyCounter, 884 mSolverCounterSat, 41 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1208 SdHoareTripleChecker+Valid, 475 SdHoareTripleChecker+Invalid, 925 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 41 IncrementalHoareTripleChecker+Valid, 884 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2024-11-19 09:17:13,895 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1208 Valid, 475 Invalid, 925 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [41 Valid, 884 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2024-11-19 09:17:13,896 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1552 states. [2024-11-19 09:17:13,906 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1552 to 1059. [2024-11-19 09:17:13,907 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1059 states, 703 states have (on average 1.7780938833570412) internal successors, (1250), 1053 states have internal predecessors, (1250), 5 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-19 09:17:13,910 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1059 states to 1059 states and 1258 transitions. [2024-11-19 09:17:13,910 INFO L78 Accepts]: Start accepts. Automaton has 1059 states and 1258 transitions. Word has length 61 [2024-11-19 09:17:13,910 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 09:17:13,910 INFO L471 AbstractCegarLoop]: Abstraction has 1059 states and 1258 transitions. [2024-11-19 09:17:13,911 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 20.333333333333332) internal successors, (61), 4 states have internal predecessors, (61), 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 09:17:13,911 INFO L276 IsEmpty]: Start isEmpty. Operand 1059 states and 1258 transitions. [2024-11-19 09:17:13,911 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2024-11-19 09:17:13,911 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 09:17:13,912 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 09:17:13,922 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 09:17:14,112 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 09:17:14,113 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr76REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 520 more)] === [2024-11-19 09:17:14,113 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 09:17:14,114 INFO L85 PathProgramCache]: Analyzing trace with hash -1654454369, now seen corresponding path program 1 times [2024-11-19 09:17:14,114 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 09:17:14,114 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [602673106] [2024-11-19 09:17:14,115 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 09:17:14,115 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 09:17:14,115 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 09:17:14,118 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 09:17:14,119 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 09:17:14,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 09:17:14,375 INFO L255 TraceCheckSpWp]: Trace formula consists of 305 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-11-19 09:17:14,378 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 09:17:14,384 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 6 treesize of output 7 [2024-11-19 09:17:14,399 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 19 treesize of output 1 [2024-11-19 09:17:14,436 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2024-11-19 09:17:14,446 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 09:17:14,446 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 09:17:14,446 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 09:17:14,446 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [602673106] [2024-11-19 09:17:14,446 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [602673106] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 09:17:14,446 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 09:17:14,446 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-19 09:17:14,446 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1954683361] [2024-11-19 09:17:14,446 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 09:17:14,447 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-19 09:17:14,447 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 09:17:14,447 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-19 09:17:14,447 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-19 09:17:14,447 INFO L87 Difference]: Start difference. First operand 1059 states and 1258 transitions. Second operand has 5 states, 4 states have (on average 16.5) internal successors, (66), 5 states have internal predecessors, (66), 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 09:17:15,826 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 09:17:15,827 INFO L93 Difference]: Finished difference Result 1058 states and 1257 transitions. [2024-11-19 09:17:15,827 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-19 09:17:15,827 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 16.5) internal successors, (66), 5 states have internal predecessors, (66), 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 66 [2024-11-19 09:17:15,828 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 09:17:15,830 INFO L225 Difference]: With dead ends: 1058 [2024-11-19 09:17:15,830 INFO L226 Difference]: Without dead ends: 1058 [2024-11-19 09:17:15,830 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 62 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-19 09:17:15,831 INFO L432 NwaCegarLoop]: 878 mSDtfsCounter, 2 mSDsluCounter, 1378 mSDsCounter, 0 mSdLazyCounter, 1263 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 2256 SdHoareTripleChecker+Invalid, 1264 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 1263 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2024-11-19 09:17:15,831 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 2256 Invalid, 1264 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 1263 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2024-11-19 09:17:15,832 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1058 states. [2024-11-19 09:17:15,840 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1058 to 1058. [2024-11-19 09:17:15,842 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1058 states, 703 states have (on average 1.7766714082503556) internal successors, (1249), 1052 states have internal predecessors, (1249), 5 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-19 09:17:15,844 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1058 states to 1058 states and 1257 transitions. [2024-11-19 09:17:15,844 INFO L78 Accepts]: Start accepts. Automaton has 1058 states and 1257 transitions. Word has length 66 [2024-11-19 09:17:15,844 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 09:17:15,844 INFO L471 AbstractCegarLoop]: Abstraction has 1058 states and 1257 transitions. [2024-11-19 09:17:15,844 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 16.5) internal successors, (66), 5 states have internal predecessors, (66), 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 09:17:15,845 INFO L276 IsEmpty]: Start isEmpty. Operand 1058 states and 1257 transitions. [2024-11-19 09:17:15,845 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2024-11-19 09:17:15,845 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 09:17:15,845 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 09:17:15,854 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (15)] Ended with exit code 0 [2024-11-19 09:17:16,046 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-19 09:17:16,046 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr77REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 520 more)] === [2024-11-19 09:17:16,047 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 09:17:16,047 INFO L85 PathProgramCache]: Analyzing trace with hash -1654454368, now seen corresponding path program 1 times [2024-11-19 09:17:16,047 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 09:17:16,047 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [532088685] [2024-11-19 09:17:16,047 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 09:17:16,047 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 09:17:16,047 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 09:17:16,050 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-19 09:17:16,051 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (16)] Waiting until timeout for monitored process [2024-11-19 09:17:16,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 09:17:16,283 INFO L255 TraceCheckSpWp]: Trace formula consists of 305 conjuncts, 12 conjuncts are in the unsatisfiable core [2024-11-19 09:17:16,285 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 09:17:16,296 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 6 treesize of output 5 [2024-11-19 09:17:16,315 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 13 treesize of output 9 [2024-11-19 09:17:16,323 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 19 treesize of output 1 [2024-11-19 09:17:16,363 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 9 [2024-11-19 09:17:16,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 09:17:16,385 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 09:17:16,385 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 09:17:16,385 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [532088685] [2024-11-19 09:17:16,385 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [532088685] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 09:17:16,385 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 09:17:16,385 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-19 09:17:16,385 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [735944510] [2024-11-19 09:17:16,385 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 09:17:16,386 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-19 09:17:16,386 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 09:17:16,386 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-19 09:17:16,386 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-19 09:17:16,386 INFO L87 Difference]: Start difference. First operand 1058 states and 1257 transitions. Second operand has 5 states, 4 states have (on average 16.5) internal successors, (66), 5 states have internal predecessors, (66), 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 09:17:18,203 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 09:17:18,203 INFO L93 Difference]: Finished difference Result 1057 states and 1256 transitions. [2024-11-19 09:17:18,203 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-19 09:17:18,204 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 16.5) internal successors, (66), 5 states have internal predecessors, (66), 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 66 [2024-11-19 09:17:18,204 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 09:17:18,206 INFO L225 Difference]: With dead ends: 1057 [2024-11-19 09:17:18,206 INFO L226 Difference]: Without dead ends: 1057 [2024-11-19 09:17:18,206 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 62 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-19 09:17:18,207 INFO L432 NwaCegarLoop]: 878 mSDtfsCounter, 1 mSDsluCounter, 1416 mSDsCounter, 0 mSdLazyCounter, 1222 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 2294 SdHoareTripleChecker+Invalid, 1223 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 1222 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2024-11-19 09:17:18,207 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 2294 Invalid, 1223 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 1222 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2024-11-19 09:17:18,208 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1057 states. [2024-11-19 09:17:18,216 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1057 to 1057. [2024-11-19 09:17:18,217 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1057 states, 702 states have (on average 1.7777777777777777) internal successors, (1248), 1051 states have internal predecessors, (1248), 5 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-19 09:17:18,219 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1057 states to 1057 states and 1256 transitions. [2024-11-19 09:17:18,219 INFO L78 Accepts]: Start accepts. Automaton has 1057 states and 1256 transitions. Word has length 66 [2024-11-19 09:17:18,219 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 09:17:18,219 INFO L471 AbstractCegarLoop]: Abstraction has 1057 states and 1256 transitions. [2024-11-19 09:17:18,219 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 16.5) internal successors, (66), 5 states have internal predecessors, (66), 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 09:17:18,220 INFO L276 IsEmpty]: Start isEmpty. Operand 1057 states and 1256 transitions. [2024-11-19 09:17:18,220 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2024-11-19 09:17:18,220 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 09:17:18,221 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, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 09:17:18,229 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 (16)] Forceful destruction successful, exit code 0 [2024-11-19 09:17:18,421 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -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 09:17:18,421 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr80REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 520 more)] === [2024-11-19 09:17:18,422 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 09:17:18,422 INFO L85 PathProgramCache]: Analyzing trace with hash -439730522, now seen corresponding path program 1 times [2024-11-19 09:17:18,422 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 09:17:18,422 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1609740490] [2024-11-19 09:17:18,422 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 09:17:18,423 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 09:17:18,423 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 09:17:18,424 INFO L229 MonitoredProcess]: Starting monitored process 17 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 09:17:18,425 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 (17)] Waiting until timeout for monitored process [2024-11-19 09:17:18,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 09:17:18,664 INFO L255 TraceCheckSpWp]: Trace formula consists of 331 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-19 09:17:18,666 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 09:17:18,685 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 09:17:18,685 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 09:17:18,686 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 09:17:18,686 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1609740490] [2024-11-19 09:17:18,686 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1609740490] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 09:17:18,686 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 09:17:18,686 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-19 09:17:18,686 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [301695605] [2024-11-19 09:17:18,686 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 09:17:18,687 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-19 09:17:18,687 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 09:17:18,688 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-19 09:17:18,688 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-19 09:17:18,688 INFO L87 Difference]: Start difference. First operand 1057 states and 1256 transitions. Second operand has 4 states, 4 states have (on average 18.0) internal successors, (72), 4 states have internal predecessors, (72), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-19 09:17:18,726 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 09:17:18,726 INFO L93 Difference]: Finished difference Result 1060 states and 1260 transitions. [2024-11-19 09:17:18,727 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-19 09:17:18,727 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 18.0) internal successors, (72), 4 states have internal predecessors, (72), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 74 [2024-11-19 09:17:18,728 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 09:17:18,733 INFO L225 Difference]: With dead ends: 1060 [2024-11-19 09:17:18,733 INFO L226 Difference]: Without dead ends: 1060 [2024-11-19 09:17:18,733 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 71 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 09:17:18,734 INFO L432 NwaCegarLoop]: 878 mSDtfsCounter, 0 mSDsluCounter, 1751 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 2629 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-19 09:17:18,734 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 2629 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 09:17:18,735 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1060 states. [2024-11-19 09:17:18,748 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1060 to 1060. [2024-11-19 09:17:18,749 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1060 states, 704 states have (on average 1.7769886363636365) internal successors, (1251), 1054 states have internal predecessors, (1251), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2024-11-19 09:17:18,751 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1060 states to 1060 states and 1260 transitions. [2024-11-19 09:17:18,752 INFO L78 Accepts]: Start accepts. Automaton has 1060 states and 1260 transitions. Word has length 74 [2024-11-19 09:17:18,752 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 09:17:18,752 INFO L471 AbstractCegarLoop]: Abstraction has 1060 states and 1260 transitions. [2024-11-19 09:17:18,753 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 18.0) internal successors, (72), 4 states have internal predecessors, (72), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-19 09:17:18,753 INFO L276 IsEmpty]: Start isEmpty. Operand 1060 states and 1260 transitions. [2024-11-19 09:17:18,753 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2024-11-19 09:17:18,753 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 09:17:18,754 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, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 09:17:18,762 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 (17)] Ended with exit code 0 [2024-11-19 09:17:18,954 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -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 09:17:18,954 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr80REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 520 more)] === [2024-11-19 09:17:18,955 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 09:17:18,955 INFO L85 PathProgramCache]: Analyzing trace with hash 258431926, now seen corresponding path program 1 times [2024-11-19 09:17:18,955 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 09:17:18,955 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [970128326] [2024-11-19 09:17:18,955 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 09:17:18,956 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 09:17:18,956 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 09:17:18,959 INFO L229 MonitoredProcess]: Starting monitored process 18 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 09:17:18,960 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 (18)] Waiting until timeout for monitored process [2024-11-19 09:17:19,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 09:17:19,290 INFO L255 TraceCheckSpWp]: Trace formula consists of 342 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-19 09:17:19,292 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 09:17:19,315 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 09:17:19,315 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 09:17:19,385 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 09:17:19,385 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 09:17:19,385 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [970128326] [2024-11-19 09:17:19,386 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [970128326] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-19 09:17:19,386 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-19 09:17:19,386 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 8 [2024-11-19 09:17:19,386 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [402914496] [2024-11-19 09:17:19,386 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-19 09:17:19,387 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-19 09:17:19,387 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 09:17:19,388 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-19 09:17:19,388 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2024-11-19 09:17:19,388 INFO L87 Difference]: Start difference. First operand 1060 states and 1260 transitions. Second operand has 8 states, 8 states have (on average 9.625) internal successors, (77), 8 states have internal predecessors, (77), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-19 09:17:19,538 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 09:17:19,538 INFO L93 Difference]: Finished difference Result 1072 states and 1277 transitions. [2024-11-19 09:17:19,539 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-19 09:17:19,539 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 9.625) internal successors, (77), 8 states have internal predecessors, (77), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 75 [2024-11-19 09:17:19,539 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 09:17:19,543 INFO L225 Difference]: With dead ends: 1072 [2024-11-19 09:17:19,543 INFO L226 Difference]: Without dead ends: 1072 [2024-11-19 09:17:19,543 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 151 GetRequests, 142 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 09:17:19,544 INFO L432 NwaCegarLoop]: 878 mSDtfsCounter, 7 mSDsluCounter, 1753 mSDsCounter, 0 mSdLazyCounter, 50 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 2631 SdHoareTripleChecker+Invalid, 57 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 50 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-19 09:17:19,544 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 2631 Invalid, 57 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 50 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-19 09:17:19,546 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1072 states. [2024-11-19 09:17:19,556 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1072 to 1070. [2024-11-19 09:17:19,557 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1070 states, 713 states have (on average 1.7755960729312763) internal successors, (1266), 1063 states have internal predecessors, (1266), 5 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2024-11-19 09:17:19,559 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1070 states to 1070 states and 1275 transitions. [2024-11-19 09:17:19,560 INFO L78 Accepts]: Start accepts. Automaton has 1070 states and 1275 transitions. Word has length 75 [2024-11-19 09:17:19,560 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 09:17:19,560 INFO L471 AbstractCegarLoop]: Abstraction has 1070 states and 1275 transitions. [2024-11-19 09:17:19,560 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 9.625) internal successors, (77), 8 states have internal predecessors, (77), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-19 09:17:19,560 INFO L276 IsEmpty]: Start isEmpty. Operand 1070 states and 1275 transitions. [2024-11-19 09:17:19,561 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2024-11-19 09:17:19,561 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 09:17:19,561 INFO L215 NwaCegarLoop]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 09:17:19,572 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 (18)] Forceful destruction successful, exit code 0 [2024-11-19 09:17:19,765 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -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 09:17:19,766 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr80REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 520 more)] === [2024-11-19 09:17:19,767 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 09:17:19,767 INFO L85 PathProgramCache]: Analyzing trace with hash -223280474, now seen corresponding path program 2 times [2024-11-19 09:17:19,767 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 09:17:19,767 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [534668198] [2024-11-19 09:17:19,767 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-19 09:17:19,768 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 09:17:19,768 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 09:17:19,771 INFO L229 MonitoredProcess]: Starting monitored process 19 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 09:17:19,772 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (19)] Waiting until timeout for monitored process [2024-11-19 09:17:20,187 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-19 09:17:20,187 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-19 09:17:20,198 INFO L255 TraceCheckSpWp]: Trace formula consists of 375 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-11-19 09:17:20,200 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 09:17:20,240 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 09:17:20,240 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 09:17:20,360 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 09:17:20,360 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 09:17:20,360 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [534668198] [2024-11-19 09:17:20,360 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [534668198] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-19 09:17:20,360 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-19 09:17:20,360 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 14 [2024-11-19 09:17:20,360 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [840492464] [2024-11-19 09:17:20,361 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-19 09:17:20,361 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-11-19 09:17:20,361 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 09:17:20,362 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-11-19 09:17:20,362 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=121, Unknown=0, NotChecked=0, Total=182 [2024-11-19 09:17:20,362 INFO L87 Difference]: Start difference. First operand 1070 states and 1275 transitions. Second operand has 14 states, 14 states have (on average 5.928571428571429) internal successors, (83), 14 states have internal predecessors, (83), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-19 09:17:20,703 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 09:17:20,703 INFO L93 Difference]: Finished difference Result 1085 states and 1297 transitions. [2024-11-19 09:17:20,704 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2024-11-19 09:17:20,705 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 5.928571428571429) internal successors, (83), 14 states have internal predecessors, (83), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 78 [2024-11-19 09:17:20,705 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 09:17:20,708 INFO L225 Difference]: With dead ends: 1085 [2024-11-19 09:17:20,709 INFO L226 Difference]: Without dead ends: 1081 [2024-11-19 09:17:20,709 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 163 GetRequests, 142 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=182, Invalid=324, Unknown=0, NotChecked=0, Total=506 [2024-11-19 09:17:20,710 INFO L432 NwaCegarLoop]: 878 mSDtfsCounter, 14 mSDsluCounter, 4379 mSDsCounter, 0 mSdLazyCounter, 178 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 5257 SdHoareTripleChecker+Invalid, 196 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 178 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-19 09:17:20,710 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 5257 Invalid, 196 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 178 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-19 09:17:20,711 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1081 states. [2024-11-19 09:17:20,720 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1081 to 1079. [2024-11-19 09:17:20,721 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1079 states, 722 states have (on average 1.7700831024930748) internal successors, (1278), 1072 states have internal predecessors, (1278), 5 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2024-11-19 09:17:20,723 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1079 states to 1079 states and 1287 transitions. [2024-11-19 09:17:20,724 INFO L78 Accepts]: Start accepts. Automaton has 1079 states and 1287 transitions. Word has length 78 [2024-11-19 09:17:20,724 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 09:17:20,724 INFO L471 AbstractCegarLoop]: Abstraction has 1079 states and 1287 transitions. [2024-11-19 09:17:20,724 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 5.928571428571429) internal successors, (83), 14 states have internal predecessors, (83), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-19 09:17:20,724 INFO L276 IsEmpty]: Start isEmpty. Operand 1079 states and 1287 transitions. [2024-11-19 09:17:20,725 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2024-11-19 09:17:20,725 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 09:17:20,725 INFO L215 NwaCegarLoop]: trace histogram [10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 09:17:20,735 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 (19)] Ended with exit code 0 [2024-11-19 09:17:20,925 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -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 09:17:20,926 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr80REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 520 more)] === [2024-11-19 09:17:20,926 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 09:17:20,926 INFO L85 PathProgramCache]: Analyzing trace with hash 360147110, now seen corresponding path program 3 times [2024-11-19 09:17:20,927 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 09:17:20,927 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [652058443] [2024-11-19 09:17:20,927 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-19 09:17:20,927 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 09:17:20,927 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 09:17:20,928 INFO L229 MonitoredProcess]: Starting monitored process 20 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 09:17:20,929 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 (20)] Waiting until timeout for monitored process [2024-11-19 09:17:21,549 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2024-11-19 09:17:21,550 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-19 09:17:21,563 INFO L255 TraceCheckSpWp]: Trace formula consists of 441 conjuncts, 14 conjuncts are in the unsatisfiable core [2024-11-19 09:17:21,565 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 09:17:21,678 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 09:17:21,679 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 09:17:22,232 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 09:17:22,232 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 09:17:22,233 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [652058443] [2024-11-19 09:17:22,233 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [652058443] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-19 09:17:22,233 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-19 09:17:22,233 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 26 [2024-11-19 09:17:22,233 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1569640014] [2024-11-19 09:17:22,233 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-19 09:17:22,234 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2024-11-19 09:17:22,234 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 09:17:22,235 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2024-11-19 09:17:22,235 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=193, Invalid=457, Unknown=0, NotChecked=0, Total=650 [2024-11-19 09:17:22,235 INFO L87 Difference]: Start difference. First operand 1079 states and 1287 transitions. Second operand has 26 states, 26 states have (on average 3.6538461538461537) internal successors, (95), 26 states have internal predecessors, (95), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-19 09:17:23,771 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 09:17:23,771 INFO L93 Difference]: Finished difference Result 1103 states and 1326 transitions. [2024-11-19 09:17:23,772 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2024-11-19 09:17:23,772 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 26 states have (on average 3.6538461538461537) internal successors, (95), 26 states have internal predecessors, (95), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 84 [2024-11-19 09:17:23,772 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 09:17:23,776 INFO L225 Difference]: With dead ends: 1103 [2024-11-19 09:17:23,776 INFO L226 Difference]: Without dead ends: 1097 [2024-11-19 09:17:23,777 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 187 GetRequests, 142 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 09:17:23,778 INFO L432 NwaCegarLoop]: 879 mSDtfsCounter, 25 mSDsluCounter, 9638 mSDsCounter, 0 mSdLazyCounter, 588 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 10517 SdHoareTripleChecker+Invalid, 613 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 588 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-19 09:17:23,778 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [25 Valid, 10517 Invalid, 613 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 588 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-11-19 09:17:23,780 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1097 states. [2024-11-19 09:17:23,790 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1097 to 1097. [2024-11-19 09:17:23,792 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1097 states, 740 states have (on average 1.758108108108108) internal successors, (1301), 1090 states have internal predecessors, (1301), 5 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2024-11-19 09:17:23,793 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1097 states to 1097 states and 1310 transitions. [2024-11-19 09:17:23,794 INFO L78 Accepts]: Start accepts. Automaton has 1097 states and 1310 transitions. Word has length 84 [2024-11-19 09:17:23,794 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 09:17:23,794 INFO L471 AbstractCegarLoop]: Abstraction has 1097 states and 1310 transitions. [2024-11-19 09:17:23,794 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 26 states have (on average 3.6538461538461537) internal successors, (95), 26 states have internal predecessors, (95), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-19 09:17:23,794 INFO L276 IsEmpty]: Start isEmpty. Operand 1097 states and 1310 transitions. [2024-11-19 09:17:23,795 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2024-11-19 09:17:23,795 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 09:17:23,795 INFO L215 NwaCegarLoop]: trace histogram [22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 09:17:23,809 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 (20)] Ended with exit code 0 [2024-11-19 09:17:23,996 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 20 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -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 09:17:23,996 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr80REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 520 more)] === [2024-11-19 09:17:23,996 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 09:17:23,996 INFO L85 PathProgramCache]: Analyzing trace with hash -1514752858, now seen corresponding path program 4 times [2024-11-19 09:17:23,997 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 09:17:23,997 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1049240861] [2024-11-19 09:17:23,997 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2024-11-19 09:17:23,997 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 09:17:23,997 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 09:17:23,998 INFO L229 MonitoredProcess]: Starting monitored process 21 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 09:17:23,999 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (21)] Waiting until timeout for monitored process [2024-11-19 09:17:24,557 INFO L227 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2024-11-19 09:17:24,557 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-19 09:17:24,570 INFO L255 TraceCheckSpWp]: Trace formula consists of 573 conjuncts, 26 conjuncts are in the unsatisfiable core [2024-11-19 09:17:24,573 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 09:17:24,974 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 0 proven. 253 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 09:17:24,974 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 09:17:26,267 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 0 proven. 253 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 09:17:26,267 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 09:17:26,267 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1049240861] [2024-11-19 09:17:26,267 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1049240861] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-19 09:17:26,268 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-19 09:17:26,268 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 26] total 50 [2024-11-19 09:17:26,268 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1086067873] [2024-11-19 09:17:26,268 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-19 09:17:26,269 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 50 states [2024-11-19 09:17:26,269 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 09:17:26,270 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2024-11-19 09:17:26,270 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=672, Invalid=1778, Unknown=0, NotChecked=0, Total=2450 [2024-11-19 09:17:26,271 INFO L87 Difference]: Start difference. First operand 1097 states and 1310 transitions. Second operand has 50 states, 50 states have (on average 2.38) internal successors, (119), 50 states have internal predecessors, (119), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-19 09:17:31,160 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 09:17:31,160 INFO L93 Difference]: Finished difference Result 1137 states and 1382 transitions. [2024-11-19 09:17:31,161 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 71 states. [2024-11-19 09:17:31,161 INFO L78 Accepts]: Start accepts. Automaton has has 50 states, 50 states have (on average 2.38) internal successors, (119), 50 states have internal predecessors, (119), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 96 [2024-11-19 09:17:31,161 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 09:17:31,165 INFO L225 Difference]: With dead ends: 1137 [2024-11-19 09:17:31,165 INFO L226 Difference]: Without dead ends: 1133 [2024-11-19 09:17:31,167 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 233 GetRequests, 142 SyntacticMatches, 0 SemanticMatches, 91 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 465 ImplicationChecksByTransitivity, 4.3s TimeCoverageRelationStatistics Valid=2713, Invalid=5843, Unknown=0, NotChecked=0, Total=8556 [2024-11-19 09:17:31,167 INFO L432 NwaCegarLoop]: 879 mSDtfsCounter, 49 mSDsluCounter, 21001 mSDsCounter, 0 mSdLazyCounter, 2022 mSolverCounterSat, 59 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 49 SdHoareTripleChecker+Valid, 21880 SdHoareTripleChecker+Invalid, 2081 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 59 IncrementalHoareTripleChecker+Valid, 2022 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2024-11-19 09:17:31,168 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [49 Valid, 21880 Invalid, 2081 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [59 Valid, 2022 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2024-11-19 09:17:31,169 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1133 states. [2024-11-19 09:17:31,179 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1133 to 1131. [2024-11-19 09:17:31,181 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1131 states, 774 states have (on average 1.7403100775193798) internal successors, (1347), 1124 states have internal predecessors, (1347), 5 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2024-11-19 09:17:31,183 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1131 states to 1131 states and 1356 transitions. [2024-11-19 09:17:31,187 INFO L78 Accepts]: Start accepts. Automaton has 1131 states and 1356 transitions. Word has length 96 [2024-11-19 09:17:31,188 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 09:17:31,188 INFO L471 AbstractCegarLoop]: Abstraction has 1131 states and 1356 transitions. [2024-11-19 09:17:31,188 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 50 states, 50 states have (on average 2.38) internal successors, (119), 50 states have internal predecessors, (119), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-19 09:17:31,188 INFO L276 IsEmpty]: Start isEmpty. Operand 1131 states and 1356 transitions. [2024-11-19 09:17:31,189 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2024-11-19 09:17:31,189 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 09:17:31,189 INFO L215 NwaCegarLoop]: trace histogram [44, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 09:17:31,212 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 (21)] Ended with exit code 0 [2024-11-19 09:17:31,389 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -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 09:17:31,390 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr80REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 520 more)] === [2024-11-19 09:17:31,390 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 09:17:31,390 INFO L85 PathProgramCache]: Analyzing trace with hash 1229367974, now seen corresponding path program 5 times [2024-11-19 09:17:31,391 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 09:17:31,391 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [567983885] [2024-11-19 09:17:31,391 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2024-11-19 09:17:31,391 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 09:17:31,391 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 09:17:31,392 INFO L229 MonitoredProcess]: Starting monitored process 22 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 09:17:31,393 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 (22)] Waiting until timeout for monitored process [2024-11-19 09:17:32,545 INFO L227 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 23 check-sat command(s) [2024-11-19 09:17:32,545 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-19 09:17:32,567 INFO L255 TraceCheckSpWp]: Trace formula consists of 815 conjuncts, 59 conjuncts are in the unsatisfiable core [2024-11-19 09:17:32,574 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 09:17:32,582 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 6 treesize of output 7 [2024-11-19 09:17:32,677 INFO L349 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2024-11-19 09:17:32,677 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 27 [2024-11-19 09:17:32,701 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2024-11-19 09:17:32,771 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 12 [2024-11-19 09:17:33,743 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-19 09:17:33,743 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 44 treesize of output 43 [2024-11-19 09:17:33,795 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 15 [2024-11-19 09:17:33,830 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 44 refuted. 0 times theorem prover too weak. 946 trivial. 0 not checked. [2024-11-19 09:17:33,831 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 09:17:34,250 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 09:17:34,251 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [567983885] [2024-11-19 09:17:34,251 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [567983885] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 09:17:34,251 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [321671916] [2024-11-19 09:17:34,251 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2024-11-19 09:17:34,251 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-11-19 09:17:34,251 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2024-11-19 09:17:34,254 INFO L229 MonitoredProcess]: Starting monitored process 23 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-11-19 09:17:34,256 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (23)] Waiting until timeout for monitored process