./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/uthash-2.0.2/uthash_JEN_test4-2.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_JEN_test4-2.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 2c8bfc4504f1d1d767281638f115bf6ca8337de4769381189ae1d6a9b301298b --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-assert-order-craig-3061b6d-m [2024-11-19 09:05:40,832 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-19 09:05:40,892 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2024-11-19 09:05:40,897 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-19 09:05:40,898 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-19 09:05:40,917 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-19 09:05:40,918 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-19 09:05:40,918 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-19 09:05:40,918 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-19 09:05:40,919 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-19 09:05:40,919 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-19 09:05:40,919 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-19 09:05:40,920 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-19 09:05:40,921 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-19 09:05:40,922 INFO L153 SettingsManager]: * Use SBE=true [2024-11-19 09:05:40,922 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-19 09:05:40,922 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-19 09:05:40,922 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-19 09:05:40,923 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-19 09:05:40,923 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-19 09:05:40,923 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-11-19 09:05:40,926 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-11-19 09:05:40,926 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-11-19 09:05:40,926 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-19 09:05:40,926 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-19 09:05:40,927 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-19 09:05:40,927 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-19 09:05:40,927 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-19 09:05:40,927 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-19 09:05:40,927 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-19 09:05:40,927 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-19 09:05:40,928 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-19 09:05:40,928 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-19 09:05:40,928 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-19 09:05:40,928 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-19 09:05:40,928 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-19 09:05:40,928 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-19 09:05:40,929 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-19 09:05:40,929 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-19 09:05:40,929 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-19 09:05:40,929 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-19 09:05:40,930 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-19 09:05:40,930 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 -> 2c8bfc4504f1d1d767281638f115bf6ca8337de4769381189ae1d6a9b301298b [2024-11-19 09:05:41,140 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-19 09:05:41,159 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-19 09:05:41,161 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-19 09:05:41,162 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-19 09:05:41,163 INFO L274 PluginConnector]: CDTParser initialized [2024-11-19 09:05:41,163 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/uthash-2.0.2/uthash_JEN_test4-2.i [2024-11-19 09:05:42,348 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-19 09:05:42,593 INFO L384 CDTParser]: Found 1 translation units. [2024-11-19 09:05:42,594 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_JEN_test4-2.i [2024-11-19 09:05:42,613 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/258fbd78c/5b27cc00e1584e5b9857b83ecc6744dc/FLAG87226f545 [2024-11-19 09:05:42,628 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/258fbd78c/5b27cc00e1584e5b9857b83ecc6744dc [2024-11-19 09:05:42,630 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-19 09:05:42,632 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-19 09:05:42,633 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-19 09:05:42,634 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-19 09:05:42,641 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-19 09:05:42,641 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 09:05:42" (1/1) ... [2024-11-19 09:05:42,642 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5c7d07c3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:05:42, skipping insertion in model container [2024-11-19 09:05:42,642 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 09:05:42" (1/1) ... [2024-11-19 09:05:42,689 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-19 09:05:43,006 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:05:43,038 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:05:43,041 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:05:43,043 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:05:43,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:05:43,074 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:05:43,076 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:05:43,081 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:05:43,085 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:05:43,097 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:05:43,098 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:05:43,099 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:05:43,101 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:05:43,101 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:05:43,102 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:05:43,106 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:05:43,118 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-19 09:05:43,126 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:05:43,127 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver@6bf74c80 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:05:43, skipping insertion in model container [2024-11-19 09:05:43,127 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-19 09:05:43,127 INFO L186 ToolchainWalker]: Toolchain execution was canceled (user or tool) before executing de.uni_freiburg.informatik.ultimate.boogie.procedureinliner [2024-11-19 09:05:43,128 INFO L158 Benchmark]: Toolchain (without parser) took 495.88ms. Allocated memory is still 159.4MB. Free memory was 84.2MB in the beginning and 59.3MB in the end (delta: 24.9MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2024-11-19 09:05:43,129 INFO L158 Benchmark]: CDTParser took 0.14ms. Allocated memory is still 159.4MB. Free memory is still 109.8MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-19 09:05:43,129 INFO L158 Benchmark]: CACSL2BoogieTranslator took 493.46ms. Allocated memory is still 159.4MB. Free memory was 84.0MB in the beginning and 59.6MB in the end (delta: 24.4MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2024-11-19 09:05:43,130 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.14ms. Allocated memory is still 159.4MB. Free memory is still 109.8MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 493.46ms. Allocated memory is still 159.4MB. Free memory was 84.0MB in the beginning and 59.6MB in the end (delta: 24.4MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - UnsupportedSyntaxResult [Line: 766]: Unsupported Syntax Found a cast between two array/pointer types of different sizes while using memory model HoenickeLindenmann_Original (while Not using bitvector translation) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/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_JEN_test4-2.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 2c8bfc4504f1d1d767281638f115bf6ca8337de4769381189ae1d6a9b301298b --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-assert-order-craig-3061b6d-m [2024-11-19 09:05:44,757 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-19 09:05:44,815 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf [2024-11-19 09:05:44,818 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-19 09:05:44,818 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-19 09:05:44,839 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-19 09:05:44,843 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-19 09:05:44,843 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-19 09:05:44,843 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-19 09:05:44,844 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-19 09:05:44,844 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-19 09:05:44,844 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-19 09:05:44,845 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-19 09:05:44,845 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-19 09:05:44,845 INFO L153 SettingsManager]: * Use SBE=true [2024-11-19 09:05:44,845 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-19 09:05:44,845 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-19 09:05:44,846 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-19 09:05:44,846 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-19 09:05:44,848 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-19 09:05:44,850 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-11-19 09:05:44,850 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-11-19 09:05:44,850 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-11-19 09:05:44,850 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-19 09:05:44,850 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-19 09:05:44,851 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-19 09:05:44,851 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-19 09:05:44,851 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-19 09:05:44,851 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-19 09:05:44,852 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-19 09:05:44,852 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-19 09:05:44,852 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-19 09:05:44,853 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-19 09:05:44,853 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-19 09:05:44,853 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-19 09:05:44,854 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-19 09:05:44,854 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-19 09:05:44,854 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-19 09:05:44,855 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-19 09:05:44,855 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-19 09:05:44,855 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-19 09:05:44,855 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-19 09:05:44,855 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-19 09:05:44,855 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-19 09:05:44,855 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 -> 2c8bfc4504f1d1d767281638f115bf6ca8337de4769381189ae1d6a9b301298b [2024-11-19 09:05:45,107 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-19 09:05:45,127 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-19 09:05:45,129 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-19 09:05:45,130 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-19 09:05:45,130 INFO L274 PluginConnector]: CDTParser initialized [2024-11-19 09:05:45,131 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/uthash-2.0.2/uthash_JEN_test4-2.i [2024-11-19 09:05:46,440 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-19 09:05:46,689 INFO L384 CDTParser]: Found 1 translation units. [2024-11-19 09:05:46,690 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_JEN_test4-2.i [2024-11-19 09:05:46,709 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/404af63f3/7689e72c77614e29bc9a7b7af751bd1b/FLAG82d0dcdf4 [2024-11-19 09:05:46,999 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/404af63f3/7689e72c77614e29bc9a7b7af751bd1b [2024-11-19 09:05:47,001 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-19 09:05:47,002 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-19 09:05:47,002 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-19 09:05:47,003 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-19 09:05:47,006 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-19 09:05:47,007 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 09:05:47" (1/1) ... [2024-11-19 09:05:47,009 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@700e105e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:05:47, skipping insertion in model container [2024-11-19 09:05:47,009 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 09:05:47" (1/1) ... [2024-11-19 09:05:47,055 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-19 09:05:47,410 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:05:47,441 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:05:47,446 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:05:47,459 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:05:47,464 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:05:47,482 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:05:47,484 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:05:47,487 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:05:47,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:05:47,497 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:05:47,497 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:05:47,498 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:05:47,499 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:05:47,500 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:05:47,500 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:05:47,503 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:05:47,508 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-19 09:05:47,516 INFO L197 MainTranslator]: Restarting translation with changed settings: SettingsChange [mNewPreferredMemoryModel=HoenickeLindenmann_1ByteResolution] [2024-11-19 09:05:47,533 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-19 09:05:47,559 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:05:47,569 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:05:47,570 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:05:47,572 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:05:47,574 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:05:47,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:05:47,589 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:05:47,591 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:05:47,596 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-19 09:05:47,605 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:05:47,605 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:05:47,606 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:05:47,607 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:05:47,607 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:05:47,608 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:05:47,610 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:05:47,612 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-19 09:05:47,615 INFO L200 MainTranslator]: Completed pre-run [2024-11-19 09:05:47,663 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-19 09:05:47,709 INFO L204 MainTranslator]: Completed translation [2024-11-19 09:05:47,709 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:05:47 WrapperNode [2024-11-19 09:05:47,710 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-19 09:05:47,710 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-19 09:05:47,710 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-19 09:05:47,711 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-19 09:05:47,715 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:05:47" (1/1) ... [2024-11-19 09:05:47,748 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:05:47" (1/1) ... [2024-11-19 09:05:47,792 INFO L138 Inliner]: procedures = 179, calls = 387, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 1351 [2024-11-19 09:05:47,793 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-19 09:05:47,794 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-19 09:05:47,794 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-19 09:05:47,794 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-19 09:05:47,802 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:05:47" (1/1) ... [2024-11-19 09:05:47,803 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:05:47" (1/1) ... [2024-11-19 09:05:47,814 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:05:47" (1/1) ... [2024-11-19 09:05:47,903 INFO L175 MemorySlicer]: Split 357 memory accesses to 2 slices as follows [2, 355]. 99 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0]. The 90 writes are split as follows [0, 90]. [2024-11-19 09:05:47,906 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:05:47" (1/1) ... [2024-11-19 09:05:47,906 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:05:47" (1/1) ... [2024-11-19 09:05:47,944 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:05:47" (1/1) ... [2024-11-19 09:05:47,951 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:05:47" (1/1) ... [2024-11-19 09:05:47,955 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:05:47" (1/1) ... [2024-11-19 09:05:47,958 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:05:47" (1/1) ... [2024-11-19 09:05:47,965 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-19 09:05:47,966 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-19 09:05:47,966 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-19 09:05:47,966 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-19 09:05:47,967 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:05:47" (1/1) ... [2024-11-19 09:05:47,974 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-19 09:05:47,985 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 09:05:47,999 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:05:48,006 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:05:48,041 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#0 [2024-11-19 09:05:48,041 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#1 [2024-11-19 09:05:48,041 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#0 [2024-11-19 09:05:48,041 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#1 [2024-11-19 09:05:48,042 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2024-11-19 09:05:48,042 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2024-11-19 09:05:48,042 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#0 [2024-11-19 09:05:48,042 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#1 [2024-11-19 09:05:48,042 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#0 [2024-11-19 09:05:48,042 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#1 [2024-11-19 09:05:48,042 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-11-19 09:05:48,042 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-19 09:05:48,042 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2024-11-19 09:05:48,043 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2024-11-19 09:05:48,043 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2024-11-19 09:05:48,043 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2024-11-19 09:05:48,043 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-19 09:05:48,043 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#0 [2024-11-19 09:05:48,043 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#1 [2024-11-19 09:05:48,043 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-19 09:05:48,043 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2024-11-19 09:05:48,044 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-19 09:05:48,044 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-19 09:05:48,243 INFO L238 CfgBuilder]: Building ICFG [2024-11-19 09:05:48,244 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-19 09:05:48,247 WARN L781 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2024-11-19 09:05:48,288 WARN L781 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2024-11-19 09:05:51,500 INFO L? ?]: Removed 1547 outVars from TransFormulas that were not future-live. [2024-11-19 09:05:51,501 INFO L287 CfgBuilder]: Performing block encoding [2024-11-19 09:05:51,524 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-19 09:05:51,524 INFO L316 CfgBuilder]: Removed 69 assume(true) statements. [2024-11-19 09:05:51,525 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 09:05:51 BoogieIcfgContainer [2024-11-19 09:05:51,525 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-19 09:05:51,526 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-19 09:05:51,526 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-19 09:05:51,531 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-19 09:05:51,531 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.11 09:05:47" (1/3) ... [2024-11-19 09:05:51,531 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1a919a3b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 09:05:51, skipping insertion in model container [2024-11-19 09:05:51,532 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:05:47" (2/3) ... [2024-11-19 09:05:51,532 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1a919a3b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 09:05:51, skipping insertion in model container [2024-11-19 09:05:51,532 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 09:05:51" (3/3) ... [2024-11-19 09:05:51,533 INFO L112 eAbstractionObserver]: Analyzing ICFG uthash_JEN_test4-2.i [2024-11-19 09:05:51,550 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-19 09:05:51,550 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 733 error locations. [2024-11-19 09:05:51,602 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-19 09:05:51,607 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;@60b409f9, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-19 09:05:51,607 INFO L334 AbstractCegarLoop]: Starting to check reachability of 733 error locations. [2024-11-19 09:05:51,614 INFO L276 IsEmpty]: Start isEmpty. Operand has 1451 states, 705 states have (on average 2.2411347517730498) internal successors, (1580), 1442 states have internal predecessors, (1580), 16 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 7 states have call predecessors, (16), 16 states have call successors, (16) [2024-11-19 09:05:51,618 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2024-11-19 09:05:51,618 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 09:05:51,618 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2024-11-19 09:05:51,619 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 730 more)] === [2024-11-19 09:05:51,623 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 09:05:51,623 INFO L85 PathProgramCache]: Analyzing trace with hash 45876316, now seen corresponding path program 1 times [2024-11-19 09:05:51,632 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 09:05:51,633 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2025370767] [2024-11-19 09:05:51,633 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 09:05:51,633 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:05:51,633 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 09:05:51,635 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:05:51,655 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:05:51,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 09:05:51,792 INFO L255 TraceCheckSpWp]: Trace formula consists of 29 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-19 09:05:51,797 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 09:05:51,828 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:05:51,840 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:05:51,840 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 09:05:51,841 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 09:05:51,841 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2025370767] [2024-11-19 09:05:51,841 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2025370767] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 09:05:51,842 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 09:05:51,842 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-19 09:05:51,843 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1789031493] [2024-11-19 09:05:51,845 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 09:05:51,847 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 09:05:51,848 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 09:05:51,887 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 09:05:51,888 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 09:05:51,892 INFO L87 Difference]: Start difference. First operand has 1451 states, 705 states have (on average 2.2411347517730498) internal successors, (1580), 1442 states have internal predecessors, (1580), 16 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 7 states have call predecessors, (16), 16 states have call successors, (16) Second operand has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 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:05:53,539 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 09:05:53,540 INFO L93 Difference]: Finished difference Result 1340 states and 1424 transitions. [2024-11-19 09:05:53,541 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 09:05:53,542 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 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 5 [2024-11-19 09:05:53,542 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 09:05:53,557 INFO L225 Difference]: With dead ends: 1340 [2024-11-19 09:05:53,558 INFO L226 Difference]: Without dead ends: 1338 [2024-11-19 09:05:53,559 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 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:05:53,563 INFO L432 NwaCegarLoop]: 810 mSDtfsCounter, 1042 mSDsluCounter, 116 mSDsCounter, 0 mSdLazyCounter, 852 mSolverCounterSat, 102 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1058 SdHoareTripleChecker+Valid, 926 SdHoareTripleChecker+Invalid, 954 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 102 IncrementalHoareTripleChecker+Valid, 852 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2024-11-19 09:05:53,563 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1058 Valid, 926 Invalid, 954 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [102 Valid, 852 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2024-11-19 09:05:53,578 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1338 states. [2024-11-19 09:05:53,618 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1338 to 1336. [2024-11-19 09:05:53,620 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1336 states, 695 states have (on average 1.9956834532374101) internal successors, (1387), 1327 states have internal predecessors, (1387), 16 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 7 states have call predecessors, (16), 16 states have call successors, (16) [2024-11-19 09:05:53,623 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1336 states to 1336 states and 1419 transitions. [2024-11-19 09:05:53,627 INFO L78 Accepts]: Start accepts. Automaton has 1336 states and 1419 transitions. Word has length 5 [2024-11-19 09:05:53,628 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 09:05:53,628 INFO L471 AbstractCegarLoop]: Abstraction has 1336 states and 1419 transitions. [2024-11-19 09:05:53,628 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 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:05:53,628 INFO L276 IsEmpty]: Start isEmpty. Operand 1336 states and 1419 transitions. [2024-11-19 09:05:53,628 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2024-11-19 09:05:53,628 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 09:05:53,628 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2024-11-19 09:05:53,641 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:05:53,829 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:05:53,829 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 730 more)] === [2024-11-19 09:05:53,830 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 09:05:53,830 INFO L85 PathProgramCache]: Analyzing trace with hash 45876317, now seen corresponding path program 1 times [2024-11-19 09:05:53,831 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 09:05:53,831 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [587980604] [2024-11-19 09:05:53,831 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 09:05:53,831 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:05:53,831 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 09:05:53,834 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:05:53,835 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:05:53,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 09:05:53,933 INFO L255 TraceCheckSpWp]: Trace formula consists of 29 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-19 09:05:53,934 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 09:05:53,947 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:05:53,960 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:05:53,960 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 09:05:53,961 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 09:05:53,961 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [587980604] [2024-11-19 09:05:53,961 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [587980604] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 09:05:53,961 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 09:05:53,961 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-19 09:05:53,962 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [831654708] [2024-11-19 09:05:53,962 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 09:05:53,965 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 09:05:53,966 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 09:05:53,966 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 09:05:53,967 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 09:05:53,967 INFO L87 Difference]: Start difference. First operand 1336 states and 1419 transitions. Second operand has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 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:05:55,963 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 09:05:55,963 INFO L93 Difference]: Finished difference Result 1656 states and 1759 transitions. [2024-11-19 09:05:55,963 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 09:05:55,964 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 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 5 [2024-11-19 09:05:55,964 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 09:05:55,969 INFO L225 Difference]: With dead ends: 1656 [2024-11-19 09:05:55,969 INFO L226 Difference]: Without dead ends: 1656 [2024-11-19 09:05:55,969 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 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:05:55,970 INFO L432 NwaCegarLoop]: 1174 mSDtfsCounter, 522 mSDsluCounter, 586 mSDsCounter, 0 mSdLazyCounter, 883 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 522 SdHoareTripleChecker+Valid, 1760 SdHoareTripleChecker+Invalid, 908 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 883 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2024-11-19 09:05:55,971 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [522 Valid, 1760 Invalid, 908 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 883 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2024-11-19 09:05:55,975 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1656 states. [2024-11-19 09:05:55,998 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1656 to 1503. [2024-11-19 09:05:55,999 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1503 states, 872 states have (on average 1.9575688073394495) internal successors, (1707), 1494 states have internal predecessors, (1707), 16 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 7 states have call predecessors, (16), 16 states have call successors, (16) [2024-11-19 09:05:56,004 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1503 states to 1503 states and 1739 transitions. [2024-11-19 09:05:56,005 INFO L78 Accepts]: Start accepts. Automaton has 1503 states and 1739 transitions. Word has length 5 [2024-11-19 09:05:56,005 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 09:05:56,005 INFO L471 AbstractCegarLoop]: Abstraction has 1503 states and 1739 transitions. [2024-11-19 09:05:56,005 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 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:05:56,005 INFO L276 IsEmpty]: Start isEmpty. Operand 1503 states and 1739 transitions. [2024-11-19 09:05:56,006 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2024-11-19 09:05:56,006 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 09:05:56,006 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2024-11-19 09:05:56,009 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:05:56,208 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:05:56,209 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr620REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 730 more)] === [2024-11-19 09:05:56,209 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 09:05:56,209 INFO L85 PathProgramCache]: Analyzing trace with hash 1423825295, now seen corresponding path program 1 times [2024-11-19 09:05:56,209 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 09:05:56,210 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [856759695] [2024-11-19 09:05:56,210 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 09:05:56,210 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:05:56,210 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 09:05:56,216 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:05:56,217 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:05:56,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 09:05:56,313 INFO L255 TraceCheckSpWp]: Trace formula consists of 23 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-19 09:05:56,314 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 09:05:56,321 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:05:56,321 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 09:05:56,322 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 09:05:56,322 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [856759695] [2024-11-19 09:05:56,322 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [856759695] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 09:05:56,322 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 09:05:56,322 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-19 09:05:56,323 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [524098947] [2024-11-19 09:05:56,323 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 09:05:56,323 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 09:05:56,323 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 09:05:56,324 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 09:05:56,324 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 09:05:56,324 INFO L87 Difference]: Start difference. First operand 1503 states and 1739 transitions. Second operand has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 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:05:56,401 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 09:05:56,401 INFO L93 Difference]: Finished difference Result 2755 states and 3196 transitions. [2024-11-19 09:05:56,404 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 09:05:56,404 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 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 6 [2024-11-19 09:05:56,406 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 09:05:56,413 INFO L225 Difference]: With dead ends: 2755 [2024-11-19 09:05:56,413 INFO L226 Difference]: Without dead ends: 2755 [2024-11-19 09:05:56,413 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 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:05:56,415 INFO L432 NwaCegarLoop]: 1892 mSDtfsCounter, 1114 mSDsluCounter, 1404 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1120 SdHoareTripleChecker+Valid, 3296 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-19 09:05:56,415 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1120 Valid, 3296 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-19 09:05:56,419 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2755 states. [2024-11-19 09:05:56,462 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2755 to 1504. [2024-11-19 09:05:56,463 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1504 states, 873 states have (on average 1.956471935853379) internal successors, (1708), 1495 states have internal predecessors, (1708), 16 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 7 states have call predecessors, (16), 16 states have call successors, (16) [2024-11-19 09:05:56,467 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1504 states to 1504 states and 1740 transitions. [2024-11-19 09:05:56,467 INFO L78 Accepts]: Start accepts. Automaton has 1504 states and 1740 transitions. Word has length 6 [2024-11-19 09:05:56,467 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 09:05:56,468 INFO L471 AbstractCegarLoop]: Abstraction has 1504 states and 1740 transitions. [2024-11-19 09:05:56,468 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 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:05:56,468 INFO L276 IsEmpty]: Start isEmpty. Operand 1504 states and 1740 transitions. [2024-11-19 09:05:56,468 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2024-11-19 09:05:56,468 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 09:05:56,469 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 09:05:56,471 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Forceful destruction successful, exit code 0 [2024-11-19 09:05:56,669 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:05:56,670 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 730 more)] === [2024-11-19 09:05:56,670 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 09:05:56,670 INFO L85 PathProgramCache]: Analyzing trace with hash -1344610650, now seen corresponding path program 1 times [2024-11-19 09:05:56,671 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 09:05:56,671 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [613337397] [2024-11-19 09:05:56,671 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 09:05:56,671 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:05:56,671 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 09:05:56,675 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:05:56,676 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2024-11-19 09:05:56,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 09:05:56,800 INFO L255 TraceCheckSpWp]: Trace formula consists of 82 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-19 09:05:56,801 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 09:05:56,810 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:05:56,810 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 09:05:56,810 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 09:05:56,810 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [613337397] [2024-11-19 09:05:56,810 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [613337397] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 09:05:56,810 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 09:05:56,811 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-19 09:05:56,811 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [92238722] [2024-11-19 09:05:56,811 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 09:05:56,811 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 09:05:56,811 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 09:05:56,811 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 09:05:56,811 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 09:05:56,812 INFO L87 Difference]: Start difference. First operand 1504 states and 1740 transitions. Second operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 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:05:56,846 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 09:05:56,846 INFO L93 Difference]: Finished difference Result 1462 states and 1697 transitions. [2024-11-19 09:05:56,847 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 09:05:56,847 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 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 11 [2024-11-19 09:05:56,847 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 09:05:56,851 INFO L225 Difference]: With dead ends: 1462 [2024-11-19 09:05:56,851 INFO L226 Difference]: Without dead ends: 1462 [2024-11-19 09:05:56,852 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 9 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:05:56,852 INFO L432 NwaCegarLoop]: 1354 mSDtfsCounter, 71 mSDsluCounter, 1291 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 71 SdHoareTripleChecker+Valid, 2645 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:05:56,853 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [71 Valid, 2645 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 09:05:56,855 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1462 states. [2024-11-19 09:05:56,866 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1462 to 1462. [2024-11-19 09:05:56,867 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1462 states, 855 states have (on average 1.9473684210526316) internal successors, (1665), 1453 states have internal predecessors, (1665), 16 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 7 states have call predecessors, (16), 16 states have call successors, (16) [2024-11-19 09:05:56,870 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1462 states to 1462 states and 1697 transitions. [2024-11-19 09:05:56,870 INFO L78 Accepts]: Start accepts. Automaton has 1462 states and 1697 transitions. Word has length 11 [2024-11-19 09:05:56,870 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 09:05:56,871 INFO L471 AbstractCegarLoop]: Abstraction has 1462 states and 1697 transitions. [2024-11-19 09:05:56,871 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 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:05:56,871 INFO L276 IsEmpty]: Start isEmpty. Operand 1462 states and 1697 transitions. [2024-11-19 09:05:56,871 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2024-11-19 09:05:56,871 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 09:05:56,871 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 09:05:56,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 (5)] Ended with exit code 0 [2024-11-19 09:05:57,072 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:05:57,072 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr28REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 730 more)] === [2024-11-19 09:05:57,073 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 09:05:57,073 INFO L85 PathProgramCache]: Analyzing trace with hash 614317568, now seen corresponding path program 1 times [2024-11-19 09:05:57,073 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 09:05:57,073 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [264983808] [2024-11-19 09:05:57,073 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 09:05:57,073 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:05:57,073 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 09:05:57,076 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:05:57,077 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:05:57,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 09:05:57,186 INFO L255 TraceCheckSpWp]: Trace formula consists of 85 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-19 09:05:57,187 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 09:05:57,213 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:05:57,213 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 09:05:57,214 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 09:05:57,214 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [264983808] [2024-11-19 09:05:57,214 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [264983808] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 09:05:57,214 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 09:05:57,214 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-19 09:05:57,214 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [63702211] [2024-11-19 09:05:57,214 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 09:05:57,215 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-19 09:05:57,215 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 09:05:57,215 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-19 09:05:57,215 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-19 09:05:57,215 INFO L87 Difference]: Start difference. First operand 1462 states and 1697 transitions. Second operand has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 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:05:57,280 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 09:05:57,280 INFO L93 Difference]: Finished difference Result 1440 states and 1668 transitions. [2024-11-19 09:05:57,281 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-19 09:05:57,281 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 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 13 [2024-11-19 09:05:57,281 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 09:05:57,285 INFO L225 Difference]: With dead ends: 1440 [2024-11-19 09:05:57,285 INFO L226 Difference]: Without dead ends: 1440 [2024-11-19 09:05:57,285 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 10 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:05:57,286 INFO L432 NwaCegarLoop]: 1309 mSDtfsCounter, 48 mSDsluCounter, 2592 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 48 SdHoareTripleChecker+Valid, 3901 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:05:57,287 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [48 Valid, 3901 Invalid, 59 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 09:05:57,289 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1440 states. [2024-11-19 09:05:57,302 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1440 to 1440. [2024-11-19 09:05:57,304 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1440 states, 847 states have (on average 1.9315230224321134) internal successors, (1636), 1431 states have internal predecessors, (1636), 16 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 7 states have call predecessors, (16), 16 states have call successors, (16) [2024-11-19 09:05:57,307 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1440 states to 1440 states and 1668 transitions. [2024-11-19 09:05:57,307 INFO L78 Accepts]: Start accepts. Automaton has 1440 states and 1668 transitions. Word has length 13 [2024-11-19 09:05:57,307 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 09:05:57,307 INFO L471 AbstractCegarLoop]: Abstraction has 1440 states and 1668 transitions. [2024-11-19 09:05:57,308 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 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:05:57,308 INFO L276 IsEmpty]: Start isEmpty. Operand 1440 states and 1668 transitions. [2024-11-19 09:05:57,310 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2024-11-19 09:05:57,311 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 09:05:57,311 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] [2024-11-19 09:05:57,315 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:05:57,514 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:05:57,515 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr42REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 730 more)] === [2024-11-19 09:05:57,515 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 09:05:57,515 INFO L85 PathProgramCache]: Analyzing trace with hash -957630610, now seen corresponding path program 1 times [2024-11-19 09:05:57,515 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 09:05:57,515 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1212019845] [2024-11-19 09:05:57,516 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 09:05:57,516 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:05:57,516 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 09:05:57,517 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:05:57,517 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:05:57,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 09:05:57,648 INFO L255 TraceCheckSpWp]: Trace formula consists of 99 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-19 09:05:57,650 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 09:05:57,654 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:05:57,718 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:05:57,718 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 09:05:57,718 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 09:05:57,718 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1212019845] [2024-11-19 09:05:57,718 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1212019845] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 09:05:57,718 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 09:05:57,718 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-19 09:05:57,718 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1422671468] [2024-11-19 09:05:57,718 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 09:05:57,719 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-19 09:05:57,719 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 09:05:57,719 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-19 09:05:57,719 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-19 09:05:57,719 INFO L87 Difference]: Start difference. First operand 1440 states and 1668 transitions. Second operand has 4 states, 3 states have (on average 9.0) internal successors, (27), 4 states have internal predecessors, (27), 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:05:59,611 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 09:05:59,611 INFO L93 Difference]: Finished difference Result 1440 states and 1668 transitions. [2024-11-19 09:05:59,611 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-19 09:05:59,611 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 9.0) internal successors, (27), 4 states have internal predecessors, (27), 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 27 [2024-11-19 09:05:59,612 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 09:05:59,616 INFO L225 Difference]: With dead ends: 1440 [2024-11-19 09:05:59,616 INFO L226 Difference]: Without dead ends: 1440 [2024-11-19 09:05:59,617 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 24 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:05:59,618 INFO L432 NwaCegarLoop]: 762 mSDtfsCounter, 979 mSDsluCounter, 700 mSDsCounter, 0 mSdLazyCounter, 1500 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 995 SdHoareTripleChecker+Valid, 1462 SdHoareTripleChecker+Invalid, 1512 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 1500 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2024-11-19 09:05:59,618 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [995 Valid, 1462 Invalid, 1512 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 1500 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2024-11-19 09:05:59,621 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1440 states. [2024-11-19 09:05:59,636 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1440 to 1436. [2024-11-19 09:05:59,637 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1436 states, 847 states have (on average 1.9268004722550176) internal successors, (1632), 1427 states have internal predecessors, (1632), 16 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 7 states have call predecessors, (16), 16 states have call successors, (16) [2024-11-19 09:05:59,640 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1436 states to 1436 states and 1664 transitions. [2024-11-19 09:05:59,641 INFO L78 Accepts]: Start accepts. Automaton has 1436 states and 1664 transitions. Word has length 27 [2024-11-19 09:05:59,641 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 09:05:59,641 INFO L471 AbstractCegarLoop]: Abstraction has 1436 states and 1664 transitions. [2024-11-19 09:05:59,641 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 9.0) internal successors, (27), 4 states have internal predecessors, (27), 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:05:59,641 INFO L276 IsEmpty]: Start isEmpty. Operand 1436 states and 1664 transitions. [2024-11-19 09:05:59,642 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2024-11-19 09:05:59,642 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 09:05:59,642 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] [2024-11-19 09:05:59,646 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:05:59,842 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:05:59,843 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr43REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 730 more)] === [2024-11-19 09:05:59,844 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 09:05:59,844 INFO L85 PathProgramCache]: Analyzing trace with hash -957630609, now seen corresponding path program 1 times [2024-11-19 09:05:59,844 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 09:05:59,844 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [437356938] [2024-11-19 09:05:59,844 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 09:05:59,845 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:05:59,845 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 09:05:59,847 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:05:59,849 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:05:59,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 09:05:59,970 INFO L255 TraceCheckSpWp]: Trace formula consists of 99 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-19 09:05:59,972 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 09:05:59,982 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:06:00,113 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:06:00,114 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 09:06:00,114 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 09:06:00,114 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [437356938] [2024-11-19 09:06:00,114 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [437356938] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 09:06:00,114 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 09:06:00,114 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-19 09:06:00,114 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [606253920] [2024-11-19 09:06:00,114 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 09:06:00,115 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-19 09:06:00,115 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 09:06:00,115 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-19 09:06:00,115 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-19 09:06:00,115 INFO L87 Difference]: Start difference. First operand 1436 states and 1664 transitions. Second operand has 4 states, 3 states have (on average 9.0) internal successors, (27), 4 states have internal predecessors, (27), 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:06:02,528 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 09:06:02,528 INFO L93 Difference]: Finished difference Result 1589 states and 1684 transitions. [2024-11-19 09:06:02,528 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-19 09:06:02,529 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 9.0) internal successors, (27), 4 states have internal predecessors, (27), 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 27 [2024-11-19 09:06:02,529 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 09:06:02,533 INFO L225 Difference]: With dead ends: 1589 [2024-11-19 09:06:02,533 INFO L226 Difference]: Without dead ends: 1589 [2024-11-19 09:06:02,533 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 24 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:06:02,533 INFO L432 NwaCegarLoop]: 1128 mSDtfsCounter, 455 mSDsluCounter, 1217 mSDsCounter, 0 mSdLazyCounter, 1499 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 455 SdHoareTripleChecker+Valid, 2345 SdHoareTripleChecker+Invalid, 1502 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 1499 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2024-11-19 09:06:02,533 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [455 Valid, 2345 Invalid, 1502 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 1499 Invalid, 0 Unknown, 0 Unchecked, 2.4s Time] [2024-11-19 09:06:02,535 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1589 states. [2024-11-19 09:06:02,545 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1589 to 1432. [2024-11-19 09:06:02,546 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1432 states, 847 states have (on average 1.922077922077922) internal successors, (1628), 1423 states have internal predecessors, (1628), 16 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 7 states have call predecessors, (16), 16 states have call successors, (16) [2024-11-19 09:06:02,548 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1432 states to 1432 states and 1660 transitions. [2024-11-19 09:06:02,548 INFO L78 Accepts]: Start accepts. Automaton has 1432 states and 1660 transitions. Word has length 27 [2024-11-19 09:06:02,548 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 09:06:02,549 INFO L471 AbstractCegarLoop]: Abstraction has 1432 states and 1660 transitions. [2024-11-19 09:06:02,549 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 9.0) internal successors, (27), 4 states have internal predecessors, (27), 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:06:02,549 INFO L276 IsEmpty]: Start isEmpty. Operand 1432 states and 1660 transitions. [2024-11-19 09:06:02,549 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2024-11-19 09:06:02,549 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 09:06:02,550 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] [2024-11-19 09:06:02,554 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:06:02,750 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:06:02,750 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr107REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 730 more)] === [2024-11-19 09:06:02,751 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 09:06:02,751 INFO L85 PathProgramCache]: Analyzing trace with hash -3860248, now seen corresponding path program 1 times [2024-11-19 09:06:02,751 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 09:06:02,751 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1596772201] [2024-11-19 09:06:02,751 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 09:06:02,751 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:06:02,751 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 09:06:02,752 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:06:02,754 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:06:02,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 09:06:02,901 INFO L255 TraceCheckSpWp]: Trace formula consists of 171 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-19 09:06:02,903 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 09:06:02,937 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:06:02,937 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 09:06:02,938 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 09:06:02,938 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1596772201] [2024-11-19 09:06:02,938 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1596772201] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 09:06:02,938 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 09:06:02,938 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-19 09:06:02,938 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [704795103] [2024-11-19 09:06:02,938 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 09:06:02,938 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-19 09:06:02,938 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 09:06:02,938 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-19 09:06:02,939 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-19 09:06:02,939 INFO L87 Difference]: Start difference. First operand 1432 states and 1660 transitions. Second operand has 4 states, 4 states have (on average 10.75) internal successors, (43), 4 states have internal predecessors, (43), 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:06:02,992 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 09:06:02,993 INFO L93 Difference]: Finished difference Result 1426 states and 1650 transitions. [2024-11-19 09:06:02,993 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-19 09:06:02,993 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 10.75) internal successors, (43), 4 states have internal predecessors, (43), 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 43 [2024-11-19 09:06:02,994 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 09:06:02,997 INFO L225 Difference]: With dead ends: 1426 [2024-11-19 09:06:02,997 INFO L226 Difference]: Without dead ends: 1426 [2024-11-19 09:06:02,997 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 40 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:06:02,997 INFO L432 NwaCegarLoop]: 1303 mSDtfsCounter, 21 mSDsluCounter, 2575 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 3878 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:06:02,997 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 3878 Invalid, 44 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 09:06:02,999 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1426 states. [2024-11-19 09:06:03,009 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1426 to 1426. [2024-11-19 09:06:03,011 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1426 states, 841 states have (on average 1.9239001189060643) internal successors, (1618), 1417 states have internal predecessors, (1618), 16 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 7 states have call predecessors, (16), 16 states have call successors, (16) [2024-11-19 09:06:03,013 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1426 states to 1426 states and 1650 transitions. [2024-11-19 09:06:03,013 INFO L78 Accepts]: Start accepts. Automaton has 1426 states and 1650 transitions. Word has length 43 [2024-11-19 09:06:03,013 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 09:06:03,013 INFO L471 AbstractCegarLoop]: Abstraction has 1426 states and 1650 transitions. [2024-11-19 09:06:03,013 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.75) internal successors, (43), 4 states have internal predecessors, (43), 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:06:03,013 INFO L276 IsEmpty]: Start isEmpty. Operand 1426 states and 1650 transitions. [2024-11-19 09:06:03,014 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2024-11-19 09:06:03,014 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 09:06:03,014 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] [2024-11-19 09:06:03,020 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Forceful destruction successful, exit code 0 [2024-11-19 09:06:03,214 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:06:03,215 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr107REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 730 more)] === [2024-11-19 09:06:03,215 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 09:06:03,215 INFO L85 PathProgramCache]: Analyzing trace with hash 168131124, now seen corresponding path program 1 times [2024-11-19 09:06:03,216 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 09:06:03,216 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [292340857] [2024-11-19 09:06:03,216 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 09:06:03,216 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:06:03,216 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 09:06:03,217 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:06:03,219 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:06:03,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 09:06:03,378 INFO L255 TraceCheckSpWp]: Trace formula consists of 195 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-19 09:06:03,380 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 09:06:03,543 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:06:03,543 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 09:06:03,543 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 09:06:03,543 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [292340857] [2024-11-19 09:06:03,543 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [292340857] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 09:06:03,543 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 09:06:03,544 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-19 09:06:03,544 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1121575556] [2024-11-19 09:06:03,544 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 09:06:03,544 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 09:06:03,544 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 09:06:03,544 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 09:06:03,544 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 09:06:03,545 INFO L87 Difference]: Start difference. First operand 1426 states and 1650 transitions. Second operand has 3 states, 3 states have (on average 17.0) internal successors, (51), 3 states have internal predecessors, (51), 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:06:03,650 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 09:06:03,650 INFO L93 Difference]: Finished difference Result 1644 states and 1897 transitions. [2024-11-19 09:06:03,650 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 09:06:03,650 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 17.0) internal successors, (51), 3 states have internal predecessors, (51), 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 51 [2024-11-19 09:06:03,651 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 09:06:03,654 INFO L225 Difference]: With dead ends: 1644 [2024-11-19 09:06:03,654 INFO L226 Difference]: Without dead ends: 1644 [2024-11-19 09:06:03,654 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 49 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:06:03,654 INFO L432 NwaCegarLoop]: 1390 mSDtfsCounter, 178 mSDsluCounter, 1253 mSDsCounter, 0 mSdLazyCounter, 102 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 178 SdHoareTripleChecker+Valid, 2643 SdHoareTripleChecker+Invalid, 104 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 102 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-19 09:06:03,654 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [178 Valid, 2643 Invalid, 104 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 102 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-19 09:06:03,656 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1644 states. [2024-11-19 09:06:03,666 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1644 to 1473. [2024-11-19 09:06:03,667 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1473 states, 888 states have (on average 1.875) internal successors, (1665), 1464 states have internal predecessors, (1665), 16 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 7 states have call predecessors, (16), 16 states have call successors, (16) [2024-11-19 09:06:03,669 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1473 states to 1473 states and 1697 transitions. [2024-11-19 09:06:03,669 INFO L78 Accepts]: Start accepts. Automaton has 1473 states and 1697 transitions. Word has length 51 [2024-11-19 09:06:03,670 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 09:06:03,670 INFO L471 AbstractCegarLoop]: Abstraction has 1473 states and 1697 transitions. [2024-11-19 09:06:03,670 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 17.0) internal successors, (51), 3 states have internal predecessors, (51), 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:06:03,670 INFO L276 IsEmpty]: Start isEmpty. Operand 1473 states and 1697 transitions. [2024-11-19 09:06:03,671 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2024-11-19 09:06:03,671 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 09:06:03,671 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] [2024-11-19 09:06:03,677 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:06:03,871 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:06:03,872 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr61REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 730 more)] === [2024-11-19 09:06:03,872 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 09:06:03,872 INFO L85 PathProgramCache]: Analyzing trace with hash 754975115, now seen corresponding path program 1 times [2024-11-19 09:06:03,872 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 09:06:03,872 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [566818160] [2024-11-19 09:06:03,873 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 09:06:03,873 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:06:03,873 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 09:06:03,875 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:06:03,876 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:06:04,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 09:06:04,088 INFO L255 TraceCheckSpWp]: Trace formula consists of 230 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-19 09:06:04,092 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 09:06:04,100 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:06:04,106 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:06:04,439 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-19 09:06:04,441 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:06:04,455 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2024-11-19 09:06:04,455 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:06:04,467 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:06:04,467 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 09:06:04,467 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 09:06:04,468 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [566818160] [2024-11-19 09:06:04,468 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [566818160] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 09:06:04,468 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 09:06:04,468 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-19 09:06:04,468 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1088333591] [2024-11-19 09:06:04,468 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 09:06:04,468 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-19 09:06:04,468 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 09:06:04,469 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-19 09:06:04,469 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-19 09:06:04,469 INFO L87 Difference]: Start difference. First operand 1473 states and 1697 transitions. Second operand has 4 states, 3 states have (on average 18.0) internal successors, (54), 4 states have internal predecessors, (54), 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:06:05,929 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 09:06:05,929 INFO L93 Difference]: Finished difference Result 1389 states and 1613 transitions. [2024-11-19 09:06:05,930 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-19 09:06:05,930 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 18.0) internal successors, (54), 4 states have internal predecessors, (54), 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 54 [2024-11-19 09:06:05,930 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 09:06:05,933 INFO L225 Difference]: With dead ends: 1389 [2024-11-19 09:06:05,933 INFO L226 Difference]: Without dead ends: 1389 [2024-11-19 09:06:05,933 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 51 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:06:05,934 INFO L432 NwaCegarLoop]: 571 mSDtfsCounter, 1764 mSDsluCounter, 160 mSDsCounter, 0 mSdLazyCounter, 796 mSolverCounterSat, 102 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1770 SdHoareTripleChecker+Valid, 731 SdHoareTripleChecker+Invalid, 898 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 102 IncrementalHoareTripleChecker+Valid, 796 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2024-11-19 09:06:05,934 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1770 Valid, 731 Invalid, 898 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [102 Valid, 796 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2024-11-19 09:06:05,935 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1389 states. [2024-11-19 09:06:05,943 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1389 to 1212. [2024-11-19 09:06:05,944 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1212 states, 711 states have (on average 1.759493670886076) internal successors, (1251), 1203 states have internal predecessors, (1251), 16 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 7 states have call predecessors, (16), 16 states have call successors, (16) [2024-11-19 09:06:05,946 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1212 states to 1212 states and 1283 transitions. [2024-11-19 09:06:05,946 INFO L78 Accepts]: Start accepts. Automaton has 1212 states and 1283 transitions. Word has length 54 [2024-11-19 09:06:05,946 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 09:06:05,946 INFO L471 AbstractCegarLoop]: Abstraction has 1212 states and 1283 transitions. [2024-11-19 09:06:05,947 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 18.0) internal successors, (54), 4 states have internal predecessors, (54), 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:06:05,947 INFO L276 IsEmpty]: Start isEmpty. Operand 1212 states and 1283 transitions. [2024-11-19 09:06:05,947 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2024-11-19 09:06:05,947 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 09:06:05,947 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] [2024-11-19 09:06:05,956 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Ended with exit code 0 [2024-11-19 09:06:06,148 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:06:06,148 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr66REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 730 more)] === [2024-11-19 09:06:06,148 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 09:06:06,149 INFO L85 PathProgramCache]: Analyzing trace with hash -1572100217, now seen corresponding path program 1 times [2024-11-19 09:06:06,149 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 09:06:06,149 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [75011048] [2024-11-19 09:06:06,149 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 09:06:06,149 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:06:06,149 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 09:06:06,151 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:06:06,152 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:06:06,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 09:06:06,339 INFO L255 TraceCheckSpWp]: Trace formula consists of 257 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-19 09:06:06,342 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 09:06:06,348 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:06:06,357 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:06:06,374 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:06:06,383 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:06:06,384 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 09:06:06,384 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 09:06:06,384 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [75011048] [2024-11-19 09:06:06,384 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [75011048] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 09:06:06,384 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 09:06:06,384 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-19 09:06:06,384 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2129548116] [2024-11-19 09:06:06,384 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 09:06:06,384 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-19 09:06:06,384 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 09:06:06,385 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-19 09:06:06,385 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-19 09:06:06,385 INFO L87 Difference]: Start difference. First operand 1212 states and 1283 transitions. Second operand has 5 states, 4 states have (on average 14.75) internal successors, (59), 5 states have internal predecessors, (59), 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:06:08,128 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 09:06:08,128 INFO L93 Difference]: Finished difference Result 1211 states and 1282 transitions. [2024-11-19 09:06:08,128 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-19 09:06:08,128 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 14.75) internal successors, (59), 5 states have internal predecessors, (59), 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 59 [2024-11-19 09:06:08,129 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 09:06:08,131 INFO L225 Difference]: With dead ends: 1211 [2024-11-19 09:06:08,131 INFO L226 Difference]: Without dead ends: 1211 [2024-11-19 09:06:08,132 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 55 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:06:08,132 INFO L432 NwaCegarLoop]: 1230 mSDtfsCounter, 2 mSDsluCounter, 1915 mSDsCounter, 0 mSdLazyCounter, 1782 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 3145 SdHoareTripleChecker+Invalid, 1783 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 1782 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2024-11-19 09:06:08,132 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 3145 Invalid, 1783 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 1782 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2024-11-19 09:06:08,134 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1211 states. [2024-11-19 09:06:08,141 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1211 to 1211. [2024-11-19 09:06:08,142 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1211 states, 711 states have (on average 1.7580872011251758) internal successors, (1250), 1202 states have internal predecessors, (1250), 16 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 7 states have call predecessors, (16), 16 states have call successors, (16) [2024-11-19 09:06:08,144 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1211 states to 1211 states and 1282 transitions. [2024-11-19 09:06:08,144 INFO L78 Accepts]: Start accepts. Automaton has 1211 states and 1282 transitions. Word has length 59 [2024-11-19 09:06:08,144 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 09:06:08,144 INFO L471 AbstractCegarLoop]: Abstraction has 1211 states and 1282 transitions. [2024-11-19 09:06:08,144 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 14.75) internal successors, (59), 5 states have internal predecessors, (59), 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:06:08,144 INFO L276 IsEmpty]: Start isEmpty. Operand 1211 states and 1282 transitions. [2024-11-19 09:06:08,145 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2024-11-19 09:06:08,145 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 09:06:08,145 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] [2024-11-19 09:06:08,152 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (12)] Forceful destruction successful, exit code 0 [2024-11-19 09:06:08,345 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:06:08,346 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr67REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 730 more)] === [2024-11-19 09:06:08,346 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 09:06:08,346 INFO L85 PathProgramCache]: Analyzing trace with hash -1572100216, now seen corresponding path program 1 times [2024-11-19 09:06:08,346 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 09:06:08,346 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [726238061] [2024-11-19 09:06:08,346 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 09:06:08,347 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:06:08,347 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 09:06:08,348 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:06:08,348 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (13)] Waiting until timeout for monitored process [2024-11-19 09:06:08,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 09:06:08,518 INFO L255 TraceCheckSpWp]: Trace formula consists of 257 conjuncts, 11 conjuncts are in the unsatisfiable core [2024-11-19 09:06:08,520 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 09:06:08,527 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:06:08,539 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:06:08,542 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:06:08,577 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:06:08,589 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:06:08,590 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 09:06:08,590 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 09:06:08,590 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [726238061] [2024-11-19 09:06:08,590 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [726238061] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 09:06:08,590 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 09:06:08,590 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-19 09:06:08,590 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [149205289] [2024-11-19 09:06:08,590 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 09:06:08,591 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-19 09:06:08,591 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 09:06:08,591 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-19 09:06:08,591 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-19 09:06:08,591 INFO L87 Difference]: Start difference. First operand 1211 states and 1282 transitions. Second operand has 5 states, 4 states have (on average 14.75) internal successors, (59), 5 states have internal predecessors, (59), 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:06:10,761 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 09:06:10,762 INFO L93 Difference]: Finished difference Result 1210 states and 1281 transitions. [2024-11-19 09:06:10,762 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-19 09:06:10,762 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 14.75) internal successors, (59), 5 states have internal predecessors, (59), 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 59 [2024-11-19 09:06:10,762 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 09:06:10,765 INFO L225 Difference]: With dead ends: 1210 [2024-11-19 09:06:10,765 INFO L226 Difference]: Without dead ends: 1210 [2024-11-19 09:06:10,765 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 55 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:06:10,765 INFO L432 NwaCegarLoop]: 1230 mSDtfsCounter, 1 mSDsluCounter, 1946 mSDsCounter, 0 mSdLazyCounter, 1748 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 3176 SdHoareTripleChecker+Invalid, 1749 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 1748 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2024-11-19 09:06:10,766 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 3176 Invalid, 1749 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 1748 Invalid, 0 Unknown, 0 Unchecked, 2.1s Time] [2024-11-19 09:06:10,767 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1210 states. [2024-11-19 09:06:10,775 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1210 to 1210. [2024-11-19 09:06:10,776 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1210 states, 710 states have (on average 1.7591549295774649) internal successors, (1249), 1201 states have internal predecessors, (1249), 16 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 7 states have call predecessors, (16), 16 states have call successors, (16) [2024-11-19 09:06:10,777 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1210 states to 1210 states and 1281 transitions. [2024-11-19 09:06:10,778 INFO L78 Accepts]: Start accepts. Automaton has 1210 states and 1281 transitions. Word has length 59 [2024-11-19 09:06:10,778 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 09:06:10,778 INFO L471 AbstractCegarLoop]: Abstraction has 1210 states and 1281 transitions. [2024-11-19 09:06:10,778 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 14.75) internal successors, (59), 5 states have internal predecessors, (59), 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:06:10,778 INFO L276 IsEmpty]: Start isEmpty. Operand 1210 states and 1281 transitions. [2024-11-19 09:06:10,779 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2024-11-19 09:06:10,779 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 09:06:10,779 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 09:06:10,786 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (13)] Ended with exit code 0 [2024-11-19 09:06:10,980 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:06:10,980 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr70REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 730 more)] === [2024-11-19 09:06:10,981 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 09:06:10,981 INFO L85 PathProgramCache]: Analyzing trace with hash -1878357490, now seen corresponding path program 1 times [2024-11-19 09:06:10,981 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 09:06:10,981 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1932182190] [2024-11-19 09:06:10,981 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 09:06:10,982 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:06:10,982 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 09:06:10,983 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:06:10,985 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:06:11,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 09:06:11,173 INFO L255 TraceCheckSpWp]: Trace formula consists of 283 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-19 09:06:11,175 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 09:06:11,191 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:06:11,191 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 09:06:11,192 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 09:06:11,192 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1932182190] [2024-11-19 09:06:11,192 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1932182190] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 09:06:11,192 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 09:06:11,192 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-19 09:06:11,192 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1346233901] [2024-11-19 09:06:11,192 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 09:06:11,192 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-19 09:06:11,193 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 09:06:11,193 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-19 09:06:11,193 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-19 09:06:11,193 INFO L87 Difference]: Start difference. First operand 1210 states and 1281 transitions. Second operand has 4 states, 4 states have (on average 16.25) internal successors, (65), 4 states have internal predecessors, (65), 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:06:11,230 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 09:06:11,230 INFO L93 Difference]: Finished difference Result 1213 states and 1286 transitions. [2024-11-19 09:06:11,230 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-19 09:06:11,230 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 16.25) internal successors, (65), 4 states have internal predecessors, (65), 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 67 [2024-11-19 09:06:11,230 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 09:06:11,234 INFO L225 Difference]: With dead ends: 1213 [2024-11-19 09:06:11,234 INFO L226 Difference]: Without dead ends: 1213 [2024-11-19 09:06:11,234 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 64 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:06:11,234 INFO L432 NwaCegarLoop]: 1229 mSDtfsCounter, 0 mSDsluCounter, 2450 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 3679 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-19 09:06:11,234 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 3679 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 09:06:11,236 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1213 states. [2024-11-19 09:06:11,244 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1213 to 1213. [2024-11-19 09:06:11,246 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1213 states, 712 states have (on average 1.7584269662921348) internal successors, (1252), 1204 states have internal predecessors, (1252), 16 states have call successors, (16), 2 states have call predecessors, (16), 3 states have return successors, (18), 7 states have call predecessors, (18), 16 states have call successors, (18) [2024-11-19 09:06:11,247 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1213 states to 1213 states and 1286 transitions. [2024-11-19 09:06:11,247 INFO L78 Accepts]: Start accepts. Automaton has 1213 states and 1286 transitions. Word has length 67 [2024-11-19 09:06:11,247 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 09:06:11,247 INFO L471 AbstractCegarLoop]: Abstraction has 1213 states and 1286 transitions. [2024-11-19 09:06:11,247 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 16.25) internal successors, (65), 4 states have internal predecessors, (65), 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:06:11,247 INFO L276 IsEmpty]: Start isEmpty. Operand 1213 states and 1286 transitions. [2024-11-19 09:06:11,248 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2024-11-19 09:06:11,248 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 09:06:11,248 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] [2024-11-19 09:06:11,258 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 (14)] Forceful destruction successful, exit code 0 [2024-11-19 09:06:11,448 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:06:11,449 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr70REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 730 more)] === [2024-11-19 09:06:11,449 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 09:06:11,449 INFO L85 PathProgramCache]: Analyzing trace with hash -1847933811, now seen corresponding path program 1 times [2024-11-19 09:06:11,450 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 09:06:11,450 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1189980424] [2024-11-19 09:06:11,450 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 09:06:11,450 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:06:11,450 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 09:06:11,453 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:06:11,453 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:06:11,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 09:06:11,646 INFO L255 TraceCheckSpWp]: Trace formula consists of 294 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-19 09:06:11,648 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 09:06:11,664 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:06:11,664 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 09:06:11,725 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:06:11,726 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 09:06:11,726 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1189980424] [2024-11-19 09:06:11,726 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1189980424] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-19 09:06:11,726 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-19 09:06:11,726 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 8 [2024-11-19 09:06:11,726 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1143692553] [2024-11-19 09:06:11,726 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-19 09:06:11,726 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-19 09:06:11,726 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 09:06:11,727 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-19 09:06:11,727 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2024-11-19 09:06:11,727 INFO L87 Difference]: Start difference. First operand 1213 states and 1286 transitions. Second operand has 8 states, 8 states have (on average 8.75) internal successors, (70), 8 states have internal predecessors, (70), 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:06:11,829 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 09:06:11,829 INFO L93 Difference]: Finished difference Result 1225 states and 1304 transitions. [2024-11-19 09:06:11,830 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-19 09:06:11,830 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 8.75) internal successors, (70), 8 states have internal predecessors, (70), 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 68 [2024-11-19 09:06:11,830 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 09:06:11,833 INFO L225 Difference]: With dead ends: 1225 [2024-11-19 09:06:11,833 INFO L226 Difference]: Without dead ends: 1225 [2024-11-19 09:06:11,834 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 137 GetRequests, 128 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=44, Invalid=66, Unknown=0, NotChecked=0, Total=110 [2024-11-19 09:06:11,834 INFO L432 NwaCegarLoop]: 1228 mSDtfsCounter, 8 mSDsluCounter, 2451 mSDsCounter, 0 mSdLazyCounter, 60 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 3679 SdHoareTripleChecker+Invalid, 78 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 60 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-19 09:06:11,834 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 3679 Invalid, 78 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 60 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-19 09:06:11,836 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1225 states. [2024-11-19 09:06:11,846 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1225 to 1223. [2024-11-19 09:06:11,847 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1223 states, 721 states have (on average 1.7572815533980584) internal successors, (1267), 1213 states have internal predecessors, (1267), 16 states have call successors, (16), 3 states have call predecessors, (16), 4 states have return successors, (18), 7 states have call predecessors, (18), 16 states have call successors, (18) [2024-11-19 09:06:11,849 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1223 states to 1223 states and 1301 transitions. [2024-11-19 09:06:11,849 INFO L78 Accepts]: Start accepts. Automaton has 1223 states and 1301 transitions. Word has length 68 [2024-11-19 09:06:11,849 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 09:06:11,849 INFO L471 AbstractCegarLoop]: Abstraction has 1223 states and 1301 transitions. [2024-11-19 09:06:11,849 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 8.75) internal successors, (70), 8 states have internal predecessors, (70), 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:06:11,850 INFO L276 IsEmpty]: Start isEmpty. Operand 1223 states and 1301 transitions. [2024-11-19 09:06:11,850 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2024-11-19 09:06:11,850 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 09:06:11,850 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] [2024-11-19 09:06:11,857 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:06:12,050 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:06:12,051 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr70REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 730 more)] === [2024-11-19 09:06:12,052 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 09:06:12,052 INFO L85 PathProgramCache]: Analyzing trace with hash -1618693682, now seen corresponding path program 2 times [2024-11-19 09:06:12,052 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 09:06:12,052 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1832850335] [2024-11-19 09:06:12,052 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-19 09:06:12,053 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:06:12,053 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 09:06:12,055 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:06:12,056 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:06:12,359 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-19 09:06:12,359 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-19 09:06:12,370 INFO L255 TraceCheckSpWp]: Trace formula consists of 327 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-19 09:06:12,372 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 09:06:12,423 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:06:12,423 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 09:06:12,544 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:06:12,544 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 09:06:12,545 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1832850335] [2024-11-19 09:06:12,545 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1832850335] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-19 09:06:12,545 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-19 09:06:12,545 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 14 [2024-11-19 09:06:12,545 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [927938747] [2024-11-19 09:06:12,545 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-19 09:06:12,545 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-11-19 09:06:12,545 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 09:06:12,546 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-11-19 09:06:12,546 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=121, Unknown=0, NotChecked=0, Total=182 [2024-11-19 09:06:12,546 INFO L87 Difference]: Start difference. First operand 1223 states and 1301 transitions. Second operand has 14 states, 14 states have (on average 5.428571428571429) internal successors, (76), 14 states have internal predecessors, (76), 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:06:12,902 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 09:06:12,902 INFO L93 Difference]: Finished difference Result 1238 states and 1322 transitions. [2024-11-19 09:06:12,903 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2024-11-19 09:06:12,903 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 5.428571428571429) internal successors, (76), 14 states have internal predecessors, (76), 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 71 [2024-11-19 09:06:12,903 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 09:06:12,915 INFO L225 Difference]: With dead ends: 1238 [2024-11-19 09:06:12,915 INFO L226 Difference]: Without dead ends: 1232 [2024-11-19 09:06:12,916 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 149 GetRequests, 128 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:06:12,916 INFO L432 NwaCegarLoop]: 1229 mSDtfsCounter, 14 mSDsluCounter, 9785 mSDsCounter, 0 mSdLazyCounter, 222 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 11014 SdHoareTripleChecker+Invalid, 253 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 222 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-19 09:06:12,916 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 11014 Invalid, 253 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 222 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-19 09:06:12,917 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1232 states. [2024-11-19 09:06:12,925 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1232 to 1232. [2024-11-19 09:06:12,926 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1232 states, 730 states have (on average 1.7506849315068493) internal successors, (1278), 1222 states have internal predecessors, (1278), 16 states have call successors, (16), 3 states have call predecessors, (16), 4 states have return successors, (18), 7 states have call predecessors, (18), 16 states have call successors, (18) [2024-11-19 09:06:12,927 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1232 states to 1232 states and 1312 transitions. [2024-11-19 09:06:12,927 INFO L78 Accepts]: Start accepts. Automaton has 1232 states and 1312 transitions. Word has length 71 [2024-11-19 09:06:12,928 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 09:06:12,928 INFO L471 AbstractCegarLoop]: Abstraction has 1232 states and 1312 transitions. [2024-11-19 09:06:12,928 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 5.428571428571429) internal successors, (76), 14 states have internal predecessors, (76), 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:06:12,928 INFO L276 IsEmpty]: Start isEmpty. Operand 1232 states and 1312 transitions. [2024-11-19 09:06:12,928 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2024-11-19 09:06:12,928 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 09:06:12,928 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] [2024-11-19 09:06:12,950 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 (16)] Ended with exit code 0 [2024-11-19 09:06:13,129 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:06:13,129 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr70REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 730 more)] === [2024-11-19 09:06:13,129 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 09:06:13,129 INFO L85 PathProgramCache]: Analyzing trace with hash -1353815698, now seen corresponding path program 3 times [2024-11-19 09:06:13,130 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 09:06:13,130 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1159987688] [2024-11-19 09:06:13,130 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-19 09:06:13,130 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:06:13,130 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 09:06:13,131 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:06:13,132 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:06:13,551 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2024-11-19 09:06:13,552 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-19 09:06:13,563 INFO L255 TraceCheckSpWp]: Trace formula consists of 393 conjuncts, 14 conjuncts are in the unsatisfiable core [2024-11-19 09:06:13,565 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 09:06:13,676 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:06:13,677 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 09:06:14,032 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:06:14,032 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 09:06:14,032 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1159987688] [2024-11-19 09:06:14,032 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1159987688] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-19 09:06:14,032 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-19 09:06:14,032 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 26 [2024-11-19 09:06:14,032 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [548450355] [2024-11-19 09:06:14,033 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-19 09:06:14,033 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2024-11-19 09:06:14,033 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 09:06:14,034 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2024-11-19 09:06:14,034 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=193, Invalid=457, Unknown=0, NotChecked=0, Total=650 [2024-11-19 09:06:14,034 INFO L87 Difference]: Start difference. First operand 1232 states and 1312 transitions. Second operand has 26 states, 26 states have (on average 3.3846153846153846) internal successors, (88), 26 states have internal predecessors, (88), 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:06:15,139 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 09:06:15,139 INFO L93 Difference]: Finished difference Result 1256 states and 1351 transitions. [2024-11-19 09:06:15,139 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2024-11-19 09:06:15,140 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 26 states have (on average 3.3846153846153846) internal successors, (88), 26 states have internal predecessors, (88), 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 77 [2024-11-19 09:06:15,140 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 09:06:15,143 INFO L225 Difference]: With dead ends: 1256 [2024-11-19 09:06:15,143 INFO L226 Difference]: Without dead ends: 1250 [2024-11-19 09:06:15,144 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 173 GetRequests, 128 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 100 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=728, Invalid=1434, Unknown=0, NotChecked=0, Total=2162 [2024-11-19 09:06:15,144 INFO L432 NwaCegarLoop]: 1229 mSDtfsCounter, 19 mSDsluCounter, 18358 mSDsCounter, 0 mSdLazyCounter, 619 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 19587 SdHoareTripleChecker+Invalid, 646 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 619 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-19 09:06:15,144 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [19 Valid, 19587 Invalid, 646 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 619 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-19 09:06:15,146 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1250 states. [2024-11-19 09:06:15,153 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1250 to 1250. [2024-11-19 09:06:15,154 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1250 states, 748 states have (on average 1.7393048128342246) internal successors, (1301), 1240 states have internal predecessors, (1301), 16 states have call successors, (16), 3 states have call predecessors, (16), 4 states have return successors, (18), 7 states have call predecessors, (18), 16 states have call successors, (18) [2024-11-19 09:06:15,155 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1250 states to 1250 states and 1335 transitions. [2024-11-19 09:06:15,156 INFO L78 Accepts]: Start accepts. Automaton has 1250 states and 1335 transitions. Word has length 77 [2024-11-19 09:06:15,156 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 09:06:15,156 INFO L471 AbstractCegarLoop]: Abstraction has 1250 states and 1335 transitions. [2024-11-19 09:06:15,156 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 26 states have (on average 3.3846153846153846) internal successors, (88), 26 states have internal predecessors, (88), 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:06:15,156 INFO L276 IsEmpty]: Start isEmpty. Operand 1250 states and 1335 transitions. [2024-11-19 09:06:15,156 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2024-11-19 09:06:15,157 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 09:06:15,157 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] [2024-11-19 09:06:15,167 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:06:15,360 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:06:15,361 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr70REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 730 more)] === [2024-11-19 09:06:15,361 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 09:06:15,361 INFO L85 PathProgramCache]: Analyzing trace with hash 241905838, now seen corresponding path program 4 times [2024-11-19 09:06:15,361 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 09:06:15,361 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1464718338] [2024-11-19 09:06:15,361 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2024-11-19 09:06:15,362 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:06:15,362 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 09:06:15,363 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:06:15,373 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:06:15,705 INFO L227 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2024-11-19 09:06:15,705 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-19 09:06:15,719 INFO L255 TraceCheckSpWp]: Trace formula consists of 525 conjuncts, 25 conjuncts are in the unsatisfiable core [2024-11-19 09:06:15,721 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 09:06:15,973 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:06:15,973 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 09:06:16,916 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:06:16,916 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 09:06:16,916 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1464718338] [2024-11-19 09:06:16,917 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1464718338] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-19 09:06:16,917 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-19 09:06:16,917 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 26] total 50 [2024-11-19 09:06:16,917 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [985011929] [2024-11-19 09:06:16,917 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-19 09:06:16,917 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 50 states [2024-11-19 09:06:16,917 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 09:06:16,918 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2024-11-19 09:06:16,919 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=672, Invalid=1778, Unknown=0, NotChecked=0, Total=2450 [2024-11-19 09:06:16,919 INFO L87 Difference]: Start difference. First operand 1250 states and 1335 transitions. Second operand has 50 states, 50 states have (on average 2.24) internal successors, (112), 50 states have internal predecessors, (112), 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:06:20,784 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 09:06:20,784 INFO L93 Difference]: Finished difference Result 1290 states and 1408 transitions. [2024-11-19 09:06:20,784 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 71 states. [2024-11-19 09:06:20,784 INFO L78 Accepts]: Start accepts. Automaton has has 50 states, 50 states have (on average 2.24) internal successors, (112), 50 states have internal predecessors, (112), 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 89 [2024-11-19 09:06:20,785 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 09:06:20,787 INFO L225 Difference]: With dead ends: 1290 [2024-11-19 09:06:20,788 INFO L226 Difference]: Without dead ends: 1286 [2024-11-19 09:06:20,789 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 219 GetRequests, 128 SyntacticMatches, 0 SemanticMatches, 91 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 465 ImplicationChecksByTransitivity, 3.2s TimeCoverageRelationStatistics Valid=2713, Invalid=5843, Unknown=0, NotChecked=0, Total=8556 [2024-11-19 09:06:20,789 INFO L432 NwaCegarLoop]: 1228 mSDtfsCounter, 33 mSDsluCounter, 34260 mSDsCounter, 0 mSdLazyCounter, 2007 mSolverCounterSat, 54 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 33 SdHoareTripleChecker+Valid, 35488 SdHoareTripleChecker+Invalid, 2061 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 54 IncrementalHoareTripleChecker+Valid, 2007 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2024-11-19 09:06:20,790 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [33 Valid, 35488 Invalid, 2061 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [54 Valid, 2007 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2024-11-19 09:06:20,791 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1286 states. [2024-11-19 09:06:20,798 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1286 to 1284. [2024-11-19 09:06:20,799 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1284 states, 782 states have (on average 1.7225063938618925) internal successors, (1347), 1274 states have internal predecessors, (1347), 16 states have call successors, (16), 3 states have call predecessors, (16), 4 states have return successors, (18), 7 states have call predecessors, (18), 16 states have call successors, (18) [2024-11-19 09:06:20,800 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1284 states to 1284 states and 1381 transitions. [2024-11-19 09:06:20,801 INFO L78 Accepts]: Start accepts. Automaton has 1284 states and 1381 transitions. Word has length 89 [2024-11-19 09:06:20,801 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 09:06:20,801 INFO L471 AbstractCegarLoop]: Abstraction has 1284 states and 1381 transitions. [2024-11-19 09:06:20,801 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 50 states, 50 states have (on average 2.24) internal successors, (112), 50 states have internal predecessors, (112), 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:06:20,801 INFO L276 IsEmpty]: Start isEmpty. Operand 1284 states and 1381 transitions. [2024-11-19 09:06:20,802 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2024-11-19 09:06:20,802 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 09:06:20,802 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] [2024-11-19 09:06:20,811 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 (18)] Ended with exit code 0 [2024-11-19 09:06:21,002 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:06:21,003 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr70REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 730 more)] === [2024-11-19 09:06:21,003 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 09:06:21,003 INFO L85 PathProgramCache]: Analyzing trace with hash 220929870, now seen corresponding path program 5 times [2024-11-19 09:06:21,003 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 09:06:21,004 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [367939397] [2024-11-19 09:06:21,004 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2024-11-19 09:06:21,004 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:06:21,004 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 09:06:21,005 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:06:21,006 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:06:22,047 INFO L227 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 23 check-sat command(s) [2024-11-19 09:06:22,047 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-19 09:06:22,067 INFO L255 TraceCheckSpWp]: Trace formula consists of 767 conjuncts, 58 conjuncts are in the unsatisfiable core [2024-11-19 09:06:22,073 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 09:06:22,087 INFO L349 Elim1Store]: treesize reduction 13, result has 45.8 percent of original size [2024-11-19 09:06:22,088 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 22 [2024-11-19 09:06:22,371 INFO L349 Elim1Store]: treesize reduction 54, result has 29.9 percent of original size [2024-11-19 09:06:22,371 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 28 treesize of output 45 [2024-11-19 09:06:22,429 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:06:22,528 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 42 treesize of output 24 [2024-11-19 09:06:24,207 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-19 09:06:24,207 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 62 treesize of output 59 [2024-11-19 09:06:24,271 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 51 treesize of output 27 [2024-11-19 09:06:24,312 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:06:24,312 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 09:06:24,559 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1646 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 1) (bvadd (_ bv1 1) (select |c_#valid| (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem32#1.base| v_ArrVal_1646) |c_ULTIMATE.start_main_~user~0#1.base|) (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|)))))) is different from false [2024-11-19 09:06:24,560 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 09:06:24,560 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [367939397] [2024-11-19 09:06:24,560 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [367939397] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 09:06:24,560 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [711771555] [2024-11-19 09:06:24,560 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2024-11-19 09:06:24,560 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-11-19 09:06:24,561 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2024-11-19 09:06:24,562 INFO L229 MonitoredProcess]: Starting monitored process 20 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:06:24,563 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (20)] Waiting until timeout for monitored process