./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/uthash-2.0.2/uthash_JEN_test7-2.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 023d838f 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_test7-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 1f8d40fc3d39b827c494ff373d43bd116589a8fd89c6e972621bd6e0216b2f6d --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.fs.icfgbuilder-eval-023d838-m [2024-11-10 17:32:26,849 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-10 17:32:26,884 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2024-11-10 17:32:26,891 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-10 17:32:26,892 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-10 17:32:26,912 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-10 17:32:26,912 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-10 17:32:26,913 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-10 17:32:26,913 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-10 17:32:26,915 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-10 17:32:26,916 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-10 17:32:26,916 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-10 17:32:26,916 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-10 17:32:26,916 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-10 17:32:26,917 INFO L153 SettingsManager]: * Use SBE=true [2024-11-10 17:32:26,917 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-10 17:32:26,917 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-10 17:32:26,917 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-10 17:32:26,917 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-10 17:32:26,918 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-10 17:32:26,918 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-11-10 17:32:26,921 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-11-10 17:32:26,922 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-11-10 17:32:26,922 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-10 17:32:26,922 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-10 17:32:26,922 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-10 17:32:26,922 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-10 17:32:26,923 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-10 17:32:26,923 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-10 17:32:26,923 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-10 17:32:26,923 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-10 17:32:26,923 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-10 17:32:26,924 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-10 17:32:26,924 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-10 17:32:26,924 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-10 17:32:26,924 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-10 17:32:26,924 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-10 17:32:26,924 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-10 17:32:26,925 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-10 17:32:26,925 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-10 17:32:26,925 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-10 17:32:26,925 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-10 17:32:26,926 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 -> 1f8d40fc3d39b827c494ff373d43bd116589a8fd89c6e972621bd6e0216b2f6d [2024-11-10 17:32:27,111 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-10 17:32:27,133 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-10 17:32:27,137 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-10 17:32:27,138 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-10 17:32:27,138 INFO L274 PluginConnector]: CDTParser initialized [2024-11-10 17:32:27,139 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_test7-2.i [2024-11-10 17:32:28,381 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-10 17:32:28,618 INFO L384 CDTParser]: Found 1 translation units. [2024-11-10 17:32:28,618 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_JEN_test7-2.i [2024-11-10 17:32:28,640 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/36ba778cd/2cce5d162a4d4087a0ff7c7edb5edb43/FLAG7254ea6e2 [2024-11-10 17:32:28,654 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/36ba778cd/2cce5d162a4d4087a0ff7c7edb5edb43 [2024-11-10 17:32:28,658 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-10 17:32:28,660 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-10 17:32:28,662 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-10 17:32:28,663 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-10 17:32:28,672 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-10 17:32:28,674 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 05:32:28" (1/1) ... [2024-11-10 17:32:28,675 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2470cfad and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 05:32:28, skipping insertion in model container [2024-11-10 17:32:28,675 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 05:32:28" (1/1) ... [2024-11-10 17:32:28,724 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-10 17:32:29,137 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-10 17:32:29,165 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-10 17:32:29,169 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-10 17:32:29,175 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-10 17:32:29,183 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-10 17:32:29,215 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-10 17:32:29,215 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-10 17:32:29,220 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-10 17:32:29,220 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-10 17:32:29,224 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-10 17:32:29,225 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-10 17:32:29,226 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-10 17:32:29,226 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-10 17:32:29,231 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-10 17:32:29,232 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-10 17:32:29,238 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-10 17:32:29,239 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-10 17:32:29,239 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-10 17:32:29,240 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-10 17:32:29,245 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-10 17:32:29,255 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-10 17:32:29,265 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-10 17:32:29,265 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver@2335555e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 05:32:29, skipping insertion in model container [2024-11-10 17:32:29,266 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-10 17:32:29,266 INFO L186 ToolchainWalker]: Toolchain execution was canceled (user or tool) before executing de.uni_freiburg.informatik.ultimate.boogie.procedureinliner [2024-11-10 17:32:29,269 INFO L158 Benchmark]: Toolchain (without parser) took 606.95ms. Allocated memory is still 146.8MB. Free memory was 75.5MB in the beginning and 108.8MB in the end (delta: -33.3MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. [2024-11-10 17:32:29,270 INFO L158 Benchmark]: CDTParser took 0.17ms. Allocated memory is still 113.2MB. Free memory is still 74.2MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-10 17:32:29,270 INFO L158 Benchmark]: CACSL2BoogieTranslator took 603.40ms. Allocated memory is still 146.8MB. Free memory was 75.3MB in the beginning and 108.8MB in the end (delta: -33.5MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. [2024-11-10 17:32:29,272 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.17ms. Allocated memory is still 113.2MB. Free memory is still 74.2MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 603.40ms. Allocated memory is still 146.8MB. Free memory was 75.3MB in the beginning and 108.8MB in the end (delta: -33.5MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - UnsupportedSyntaxResult [Line: 727]: Unsupported Syntax Found a cast between two array/pointer types of different sizes while using memory model HoenickeLindenmann_Original (while Not using bitvector translation) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/uthash-2.0.2/uthash_JEN_test7-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 1f8d40fc3d39b827c494ff373d43bd116589a8fd89c6e972621bd6e0216b2f6d --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.fs.icfgbuilder-eval-023d838-m [2024-11-10 17:32:30,902 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-10 17:32:30,966 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf [2024-11-10 17:32:30,972 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-10 17:32:30,973 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-10 17:32:30,998 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-10 17:32:30,999 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-10 17:32:30,999 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-10 17:32:31,000 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-10 17:32:31,001 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-10 17:32:31,001 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-10 17:32:31,002 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-10 17:32:31,002 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-10 17:32:31,002 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-10 17:32:31,002 INFO L153 SettingsManager]: * Use SBE=true [2024-11-10 17:32:31,003 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-10 17:32:31,003 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-10 17:32:31,003 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-10 17:32:31,006 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-10 17:32:31,006 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-10 17:32:31,006 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-11-10 17:32:31,007 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-11-10 17:32:31,007 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-11-10 17:32:31,007 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-10 17:32:31,007 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-10 17:32:31,007 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-10 17:32:31,007 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-10 17:32:31,007 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-10 17:32:31,008 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-10 17:32:31,008 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-10 17:32:31,008 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-10 17:32:31,008 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-10 17:32:31,008 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-10 17:32:31,008 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-10 17:32:31,008 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-10 17:32:31,009 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-10 17:32:31,009 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-10 17:32:31,009 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-10 17:32:31,009 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-10 17:32:31,009 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-10 17:32:31,011 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-10 17:32:31,012 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-10 17:32:31,013 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-10 17:32:31,013 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-10 17:32:31,013 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 -> 1f8d40fc3d39b827c494ff373d43bd116589a8fd89c6e972621bd6e0216b2f6d [2024-11-10 17:32:31,260 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-10 17:32:31,281 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-10 17:32:31,283 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-10 17:32:31,291 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-10 17:32:31,292 INFO L274 PluginConnector]: CDTParser initialized [2024-11-10 17:32:31,293 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_test7-2.i [2024-11-10 17:32:32,593 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-10 17:32:32,823 INFO L384 CDTParser]: Found 1 translation units. [2024-11-10 17:32:32,823 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_JEN_test7-2.i [2024-11-10 17:32:32,838 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e583ad3e8/e1eaccf904524f3f90851c9334971f2e/FLAGc3b186e80 [2024-11-10 17:32:32,852 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e583ad3e8/e1eaccf904524f3f90851c9334971f2e [2024-11-10 17:32:32,854 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-10 17:32:32,855 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-10 17:32:32,856 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-10 17:32:32,856 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-10 17:32:32,861 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-10 17:32:32,861 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 05:32:32" (1/1) ... [2024-11-10 17:32:32,862 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@f3595b9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 05:32:32, skipping insertion in model container [2024-11-10 17:32:32,862 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 05:32:32" (1/1) ... [2024-11-10 17:32:32,903 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-10 17:32:33,258 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-10 17:32:33,292 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-10 17:32:33,297 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-10 17:32:33,300 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-10 17:32:33,305 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-10 17:32:33,337 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-10 17:32:33,337 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-10 17:32:33,339 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-10 17:32:33,339 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-10 17:32:33,341 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-10 17:32:33,343 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-10 17:32:33,343 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-10 17:32:33,346 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-10 17:32:33,352 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-10 17:32:33,353 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-10 17:32:33,359 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-10 17:32:33,360 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-10 17:32:33,360 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-10 17:32:33,361 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-10 17:32:33,366 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-10 17:32:33,376 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-10 17:32:33,392 INFO L197 MainTranslator]: Restarting translation with changed settings: SettingsChange [mNewPreferredMemoryModel=HoenickeLindenmann_1ByteResolution] [2024-11-10 17:32:33,399 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-10 17:32:33,425 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-10 17:32:33,445 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-10 17:32:33,446 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-10 17:32:33,455 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-10 17:32:33,460 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-10 17:32:33,476 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-10 17:32:33,480 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-10 17:32:33,482 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-10 17:32:33,482 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-10 17:32:33,484 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-10 17:32:33,484 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-10 17:32:33,485 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-10 17:32:33,485 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-10 17:32:33,487 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-10 17:32:33,487 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-10 17:32:33,489 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-10 17:32:33,493 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-10 17:32:33,493 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-10 17:32:33,494 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-10 17:32:33,496 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-10 17:32:33,501 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-10 17:32:33,511 INFO L200 MainTranslator]: Completed pre-run [2024-11-10 17:32:33,573 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-10 17:32:33,608 INFO L204 MainTranslator]: Completed translation [2024-11-10 17:32:33,609 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 05:32:33 WrapperNode [2024-11-10 17:32:33,609 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-10 17:32:33,610 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-10 17:32:33,610 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-10 17:32:33,610 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-10 17:32:33,616 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 05:32:33" (1/1) ... [2024-11-10 17:32:33,651 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 05:32:33" (1/1) ... [2024-11-10 17:32:33,715 INFO L138 Inliner]: procedures = 179, calls = 323, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 1164 [2024-11-10 17:32:33,716 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-10 17:32:33,716 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-10 17:32:33,717 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-10 17:32:33,717 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-10 17:32:33,725 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 05:32:33" (1/1) ... [2024-11-10 17:32:33,726 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 05:32:33" (1/1) ... [2024-11-10 17:32:33,748 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 05:32:33" (1/1) ... [2024-11-10 17:32:33,814 INFO L175 MemorySlicer]: Split 301 memory accesses to 3 slices as follows [2, 265, 34]. 88 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0, 0]. The 62 writes are split as follows [0, 58, 4]. [2024-11-10 17:32:33,814 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 05:32:33" (1/1) ... [2024-11-10 17:32:33,815 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 05:32:33" (1/1) ... [2024-11-10 17:32:33,851 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 05:32:33" (1/1) ... [2024-11-10 17:32:33,853 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 05:32:33" (1/1) ... [2024-11-10 17:32:33,856 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 05:32:33" (1/1) ... [2024-11-10 17:32:33,862 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 05:32:33" (1/1) ... [2024-11-10 17:32:33,875 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-10 17:32:33,879 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2024-11-10 17:32:33,879 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2024-11-10 17:32:33,880 INFO L274 PluginConnector]: IcfgBuilder initialized [2024-11-10 17:32:33,880 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 05:32:33" (1/1) ... [2024-11-10 17:32:33,885 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-10 17:32:33,895 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 17:32:33,917 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-10 17:32:33,920 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-10 17:32:33,958 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2024-11-10 17:32:33,958 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2024-11-10 17:32:33,958 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#0 [2024-11-10 17:32:33,959 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#1 [2024-11-10 17:32:33,959 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#2 [2024-11-10 17:32:33,959 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#0 [2024-11-10 17:32:33,960 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#1 [2024-11-10 17:32:33,961 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#2 [2024-11-10 17:32:33,961 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#0 [2024-11-10 17:32:33,961 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#1 [2024-11-10 17:32:33,961 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#2 [2024-11-10 17:32:33,961 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#0 [2024-11-10 17:32:33,961 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#1 [2024-11-10 17:32:33,962 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#2 [2024-11-10 17:32:33,962 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-11-10 17:32:33,962 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-10 17:32:33,963 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2024-11-10 17:32:33,963 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2024-11-10 17:32:33,963 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2024-11-10 17:32:33,963 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-11-10 17:32:33,963 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2024-11-10 17:32:33,963 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2024-11-10 17:32:33,963 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2024-11-10 17:32:33,963 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-10 17:32:33,963 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#0 [2024-11-10 17:32:33,963 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#1 [2024-11-10 17:32:33,963 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#2 [2024-11-10 17:32:33,963 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-10 17:32:33,963 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2024-11-10 17:32:33,963 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#2 [2024-11-10 17:32:33,963 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-10 17:32:33,964 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-10 17:32:34,190 INFO L256 CfgBuilder]: Building ICFG [2024-11-10 17:32:34,192 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-10 17:32:37,214 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L713: call ULTIMATE.dealloc(main_~#i~0#1.base, main_~#i~0#1.offset);havoc main_~#i~0#1.base, main_~#i~0#1.offset; [2024-11-10 17:32:37,324 INFO L? ?]: Removed 1294 outVars from TransFormulas that were not future-live. [2024-11-10 17:32:37,324 INFO L307 CfgBuilder]: Performing block encoding [2024-11-10 17:32:37,359 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-10 17:32:37,360 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-10 17:32:37,360 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 05:32:37 BoogieIcfgContainer [2024-11-10 17:32:37,360 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2024-11-10 17:32:37,365 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-10 17:32:37,365 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-10 17:32:37,372 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-10 17:32:37,372 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.11 05:32:32" (1/3) ... [2024-11-10 17:32:37,373 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1e0c5253 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 05:32:37, skipping insertion in model container [2024-11-10 17:32:37,373 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 05:32:33" (2/3) ... [2024-11-10 17:32:37,373 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1e0c5253 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 05:32:37, skipping insertion in model container [2024-11-10 17:32:37,373 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 05:32:37" (3/3) ... [2024-11-10 17:32:37,374 INFO L112 eAbstractionObserver]: Analyzing ICFG uthash_JEN_test7-2.i [2024-11-10 17:32:37,388 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-10 17:32:37,388 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 628 error locations. [2024-11-10 17:32:37,444 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-10 17:32:37,451 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;@4eaeda9e, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-10 17:32:37,452 INFO L334 AbstractCegarLoop]: Starting to check reachability of 628 error locations. [2024-11-10 17:32:37,458 INFO L276 IsEmpty]: Start isEmpty. Operand has 1286 states, 653 states have (on average 2.1761102603369067) internal successors, (1421), 1279 states have internal predecessors, (1421), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2024-11-10 17:32:37,462 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2024-11-10 17:32:37,462 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 17:32:37,463 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1] [2024-11-10 17:32:37,463 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr625REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 625 more)] === [2024-11-10 17:32:37,467 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 17:32:37,468 INFO L85 PathProgramCache]: Analyzing trace with hash 1457691, now seen corresponding path program 1 times [2024-11-10 17:32:37,482 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-10 17:32:37,483 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [670650236] [2024-11-10 17:32:37,483 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 17:32:37,483 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-10 17:32:37,483 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-10 17:32:37,503 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-10 17:32:37,504 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-10 17:32:37,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 17:32:37,655 INFO L255 TraceCheckSpWp]: Trace formula consists of 23 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-10 17:32:37,660 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 17:32:37,691 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-10 17:32:37,706 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-10 17:32:37,706 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-10 17:32:37,707 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-10 17:32:37,707 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [670650236] [2024-11-10 17:32:37,707 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [670650236] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 17:32:37,707 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 17:32:37,707 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-10 17:32:37,709 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [958624799] [2024-11-10 17:32:37,713 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 17:32:37,732 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 17:32:37,733 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-10 17:32:37,756 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 17:32:37,761 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 17:32:37,764 INFO L87 Difference]: Start difference. First operand has 1286 states, 653 states have (on average 2.1761102603369067) internal successors, (1421), 1279 states have internal predecessors, (1421), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) Second operand has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 17:32:39,369 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 17:32:39,369 INFO L93 Difference]: Finished difference Result 1462 states and 1538 transitions. [2024-11-10 17:32:39,370 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 17:32:39,371 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 3 [2024-11-10 17:32:39,371 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 17:32:39,384 INFO L225 Difference]: With dead ends: 1462 [2024-11-10 17:32:39,384 INFO L226 Difference]: Without dead ends: 1459 [2024-11-10 17:32:39,385 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 17:32:39,388 INFO L432 NwaCegarLoop]: 775 mSDtfsCounter, 1179 mSDsluCounter, 166 mSDsCounter, 0 mSdLazyCounter, 749 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1182 SdHoareTripleChecker+Valid, 941 SdHoareTripleChecker+Invalid, 765 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 749 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2024-11-10 17:32:39,389 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1182 Valid, 941 Invalid, 765 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 749 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2024-11-10 17:32:39,406 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1459 states. [2024-11-10 17:32:39,451 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1459 to 1265. [2024-11-10 17:32:39,454 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1265 states, 651 states have (on average 2.0337941628264207) internal successors, (1324), 1259 states have internal predecessors, (1324), 5 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-10 17:32:39,457 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1265 states to 1265 states and 1332 transitions. [2024-11-10 17:32:39,459 INFO L78 Accepts]: Start accepts. Automaton has 1265 states and 1332 transitions. Word has length 3 [2024-11-10 17:32:39,459 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 17:32:39,460 INFO L471 AbstractCegarLoop]: Abstraction has 1265 states and 1332 transitions. [2024-11-10 17:32:39,461 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 17:32:39,461 INFO L276 IsEmpty]: Start isEmpty. Operand 1265 states and 1332 transitions. [2024-11-10 17:32:39,461 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2024-11-10 17:32:39,462 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 17:32:39,462 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1] [2024-11-10 17:32:39,465 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-10 17:32:39,663 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-10 17:32:39,664 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr626REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 625 more)] === [2024-11-10 17:32:39,664 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 17:32:39,664 INFO L85 PathProgramCache]: Analyzing trace with hash 1457692, now seen corresponding path program 1 times [2024-11-10 17:32:39,665 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-10 17:32:39,665 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [141848004] [2024-11-10 17:32:39,665 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 17:32:39,665 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-10 17:32:39,665 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-10 17:32:39,668 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-10 17:32:39,669 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-10 17:32:39,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 17:32:39,761 INFO L255 TraceCheckSpWp]: Trace formula consists of 23 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-10 17:32:39,763 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 17:32:39,771 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-10 17:32:39,797 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-10 17:32:39,799 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-10 17:32:39,799 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-10 17:32:39,800 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [141848004] [2024-11-10 17:32:39,800 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [141848004] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 17:32:39,800 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 17:32:39,800 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-10 17:32:39,800 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [697929117] [2024-11-10 17:32:39,800 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 17:32:39,801 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 17:32:39,801 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-10 17:32:39,801 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 17:32:39,801 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 17:32:39,802 INFO L87 Difference]: Start difference. First operand 1265 states and 1332 transitions. Second operand has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 17:32:41,942 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 17:32:41,942 INFO L93 Difference]: Finished difference Result 1884 states and 1994 transitions. [2024-11-10 17:32:41,942 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 17:32:41,943 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 3 [2024-11-10 17:32:41,943 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 17:32:41,947 INFO L225 Difference]: With dead ends: 1884 [2024-11-10 17:32:41,947 INFO L226 Difference]: Without dead ends: 1884 [2024-11-10 17:32:41,947 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 17:32:41,948 INFO L432 NwaCegarLoop]: 1040 mSDtfsCounter, 659 mSDsluCounter, 714 mSDsCounter, 0 mSdLazyCounter, 888 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 659 SdHoareTripleChecker+Valid, 1754 SdHoareTripleChecker+Invalid, 894 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 888 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2024-11-10 17:32:41,948 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [659 Valid, 1754 Invalid, 894 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 888 Invalid, 0 Unknown, 0 Unchecked, 2.1s Time] [2024-11-10 17:32:41,951 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1884 states. [2024-11-10 17:32:41,966 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1884 to 1488. [2024-11-10 17:32:41,967 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1488 states, 875 states have (on average 2.0125714285714285) internal successors, (1761), 1482 states have internal predecessors, (1761), 5 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-10 17:32:41,970 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1488 states to 1488 states and 1769 transitions. [2024-11-10 17:32:41,971 INFO L78 Accepts]: Start accepts. Automaton has 1488 states and 1769 transitions. Word has length 3 [2024-11-10 17:32:41,971 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 17:32:41,971 INFO L471 AbstractCegarLoop]: Abstraction has 1488 states and 1769 transitions. [2024-11-10 17:32:41,971 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 17:32:41,971 INFO L276 IsEmpty]: Start isEmpty. Operand 1488 states and 1769 transitions. [2024-11-10 17:32:41,971 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2024-11-10 17:32:41,972 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 17:32:41,972 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 17:32:41,975 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-10 17:32:42,172 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-10 17:32:42,173 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr622REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 625 more)] === [2024-11-10 17:32:42,173 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 17:32:42,173 INFO L85 PathProgramCache]: Analyzing trace with hash -403622757, now seen corresponding path program 1 times [2024-11-10 17:32:42,174 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-10 17:32:42,174 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1598061885] [2024-11-10 17:32:42,174 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 17:32:42,174 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-10 17:32:42,174 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-10 17:32:42,177 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-10 17:32:42,179 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-10 17:32:42,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 17:32:42,279 INFO L255 TraceCheckSpWp]: Trace formula consists of 61 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-10 17:32:42,281 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 17:32:42,288 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-10 17:32:42,293 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-10 17:32:42,366 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-10 17:32:42,368 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-10 17:32:42,386 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2024-11-10 17:32:42,387 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-10 17:32:42,406 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-10 17:32:42,406 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-10 17:32:42,407 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-10 17:32:42,407 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1598061885] [2024-11-10 17:32:42,408 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1598061885] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 17:32:42,408 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 17:32:42,408 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-10 17:32:42,408 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1445648558] [2024-11-10 17:32:42,408 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 17:32:42,408 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-10 17:32:42,408 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-10 17:32:42,409 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-10 17:32:42,409 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-10 17:32:42,409 INFO L87 Difference]: Start difference. First operand 1488 states and 1769 transitions. Second operand has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 4 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 17:32:44,628 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 17:32:44,629 INFO L93 Difference]: Finished difference Result 1677 states and 1969 transitions. [2024-11-10 17:32:44,629 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-10 17:32:44,629 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 4 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 8 [2024-11-10 17:32:44,629 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 17:32:44,634 INFO L225 Difference]: With dead ends: 1677 [2024-11-10 17:32:44,634 INFO L226 Difference]: Without dead ends: 1677 [2024-11-10 17:32:44,634 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 5 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-10 17:32:44,635 INFO L432 NwaCegarLoop]: 457 mSDtfsCounter, 2649 mSDsluCounter, 98 mSDsCounter, 0 mSdLazyCounter, 1105 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2652 SdHoareTripleChecker+Valid, 555 SdHoareTripleChecker+Invalid, 1128 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 1105 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2024-11-10 17:32:44,635 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2652 Valid, 555 Invalid, 1128 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 1105 Invalid, 0 Unknown, 0 Unchecked, 2.2s Time] [2024-11-10 17:32:44,637 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1677 states. [2024-11-10 17:32:44,649 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1677 to 1253. [2024-11-10 17:32:44,650 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1253 states, 651 states have (on average 2.013824884792627) internal successors, (1311), 1247 states have internal predecessors, (1311), 5 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-10 17:32:44,653 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1253 states to 1253 states and 1319 transitions. [2024-11-10 17:32:44,653 INFO L78 Accepts]: Start accepts. Automaton has 1253 states and 1319 transitions. Word has length 8 [2024-11-10 17:32:44,653 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 17:32:44,653 INFO L471 AbstractCegarLoop]: Abstraction has 1253 states and 1319 transitions. [2024-11-10 17:32:44,653 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 4 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 17:32:44,654 INFO L276 IsEmpty]: Start isEmpty. Operand 1253 states and 1319 transitions. [2024-11-10 17:32:44,654 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2024-11-10 17:32:44,654 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 17:32:44,654 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 17:32:44,658 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Ended with exit code 0 [2024-11-10 17:32:44,857 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-10 17:32:44,857 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr619REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 625 more)] === [2024-11-10 17:32:44,858 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 17:32:44,858 INFO L85 PathProgramCache]: Analyzing trace with hash 372597777, now seen corresponding path program 1 times [2024-11-10 17:32:44,858 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-10 17:32:44,858 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2017642718] [2024-11-10 17:32:44,858 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 17:32:44,858 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-10 17:32:44,858 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-10 17:32:44,860 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-10 17:32:44,860 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-10 17:32:44,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 17:32:44,955 INFO L255 TraceCheckSpWp]: Trace formula consists of 66 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-10 17:32:44,957 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 17:32:44,963 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-10 17:32:44,975 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-10 17:32:44,975 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-10 17:32:44,975 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-10 17:32:44,975 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2017642718] [2024-11-10 17:32:44,975 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2017642718] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 17:32:44,976 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 17:32:44,976 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-10 17:32:44,976 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [429499427] [2024-11-10 17:32:44,976 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 17:32:44,976 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 17:32:44,976 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-10 17:32:44,976 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 17:32:44,976 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 17:32:44,977 INFO L87 Difference]: Start difference. First operand 1253 states and 1319 transitions. Second operand has 3 states, 2 states have (on average 4.5) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 17:32:46,322 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 17:32:46,323 INFO L93 Difference]: Finished difference Result 1601 states and 1697 transitions. [2024-11-10 17:32:46,323 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 17:32:46,323 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 4.5) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2024-11-10 17:32:46,323 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 17:32:46,327 INFO L225 Difference]: With dead ends: 1601 [2024-11-10 17:32:46,327 INFO L226 Difference]: Without dead ends: 1601 [2024-11-10 17:32:46,327 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 7 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-10 17:32:46,328 INFO L432 NwaCegarLoop]: 1192 mSDtfsCounter, 947 mSDsluCounter, 364 mSDsCounter, 0 mSdLazyCounter, 864 mSolverCounterSat, 50 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 950 SdHoareTripleChecker+Valid, 1556 SdHoareTripleChecker+Invalid, 914 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 50 IncrementalHoareTripleChecker+Valid, 864 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2024-11-10 17:32:46,328 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [950 Valid, 1556 Invalid, 914 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [50 Valid, 864 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2024-11-10 17:32:46,331 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1601 states. [2024-11-10 17:32:46,349 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1601 to 1206. [2024-11-10 17:32:46,350 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1206 states, 651 states have (on average 1.9416282642089093) internal successors, (1264), 1200 states have internal predecessors, (1264), 5 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-10 17:32:46,352 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1206 states to 1206 states and 1272 transitions. [2024-11-10 17:32:46,352 INFO L78 Accepts]: Start accepts. Automaton has 1206 states and 1272 transitions. Word has length 9 [2024-11-10 17:32:46,352 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 17:32:46,352 INFO L471 AbstractCegarLoop]: Abstraction has 1206 states and 1272 transitions. [2024-11-10 17:32:46,353 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 4.5) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 17:32:46,354 INFO L276 IsEmpty]: Start isEmpty. Operand 1206 states and 1272 transitions. [2024-11-10 17:32:46,354 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2024-11-10 17:32:46,354 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 17:32:46,354 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 17:32:46,359 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 (5)] Forceful destruction successful, exit code 0 [2024-11-10 17:32:46,554 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-10 17:32:46,555 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr620REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 625 more)] === [2024-11-10 17:32:46,555 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 17:32:46,555 INFO L85 PathProgramCache]: Analyzing trace with hash 372597778, now seen corresponding path program 1 times [2024-11-10 17:32:46,555 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-10 17:32:46,556 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [591388597] [2024-11-10 17:32:46,556 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 17:32:46,556 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-10 17:32:46,556 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-10 17:32:46,557 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-10 17:32:46,558 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-10 17:32:46,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 17:32:46,652 INFO L255 TraceCheckSpWp]: Trace formula consists of 66 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-10 17:32:46,654 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 17:32:46,665 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-10 17:32:46,694 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-10 17:32:46,694 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-10 17:32:46,694 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-10 17:32:46,694 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [591388597] [2024-11-10 17:32:46,694 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [591388597] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 17:32:46,695 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 17:32:46,695 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-10 17:32:46,695 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1172306208] [2024-11-10 17:32:46,695 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 17:32:46,695 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 17:32:46,695 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-10 17:32:46,696 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 17:32:46,696 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 17:32:46,696 INFO L87 Difference]: Start difference. First operand 1206 states and 1272 transitions. Second operand has 3 states, 2 states have (on average 4.5) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 17:32:48,446 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 17:32:48,446 INFO L93 Difference]: Finished difference Result 1694 states and 1793 transitions. [2024-11-10 17:32:48,446 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 17:32:48,446 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 4.5) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2024-11-10 17:32:48,447 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 17:32:48,453 INFO L225 Difference]: With dead ends: 1694 [2024-11-10 17:32:48,453 INFO L226 Difference]: Without dead ends: 1694 [2024-11-10 17:32:48,454 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 7 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-10 17:32:48,454 INFO L432 NwaCegarLoop]: 1388 mSDtfsCounter, 711 mSDsluCounter, 551 mSDsCounter, 0 mSdLazyCounter, 824 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 711 SdHoareTripleChecker+Valid, 1939 SdHoareTripleChecker+Invalid, 837 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 824 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2024-11-10 17:32:48,454 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [711 Valid, 1939 Invalid, 837 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 824 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2024-11-10 17:32:48,456 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1694 states. [2024-11-10 17:32:48,470 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1694 to 1235. [2024-11-10 17:32:48,471 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1235 states, 690 states have (on average 1.9275362318840579) internal successors, (1330), 1229 states have internal predecessors, (1330), 5 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-10 17:32:48,473 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1235 states to 1235 states and 1338 transitions. [2024-11-10 17:32:48,474 INFO L78 Accepts]: Start accepts. Automaton has 1235 states and 1338 transitions. Word has length 9 [2024-11-10 17:32:48,474 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 17:32:48,474 INFO L471 AbstractCegarLoop]: Abstraction has 1235 states and 1338 transitions. [2024-11-10 17:32:48,474 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 4.5) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 17:32:48,474 INFO L276 IsEmpty]: Start isEmpty. Operand 1235 states and 1338 transitions. [2024-11-10 17:32:48,475 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2024-11-10 17:32:48,475 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 17:32:48,475 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 17:32:48,478 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-10 17:32:48,675 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-10 17:32:48,676 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 625 more)] === [2024-11-10 17:32:48,677 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 17:32:48,677 INFO L85 PathProgramCache]: Analyzing trace with hash 612082575, now seen corresponding path program 1 times [2024-11-10 17:32:48,678 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-10 17:32:48,678 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1982436413] [2024-11-10 17:32:48,678 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 17:32:48,678 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-10 17:32:48,678 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-10 17:32:48,680 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-10 17:32:48,681 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-10 17:32:48,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 17:32:48,778 INFO L255 TraceCheckSpWp]: Trace formula consists of 89 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-10 17:32:48,780 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 17:32:48,848 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-10 17:32:48,848 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-10 17:32:48,848 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-10 17:32:48,848 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1982436413] [2024-11-10 17:32:48,848 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1982436413] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 17:32:48,848 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 17:32:48,848 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-10 17:32:48,848 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1056529445] [2024-11-10 17:32:48,848 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 17:32:48,849 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-10 17:32:48,849 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-10 17:32:48,849 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-10 17:32:48,849 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-10 17:32:48,849 INFO L87 Difference]: Start difference. First operand 1235 states and 1338 transitions. Second operand has 4 states, 4 states have (on average 3.75) internal successors, (15), 4 states have internal predecessors, (15), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 17:32:49,343 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 17:32:49,343 INFO L93 Difference]: Finished difference Result 1854 states and 2041 transitions. [2024-11-10 17:32:49,344 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-10 17:32:49,344 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.75) internal successors, (15), 4 states have internal predecessors, (15), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2024-11-10 17:32:49,344 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 17:32:49,348 INFO L225 Difference]: With dead ends: 1854 [2024-11-10 17:32:49,348 INFO L226 Difference]: Without dead ends: 1854 [2024-11-10 17:32:49,348 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 13 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-10 17:32:49,349 INFO L432 NwaCegarLoop]: 1395 mSDtfsCounter, 653 mSDsluCounter, 2425 mSDsCounter, 0 mSdLazyCounter, 368 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 653 SdHoareTripleChecker+Valid, 3820 SdHoareTripleChecker+Invalid, 377 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 368 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-10 17:32:49,349 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [653 Valid, 3820 Invalid, 377 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 368 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-10 17:32:49,353 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1854 states. [2024-11-10 17:32:49,365 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1854 to 1495. [2024-11-10 17:32:49,367 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1495 states, 950 states have (on average 1.9) internal successors, (1805), 1489 states have internal predecessors, (1805), 5 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-10 17:32:49,371 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1495 states to 1495 states and 1813 transitions. [2024-11-10 17:32:49,371 INFO L78 Accepts]: Start accepts. Automaton has 1495 states and 1813 transitions. Word has length 16 [2024-11-10 17:32:49,371 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 17:32:49,371 INFO L471 AbstractCegarLoop]: Abstraction has 1495 states and 1813 transitions. [2024-11-10 17:32:49,371 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.75) internal successors, (15), 4 states have internal predecessors, (15), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 17:32:49,372 INFO L276 IsEmpty]: Start isEmpty. Operand 1495 states and 1813 transitions. [2024-11-10 17:32:49,372 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2024-11-10 17:32:49,372 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 17:32:49,372 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 17:32:49,376 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Forceful destruction successful, exit code 0 [2024-11-10 17:32:49,572 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-10 17:32:49,573 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr295REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 625 more)] === [2024-11-10 17:32:49,573 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 17:32:49,574 INFO L85 PathProgramCache]: Analyzing trace with hash -1925134447, now seen corresponding path program 1 times [2024-11-10 17:32:49,574 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-10 17:32:49,574 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1751497024] [2024-11-10 17:32:49,574 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 17:32:49,574 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-10 17:32:49,574 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-10 17:32:49,575 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-10 17:32:49,576 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-10 17:32:49,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 17:32:49,693 INFO L255 TraceCheckSpWp]: Trace formula consists of 91 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-10 17:32:49,694 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 17:32:49,713 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-10 17:32:49,714 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-10 17:32:49,714 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-10 17:32:49,714 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1751497024] [2024-11-10 17:32:49,714 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1751497024] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 17:32:49,714 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 17:32:49,714 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-10 17:32:49,714 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [863200811] [2024-11-10 17:32:49,715 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 17:32:49,715 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 17:32:49,715 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-10 17:32:49,715 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 17:32:49,715 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 17:32:49,715 INFO L87 Difference]: Start difference. First operand 1495 states and 1813 transitions. Second operand has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 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-10 17:32:49,734 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 17:32:49,735 INFO L93 Difference]: Finished difference Result 1435 states and 1727 transitions. [2024-11-10 17:32:49,735 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 17:32:49,735 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 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 16 [2024-11-10 17:32:49,735 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 17:32:49,738 INFO L225 Difference]: With dead ends: 1435 [2024-11-10 17:32:49,738 INFO L226 Difference]: Without dead ends: 1435 [2024-11-10 17:32:49,738 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 14 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-10 17:32:49,739 INFO L432 NwaCegarLoop]: 1199 mSDtfsCounter, 71 mSDsluCounter, 1135 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 71 SdHoareTripleChecker+Valid, 2334 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-10 17:32:49,739 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [71 Valid, 2334 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 17:32:49,741 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1435 states. [2024-11-10 17:32:49,751 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1435 to 1435. [2024-11-10 17:32:49,752 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1435 states, 914 states have (on average 1.8807439824945296) internal successors, (1719), 1429 states have internal predecessors, (1719), 5 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-10 17:32:49,755 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1435 states to 1435 states and 1727 transitions. [2024-11-10 17:32:49,755 INFO L78 Accepts]: Start accepts. Automaton has 1435 states and 1727 transitions. Word has length 16 [2024-11-10 17:32:49,755 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 17:32:49,756 INFO L471 AbstractCegarLoop]: Abstraction has 1435 states and 1727 transitions. [2024-11-10 17:32:49,756 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 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-10 17:32:49,756 INFO L276 IsEmpty]: Start isEmpty. Operand 1435 states and 1727 transitions. [2024-11-10 17:32:49,757 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2024-11-10 17:32:49,757 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 17:32:49,757 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 17:32:49,762 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Ended with exit code 0 [2024-11-10 17:32:49,959 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-10 17:32:49,960 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr272REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 625 more)] === [2024-11-10 17:32:49,960 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 17:32:49,960 INFO L85 PathProgramCache]: Analyzing trace with hash 1076651430, now seen corresponding path program 1 times [2024-11-10 17:32:49,960 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-10 17:32:49,960 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1101042323] [2024-11-10 17:32:49,961 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 17:32:49,961 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-10 17:32:49,961 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-10 17:32:49,962 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-10 17:32:49,963 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-10 17:32:50,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 17:32:50,060 INFO L255 TraceCheckSpWp]: Trace formula consists of 94 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-10 17:32:50,061 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 17:32:50,078 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-10 17:32:50,078 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-10 17:32:50,078 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-10 17:32:50,078 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1101042323] [2024-11-10 17:32:50,078 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1101042323] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 17:32:50,078 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 17:32:50,078 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-10 17:32:50,078 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [294265148] [2024-11-10 17:32:50,078 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 17:32:50,079 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-10 17:32:50,079 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-10 17:32:50,079 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-10 17:32:50,079 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-10 17:32:50,079 INFO L87 Difference]: Start difference. First operand 1435 states and 1727 transitions. Second operand has 4 states, 4 states have (on average 4.5) internal successors, (18), 4 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 17:32:50,126 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 17:32:50,127 INFO L93 Difference]: Finished difference Result 1405 states and 1669 transitions. [2024-11-10 17:32:50,130 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-10 17:32:50,130 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.5) internal successors, (18), 4 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2024-11-10 17:32:50,131 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 17:32:50,134 INFO L225 Difference]: With dead ends: 1405 [2024-11-10 17:32:50,134 INFO L226 Difference]: Without dead ends: 1405 [2024-11-10 17:32:50,134 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 15 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-10 17:32:50,134 INFO L432 NwaCegarLoop]: 1154 mSDtfsCounter, 48 mSDsluCounter, 2281 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 48 SdHoareTripleChecker+Valid, 3435 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-10 17:32:50,135 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [48 Valid, 3435 Invalid, 59 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 17:32:50,136 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1405 states. [2024-11-10 17:32:50,146 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1405 to 1405. [2024-11-10 17:32:50,148 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1405 states, 898 states have (on average 1.8496659242761693) internal successors, (1661), 1399 states have internal predecessors, (1661), 5 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-10 17:32:50,151 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1405 states to 1405 states and 1669 transitions. [2024-11-10 17:32:50,151 INFO L78 Accepts]: Start accepts. Automaton has 1405 states and 1669 transitions. Word has length 18 [2024-11-10 17:32:50,152 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 17:32:50,152 INFO L471 AbstractCegarLoop]: Abstraction has 1405 states and 1669 transitions. [2024-11-10 17:32:50,152 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.5) internal successors, (18), 4 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 17:32:50,152 INFO L276 IsEmpty]: Start isEmpty. Operand 1405 states and 1669 transitions. [2024-11-10 17:32:50,153 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2024-11-10 17:32:50,154 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 17:32:50,154 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 17:32:50,164 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Ended with exit code 0 [2024-11-10 17:32:50,354 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-10 17:32:50,354 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr611REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 625 more)] === [2024-11-10 17:32:50,355 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 17:32:50,355 INFO L85 PathProgramCache]: Analyzing trace with hash -196783027, now seen corresponding path program 1 times [2024-11-10 17:32:50,355 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-10 17:32:50,355 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [899889858] [2024-11-10 17:32:50,355 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 17:32:50,355 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-10 17:32:50,355 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-10 17:32:50,360 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-10 17:32:50,361 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-10 17:32:50,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 17:32:50,487 INFO L255 TraceCheckSpWp]: Trace formula consists of 132 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-10 17:32:50,489 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 17:32:50,499 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-10 17:32:50,499 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-10 17:32:50,499 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-10 17:32:50,499 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [899889858] [2024-11-10 17:32:50,499 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [899889858] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 17:32:50,499 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 17:32:50,499 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-10 17:32:50,499 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1273254764] [2024-11-10 17:32:50,500 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 17:32:50,500 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 17:32:50,500 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-10 17:32:50,500 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 17:32:50,500 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 17:32:50,500 INFO L87 Difference]: Start difference. First operand 1405 states and 1669 transitions. Second operand has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 17:32:50,523 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 17:32:50,524 INFO L93 Difference]: Finished difference Result 1345 states and 1583 transitions. [2024-11-10 17:32:50,524 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 17:32:50,524 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 20 [2024-11-10 17:32:50,524 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 17:32:50,527 INFO L225 Difference]: With dead ends: 1345 [2024-11-10 17:32:50,527 INFO L226 Difference]: Without dead ends: 1345 [2024-11-10 17:32:50,527 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 18 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-10 17:32:50,528 INFO L432 NwaCegarLoop]: 1121 mSDtfsCounter, 71 mSDsluCounter, 1057 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 71 SdHoareTripleChecker+Valid, 2178 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-10 17:32:50,528 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [71 Valid, 2178 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 17:32:50,529 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1345 states. [2024-11-10 17:32:50,539 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1345 to 1345. [2024-11-10 17:32:50,540 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1345 states, 862 states have (on average 1.8271461716937354) internal successors, (1575), 1339 states have internal predecessors, (1575), 5 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-10 17:32:50,542 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1345 states to 1345 states and 1583 transitions. [2024-11-10 17:32:50,543 INFO L78 Accepts]: Start accepts. Automaton has 1345 states and 1583 transitions. Word has length 20 [2024-11-10 17:32:50,543 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 17:32:50,543 INFO L471 AbstractCegarLoop]: Abstraction has 1345 states and 1583 transitions. [2024-11-10 17:32:50,543 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 17:32:50,543 INFO L276 IsEmpty]: Start isEmpty. Operand 1345 states and 1583 transitions. [2024-11-10 17:32:50,545 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2024-11-10 17:32:50,546 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 17:32:50,546 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] [2024-11-10 17:32:50,551 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-10 17:32:50,746 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-10 17:32:50,746 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 625 more)] === [2024-11-10 17:32:50,747 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 17:32:50,747 INFO L85 PathProgramCache]: Analyzing trace with hash 1006191921, now seen corresponding path program 1 times [2024-11-10 17:32:50,747 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-10 17:32:50,747 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1546081032] [2024-11-10 17:32:50,747 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 17:32:50,747 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-10 17:32:50,747 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-10 17:32:50,748 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-10 17:32:50,750 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-10 17:32:50,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 17:32:50,883 INFO L255 TraceCheckSpWp]: Trace formula consists of 101 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-10 17:32:50,885 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 17:32:50,889 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-10 17:32:50,890 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-10 17:32:50,890 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-10 17:32:50,893 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 39 [2024-11-10 17:32:50,936 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-10 17:32:50,936 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 70 treesize of output 26 [2024-11-10 17:32:50,946 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-10 17:32:50,946 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-10 17:32:50,946 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-10 17:32:50,946 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1546081032] [2024-11-10 17:32:50,946 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1546081032] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 17:32:50,946 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 17:32:50,946 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-10 17:32:50,947 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [294004314] [2024-11-10 17:32:50,947 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 17:32:50,947 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-10 17:32:50,947 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-10 17:32:50,947 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-10 17:32:50,947 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-10 17:32:50,947 INFO L87 Difference]: Start difference. First operand 1345 states and 1583 transitions. Second operand has 4 states, 4 states have (on average 5.25) internal successors, (21), 4 states have internal predecessors, (21), 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-10 17:32:51,100 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 17:32:51,101 INFO L93 Difference]: Finished difference Result 2388 states and 2748 transitions. [2024-11-10 17:32:51,101 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-10 17:32:51,101 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.25) internal successors, (21), 4 states have internal predecessors, (21), 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 21 [2024-11-10 17:32:51,101 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 17:32:51,106 INFO L225 Difference]: With dead ends: 2388 [2024-11-10 17:32:51,106 INFO L226 Difference]: Without dead ends: 2388 [2024-11-10 17:32:51,106 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 18 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-10 17:32:51,107 INFO L432 NwaCegarLoop]: 1113 mSDtfsCounter, 1063 mSDsluCounter, 2217 mSDsCounter, 0 mSdLazyCounter, 67 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1066 SdHoareTripleChecker+Valid, 3330 SdHoareTripleChecker+Invalid, 68 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 67 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-10 17:32:51,107 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1066 Valid, 3330 Invalid, 68 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 67 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-10 17:32:51,109 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2388 states. [2024-11-10 17:32:51,120 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2388 to 1344. [2024-11-10 17:32:51,122 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1344 states, 861 states have (on average 1.826945412311266) internal successors, (1573), 1338 states have internal predecessors, (1573), 5 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-10 17:32:51,124 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1344 states to 1344 states and 1581 transitions. [2024-11-10 17:32:51,124 INFO L78 Accepts]: Start accepts. Automaton has 1344 states and 1581 transitions. Word has length 21 [2024-11-10 17:32:51,125 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 17:32:51,125 INFO L471 AbstractCegarLoop]: Abstraction has 1344 states and 1581 transitions. [2024-11-10 17:32:51,125 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.25) internal successors, (21), 4 states have internal predecessors, (21), 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-10 17:32:51,125 INFO L276 IsEmpty]: Start isEmpty. Operand 1344 states and 1581 transitions. [2024-11-10 17:32:51,125 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2024-11-10 17:32:51,125 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 17:32:51,125 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] [2024-11-10 17:32:51,130 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-10 17:32:51,326 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-10 17:32:51,326 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr587REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 625 more)] === [2024-11-10 17:32:51,326 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 17:32:51,326 INFO L85 PathProgramCache]: Analyzing trace with hash -129955871, now seen corresponding path program 1 times [2024-11-10 17:32:51,327 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-10 17:32:51,327 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1141639812] [2024-11-10 17:32:51,327 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 17:32:51,327 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-10 17:32:51,327 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-10 17:32:51,329 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-10 17:32:51,330 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-10 17:32:51,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 17:32:51,457 INFO L255 TraceCheckSpWp]: Trace formula consists of 135 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-10 17:32:51,459 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 17:32:51,481 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-10 17:32:51,481 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-10 17:32:51,481 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-10 17:32:51,481 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1141639812] [2024-11-10 17:32:51,481 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1141639812] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 17:32:51,481 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 17:32:51,481 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-10 17:32:51,481 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1898288029] [2024-11-10 17:32:51,481 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 17:32:51,482 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-10 17:32:51,482 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-10 17:32:51,482 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-10 17:32:51,482 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-10 17:32:51,482 INFO L87 Difference]: Start difference. First operand 1344 states and 1581 transitions. Second operand has 4 states, 4 states have (on average 5.5) internal successors, (22), 4 states have internal predecessors, (22), 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-10 17:32:51,539 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 17:32:51,539 INFO L93 Difference]: Finished difference Result 1314 states and 1523 transitions. [2024-11-10 17:32:51,540 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-10 17:32:51,540 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.5) internal successors, (22), 4 states have internal predecessors, (22), 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 22 [2024-11-10 17:32:51,540 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 17:32:51,543 INFO L225 Difference]: With dead ends: 1314 [2024-11-10 17:32:51,543 INFO L226 Difference]: Without dead ends: 1314 [2024-11-10 17:32:51,544 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 19 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-10 17:32:51,544 INFO L432 NwaCegarLoop]: 1076 mSDtfsCounter, 48 mSDsluCounter, 2125 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 48 SdHoareTripleChecker+Valid, 3201 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-10 17:32:51,544 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [48 Valid, 3201 Invalid, 59 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 17:32:51,545 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1314 states. [2024-11-10 17:32:51,554 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1314 to 1314. [2024-11-10 17:32:51,555 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1314 states, 845 states have (on average 1.7928994082840237) internal successors, (1515), 1308 states have internal predecessors, (1515), 5 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-10 17:32:51,557 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1314 states to 1314 states and 1523 transitions. [2024-11-10 17:32:51,557 INFO L78 Accepts]: Start accepts. Automaton has 1314 states and 1523 transitions. Word has length 22 [2024-11-10 17:32:51,558 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 17:32:51,558 INFO L471 AbstractCegarLoop]: Abstraction has 1314 states and 1523 transitions. [2024-11-10 17:32:51,558 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.5) internal successors, (22), 4 states have internal predecessors, (22), 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-10 17:32:51,558 INFO L276 IsEmpty]: Start isEmpty. Operand 1314 states and 1523 transitions. [2024-11-10 17:32:51,558 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2024-11-10 17:32:51,559 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 17:32:51,559 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] [2024-11-10 17:32:51,563 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (12)] Ended with exit code 0 [2024-11-10 17:32:51,762 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-10 17:32:51,763 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr573REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 625 more)] === [2024-11-10 17:32:51,763 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 17:32:51,763 INFO L85 PathProgramCache]: Analyzing trace with hash -435968713, now seen corresponding path program 1 times [2024-11-10 17:32:51,763 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-10 17:32:51,763 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [645868296] [2024-11-10 17:32:51,763 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 17:32:51,764 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-10 17:32:51,764 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-10 17:32:51,765 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-10 17:32:51,766 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-10 17:32:51,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 17:32:51,897 INFO L255 TraceCheckSpWp]: Trace formula consists of 149 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-10 17:32:51,899 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 17:32:51,904 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-10 17:32:51,982 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-10 17:32:51,982 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-10 17:32:51,982 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-10 17:32:51,982 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [645868296] [2024-11-10 17:32:51,982 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [645868296] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 17:32:51,982 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 17:32:51,982 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-10 17:32:51,982 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [600165125] [2024-11-10 17:32:51,982 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 17:32:51,983 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-10 17:32:51,983 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-10 17:32:51,983 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-10 17:32:51,983 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-10 17:32:51,983 INFO L87 Difference]: Start difference. First operand 1314 states and 1523 transitions. Second operand has 4 states, 3 states have (on average 12.0) internal successors, (36), 4 states have internal predecessors, (36), 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-10 17:32:53,330 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 17:32:53,330 INFO L93 Difference]: Finished difference Result 1725 states and 2047 transitions. [2024-11-10 17:32:53,331 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-10 17:32:53,331 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 12.0) internal successors, (36), 4 states have internal predecessors, (36), 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 36 [2024-11-10 17:32:53,331 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 17:32:53,335 INFO L225 Difference]: With dead ends: 1725 [2024-11-10 17:32:53,335 INFO L226 Difference]: Without dead ends: 1725 [2024-11-10 17:32:53,335 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 33 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-10 17:32:53,335 INFO L432 NwaCegarLoop]: 695 mSDtfsCounter, 802 mSDsluCounter, 852 mSDsCounter, 0 mSdLazyCounter, 1268 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 805 SdHoareTripleChecker+Valid, 1547 SdHoareTripleChecker+Invalid, 1275 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 1268 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2024-11-10 17:32:53,336 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [805 Valid, 1547 Invalid, 1275 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 1268 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2024-11-10 17:32:53,337 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1725 states. [2024-11-10 17:32:53,345 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1725 to 1310. [2024-11-10 17:32:53,346 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1310 states, 845 states have (on average 1.7834319526627218) internal successors, (1507), 1304 states have internal predecessors, (1507), 5 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-10 17:32:53,348 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1310 states to 1310 states and 1515 transitions. [2024-11-10 17:32:53,348 INFO L78 Accepts]: Start accepts. Automaton has 1310 states and 1515 transitions. Word has length 36 [2024-11-10 17:32:53,348 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 17:32:53,348 INFO L471 AbstractCegarLoop]: Abstraction has 1310 states and 1515 transitions. [2024-11-10 17:32:53,348 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 12.0) internal successors, (36), 4 states have internal predecessors, (36), 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-10 17:32:53,348 INFO L276 IsEmpty]: Start isEmpty. Operand 1310 states and 1515 transitions. [2024-11-10 17:32:53,348 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2024-11-10 17:32:53,348 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 17:32:53,349 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] [2024-11-10 17:32:53,361 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (13)] Ended with exit code 0 [2024-11-10 17:32:53,552 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-10 17:32:53,553 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr574REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 625 more)] === [2024-11-10 17:32:53,553 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 17:32:53,553 INFO L85 PathProgramCache]: Analyzing trace with hash -435968712, now seen corresponding path program 1 times [2024-11-10 17:32:53,554 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-10 17:32:53,554 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [94178983] [2024-11-10 17:32:53,554 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 17:32:53,554 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-10 17:32:53,554 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-10 17:32:53,556 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-10 17:32:53,560 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-10 17:32:53,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 17:32:53,697 INFO L255 TraceCheckSpWp]: Trace formula consists of 149 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-10 17:32:53,699 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 17:32:53,703 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-10 17:32:53,866 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-10 17:32:53,867 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-10 17:32:53,867 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-10 17:32:53,867 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [94178983] [2024-11-10 17:32:53,867 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [94178983] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 17:32:53,867 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 17:32:53,867 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-10 17:32:53,867 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1745299136] [2024-11-10 17:32:53,867 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 17:32:53,867 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-10 17:32:53,867 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-10 17:32:53,868 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-10 17:32:53,868 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-10 17:32:53,868 INFO L87 Difference]: Start difference. First operand 1310 states and 1515 transitions. Second operand has 4 states, 3 states have (on average 12.0) internal successors, (36), 4 states have internal predecessors, (36), 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-10 17:32:55,861 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 17:32:55,862 INFO L93 Difference]: Finished difference Result 1846 states and 2145 transitions. [2024-11-10 17:32:55,862 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-10 17:32:55,862 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 12.0) internal successors, (36), 4 states have internal predecessors, (36), 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 36 [2024-11-10 17:32:55,862 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 17:32:55,866 INFO L225 Difference]: With dead ends: 1846 [2024-11-10 17:32:55,866 INFO L226 Difference]: Without dead ends: 1846 [2024-11-10 17:32:55,866 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 33 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-10 17:32:55,867 INFO L432 NwaCegarLoop]: 1317 mSDtfsCounter, 562 mSDsluCounter, 1333 mSDsCounter, 0 mSdLazyCounter, 1393 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 562 SdHoareTripleChecker+Valid, 2650 SdHoareTripleChecker+Invalid, 1396 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 1393 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2024-11-10 17:32:55,867 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [562 Valid, 2650 Invalid, 1396 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 1393 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2024-11-10 17:32:55,868 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1846 states. [2024-11-10 17:32:55,876 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1846 to 1306. [2024-11-10 17:32:55,877 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1306 states, 845 states have (on average 1.7739644970414201) internal successors, (1499), 1300 states have internal predecessors, (1499), 5 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-10 17:32:55,879 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1306 states to 1306 states and 1507 transitions. [2024-11-10 17:32:55,879 INFO L78 Accepts]: Start accepts. Automaton has 1306 states and 1507 transitions. Word has length 36 [2024-11-10 17:32:55,880 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 17:32:55,880 INFO L471 AbstractCegarLoop]: Abstraction has 1306 states and 1507 transitions. [2024-11-10 17:32:55,880 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 12.0) internal successors, (36), 4 states have internal predecessors, (36), 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-10 17:32:55,880 INFO L276 IsEmpty]: Start isEmpty. Operand 1306 states and 1507 transitions. [2024-11-10 17:32:55,882 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2024-11-10 17:32:55,882 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 17:32:55,882 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] [2024-11-10 17:32:55,887 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-10 17:32:56,082 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-10 17:32:56,083 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr530REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 625 more)] === [2024-11-10 17:32:56,083 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 17:32:56,083 INFO L85 PathProgramCache]: Analyzing trace with hash -1072987726, now seen corresponding path program 1 times [2024-11-10 17:32:56,084 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-10 17:32:56,084 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1831200943] [2024-11-10 17:32:56,084 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 17:32:56,084 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-10 17:32:56,084 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-10 17:32:56,085 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-10 17:32:56,086 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-10 17:32:56,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 17:32:56,249 INFO L255 TraceCheckSpWp]: Trace formula consists of 257 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-10 17:32:56,250 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 17:32:56,285 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-10 17:32:56,285 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-10 17:32:56,285 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-10 17:32:56,285 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1831200943] [2024-11-10 17:32:56,285 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1831200943] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 17:32:56,285 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 17:32:56,285 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-10 17:32:56,286 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2056080262] [2024-11-10 17:32:56,286 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 17:32:56,286 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-10 17:32:56,286 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-10 17:32:56,286 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-10 17:32:56,286 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-10 17:32:56,286 INFO L87 Difference]: Start difference. First operand 1306 states and 1507 transitions. Second operand has 4 states, 4 states have (on average 14.0) internal successors, (56), 4 states have internal predecessors, (56), 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-10 17:32:56,327 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 17:32:56,327 INFO L93 Difference]: Finished difference Result 1294 states and 1487 transitions. [2024-11-10 17:32:56,327 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-10 17:32:56,327 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 14.0) internal successors, (56), 4 states have internal predecessors, (56), 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 56 [2024-11-10 17:32:56,328 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 17:32:56,330 INFO L225 Difference]: With dead ends: 1294 [2024-11-10 17:32:56,330 INFO L226 Difference]: Without dead ends: 1294 [2024-11-10 17:32:56,331 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 53 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-10 17:32:56,331 INFO L432 NwaCegarLoop]: 1070 mSDtfsCounter, 21 mSDsluCounter, 2108 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 3178 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-10 17:32:56,331 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 3178 Invalid, 44 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 17:32:56,333 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1294 states. [2024-11-10 17:32:56,341 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1294 to 1294. [2024-11-10 17:32:56,342 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1294 states, 833 states have (on average 1.7755102040816326) internal successors, (1479), 1288 states have internal predecessors, (1479), 5 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-10 17:32:56,344 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1294 states to 1294 states and 1487 transitions. [2024-11-10 17:32:56,344 INFO L78 Accepts]: Start accepts. Automaton has 1294 states and 1487 transitions. Word has length 56 [2024-11-10 17:32:56,344 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 17:32:56,344 INFO L471 AbstractCegarLoop]: Abstraction has 1294 states and 1487 transitions. [2024-11-10 17:32:56,344 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.0) internal successors, (56), 4 states have internal predecessors, (56), 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-10 17:32:56,344 INFO L276 IsEmpty]: Start isEmpty. Operand 1294 states and 1487 transitions. [2024-11-10 17:32:56,345 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2024-11-10 17:32:56,345 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 17:32:56,345 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] [2024-11-10 17:32:56,351 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-10 17:32:56,545 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-10 17:32:56,545 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr530REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 625 more)] === [2024-11-10 17:32:56,546 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 17:32:56,546 INFO L85 PathProgramCache]: Analyzing trace with hash 343401210, now seen corresponding path program 1 times [2024-11-10 17:32:56,546 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-10 17:32:56,546 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [628145459] [2024-11-10 17:32:56,546 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 17:32:56,546 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-10 17:32:56,546 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-10 17:32:56,549 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-10 17:32:56,550 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-10 17:32:56,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 17:32:56,803 INFO L255 TraceCheckSpWp]: Trace formula consists of 281 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-10 17:32:56,806 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 17:32:56,812 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-10 17:32:56,817 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-10 17:32:57,196 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-10 17:32:57,197 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-10 17:32:57,207 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2024-11-10 17:32:57,207 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-10 17:32:57,219 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-10 17:32:57,219 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-10 17:32:57,219 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-10 17:32:57,219 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [628145459] [2024-11-10 17:32:57,219 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [628145459] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 17:32:57,219 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 17:32:57,219 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-10 17:32:57,219 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [808394900] [2024-11-10 17:32:57,219 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 17:32:57,220 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-10 17:32:57,220 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-10 17:32:57,220 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-10 17:32:57,220 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-10 17:32:57,220 INFO L87 Difference]: Start difference. First operand 1294 states and 1487 transitions. Second operand has 4 states, 3 states have (on average 21.333333333333332) internal successors, (64), 4 states have internal predecessors, (64), 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-10 17:32:58,856 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 17:32:58,856 INFO L93 Difference]: Finished difference Result 1663 states and 1973 transitions. [2024-11-10 17:32:58,857 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-10 17:32:58,857 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 21.333333333333332) internal successors, (64), 4 states have internal predecessors, (64), 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 64 [2024-11-10 17:32:58,857 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 17:32:58,860 INFO L225 Difference]: With dead ends: 1663 [2024-11-10 17:32:58,860 INFO L226 Difference]: Without dead ends: 1663 [2024-11-10 17:32:58,861 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 61 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-10 17:32:58,861 INFO L432 NwaCegarLoop]: 534 mSDtfsCounter, 1082 mSDsluCounter, 325 mSDsCounter, 0 mSdLazyCounter, 1044 mSolverCounterSat, 41 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1085 SdHoareTripleChecker+Valid, 859 SdHoareTripleChecker+Invalid, 1085 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 41 IncrementalHoareTripleChecker+Valid, 1044 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2024-11-10 17:32:58,861 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1085 Valid, 859 Invalid, 1085 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [41 Valid, 1044 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2024-11-10 17:32:58,862 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1663 states. [2024-11-10 17:32:58,869 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1663 to 1217. [2024-11-10 17:32:58,870 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1217 states, 794 states have (on average 1.7191435768261965) internal successors, (1365), 1211 states have internal predecessors, (1365), 5 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-10 17:32:58,872 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1217 states to 1217 states and 1373 transitions. [2024-11-10 17:32:58,872 INFO L78 Accepts]: Start accepts. Automaton has 1217 states and 1373 transitions. Word has length 64 [2024-11-10 17:32:58,872 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 17:32:58,872 INFO L471 AbstractCegarLoop]: Abstraction has 1217 states and 1373 transitions. [2024-11-10 17:32:58,872 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 21.333333333333332) internal successors, (64), 4 states have internal predecessors, (64), 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-10 17:32:58,872 INFO L276 IsEmpty]: Start isEmpty. Operand 1217 states and 1373 transitions. [2024-11-10 17:32:58,873 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2024-11-10 17:32:58,873 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 17:32:58,873 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 17:32:58,880 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-10 17:32:59,073 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-10 17:32:59,074 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr523REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 625 more)] === [2024-11-10 17:32:59,074 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 17:32:59,074 INFO L85 PathProgramCache]: Analyzing trace with hash -1338919570, now seen corresponding path program 1 times [2024-11-10 17:32:59,074 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-10 17:32:59,074 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2097067998] [2024-11-10 17:32:59,074 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 17:32:59,075 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-10 17:32:59,075 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-10 17:32:59,076 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-10 17:32:59,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 (17)] Waiting until timeout for monitored process [2024-11-10 17:32:59,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 17:32:59,292 INFO L255 TraceCheckSpWp]: Trace formula consists of 308 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-11-10 17:32:59,294 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 17:32:59,302 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-10 17:32:59,322 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-10 17:32:59,344 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-10 17:32:59,358 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-10 17:32:59,360 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-10 17:32:59,361 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-10 17:32:59,361 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2097067998] [2024-11-10 17:32:59,361 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2097067998] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 17:32:59,361 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 17:32:59,361 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-10 17:32:59,361 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [933417859] [2024-11-10 17:32:59,361 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 17:32:59,362 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-10 17:32:59,362 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-10 17:32:59,362 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-10 17:32:59,362 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-10 17:32:59,362 INFO L87 Difference]: Start difference. First operand 1217 states and 1373 transitions. Second operand has 5 states, 4 states have (on average 17.25) internal successors, (69), 5 states have internal predecessors, (69), 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-10 17:33:00,940 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 17:33:00,941 INFO L93 Difference]: Finished difference Result 1216 states and 1372 transitions. [2024-11-10 17:33:00,941 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-10 17:33:00,941 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 17.25) internal successors, (69), 5 states have internal predecessors, (69), 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 69 [2024-11-10 17:33:00,941 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 17:33:00,944 INFO L225 Difference]: With dead ends: 1216 [2024-11-10 17:33:00,944 INFO L226 Difference]: Without dead ends: 1216 [2024-11-10 17:33:00,944 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 65 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-10 17:33:00,945 INFO L432 NwaCegarLoop]: 1043 mSDtfsCounter, 2 mSDsluCounter, 1652 mSDsCounter, 0 mSdLazyCounter, 1484 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 2695 SdHoareTripleChecker+Invalid, 1485 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 1484 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2024-11-10 17:33:00,945 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 2695 Invalid, 1485 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 1484 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2024-11-10 17:33:00,946 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1216 states. [2024-11-10 17:33:00,952 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1216 to 1216. [2024-11-10 17:33:00,953 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1216 states, 794 states have (on average 1.7178841309823678) internal successors, (1364), 1210 states have internal predecessors, (1364), 5 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-10 17:33:00,954 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1216 states to 1216 states and 1372 transitions. [2024-11-10 17:33:00,954 INFO L78 Accepts]: Start accepts. Automaton has 1216 states and 1372 transitions. Word has length 69 [2024-11-10 17:33:00,954 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 17:33:00,954 INFO L471 AbstractCegarLoop]: Abstraction has 1216 states and 1372 transitions. [2024-11-10 17:33:00,955 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 17.25) internal successors, (69), 5 states have internal predecessors, (69), 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-10 17:33:00,955 INFO L276 IsEmpty]: Start isEmpty. Operand 1216 states and 1372 transitions. [2024-11-10 17:33:00,955 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2024-11-10 17:33:00,955 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 17:33:00,955 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 17:33:00,962 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 (17)] Forceful destruction successful, exit code 0 [2024-11-10 17:33:01,159 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-10 17:33:01,160 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr524REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 625 more)] === [2024-11-10 17:33:01,164 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 17:33:01,164 INFO L85 PathProgramCache]: Analyzing trace with hash -1338919569, now seen corresponding path program 1 times [2024-11-10 17:33:01,165 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-10 17:33:01,165 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2081418536] [2024-11-10 17:33:01,165 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 17:33:01,165 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-10 17:33:01,165 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-10 17:33:01,166 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-10 17:33:01,168 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-10 17:33:01,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 17:33:01,383 INFO L255 TraceCheckSpWp]: Trace formula consists of 308 conjuncts, 12 conjuncts are in the unsatisfiable core [2024-11-10 17:33:01,386 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 17:33:01,392 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-10 17:33:01,417 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-10 17:33:01,422 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-10 17:33:01,460 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-10 17:33:01,475 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-10 17:33:01,475 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-10 17:33:01,475 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-10 17:33:01,475 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2081418536] [2024-11-10 17:33:01,475 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2081418536] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 17:33:01,475 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 17:33:01,475 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-10 17:33:01,476 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [242231864] [2024-11-10 17:33:01,476 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 17:33:01,476 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-10 17:33:01,476 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-10 17:33:01,476 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-10 17:33:01,477 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-10 17:33:01,477 INFO L87 Difference]: Start difference. First operand 1216 states and 1372 transitions. Second operand has 5 states, 4 states have (on average 17.25) internal successors, (69), 5 states have internal predecessors, (69), 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-10 17:33:03,373 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 17:33:03,373 INFO L93 Difference]: Finished difference Result 1215 states and 1371 transitions. [2024-11-10 17:33:03,373 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-10 17:33:03,373 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 17.25) internal successors, (69), 5 states have internal predecessors, (69), 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 69 [2024-11-10 17:33:03,373 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 17:33:03,376 INFO L225 Difference]: With dead ends: 1215 [2024-11-10 17:33:03,376 INFO L226 Difference]: Without dead ends: 1215 [2024-11-10 17:33:03,376 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 65 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-10 17:33:03,377 INFO L432 NwaCegarLoop]: 1043 mSDtfsCounter, 1 mSDsluCounter, 1726 mSDsCounter, 0 mSdLazyCounter, 1407 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 2769 SdHoareTripleChecker+Invalid, 1408 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 1407 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2024-11-10 17:33:03,377 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 2769 Invalid, 1408 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 1407 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2024-11-10 17:33:03,378 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1215 states. [2024-11-10 17:33:03,384 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1215 to 1215. [2024-11-10 17:33:03,385 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1215 states, 793 states have (on average 1.7187894073139975) internal successors, (1363), 1209 states have internal predecessors, (1363), 5 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-10 17:33:03,387 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1215 states to 1215 states and 1371 transitions. [2024-11-10 17:33:03,387 INFO L78 Accepts]: Start accepts. Automaton has 1215 states and 1371 transitions. Word has length 69 [2024-11-10 17:33:03,387 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 17:33:03,387 INFO L471 AbstractCegarLoop]: Abstraction has 1215 states and 1371 transitions. [2024-11-10 17:33:03,387 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 17.25) internal successors, (69), 5 states have internal predecessors, (69), 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-10 17:33:03,387 INFO L276 IsEmpty]: Start isEmpty. Operand 1215 states and 1371 transitions. [2024-11-10 17:33:03,387 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2024-11-10 17:33:03,387 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 17:33:03,388 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 17:33:03,395 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (18)] Forceful destruction successful, exit code 0 [2024-11-10 17:33:03,588 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-10 17:33:03,588 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr519REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 625 more)] === [2024-11-10 17:33:03,589 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 17:33:03,589 INFO L85 PathProgramCache]: Analyzing trace with hash -1403231317, now seen corresponding path program 1 times [2024-11-10 17:33:03,589 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-10 17:33:03,589 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [852558605] [2024-11-10 17:33:03,589 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 17:33:03,589 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-10 17:33:03,589 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-10 17:33:03,590 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-10 17:33:03,591 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (19)] Waiting until timeout for monitored process [2024-11-10 17:33:03,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 17:33:03,807 INFO L255 TraceCheckSpWp]: Trace formula consists of 334 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-10 17:33:03,808 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 17:33:03,824 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-10 17:33:03,824 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-10 17:33:03,824 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-10 17:33:03,824 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [852558605] [2024-11-10 17:33:03,824 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [852558605] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 17:33:03,824 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 17:33:03,824 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-10 17:33:03,825 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1812957130] [2024-11-10 17:33:03,825 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 17:33:03,825 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-10 17:33:03,827 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-10 17:33:03,828 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-10 17:33:03,828 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-10 17:33:03,829 INFO L87 Difference]: Start difference. First operand 1215 states and 1371 transitions. Second operand has 4 states, 4 states have (on average 18.75) internal successors, (75), 4 states have internal predecessors, (75), 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-10 17:33:03,858 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 17:33:03,859 INFO L93 Difference]: Finished difference Result 1218 states and 1375 transitions. [2024-11-10 17:33:03,859 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-10 17:33:03,859 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 18.75) internal successors, (75), 4 states have internal predecessors, (75), 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 77 [2024-11-10 17:33:03,860 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 17:33:03,865 INFO L225 Difference]: With dead ends: 1218 [2024-11-10 17:33:03,868 INFO L226 Difference]: Without dead ends: 1218 [2024-11-10 17:33:03,869 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 74 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-10 17:33:03,869 INFO L432 NwaCegarLoop]: 1043 mSDtfsCounter, 0 mSDsluCounter, 2081 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 3124 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-10 17:33:03,869 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 3124 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 17:33:03,871 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1218 states. [2024-11-10 17:33:03,886 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1218 to 1218. [2024-11-10 17:33:03,888 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1218 states, 795 states have (on average 1.7182389937106919) internal successors, (1366), 1212 states have internal predecessors, (1366), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2024-11-10 17:33:03,890 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1218 states to 1218 states and 1375 transitions. [2024-11-10 17:33:03,890 INFO L78 Accepts]: Start accepts. Automaton has 1218 states and 1375 transitions. Word has length 77 [2024-11-10 17:33:03,890 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 17:33:03,890 INFO L471 AbstractCegarLoop]: Abstraction has 1218 states and 1375 transitions. [2024-11-10 17:33:03,890 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 18.75) internal successors, (75), 4 states have internal predecessors, (75), 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-10 17:33:03,890 INFO L276 IsEmpty]: Start isEmpty. Operand 1218 states and 1375 transitions. [2024-11-10 17:33:03,891 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2024-11-10 17:33:03,891 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 17:33:03,891 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 17:33:03,898 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (19)] Ended with exit code 0 [2024-11-10 17:33:04,091 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-10 17:33:04,091 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr519REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 625 more)] === [2024-11-10 17:33:04,092 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 17:33:04,092 INFO L85 PathProgramCache]: Analyzing trace with hash 1449166374, now seen corresponding path program 1 times [2024-11-10 17:33:04,092 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-10 17:33:04,092 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1628727080] [2024-11-10 17:33:04,092 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 17:33:04,092 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-10 17:33:04,092 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-10 17:33:04,093 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-10 17:33:04,095 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (20)] Waiting until timeout for monitored process [2024-11-10 17:33:04,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 17:33:04,319 INFO L255 TraceCheckSpWp]: Trace formula consists of 345 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-10 17:33:04,321 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 17:33:04,340 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-10 17:33:04,340 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-10 17:33:04,384 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-10 17:33:04,384 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-10 17:33:04,384 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1628727080] [2024-11-10 17:33:04,384 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1628727080] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-10 17:33:04,385 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-10 17:33:04,385 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 8 [2024-11-10 17:33:04,385 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1007604078] [2024-11-10 17:33:04,385 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-10 17:33:04,385 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-10 17:33:04,385 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-10 17:33:04,386 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-10 17:33:04,386 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2024-11-10 17:33:04,386 INFO L87 Difference]: Start difference. First operand 1218 states and 1375 transitions. Second operand has 8 states, 8 states have (on average 10.0) internal successors, (80), 8 states have internal predecessors, (80), 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-10 17:33:04,483 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 17:33:04,484 INFO L93 Difference]: Finished difference Result 1230 states and 1392 transitions. [2024-11-10 17:33:04,485 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-10 17:33:04,485 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 10.0) internal successors, (80), 8 states have internal predecessors, (80), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 78 [2024-11-10 17:33:04,485 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 17:33:04,488 INFO L225 Difference]: With dead ends: 1230 [2024-11-10 17:33:04,489 INFO L226 Difference]: Without dead ends: 1230 [2024-11-10 17:33:04,489 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 157 GetRequests, 148 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-10 17:33:04,489 INFO L432 NwaCegarLoop]: 1043 mSDtfsCounter, 8 mSDsluCounter, 2084 mSDsCounter, 0 mSdLazyCounter, 52 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 3127 SdHoareTripleChecker+Invalid, 61 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 52 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-10 17:33:04,489 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 3127 Invalid, 61 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 52 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-10 17:33:04,491 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1230 states. [2024-11-10 17:33:04,500 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1230 to 1228. [2024-11-10 17:33:04,501 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1228 states, 804 states have (on average 1.7176616915422886) internal successors, (1381), 1221 states have internal predecessors, (1381), 5 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2024-11-10 17:33:04,502 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1228 states to 1228 states and 1390 transitions. [2024-11-10 17:33:04,502 INFO L78 Accepts]: Start accepts. Automaton has 1228 states and 1390 transitions. Word has length 78 [2024-11-10 17:33:04,502 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 17:33:04,502 INFO L471 AbstractCegarLoop]: Abstraction has 1228 states and 1390 transitions. [2024-11-10 17:33:04,503 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 10.0) internal successors, (80), 8 states have internal predecessors, (80), 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-10 17:33:04,503 INFO L276 IsEmpty]: Start isEmpty. Operand 1228 states and 1390 transitions. [2024-11-10 17:33:04,503 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2024-11-10 17:33:04,503 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 17:33:04,503 INFO L215 NwaCegarLoop]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 17:33:04,511 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (20)] Ended with exit code 0 [2024-11-10 17:33:04,704 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 20 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-10 17:33:04,704 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr519REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 625 more)] === [2024-11-10 17:33:04,704 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 17:33:04,704 INFO L85 PathProgramCache]: Analyzing trace with hash 495889003, now seen corresponding path program 2 times [2024-11-10 17:33:04,705 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-10 17:33:04,705 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [84183034] [2024-11-10 17:33:04,705 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-10 17:33:04,705 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-10 17:33:04,705 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-10 17:33:04,708 INFO L229 MonitoredProcess]: Starting monitored process 21 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-10 17:33:04,709 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (21)] Waiting until timeout for monitored process [2024-11-10 17:33:05,109 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-10 17:33:05,109 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-10 17:33:05,121 INFO L255 TraceCheckSpWp]: Trace formula consists of 378 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-11-10 17:33:05,123 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 17:33:05,158 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-10 17:33:05,158 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-10 17:33:05,251 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-10 17:33:05,251 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-10 17:33:05,251 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [84183034] [2024-11-10 17:33:05,251 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [84183034] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-10 17:33:05,251 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-10 17:33:05,251 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 14 [2024-11-10 17:33:05,251 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1025706058] [2024-11-10 17:33:05,251 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-10 17:33:05,252 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-11-10 17:33:05,252 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-10 17:33:05,252 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-11-10 17:33:05,252 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=121, Unknown=0, NotChecked=0, Total=182 [2024-11-10 17:33:05,252 INFO L87 Difference]: Start difference. First operand 1228 states and 1390 transitions. Second operand has 14 states, 14 states have (on average 6.142857142857143) internal successors, (86), 14 states have internal predecessors, (86), 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-10 17:33:05,545 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 17:33:05,546 INFO L93 Difference]: Finished difference Result 1243 states and 1412 transitions. [2024-11-10 17:33:05,546 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2024-11-10 17:33:05,546 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 6.142857142857143) internal successors, (86), 14 states have internal predecessors, (86), 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 81 [2024-11-10 17:33:05,547 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 17:33:05,549 INFO L225 Difference]: With dead ends: 1243 [2024-11-10 17:33:05,549 INFO L226 Difference]: Without dead ends: 1239 [2024-11-10 17:33:05,549 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 169 GetRequests, 148 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-10 17:33:05,550 INFO L432 NwaCegarLoop]: 1043 mSDtfsCounter, 8 mSDsluCounter, 9354 mSDsCounter, 0 mSdLazyCounter, 184 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 10397 SdHoareTripleChecker+Invalid, 192 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 184 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-10 17:33:05,550 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 10397 Invalid, 192 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 184 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-10 17:33:05,552 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1239 states. [2024-11-10 17:33:05,561 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1239 to 1237. [2024-11-10 17:33:05,565 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1237 states, 813 states have (on average 1.7134071340713408) internal successors, (1393), 1230 states have internal predecessors, (1393), 5 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2024-11-10 17:33:05,567 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1237 states to 1237 states and 1402 transitions. [2024-11-10 17:33:05,569 INFO L78 Accepts]: Start accepts. Automaton has 1237 states and 1402 transitions. Word has length 81 [2024-11-10 17:33:05,569 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 17:33:05,569 INFO L471 AbstractCegarLoop]: Abstraction has 1237 states and 1402 transitions. [2024-11-10 17:33:05,570 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 6.142857142857143) internal successors, (86), 14 states have internal predecessors, (86), 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-10 17:33:05,570 INFO L276 IsEmpty]: Start isEmpty. Operand 1237 states and 1402 transitions. [2024-11-10 17:33:05,570 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2024-11-10 17:33:05,572 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 17:33:05,572 INFO L215 NwaCegarLoop]: trace histogram [10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 17:33:05,582 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (21)] Ended with exit code 0 [2024-11-10 17:33:05,773 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-10 17:33:05,773 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr519REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 625 more)] === [2024-11-10 17:33:05,773 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 17:33:05,773 INFO L85 PathProgramCache]: Analyzing trace with hash -1087471477, now seen corresponding path program 3 times [2024-11-10 17:33:05,774 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-10 17:33:05,774 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2123105600] [2024-11-10 17:33:05,774 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-10 17:33:05,774 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-10 17:33:05,774 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-10 17:33:05,775 INFO L229 MonitoredProcess]: Starting monitored process 22 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-10 17:33:05,776 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (22)] Waiting until timeout for monitored process [2024-11-10 17:33:06,395 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2024-11-10 17:33:06,395 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-10 17:33:06,409 INFO L255 TraceCheckSpWp]: Trace formula consists of 444 conjuncts, 14 conjuncts are in the unsatisfiable core [2024-11-10 17:33:06,411 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 17:33:06,514 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-10 17:33:06,514 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-10 17:33:06,872 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-10 17:33:06,872 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-10 17:33:06,872 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2123105600] [2024-11-10 17:33:06,872 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2123105600] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-10 17:33:06,872 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-10 17:33:06,872 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 26 [2024-11-10 17:33:06,873 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1404053258] [2024-11-10 17:33:06,873 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-10 17:33:06,873 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2024-11-10 17:33:06,873 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-10 17:33:06,873 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2024-11-10 17:33:06,874 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=193, Invalid=457, Unknown=0, NotChecked=0, Total=650 [2024-11-10 17:33:06,875 INFO L87 Difference]: Start difference. First operand 1237 states and 1402 transitions. Second operand has 26 states, 26 states have (on average 3.769230769230769) internal successors, (98), 26 states have internal predecessors, (98), 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-10 17:33:08,046 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 17:33:08,047 INFO L93 Difference]: Finished difference Result 1261 states and 1441 transitions. [2024-11-10 17:33:08,047 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2024-11-10 17:33:08,047 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 26 states have (on average 3.769230769230769) internal successors, (98), 26 states have internal predecessors, (98), 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 87 [2024-11-10 17:33:08,047 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 17:33:08,049 INFO L225 Difference]: With dead ends: 1261 [2024-11-10 17:33:08,049 INFO L226 Difference]: Without dead ends: 1255 [2024-11-10 17:33:08,049 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 193 GetRequests, 148 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-10 17:33:08,050 INFO L432 NwaCegarLoop]: 1044 mSDtfsCounter, 21 mSDsluCounter, 15605 mSDsCounter, 0 mSdLazyCounter, 596 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 16649 SdHoareTripleChecker+Invalid, 615 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 596 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-10 17:33:08,050 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 16649 Invalid, 615 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 596 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-10 17:33:08,051 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1255 states. [2024-11-10 17:33:08,059 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1255 to 1255. [2024-11-10 17:33:08,059 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1255 states, 831 states have (on average 1.703971119133574) internal successors, (1416), 1248 states have internal predecessors, (1416), 5 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2024-11-10 17:33:08,061 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1255 states to 1255 states and 1425 transitions. [2024-11-10 17:33:08,061 INFO L78 Accepts]: Start accepts. Automaton has 1255 states and 1425 transitions. Word has length 87 [2024-11-10 17:33:08,061 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 17:33:08,061 INFO L471 AbstractCegarLoop]: Abstraction has 1255 states and 1425 transitions. [2024-11-10 17:33:08,062 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 26 states have (on average 3.769230769230769) internal successors, (98), 26 states have internal predecessors, (98), 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-10 17:33:08,062 INFO L276 IsEmpty]: Start isEmpty. Operand 1255 states and 1425 transitions. [2024-11-10 17:33:08,062 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2024-11-10 17:33:08,062 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 17:33:08,062 INFO L215 NwaCegarLoop]: trace histogram [22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 17:33:08,072 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 (22)] Ended with exit code 0 [2024-11-10 17:33:08,263 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 22 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -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-10 17:33:08,263 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr519REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 625 more)] === [2024-11-10 17:33:08,264 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 17:33:08,264 INFO L85 PathProgramCache]: Analyzing trace with hash 46982347, now seen corresponding path program 4 times [2024-11-10 17:33:08,264 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-10 17:33:08,264 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [49071857] [2024-11-10 17:33:08,264 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2024-11-10 17:33:08,264 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-10 17:33:08,265 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-10 17:33:08,265 INFO L229 MonitoredProcess]: Starting monitored process 23 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-10 17:33:08,266 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 (23)] Waiting until timeout for monitored process [2024-11-10 17:33:08,675 INFO L227 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2024-11-10 17:33:08,675 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-10 17:33:08,690 INFO L255 TraceCheckSpWp]: Trace formula consists of 576 conjuncts, 25 conjuncts are in the unsatisfiable core [2024-11-10 17:33:08,692 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 17:33:08,946 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-10 17:33:08,946 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-10 17:33:09,898 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-10 17:33:09,899 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-10 17:33:09,899 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [49071857] [2024-11-10 17:33:09,899 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [49071857] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-10 17:33:09,899 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-10 17:33:09,899 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 26] total 50 [2024-11-10 17:33:09,899 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [818448298] [2024-11-10 17:33:09,899 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-10 17:33:09,900 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 50 states [2024-11-10 17:33:09,900 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-10 17:33:09,900 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2024-11-10 17:33:09,901 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=672, Invalid=1778, Unknown=0, NotChecked=0, Total=2450 [2024-11-10 17:33:09,901 INFO L87 Difference]: Start difference. First operand 1255 states and 1425 transitions. Second operand has 50 states, 50 states have (on average 2.44) internal successors, (122), 50 states have internal predecessors, (122), 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-10 17:33:14,026 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 17:33:14,026 INFO L93 Difference]: Finished difference Result 1295 states and 1497 transitions. [2024-11-10 17:33:14,027 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 71 states. [2024-11-10 17:33:14,027 INFO L78 Accepts]: Start accepts. Automaton has has 50 states, 50 states have (on average 2.44) internal successors, (122), 50 states have internal predecessors, (122), 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 99 [2024-11-10 17:33:14,027 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 17:33:14,030 INFO L225 Difference]: With dead ends: 1295 [2024-11-10 17:33:14,030 INFO L226 Difference]: Without dead ends: 1291 [2024-11-10 17:33:14,031 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 239 GetRequests, 148 SyntacticMatches, 0 SemanticMatches, 91 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 465 ImplicationChecksByTransitivity, 3.4s TimeCoverageRelationStatistics Valid=2713, Invalid=5843, Unknown=0, NotChecked=0, Total=8556 [2024-11-10 17:33:14,032 INFO L432 NwaCegarLoop]: 1043 mSDtfsCounter, 43 mSDsluCounter, 23923 mSDsCounter, 0 mSdLazyCounter, 1931 mSolverCounterSat, 58 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 43 SdHoareTripleChecker+Valid, 24966 SdHoareTripleChecker+Invalid, 1989 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 58 IncrementalHoareTripleChecker+Valid, 1931 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2024-11-10 17:33:14,032 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [43 Valid, 24966 Invalid, 1989 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [58 Valid, 1931 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2024-11-10 17:33:14,033 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1291 states. [2024-11-10 17:33:14,046 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1291 to 1289. [2024-11-10 17:33:14,047 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1289 states, 865 states have (on average 1.6901734104046242) internal successors, (1462), 1282 states have internal predecessors, (1462), 5 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2024-11-10 17:33:14,048 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1289 states to 1289 states and 1471 transitions. [2024-11-10 17:33:14,048 INFO L78 Accepts]: Start accepts. Automaton has 1289 states and 1471 transitions. Word has length 99 [2024-11-10 17:33:14,048 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 17:33:14,049 INFO L471 AbstractCegarLoop]: Abstraction has 1289 states and 1471 transitions. [2024-11-10 17:33:14,049 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 50 states, 50 states have (on average 2.44) internal successors, (122), 50 states have internal predecessors, (122), 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-10 17:33:14,049 INFO L276 IsEmpty]: Start isEmpty. Operand 1289 states and 1471 transitions. [2024-11-10 17:33:14,049 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2024-11-10 17:33:14,049 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 17:33:14,049 INFO L215 NwaCegarLoop]: trace histogram [44, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 17:33:14,060 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 (23)] Forceful destruction successful, exit code 0 [2024-11-10 17:33:14,250 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 23 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -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-10 17:33:14,250 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr519REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 625 more)] === [2024-11-10 17:33:14,251 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 17:33:14,251 INFO L85 PathProgramCache]: Analyzing trace with hash 698994155, now seen corresponding path program 5 times [2024-11-10 17:33:14,251 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-10 17:33:14,251 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1640799296] [2024-11-10 17:33:14,251 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2024-11-10 17:33:14,251 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-10 17:33:14,251 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-10 17:33:14,254 INFO L229 MonitoredProcess]: Starting monitored process 24 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-10 17:33:14,255 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 (24)] Waiting until timeout for monitored process [2024-11-10 17:33:15,314 INFO L227 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 23 check-sat command(s) [2024-11-10 17:33:15,314 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-10 17:33:15,337 INFO L255 TraceCheckSpWp]: Trace formula consists of 818 conjuncts, 59 conjuncts are in the unsatisfiable core [2024-11-10 17:33:15,344 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 17:33:15,352 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-10 17:33:15,442 INFO L349 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2024-11-10 17:33:15,442 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 27 [2024-11-10 17:33:15,470 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-10 17:33:15,546 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 12 [2024-11-10 17:33:16,369 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-10 17:33:16,370 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 44 treesize of output 43 [2024-11-10 17:33:16,422 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 15 [2024-11-10 17:33:16,451 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-10 17:33:16,451 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-10 17:33:16,772 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-10 17:33:16,772 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1640799296] [2024-11-10 17:33:16,772 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1640799296] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 17:33:16,772 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1689532769] [2024-11-10 17:33:16,772 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2024-11-10 17:33:16,772 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-11-10 17:33:16,772 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2024-11-10 17:33:16,774 INFO L229 MonitoredProcess]: Starting monitored process 25 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-11-10 17:33:16,775 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (25)] Waiting until timeout for monitored process