./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/memsafety-broom/linux-list-middle-data.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 3289d67d 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/memsafety-broom/linux-list-middle-data.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-64bit-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 64bit --witnessprinter.graph.data.programhash 225e0f8ec8427769f807cb9abdb48fc1d5aa020788f9d77d633e751d0afad499 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.fs.icfgbuilder-eval-3289d67-m [2024-11-17 00:37:59,184 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-17 00:37:59,234 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-64bit-Automizer_Default.epf [2024-11-17 00:37:59,237 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-17 00:37:59,239 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-17 00:37:59,261 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-17 00:37:59,261 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-17 00:37:59,262 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-17 00:37:59,262 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-17 00:37:59,265 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-17 00:37:59,265 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-17 00:37:59,265 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-17 00:37:59,266 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-17 00:37:59,266 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-17 00:37:59,266 INFO L153 SettingsManager]: * Use SBE=true [2024-11-17 00:37:59,266 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-17 00:37:59,267 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-17 00:37:59,268 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-17 00:37:59,269 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-11-17 00:37:59,269 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-11-17 00:37:59,269 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-11-17 00:37:59,269 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-17 00:37:59,269 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-17 00:37:59,270 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-17 00:37:59,270 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-17 00:37:59,270 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-17 00:37:59,270 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-17 00:37:59,270 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-17 00:37:59,271 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-17 00:37:59,271 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-17 00:37:59,271 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-17 00:37:59,271 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-17 00:37:59,271 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-17 00:37:59,271 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-17 00:37:59,271 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-17 00:37:59,272 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-17 00:37:59,272 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-17 00:37:59,272 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-17 00:37:59,272 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-17 00:37:59,272 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 -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 225e0f8ec8427769f807cb9abdb48fc1d5aa020788f9d77d633e751d0afad499 [2024-11-17 00:37:59,465 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-17 00:37:59,492 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-17 00:37:59,495 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-17 00:37:59,496 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-17 00:37:59,496 INFO L274 PluginConnector]: CDTParser initialized [2024-11-17 00:37:59,497 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/memsafety-broom/linux-list-middle-data.i [2024-11-17 00:38:00,996 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-17 00:38:01,257 INFO L384 CDTParser]: Found 1 translation units. [2024-11-17 00:38:01,258 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/memsafety-broom/linux-list-middle-data.i [2024-11-17 00:38:01,282 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6161a34f8/5e19c6e806a9484db94a72a5a4a6462a/FLAG734dbf5c9 [2024-11-17 00:38:01,557 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6161a34f8/5e19c6e806a9484db94a72a5a4a6462a [2024-11-17 00:38:01,560 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-17 00:38:01,561 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-17 00:38:01,563 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-17 00:38:01,563 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-17 00:38:01,568 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-17 00:38:01,568 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.11 12:38:01" (1/1) ... [2024-11-17 00:38:01,569 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3e859b32 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 12:38:01, skipping insertion in model container [2024-11-17 00:38:01,569 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.11 12:38:01" (1/1) ... [2024-11-17 00:38:01,626 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-17 00:38:01,950 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-17 00:38:01,959 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-17 00:38:01,959 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver@39126fb8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 12:38:01, skipping insertion in model container [2024-11-17 00:38:01,959 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-17 00:38:01,960 INFO L186 ToolchainWalker]: Toolchain execution was canceled (user or tool) before executing de.uni_freiburg.informatik.ultimate.boogie.procedureinliner [2024-11-17 00:38:01,961 INFO L158 Benchmark]: Toolchain (without parser) took 399.53ms. Allocated memory is still 182.5MB. Free memory was 112.5MB in the beginning and 149.6MB in the end (delta: -37.1MB). Peak memory consumption was 17.4MB. Max. memory is 16.1GB. [2024-11-17 00:38:01,962 INFO L158 Benchmark]: CDTParser took 0.16ms. Allocated memory is still 104.9MB. Free memory is still 67.7MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-17 00:38:01,963 INFO L158 Benchmark]: CACSL2BoogieTranslator took 396.60ms. Allocated memory is still 182.5MB. Free memory was 112.3MB in the beginning and 149.6MB in the end (delta: -37.3MB). Peak memory consumption was 15.3MB. Max. memory is 16.1GB. [2024-11-17 00:38:01,964 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.16ms. Allocated memory is still 104.9MB. Free memory is still 67.7MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 396.60ms. Allocated memory is still 182.5MB. Free memory was 112.3MB in the beginning and 149.6MB in the end (delta: -37.3MB). Peak memory consumption was 15.3MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - UnsupportedSyntaxResult [Line: 2493]: 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/memsafety-broom/linux-list-middle-data.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-64bit-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 64bit --witnessprinter.graph.data.programhash 225e0f8ec8427769f807cb9abdb48fc1d5aa020788f9d77d633e751d0afad499 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.fs.icfgbuilder-eval-3289d67-m [2024-11-17 00:38:03,825 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-17 00:38:03,884 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-64bit-Automizer_Bitvector.epf [2024-11-17 00:38:03,889 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-17 00:38:03,889 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-17 00:38:03,916 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-17 00:38:03,918 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-17 00:38:03,919 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-17 00:38:03,919 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-17 00:38:03,922 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-17 00:38:03,923 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-17 00:38:03,923 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-17 00:38:03,923 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-17 00:38:03,924 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-17 00:38:03,924 INFO L153 SettingsManager]: * Use SBE=true [2024-11-17 00:38:03,924 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-17 00:38:03,924 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-17 00:38:03,924 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-17 00:38:03,924 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-11-17 00:38:03,924 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-11-17 00:38:03,925 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-11-17 00:38:03,925 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-17 00:38:03,926 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-17 00:38:03,927 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-17 00:38:03,927 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-17 00:38:03,927 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-17 00:38:03,927 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-17 00:38:03,927 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-17 00:38:03,928 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-17 00:38:03,928 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-17 00:38:03,928 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-17 00:38:03,928 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-17 00:38:03,928 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-17 00:38:03,928 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-17 00:38:03,928 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-17 00:38:03,929 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-17 00:38:03,929 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-17 00:38:03,929 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-17 00:38:03,929 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-17 00:38:03,929 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-17 00:38:03,929 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-17 00:38:03,930 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 225e0f8ec8427769f807cb9abdb48fc1d5aa020788f9d77d633e751d0afad499 [2024-11-17 00:38:04,186 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-17 00:38:04,213 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-17 00:38:04,217 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-17 00:38:04,218 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-17 00:38:04,218 INFO L274 PluginConnector]: CDTParser initialized [2024-11-17 00:38:04,219 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/memsafety-broom/linux-list-middle-data.i [2024-11-17 00:38:05,701 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-17 00:38:06,006 INFO L384 CDTParser]: Found 1 translation units. [2024-11-17 00:38:06,007 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/memsafety-broom/linux-list-middle-data.i [2024-11-17 00:38:06,037 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2ed30aecf/963818f6153245679160d11f0495f2b6/FLAG2af71dcfc [2024-11-17 00:38:06,067 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2ed30aecf/963818f6153245679160d11f0495f2b6 [2024-11-17 00:38:06,070 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-17 00:38:06,071 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-17 00:38:06,077 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-17 00:38:06,077 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-17 00:38:06,082 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-17 00:38:06,088 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.11 12:38:06" (1/1) ... [2024-11-17 00:38:06,089 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6760d300 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 12:38:06, skipping insertion in model container [2024-11-17 00:38:06,089 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.11 12:38:06" (1/1) ... [2024-11-17 00:38:06,158 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-17 00:38:06,536 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-17 00:38:06,553 INFO L197 MainTranslator]: Restarting translation with changed settings: SettingsChange [mNewPreferredMemoryModel=HoenickeLindenmann_1ByteResolution] [2024-11-17 00:38:06,569 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-17 00:38:06,623 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-17 00:38:06,629 INFO L200 MainTranslator]: Completed pre-run [2024-11-17 00:38:06,671 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-17 00:38:06,701 INFO L204 MainTranslator]: Completed translation [2024-11-17 00:38:06,702 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 12:38:06 WrapperNode [2024-11-17 00:38:06,702 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-17 00:38:06,703 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-17 00:38:06,703 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-17 00:38:06,703 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-17 00:38:06,707 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 12:38:06" (1/1) ... [2024-11-17 00:38:06,725 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 12:38:06" (1/1) ... [2024-11-17 00:38:06,748 INFO L138 Inliner]: procedures = 125, calls = 34, calls flagged for inlining = 10, calls inlined = 10, statements flattened = 102 [2024-11-17 00:38:06,751 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-17 00:38:06,752 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-17 00:38:06,752 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-17 00:38:06,752 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-17 00:38:06,759 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 12:38:06" (1/1) ... [2024-11-17 00:38:06,760 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 12:38:06" (1/1) ... [2024-11-17 00:38:06,765 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 12:38:06" (1/1) ... [2024-11-17 00:38:06,785 INFO L175 MemorySlicer]: Split 20 memory accesses to 1 slices as follows [20]. 100 percent of accesses are in the largest equivalence class. The 0 initializations are split as follows [0]. The 12 writes are split as follows [12]. [2024-11-17 00:38:06,789 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 12:38:06" (1/1) ... [2024-11-17 00:38:06,789 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 12:38:06" (1/1) ... [2024-11-17 00:38:06,797 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 12:38:06" (1/1) ... [2024-11-17 00:38:06,799 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 12:38:06" (1/1) ... [2024-11-17 00:38:06,800 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 12:38:06" (1/1) ... [2024-11-17 00:38:06,800 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 12:38:06" (1/1) ... [2024-11-17 00:38:06,802 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-17 00:38:06,803 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2024-11-17 00:38:06,803 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2024-11-17 00:38:06,803 INFO L274 PluginConnector]: IcfgBuilder initialized [2024-11-17 00:38:06,804 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 12:38:06" (1/1) ... [2024-11-17 00:38:06,809 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-17 00:38:06,818 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 00:38:06,831 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-17 00:38:06,834 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-17 00:38:06,867 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-11-17 00:38:06,867 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2024-11-17 00:38:06,867 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2024-11-17 00:38:06,867 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-17 00:38:06,868 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#0 [2024-11-17 00:38:06,868 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-17 00:38:06,868 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-17 00:38:06,983 INFO L256 CfgBuilder]: Building ICFG [2024-11-17 00:38:06,984 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-17 00:38:07,426 INFO L? ?]: Removed 145 outVars from TransFormulas that were not future-live. [2024-11-17 00:38:07,427 INFO L307 CfgBuilder]: Performing block encoding [2024-11-17 00:38:07,440 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-17 00:38:07,441 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-17 00:38:07,441 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.11 12:38:07 BoogieIcfgContainer [2024-11-17 00:38:07,441 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2024-11-17 00:38:07,443 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-17 00:38:07,444 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-17 00:38:07,446 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-17 00:38:07,447 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 17.11 12:38:06" (1/3) ... [2024-11-17 00:38:07,447 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3017b9f7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.11 12:38:07, skipping insertion in model container [2024-11-17 00:38:07,448 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 12:38:06" (2/3) ... [2024-11-17 00:38:07,448 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3017b9f7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.11 12:38:07, skipping insertion in model container [2024-11-17 00:38:07,449 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.11 12:38:07" (3/3) ... [2024-11-17 00:38:07,450 INFO L112 eAbstractionObserver]: Analyzing ICFG linux-list-middle-data.i [2024-11-17 00:38:07,463 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-17 00:38:07,464 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 47 error locations. [2024-11-17 00:38:07,503 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-17 00:38:07,509 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;@408073bb, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-17 00:38:07,511 INFO L334 AbstractCegarLoop]: Starting to check reachability of 47 error locations. [2024-11-17 00:38:07,515 INFO L276 IsEmpty]: Start isEmpty. Operand has 108 states, 60 states have (on average 1.9166666666666667) internal successors, (115), 107 states have internal predecessors, (115), 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-17 00:38:07,522 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2024-11-17 00:38:07,522 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 00:38:07,523 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2024-11-17 00:38:07,524 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr45REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 44 more)] === [2024-11-17 00:38:07,528 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 00:38:07,530 INFO L85 PathProgramCache]: Analyzing trace with hash 4647326, now seen corresponding path program 1 times [2024-11-17 00:38:07,540 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-17 00:38:07,540 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1046460642] [2024-11-17 00:38:07,541 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 00:38:07,541 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-17 00:38:07,542 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-17 00:38:07,544 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-17 00:38:07,547 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-17 00:38:07,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:38:07,626 INFO L255 TraceCheckSpWp]: Trace formula consists of 16 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-17 00:38:07,630 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-17 00:38:07,675 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-17 00:38:07,691 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-17 00:38:07,692 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-17 00:38:07,692 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-17 00:38:07,692 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1046460642] [2024-11-17 00:38:07,693 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1046460642] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 00:38:07,693 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 00:38:07,693 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-17 00:38:07,713 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [49118779] [2024-11-17 00:38:07,714 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 00:38:07,717 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-17 00:38:07,717 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-17 00:38:07,737 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-17 00:38:07,737 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-17 00:38:07,739 INFO L87 Difference]: Start difference. First operand has 108 states, 60 states have (on average 1.9166666666666667) internal successors, (115), 107 states have internal predecessors, (115), 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) Second operand has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 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-17 00:38:07,937 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 00:38:07,937 INFO L93 Difference]: Finished difference Result 106 states and 108 transitions. [2024-11-17 00:38:07,938 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-17 00:38:07,939 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 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 4 [2024-11-17 00:38:07,939 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 00:38:07,945 INFO L225 Difference]: With dead ends: 106 [2024-11-17 00:38:07,945 INFO L226 Difference]: Without dead ends: 103 [2024-11-17 00:38:07,946 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 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-17 00:38:07,949 INFO L432 NwaCegarLoop]: 87 mSDtfsCounter, 31 mSDsluCounter, 38 mSDsCounter, 0 mSdLazyCounter, 57 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 125 SdHoareTripleChecker+Invalid, 59 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 57 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-17 00:38:07,950 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [31 Valid, 125 Invalid, 59 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 57 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-17 00:38:07,961 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2024-11-17 00:38:07,973 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 103. [2024-11-17 00:38:07,975 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 103 states, 58 states have (on average 1.8103448275862069) internal successors, (105), 102 states have internal predecessors, (105), 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-17 00:38:07,977 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 105 transitions. [2024-11-17 00:38:07,978 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 105 transitions. Word has length 4 [2024-11-17 00:38:07,978 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 00:38:07,978 INFO L471 AbstractCegarLoop]: Abstraction has 103 states and 105 transitions. [2024-11-17 00:38:07,978 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 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-17 00:38:07,978 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 105 transitions. [2024-11-17 00:38:07,979 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2024-11-17 00:38:07,979 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 00:38:07,979 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2024-11-17 00:38:07,982 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-17 00:38:08,182 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-17 00:38:08,183 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr46REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 44 more)] === [2024-11-17 00:38:08,184 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 00:38:08,186 INFO L85 PathProgramCache]: Analyzing trace with hash 4647327, now seen corresponding path program 1 times [2024-11-17 00:38:08,187 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-17 00:38:08,187 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1760506972] [2024-11-17 00:38:08,188 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 00:38:08,188 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-17 00:38:08,189 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-17 00:38:08,192 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-17 00:38:08,195 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-17 00:38:08,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:38:08,230 INFO L255 TraceCheckSpWp]: Trace formula consists of 16 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-17 00:38:08,231 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-17 00:38:08,237 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-17 00:38:08,255 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-17 00:38:08,255 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-17 00:38:08,255 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-17 00:38:08,255 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1760506972] [2024-11-17 00:38:08,256 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1760506972] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 00:38:08,256 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 00:38:08,256 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-17 00:38:08,256 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1323121185] [2024-11-17 00:38:08,256 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 00:38:08,257 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-17 00:38:08,257 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-17 00:38:08,257 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-17 00:38:08,257 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-17 00:38:08,257 INFO L87 Difference]: Start difference. First operand 103 states and 105 transitions. Second operand has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 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-17 00:38:08,455 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 00:38:08,455 INFO L93 Difference]: Finished difference Result 104 states and 107 transitions. [2024-11-17 00:38:08,456 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-17 00:38:08,456 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 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 4 [2024-11-17 00:38:08,456 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 00:38:08,457 INFO L225 Difference]: With dead ends: 104 [2024-11-17 00:38:08,457 INFO L226 Difference]: Without dead ends: 104 [2024-11-17 00:38:08,457 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 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-17 00:38:08,458 INFO L432 NwaCegarLoop]: 99 mSDtfsCounter, 5 mSDsluCounter, 58 mSDsCounter, 0 mSdLazyCounter, 44 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 157 SdHoareTripleChecker+Invalid, 45 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 44 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-17 00:38:08,458 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 157 Invalid, 45 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 44 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-17 00:38:08,459 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2024-11-17 00:38:08,462 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 101. [2024-11-17 00:38:08,462 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 101 states, 58 states have (on average 1.7758620689655173) internal successors, (103), 100 states have internal predecessors, (103), 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-17 00:38:08,463 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 103 transitions. [2024-11-17 00:38:08,463 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 103 transitions. Word has length 4 [2024-11-17 00:38:08,463 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 00:38:08,463 INFO L471 AbstractCegarLoop]: Abstraction has 101 states and 103 transitions. [2024-11-17 00:38:08,464 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 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-17 00:38:08,464 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 103 transitions. [2024-11-17 00:38:08,464 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2024-11-17 00:38:08,464 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 00:38:08,464 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 00:38:08,467 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2024-11-17 00:38:08,664 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-17 00:38:08,665 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr41REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 44 more)] === [2024-11-17 00:38:08,666 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 00:38:08,670 INFO L85 PathProgramCache]: Analyzing trace with hash -420905844, now seen corresponding path program 1 times [2024-11-17 00:38:08,670 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-17 00:38:08,671 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [958994562] [2024-11-17 00:38:08,671 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 00:38:08,671 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-17 00:38:08,671 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-17 00:38:08,672 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-17 00:38:08,674 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-17 00:38:08,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:38:08,745 INFO L255 TraceCheckSpWp]: Trace formula consists of 53 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-17 00:38:08,746 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-17 00:38:08,758 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-17 00:38:08,762 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-17 00:38:08,762 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-17 00:38:08,762 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-17 00:38:08,762 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [958994562] [2024-11-17 00:38:08,762 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [958994562] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 00:38:08,762 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 00:38:08,762 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-17 00:38:08,762 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [983081345] [2024-11-17 00:38:08,762 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 00:38:08,763 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-17 00:38:08,763 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-17 00:38:08,763 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-17 00:38:08,763 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-17 00:38:08,763 INFO L87 Difference]: Start difference. First operand 101 states and 103 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-17 00:38:08,923 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 00:38:08,923 INFO L93 Difference]: Finished difference Result 99 states and 101 transitions. [2024-11-17 00:38:08,924 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-17 00:38:08,924 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-17 00:38:08,924 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 00:38:08,925 INFO L225 Difference]: With dead ends: 99 [2024-11-17 00:38:08,926 INFO L226 Difference]: Without dead ends: 99 [2024-11-17 00:38:08,927 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-17 00:38:08,928 INFO L432 NwaCegarLoop]: 96 mSDtfsCounter, 3 mSDsluCounter, 49 mSDsCounter, 0 mSdLazyCounter, 53 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 145 SdHoareTripleChecker+Invalid, 54 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 53 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-17 00:38:08,929 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 145 Invalid, 54 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 53 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-17 00:38:08,929 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2024-11-17 00:38:08,932 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 99. [2024-11-17 00:38:08,932 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 99 states, 58 states have (on average 1.7413793103448276) internal successors, (101), 98 states have internal predecessors, (101), 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-17 00:38:08,933 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 101 transitions. [2024-11-17 00:38:08,933 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 101 transitions. Word has length 9 [2024-11-17 00:38:08,933 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 00:38:08,933 INFO L471 AbstractCegarLoop]: Abstraction has 99 states and 101 transitions. [2024-11-17 00:38:08,934 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-17 00:38:08,934 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 101 transitions. [2024-11-17 00:38:08,934 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2024-11-17 00:38:08,934 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 00:38:08,934 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 00:38:08,940 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-17 00:38:09,134 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-17 00:38:09,135 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr42REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 44 more)] === [2024-11-17 00:38:09,136 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 00:38:09,138 INFO L85 PathProgramCache]: Analyzing trace with hash -420905843, now seen corresponding path program 1 times [2024-11-17 00:38:09,138 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-17 00:38:09,139 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1514358791] [2024-11-17 00:38:09,139 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 00:38:09,139 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-17 00:38:09,139 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-17 00:38:09,141 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-17 00:38:09,142 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-17 00:38:09,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:38:09,231 INFO L255 TraceCheckSpWp]: Trace formula consists of 53 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-17 00:38:09,233 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-17 00:38:09,240 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-17 00:38:09,261 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-17 00:38:09,261 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-17 00:38:09,262 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-17 00:38:09,262 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1514358791] [2024-11-17 00:38:09,262 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1514358791] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 00:38:09,262 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 00:38:09,262 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-17 00:38:09,262 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [703659267] [2024-11-17 00:38:09,262 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 00:38:09,263 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-17 00:38:09,263 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-17 00:38:09,263 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-17 00:38:09,263 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-17 00:38:09,264 INFO L87 Difference]: Start difference. First operand 99 states and 101 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-17 00:38:09,494 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 00:38:09,494 INFO L93 Difference]: Finished difference Result 97 states and 99 transitions. [2024-11-17 00:38:09,494 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-17 00:38:09,495 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-17 00:38:09,495 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 00:38:09,495 INFO L225 Difference]: With dead ends: 97 [2024-11-17 00:38:09,495 INFO L226 Difference]: Without dead ends: 97 [2024-11-17 00:38:09,496 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-17 00:38:09,496 INFO L432 NwaCegarLoop]: 96 mSDtfsCounter, 3 mSDsluCounter, 57 mSDsCounter, 0 mSdLazyCounter, 41 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 153 SdHoareTripleChecker+Invalid, 42 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 41 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-17 00:38:09,497 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 153 Invalid, 42 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 41 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-17 00:38:09,497 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2024-11-17 00:38:09,500 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 97. [2024-11-17 00:38:09,500 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 97 states, 58 states have (on average 1.706896551724138) internal successors, (99), 96 states have internal predecessors, (99), 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-17 00:38:09,501 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 99 transitions. [2024-11-17 00:38:09,501 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 99 transitions. Word has length 9 [2024-11-17 00:38:09,501 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 00:38:09,501 INFO L471 AbstractCegarLoop]: Abstraction has 97 states and 99 transitions. [2024-11-17 00:38:09,501 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-17 00:38:09,501 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 99 transitions. [2024-11-17 00:38:09,501 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2024-11-17 00:38:09,501 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 00:38:09,501 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 00:38:09,518 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Ended with exit code 0 [2024-11-17 00:38:09,702 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-17 00:38:09,702 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr27REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 44 more)] === [2024-11-17 00:38:09,703 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 00:38:09,703 INFO L85 PathProgramCache]: Analyzing trace with hash -763671469, now seen corresponding path program 1 times [2024-11-17 00:38:09,703 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-17 00:38:09,703 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [832078612] [2024-11-17 00:38:09,703 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 00:38:09,704 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-17 00:38:09,704 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-17 00:38:09,707 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-17 00:38:09,708 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-17 00:38:09,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:38:09,767 INFO L255 TraceCheckSpWp]: Trace formula consists of 53 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-11-17 00:38:09,779 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-17 00:38:09,785 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-17 00:38:09,818 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-17 00:38:09,819 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-17 00:38:09,819 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-17 00:38:09,819 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [832078612] [2024-11-17 00:38:09,819 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [832078612] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 00:38:09,819 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 00:38:09,819 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-17 00:38:09,820 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2051786325] [2024-11-17 00:38:09,820 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 00:38:09,820 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-17 00:38:09,820 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-17 00:38:09,820 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-17 00:38:09,820 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-17 00:38:09,820 INFO L87 Difference]: Start difference. First operand 97 states and 99 transitions. Second operand has 5 states, 4 states have (on average 2.75) internal successors, (11), 5 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 00:38:10,102 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 00:38:10,102 INFO L93 Difference]: Finished difference Result 96 states and 98 transitions. [2024-11-17 00:38:10,103 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-17 00:38:10,103 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 2.75) internal successors, (11), 5 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2024-11-17 00:38:10,103 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 00:38:10,103 INFO L225 Difference]: With dead ends: 96 [2024-11-17 00:38:10,103 INFO L226 Difference]: Without dead ends: 96 [2024-11-17 00:38:10,104 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-17 00:38:10,104 INFO L432 NwaCegarLoop]: 74 mSDtfsCounter, 31 mSDsluCounter, 122 mSDsCounter, 0 mSdLazyCounter, 155 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 196 SdHoareTripleChecker+Invalid, 156 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 155 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-17 00:38:10,104 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [31 Valid, 196 Invalid, 156 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 155 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-17 00:38:10,105 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2024-11-17 00:38:10,107 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 96. [2024-11-17 00:38:10,107 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 96 states, 58 states have (on average 1.6896551724137931) internal successors, (98), 95 states have internal predecessors, (98), 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-17 00:38:10,108 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 98 transitions. [2024-11-17 00:38:10,108 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 98 transitions. Word has length 11 [2024-11-17 00:38:10,108 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 00:38:10,108 INFO L471 AbstractCegarLoop]: Abstraction has 96 states and 98 transitions. [2024-11-17 00:38:10,108 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 2.75) internal successors, (11), 5 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 00:38:10,108 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 98 transitions. [2024-11-17 00:38:10,109 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2024-11-17 00:38:10,109 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 00:38:10,109 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 00:38:10,116 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-17 00:38:10,309 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-17 00:38:10,310 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr28REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 44 more)] === [2024-11-17 00:38:10,310 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 00:38:10,310 INFO L85 PathProgramCache]: Analyzing trace with hash -763671468, now seen corresponding path program 1 times [2024-11-17 00:38:10,311 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-17 00:38:10,311 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1538962440] [2024-11-17 00:38:10,311 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 00:38:10,311 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-17 00:38:10,311 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-17 00:38:10,312 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-17 00:38:10,313 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-17 00:38:10,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:38:10,358 INFO L255 TraceCheckSpWp]: Trace formula consists of 53 conjuncts, 12 conjuncts are in the unsatisfiable core [2024-11-17 00:38:10,360 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-17 00:38:10,366 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-17 00:38:10,425 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-17 00:38:10,426 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-17 00:38:10,426 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-17 00:38:10,426 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1538962440] [2024-11-17 00:38:10,426 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1538962440] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 00:38:10,426 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 00:38:10,426 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-17 00:38:10,426 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2120078740] [2024-11-17 00:38:10,427 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 00:38:10,427 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-17 00:38:10,427 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-17 00:38:10,437 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-17 00:38:10,437 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-17 00:38:10,437 INFO L87 Difference]: Start difference. First operand 96 states and 98 transitions. Second operand has 5 states, 4 states have (on average 2.75) internal successors, (11), 5 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 00:38:10,720 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 00:38:10,720 INFO L93 Difference]: Finished difference Result 109 states and 113 transitions. [2024-11-17 00:38:10,721 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-17 00:38:10,721 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 2.75) internal successors, (11), 5 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2024-11-17 00:38:10,721 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 00:38:10,721 INFO L225 Difference]: With dead ends: 109 [2024-11-17 00:38:10,721 INFO L226 Difference]: Without dead ends: 109 [2024-11-17 00:38:10,722 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-17 00:38:10,722 INFO L432 NwaCegarLoop]: 88 mSDtfsCounter, 9 mSDsluCounter, 164 mSDsCounter, 0 mSdLazyCounter, 135 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 252 SdHoareTripleChecker+Invalid, 135 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 135 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-17 00:38:10,722 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 252 Invalid, 135 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 135 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-17 00:38:10,723 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2024-11-17 00:38:10,727 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 101. [2024-11-17 00:38:10,727 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 101 states, 63 states have (on average 1.6507936507936507) internal successors, (104), 100 states have internal predecessors, (104), 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-17 00:38:10,728 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 104 transitions. [2024-11-17 00:38:10,728 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 104 transitions. Word has length 11 [2024-11-17 00:38:10,729 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 00:38:10,729 INFO L471 AbstractCegarLoop]: Abstraction has 101 states and 104 transitions. [2024-11-17 00:38:10,729 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 2.75) internal successors, (11), 5 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 00:38:10,729 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 104 transitions. [2024-11-17 00:38:10,729 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2024-11-17 00:38:10,729 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 00:38:10,729 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 00:38:10,739 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-17 00:38:10,929 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-17 00:38:10,930 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr37REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 44 more)] === [2024-11-17 00:38:10,930 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 00:38:10,931 INFO L85 PathProgramCache]: Analyzing trace with hash 631319622, now seen corresponding path program 1 times [2024-11-17 00:38:10,931 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-17 00:38:10,931 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [520097856] [2024-11-17 00:38:10,931 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 00:38:10,931 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-17 00:38:10,931 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-17 00:38:10,932 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-17 00:38:10,937 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-17 00:38:11,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:38:11,053 INFO L255 TraceCheckSpWp]: Trace formula consists of 106 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-11-17 00:38:11,055 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-17 00:38:11,059 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-17 00:38:11,089 INFO L349 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2024-11-17 00:38:11,089 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 20 [2024-11-17 00:38:11,113 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-17 00:38:11,113 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-17 00:38:11,113 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-17 00:38:11,113 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [520097856] [2024-11-17 00:38:11,114 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [520097856] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 00:38:11,114 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 00:38:11,114 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-17 00:38:11,114 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1859633656] [2024-11-17 00:38:11,114 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 00:38:11,114 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-17 00:38:11,114 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-17 00:38:11,115 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-17 00:38:11,115 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-17 00:38:11,115 INFO L87 Difference]: Start difference. First operand 101 states and 104 transitions. Second operand has 4 states, 3 states have (on average 4.333333333333333) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 00:38:11,316 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 00:38:11,316 INFO L93 Difference]: Finished difference Result 100 states and 103 transitions. [2024-11-17 00:38:11,317 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-17 00:38:11,317 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 4.333333333333333) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2024-11-17 00:38:11,317 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 00:38:11,317 INFO L225 Difference]: With dead ends: 100 [2024-11-17 00:38:11,317 INFO L226 Difference]: Without dead ends: 100 [2024-11-17 00:38:11,318 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 9 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-17 00:38:11,318 INFO L432 NwaCegarLoop]: 79 mSDtfsCounter, 20 mSDsluCounter, 85 mSDsCounter, 0 mSdLazyCounter, 96 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 164 SdHoareTripleChecker+Invalid, 96 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 96 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-17 00:38:11,318 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 164 Invalid, 96 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 96 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-17 00:38:11,319 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2024-11-17 00:38:11,322 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 100. [2024-11-17 00:38:11,323 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 100 states, 63 states have (on average 1.6349206349206349) internal successors, (103), 99 states have internal predecessors, (103), 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-17 00:38:11,323 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 103 transitions. [2024-11-17 00:38:11,323 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 103 transitions. Word has length 13 [2024-11-17 00:38:11,323 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 00:38:11,323 INFO L471 AbstractCegarLoop]: Abstraction has 100 states and 103 transitions. [2024-11-17 00:38:11,323 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 4.333333333333333) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 00:38:11,323 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 103 transitions. [2024-11-17 00:38:11,324 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2024-11-17 00:38:11,324 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 00:38:11,324 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 00:38:11,333 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Forceful destruction successful, exit code 0 [2024-11-17 00:38:11,524 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-17 00:38:11,524 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr38REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 44 more)] === [2024-11-17 00:38:11,526 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 00:38:11,527 INFO L85 PathProgramCache]: Analyzing trace with hash 631319623, now seen corresponding path program 1 times [2024-11-17 00:38:11,527 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-17 00:38:11,527 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2004313505] [2024-11-17 00:38:11,528 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 00:38:11,529 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-17 00:38:11,529 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-17 00:38:11,531 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-17 00:38:11,532 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-17 00:38:11,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:38:11,646 INFO L255 TraceCheckSpWp]: Trace formula consists of 106 conjuncts, 12 conjuncts are in the unsatisfiable core [2024-11-17 00:38:11,648 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-17 00:38:11,655 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-17 00:38:11,659 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-17 00:38:11,730 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-17 00:38:11,731 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-17 00:38:11,739 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2024-11-17 00:38:11,739 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-17 00:38:11,773 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-17 00:38:11,773 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-17 00:38:11,774 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-17 00:38:11,774 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2004313505] [2024-11-17 00:38:11,774 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2004313505] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 00:38:11,774 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 00:38:11,774 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-17 00:38:11,774 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [332165556] [2024-11-17 00:38:11,774 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 00:38:11,774 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-17 00:38:11,774 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-17 00:38:11,774 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-17 00:38:11,774 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-17 00:38:11,775 INFO L87 Difference]: Start difference. First operand 100 states and 103 transitions. Second operand has 5 states, 4 states have (on average 3.25) internal successors, (13), 5 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 00:38:12,157 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 00:38:12,157 INFO L93 Difference]: Finished difference Result 99 states and 102 transitions. [2024-11-17 00:38:12,160 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-17 00:38:12,160 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 3.25) internal successors, (13), 5 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2024-11-17 00:38:12,161 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 00:38:12,161 INFO L225 Difference]: With dead ends: 99 [2024-11-17 00:38:12,161 INFO L226 Difference]: Without dead ends: 99 [2024-11-17 00:38:12,161 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-11-17 00:38:12,161 INFO L432 NwaCegarLoop]: 75 mSDtfsCounter, 40 mSDsluCounter, 95 mSDsCounter, 0 mSdLazyCounter, 88 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 40 SdHoareTripleChecker+Valid, 170 SdHoareTripleChecker+Invalid, 89 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 88 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-17 00:38:12,162 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [40 Valid, 170 Invalid, 89 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 88 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-17 00:38:12,162 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2024-11-17 00:38:12,168 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 99. [2024-11-17 00:38:12,169 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 99 states, 63 states have (on average 1.619047619047619) internal successors, (102), 98 states have internal predecessors, (102), 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-17 00:38:12,169 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 102 transitions. [2024-11-17 00:38:12,169 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 102 transitions. Word has length 13 [2024-11-17 00:38:12,169 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 00:38:12,169 INFO L471 AbstractCegarLoop]: Abstraction has 99 states and 102 transitions. [2024-11-17 00:38:12,169 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 3.25) internal successors, (13), 5 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 00:38:12,169 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 102 transitions. [2024-11-17 00:38:12,170 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2024-11-17 00:38:12,170 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 00:38:12,170 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 00:38:12,176 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Forceful destruction successful, exit code 0 [2024-11-17 00:38:12,370 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-17 00:38:12,372 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr35REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 44 more)] === [2024-11-17 00:38:12,372 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 00:38:12,372 INFO L85 PathProgramCache]: Analyzing trace with hash 1107769987, now seen corresponding path program 1 times [2024-11-17 00:38:12,373 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-17 00:38:12,373 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [186955425] [2024-11-17 00:38:12,373 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 00:38:12,373 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-17 00:38:12,373 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-17 00:38:12,375 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-17 00:38:12,376 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-17 00:38:12,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:38:12,555 INFO L255 TraceCheckSpWp]: Trace formula consists of 124 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-17 00:38:12,559 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-17 00:38:12,593 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-17 00:38:12,593 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-17 00:38:12,593 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-17 00:38:12,595 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [186955425] [2024-11-17 00:38:12,595 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [186955425] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 00:38:12,595 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 00:38:12,595 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-17 00:38:12,595 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [753322754] [2024-11-17 00:38:12,595 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 00:38:12,596 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-17 00:38:12,596 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-17 00:38:12,596 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-17 00:38:12,596 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-17 00:38:12,596 INFO L87 Difference]: Start difference. First operand 99 states and 102 transitions. Second operand has 4 states, 3 states have (on average 5.0) internal successors, (15), 4 states have internal predecessors, (15), 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-17 00:38:12,939 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 00:38:12,939 INFO L93 Difference]: Finished difference Result 98 states and 101 transitions. [2024-11-17 00:38:12,939 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-17 00:38:12,939 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 5.0) internal successors, (15), 4 states have internal predecessors, (15), 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 15 [2024-11-17 00:38:12,939 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 00:38:12,940 INFO L225 Difference]: With dead ends: 98 [2024-11-17 00:38:12,940 INFO L226 Difference]: Without dead ends: 98 [2024-11-17 00:38:12,940 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 12 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-17 00:38:12,940 INFO L432 NwaCegarLoop]: 90 mSDtfsCounter, 3 mSDsluCounter, 96 mSDsCounter, 0 mSdLazyCounter, 94 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 186 SdHoareTripleChecker+Invalid, 94 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 94 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-17 00:38:12,941 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 186 Invalid, 94 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 94 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-17 00:38:12,941 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2024-11-17 00:38:12,942 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 98. [2024-11-17 00:38:12,943 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 98 states, 63 states have (on average 1.6031746031746033) internal successors, (101), 97 states have internal predecessors, (101), 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-17 00:38:12,943 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 101 transitions. [2024-11-17 00:38:12,943 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 101 transitions. Word has length 15 [2024-11-17 00:38:12,944 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 00:38:12,944 INFO L471 AbstractCegarLoop]: Abstraction has 98 states and 101 transitions. [2024-11-17 00:38:12,944 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 5.0) internal successors, (15), 4 states have internal predecessors, (15), 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-17 00:38:12,944 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 101 transitions. [2024-11-17 00:38:12,944 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2024-11-17 00:38:12,944 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 00:38:12,945 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 00:38:12,957 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-17 00:38:13,145 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-17 00:38:13,145 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr36REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 44 more)] === [2024-11-17 00:38:13,146 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 00:38:13,146 INFO L85 PathProgramCache]: Analyzing trace with hash 1107769988, now seen corresponding path program 1 times [2024-11-17 00:38:13,146 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-17 00:38:13,146 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1076114693] [2024-11-17 00:38:13,146 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 00:38:13,146 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-17 00:38:13,146 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-17 00:38:13,149 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-17 00:38:13,151 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-17 00:38:13,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:38:13,269 INFO L255 TraceCheckSpWp]: Trace formula consists of 124 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-11-17 00:38:13,271 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-17 00:38:13,366 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-17 00:38:13,366 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-17 00:38:13,367 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-17 00:38:13,367 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1076114693] [2024-11-17 00:38:13,367 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1076114693] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 00:38:13,367 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 00:38:13,367 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-17 00:38:13,367 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [16205142] [2024-11-17 00:38:13,367 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 00:38:13,368 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-17 00:38:13,368 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-17 00:38:13,369 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-17 00:38:13,370 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-17 00:38:13,371 INFO L87 Difference]: Start difference. First operand 98 states and 101 transitions. Second operand has 6 states, 5 states have (on average 3.0) internal successors, (15), 6 states have internal predecessors, (15), 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-17 00:38:13,655 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 00:38:13,656 INFO L93 Difference]: Finished difference Result 97 states and 100 transitions. [2024-11-17 00:38:13,657 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-17 00:38:13,657 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 3.0) internal successors, (15), 6 states have internal predecessors, (15), 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 15 [2024-11-17 00:38:13,657 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 00:38:13,657 INFO L225 Difference]: With dead ends: 97 [2024-11-17 00:38:13,657 INFO L226 Difference]: Without dead ends: 97 [2024-11-17 00:38:13,658 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2024-11-17 00:38:13,658 INFO L432 NwaCegarLoop]: 85 mSDtfsCounter, 19 mSDsluCounter, 203 mSDsCounter, 0 mSdLazyCounter, 57 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 288 SdHoareTripleChecker+Invalid, 57 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 57 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-17 00:38:13,658 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [19 Valid, 288 Invalid, 57 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 57 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-17 00:38:13,659 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2024-11-17 00:38:13,660 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 97. [2024-11-17 00:38:13,660 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 97 states, 63 states have (on average 1.5873015873015872) internal successors, (100), 96 states have internal predecessors, (100), 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-17 00:38:13,664 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 100 transitions. [2024-11-17 00:38:13,665 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 100 transitions. Word has length 15 [2024-11-17 00:38:13,665 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 00:38:13,665 INFO L471 AbstractCegarLoop]: Abstraction has 97 states and 100 transitions. [2024-11-17 00:38:13,665 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 3.0) internal successors, (15), 6 states have internal predecessors, (15), 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-17 00:38:13,665 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 100 transitions. [2024-11-17 00:38:13,665 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2024-11-17 00:38:13,666 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 00:38:13,666 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 00:38:13,678 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Forceful destruction successful, exit code 0 [2024-11-17 00:38:13,866 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-17 00:38:13,866 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr23REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 44 more)] === [2024-11-17 00:38:13,867 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 00:38:13,867 INFO L85 PathProgramCache]: Analyzing trace with hash -1029015440, now seen corresponding path program 1 times [2024-11-17 00:38:13,867 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-17 00:38:13,867 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1083954508] [2024-11-17 00:38:13,868 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 00:38:13,868 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-17 00:38:13,868 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-17 00:38:13,870 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-17 00:38:13,876 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (12)] Waiting until timeout for monitored process [2024-11-17 00:38:13,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:38:13,942 INFO L255 TraceCheckSpWp]: Trace formula consists of 68 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-11-17 00:38:13,944 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-17 00:38:13,947 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2024-11-17 00:38:14,002 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-17 00:38:14,002 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-17 00:38:14,002 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-17 00:38:14,003 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1083954508] [2024-11-17 00:38:14,003 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1083954508] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 00:38:14,003 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 00:38:14,003 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-17 00:38:14,003 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [553825797] [2024-11-17 00:38:14,003 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 00:38:14,003 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-17 00:38:14,003 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-17 00:38:14,004 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-17 00:38:14,004 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-17 00:38:14,004 INFO L87 Difference]: Start difference. First operand 97 states and 100 transitions. Second operand has 6 states, 5 states have (on average 3.2) internal successors, (16), 6 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-17 00:38:14,374 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 00:38:14,374 INFO L93 Difference]: Finished difference Result 131 states and 136 transitions. [2024-11-17 00:38:14,374 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-17 00:38:14,374 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 3.2) internal successors, (16), 6 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-17 00:38:14,375 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 00:38:14,375 INFO L225 Difference]: With dead ends: 131 [2024-11-17 00:38:14,375 INFO L226 Difference]: Without dead ends: 131 [2024-11-17 00:38:14,375 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-17 00:38:14,376 INFO L432 NwaCegarLoop]: 48 mSDtfsCounter, 65 mSDsluCounter, 145 mSDsCounter, 0 mSdLazyCounter, 226 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 65 SdHoareTripleChecker+Valid, 193 SdHoareTripleChecker+Invalid, 228 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 226 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-17 00:38:14,376 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [65 Valid, 193 Invalid, 228 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 226 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-17 00:38:14,376 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 131 states. [2024-11-17 00:38:14,378 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 131 to 101. [2024-11-17 00:38:14,378 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 101 states, 68 states have (on average 1.5735294117647058) internal successors, (107), 100 states have internal predecessors, (107), 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-17 00:38:14,378 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 107 transitions. [2024-11-17 00:38:14,378 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 107 transitions. Word has length 16 [2024-11-17 00:38:14,379 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 00:38:14,379 INFO L471 AbstractCegarLoop]: Abstraction has 101 states and 107 transitions. [2024-11-17 00:38:14,379 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 3.2) internal successors, (16), 6 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-17 00:38:14,379 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 107 transitions. [2024-11-17 00:38:14,379 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2024-11-17 00:38:14,379 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 00:38:14,379 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 00:38:14,383 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-17 00:38:14,580 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-17 00:38:14,580 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr24REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 44 more)] === [2024-11-17 00:38:14,580 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 00:38:14,580 INFO L85 PathProgramCache]: Analyzing trace with hash -1029015439, now seen corresponding path program 1 times [2024-11-17 00:38:14,580 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-17 00:38:14,581 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1025245076] [2024-11-17 00:38:14,581 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 00:38:14,581 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-17 00:38:14,581 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-17 00:38:14,585 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-17 00:38:14,586 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (13)] Waiting until timeout for monitored process [2024-11-17 00:38:14,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:38:14,671 INFO L255 TraceCheckSpWp]: Trace formula consists of 68 conjuncts, 12 conjuncts are in the unsatisfiable core [2024-11-17 00:38:14,673 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-17 00:38:14,686 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-17 00:38:14,825 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-17 00:38:14,825 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-17 00:38:14,825 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-17 00:38:14,825 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1025245076] [2024-11-17 00:38:14,825 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1025245076] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 00:38:14,825 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 00:38:14,825 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-17 00:38:14,826 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1992320019] [2024-11-17 00:38:14,826 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 00:38:14,826 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-17 00:38:14,826 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-17 00:38:14,826 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-17 00:38:14,826 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-17 00:38:14,826 INFO L87 Difference]: Start difference. First operand 101 states and 107 transitions. Second operand has 6 states, 5 states have (on average 3.2) internal successors, (16), 6 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-17 00:38:15,334 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 00:38:15,334 INFO L93 Difference]: Finished difference Result 154 states and 163 transitions. [2024-11-17 00:38:15,335 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-17 00:38:15,335 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 3.2) internal successors, (16), 6 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-17 00:38:15,335 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 00:38:15,336 INFO L225 Difference]: With dead ends: 154 [2024-11-17 00:38:15,336 INFO L226 Difference]: Without dead ends: 154 [2024-11-17 00:38:15,336 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-17 00:38:15,336 INFO L432 NwaCegarLoop]: 64 mSDtfsCounter, 47 mSDsluCounter, 194 mSDsCounter, 0 mSdLazyCounter, 202 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 47 SdHoareTripleChecker+Valid, 258 SdHoareTripleChecker+Invalid, 203 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 202 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-17 00:38:15,336 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [47 Valid, 258 Invalid, 203 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 202 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-17 00:38:15,337 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 154 states. [2024-11-17 00:38:15,338 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 154 to 133. [2024-11-17 00:38:15,338 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 133 states, 100 states have (on average 1.63) internal successors, (163), 132 states have internal predecessors, (163), 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-17 00:38:15,341 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 133 states and 163 transitions. [2024-11-17 00:38:15,342 INFO L78 Accepts]: Start accepts. Automaton has 133 states and 163 transitions. Word has length 16 [2024-11-17 00:38:15,342 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 00:38:15,342 INFO L471 AbstractCegarLoop]: Abstraction has 133 states and 163 transitions. [2024-11-17 00:38:15,342 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 3.2) internal successors, (16), 6 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-17 00:38:15,342 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 163 transitions. [2024-11-17 00:38:15,342 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2024-11-17 00:38:15,343 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 00:38:15,343 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 00:38:15,347 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (13)] Forceful destruction successful, exit code 0 [2024-11-17 00:38:15,546 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-17 00:38:15,546 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr25REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 44 more)] === [2024-11-17 00:38:15,547 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 00:38:15,547 INFO L85 PathProgramCache]: Analyzing trace with hash -1029013358, now seen corresponding path program 1 times [2024-11-17 00:38:15,547 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-17 00:38:15,547 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [998794335] [2024-11-17 00:38:15,547 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 00:38:15,547 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-17 00:38:15,547 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-17 00:38:15,548 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-17 00:38:15,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 (14)] Waiting until timeout for monitored process [2024-11-17 00:38:15,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:38:15,625 INFO L255 TraceCheckSpWp]: Trace formula consists of 72 conjuncts, 17 conjuncts are in the unsatisfiable core [2024-11-17 00:38:15,627 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-17 00:38:15,630 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-17 00:38:15,645 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 11 treesize of output 7 [2024-11-17 00:38:15,661 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 11 [2024-11-17 00:38:15,720 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 15 treesize of output 7 [2024-11-17 00:38:15,746 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-17 00:38:15,747 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-17 00:38:15,747 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-17 00:38:15,747 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [998794335] [2024-11-17 00:38:15,747 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [998794335] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 00:38:15,747 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 00:38:15,747 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-17 00:38:15,747 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [223210659] [2024-11-17 00:38:15,747 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 00:38:15,748 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-17 00:38:15,748 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-17 00:38:15,748 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-17 00:38:15,748 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2024-11-17 00:38:15,748 INFO L87 Difference]: Start difference. First operand 133 states and 163 transitions. Second operand has 8 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 8 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-17 00:38:16,262 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 00:38:16,262 INFO L93 Difference]: Finished difference Result 140 states and 170 transitions. [2024-11-17 00:38:16,262 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-17 00:38:16,262 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 8 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-17 00:38:16,263 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 00:38:16,263 INFO L225 Difference]: With dead ends: 140 [2024-11-17 00:38:16,263 INFO L226 Difference]: Without dead ends: 140 [2024-11-17 00:38:16,263 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2024-11-17 00:38:16,263 INFO L432 NwaCegarLoop]: 70 mSDtfsCounter, 35 mSDsluCounter, 216 mSDsCounter, 0 mSdLazyCounter, 269 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 286 SdHoareTripleChecker+Invalid, 272 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 269 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-17 00:38:16,264 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [35 Valid, 286 Invalid, 272 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 269 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-17 00:38:16,264 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 140 states. [2024-11-17 00:38:16,265 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 140 to 137. [2024-11-17 00:38:16,266 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 137 states, 104 states have (on average 1.625) internal successors, (169), 136 states have internal predecessors, (169), 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-17 00:38:16,266 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 137 states to 137 states and 169 transitions. [2024-11-17 00:38:16,266 INFO L78 Accepts]: Start accepts. Automaton has 137 states and 169 transitions. Word has length 16 [2024-11-17 00:38:16,266 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 00:38:16,266 INFO L471 AbstractCegarLoop]: Abstraction has 137 states and 169 transitions. [2024-11-17 00:38:16,267 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 8 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-17 00:38:16,267 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 169 transitions. [2024-11-17 00:38:16,267 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2024-11-17 00:38:16,267 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 00:38:16,267 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 00:38:16,271 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-17 00:38:16,467 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-17 00:38:16,468 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr26REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 44 more)] === [2024-11-17 00:38:16,468 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 00:38:16,468 INFO L85 PathProgramCache]: Analyzing trace with hash -1029013357, now seen corresponding path program 1 times [2024-11-17 00:38:16,468 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-17 00:38:16,468 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [906601618] [2024-11-17 00:38:16,468 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 00:38:16,468 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-17 00:38:16,468 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-17 00:38:16,471 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-17 00:38:16,473 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-17 00:38:16,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:38:16,558 INFO L255 TraceCheckSpWp]: Trace formula consists of 72 conjuncts, 22 conjuncts are in the unsatisfiable core [2024-11-17 00:38:16,560 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-17 00:38:16,576 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 11 treesize of output 7 [2024-11-17 00:38:16,581 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 11 treesize of output 7 [2024-11-17 00:38:16,603 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 19 treesize of output 18 [2024-11-17 00:38:16,613 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 23 treesize of output 11 [2024-11-17 00:38:16,728 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-17 00:38:16,729 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 7 [2024-11-17 00:38:16,734 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 15 treesize of output 7 [2024-11-17 00:38:16,791 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-17 00:38:16,791 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-17 00:38:16,791 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-17 00:38:16,791 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [906601618] [2024-11-17 00:38:16,791 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [906601618] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 00:38:16,791 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 00:38:16,791 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-17 00:38:16,791 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [827984024] [2024-11-17 00:38:16,792 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 00:38:16,792 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-17 00:38:16,792 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-17 00:38:16,792 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-17 00:38:16,792 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2024-11-17 00:38:16,792 INFO L87 Difference]: Start difference. First operand 137 states and 169 transitions. Second operand has 9 states, 9 states have (on average 1.7777777777777777) internal successors, (16), 9 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-17 00:38:17,359 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 00:38:17,359 INFO L93 Difference]: Finished difference Result 131 states and 158 transitions. [2024-11-17 00:38:17,360 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-17 00:38:17,360 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 1.7777777777777777) internal successors, (16), 9 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-17 00:38:17,360 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 00:38:17,361 INFO L225 Difference]: With dead ends: 131 [2024-11-17 00:38:17,361 INFO L226 Difference]: Without dead ends: 131 [2024-11-17 00:38:17,361 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2024-11-17 00:38:17,361 INFO L432 NwaCegarLoop]: 84 mSDtfsCounter, 26 mSDsluCounter, 485 mSDsCounter, 0 mSdLazyCounter, 144 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 569 SdHoareTripleChecker+Invalid, 144 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 144 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-17 00:38:17,361 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 569 Invalid, 144 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 144 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-17 00:38:17,362 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 131 states. [2024-11-17 00:38:17,363 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 131 to 130. [2024-11-17 00:38:17,363 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 130 states, 97 states have (on average 1.6185567010309279) internal successors, (157), 129 states have internal predecessors, (157), 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-17 00:38:17,363 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 130 states to 130 states and 157 transitions. [2024-11-17 00:38:17,363 INFO L78 Accepts]: Start accepts. Automaton has 130 states and 157 transitions. Word has length 16 [2024-11-17 00:38:17,364 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 00:38:17,364 INFO L471 AbstractCegarLoop]: Abstraction has 130 states and 157 transitions. [2024-11-17 00:38:17,364 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 1.7777777777777777) internal successors, (16), 9 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-17 00:38:17,364 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states and 157 transitions. [2024-11-17 00:38:17,364 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2024-11-17 00:38:17,364 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 00:38:17,364 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 00:38:17,370 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-17 00:38:17,569 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-17 00:38:17,570 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr33REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 44 more)] === [2024-11-17 00:38:17,570 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 00:38:17,570 INFO L85 PathProgramCache]: Analyzing trace with hash -18868715, now seen corresponding path program 1 times [2024-11-17 00:38:17,570 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-17 00:38:17,570 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1275063996] [2024-11-17 00:38:17,570 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 00:38:17,571 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-17 00:38:17,571 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-17 00:38:17,573 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-17 00:38:17,574 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-17 00:38:17,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:38:17,724 INFO L255 TraceCheckSpWp]: Trace formula consists of 137 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-11-17 00:38:17,730 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-17 00:38:17,738 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-17 00:38:17,809 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-17 00:38:17,809 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-17 00:38:17,809 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-17 00:38:17,809 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1275063996] [2024-11-17 00:38:17,810 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1275063996] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 00:38:17,810 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 00:38:17,810 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-17 00:38:17,810 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1388546890] [2024-11-17 00:38:17,810 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 00:38:17,810 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-17 00:38:17,810 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-17 00:38:17,811 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-17 00:38:17,811 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-17 00:38:17,811 INFO L87 Difference]: Start difference. First operand 130 states and 157 transitions. Second operand has 5 states, 4 states have (on average 4.0) internal successors, (16), 5 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-17 00:38:18,127 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 00:38:18,127 INFO L93 Difference]: Finished difference Result 128 states and 155 transitions. [2024-11-17 00:38:18,128 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-17 00:38:18,128 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 4.0) internal successors, (16), 5 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-17 00:38:18,128 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 00:38:18,128 INFO L225 Difference]: With dead ends: 128 [2024-11-17 00:38:18,128 INFO L226 Difference]: Without dead ends: 128 [2024-11-17 00:38:18,129 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-17 00:38:18,129 INFO L432 NwaCegarLoop]: 79 mSDtfsCounter, 4 mSDsluCounter, 135 mSDsCounter, 0 mSdLazyCounter, 138 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 214 SdHoareTripleChecker+Invalid, 139 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 138 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-17 00:38:18,129 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 214 Invalid, 139 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 138 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-17 00:38:18,130 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 128 states. [2024-11-17 00:38:18,131 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 128 to 128. [2024-11-17 00:38:18,131 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 128 states, 97 states have (on average 1.597938144329897) internal successors, (155), 127 states have internal predecessors, (155), 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-17 00:38:18,131 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 128 states to 128 states and 155 transitions. [2024-11-17 00:38:18,131 INFO L78 Accepts]: Start accepts. Automaton has 128 states and 155 transitions. Word has length 16 [2024-11-17 00:38:18,132 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 00:38:18,132 INFO L471 AbstractCegarLoop]: Abstraction has 128 states and 155 transitions. [2024-11-17 00:38:18,132 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 4.0) internal successors, (16), 5 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-17 00:38:18,132 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states and 155 transitions. [2024-11-17 00:38:18,132 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2024-11-17 00:38:18,132 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 00:38:18,132 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 00:38:18,142 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (16)] Forceful destruction successful, exit code 0 [2024-11-17 00:38:18,332 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-17 00:38:18,333 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr34REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 44 more)] === [2024-11-17 00:38:18,333 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 00:38:18,333 INFO L85 PathProgramCache]: Analyzing trace with hash -18868714, now seen corresponding path program 1 times [2024-11-17 00:38:18,333 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-17 00:38:18,333 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1827397832] [2024-11-17 00:38:18,333 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 00:38:18,333 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-17 00:38:18,333 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-17 00:38:18,334 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-17 00:38:18,338 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (17)] Waiting until timeout for monitored process [2024-11-17 00:38:18,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:38:18,445 INFO L255 TraceCheckSpWp]: Trace formula consists of 137 conjuncts, 12 conjuncts are in the unsatisfiable core [2024-11-17 00:38:18,447 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-17 00:38:18,453 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-17 00:38:18,511 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-17 00:38:18,511 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-17 00:38:18,511 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-17 00:38:18,512 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1827397832] [2024-11-17 00:38:18,512 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1827397832] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 00:38:18,512 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 00:38:18,512 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-17 00:38:18,512 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1686383702] [2024-11-17 00:38:18,512 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 00:38:18,512 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-17 00:38:18,512 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-17 00:38:18,513 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-17 00:38:18,513 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-17 00:38:18,513 INFO L87 Difference]: Start difference. First operand 128 states and 155 transitions. Second operand has 5 states, 4 states have (on average 4.0) internal successors, (16), 5 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-17 00:38:18,838 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 00:38:18,839 INFO L93 Difference]: Finished difference Result 126 states and 153 transitions. [2024-11-17 00:38:18,839 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-17 00:38:18,839 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 4.0) internal successors, (16), 5 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-17 00:38:18,839 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 00:38:18,840 INFO L225 Difference]: With dead ends: 126 [2024-11-17 00:38:18,840 INFO L226 Difference]: Without dead ends: 126 [2024-11-17 00:38:18,840 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-17 00:38:18,841 INFO L432 NwaCegarLoop]: 79 mSDtfsCounter, 4 mSDsluCounter, 153 mSDsCounter, 0 mSdLazyCounter, 112 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 232 SdHoareTripleChecker+Invalid, 113 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 112 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-17 00:38:18,841 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 232 Invalid, 113 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 112 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-17 00:38:18,841 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 126 states. [2024-11-17 00:38:18,842 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 126 to 126. [2024-11-17 00:38:18,843 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 126 states, 97 states have (on average 1.577319587628866) internal successors, (153), 125 states have internal predecessors, (153), 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-17 00:38:18,843 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126 states to 126 states and 153 transitions. [2024-11-17 00:38:18,843 INFO L78 Accepts]: Start accepts. Automaton has 126 states and 153 transitions. Word has length 16 [2024-11-17 00:38:18,843 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 00:38:18,843 INFO L471 AbstractCegarLoop]: Abstraction has 126 states and 153 transitions. [2024-11-17 00:38:18,843 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 4.0) internal successors, (16), 5 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-17 00:38:18,843 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 153 transitions. [2024-11-17 00:38:18,844 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2024-11-17 00:38:18,844 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 00:38:18,844 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-17 00:38:18,851 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (17)] Ended with exit code 0 [2024-11-17 00:38:19,047 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-17 00:38:19,048 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr21REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 44 more)] === [2024-11-17 00:38:19,048 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 00:38:19,048 INFO L85 PathProgramCache]: Analyzing trace with hash -1041358963, now seen corresponding path program 1 times [2024-11-17 00:38:19,048 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-17 00:38:19,048 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [419110267] [2024-11-17 00:38:19,048 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 00:38:19,048 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-17 00:38:19,048 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-17 00:38:19,054 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-17 00:38:19,057 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-17 00:38:19,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:38:19,136 INFO L255 TraceCheckSpWp]: Trace formula consists of 76 conjuncts, 18 conjuncts are in the unsatisfiable core [2024-11-17 00:38:19,138 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-17 00:38:19,142 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-17 00:38:19,275 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 15 treesize of output 7 [2024-11-17 00:38:19,309 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-17 00:38:19,309 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-17 00:38:19,309 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-17 00:38:19,310 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [419110267] [2024-11-17 00:38:19,310 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [419110267] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 00:38:19,310 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 00:38:19,310 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-11-17 00:38:19,310 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1761207934] [2024-11-17 00:38:19,311 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 00:38:19,324 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-17 00:38:19,324 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-17 00:38:19,324 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-17 00:38:19,324 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2024-11-17 00:38:19,324 INFO L87 Difference]: Start difference. First operand 126 states and 153 transitions. Second operand has 11 states, 10 states have (on average 1.8) internal successors, (18), 11 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-17 00:38:20,264 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 00:38:20,265 INFO L93 Difference]: Finished difference Result 188 states and 235 transitions. [2024-11-17 00:38:20,265 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-17 00:38:20,265 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 1.8) internal successors, (18), 11 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-17 00:38:20,265 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 00:38:20,266 INFO L225 Difference]: With dead ends: 188 [2024-11-17 00:38:20,266 INFO L226 Difference]: Without dead ends: 188 [2024-11-17 00:38:20,267 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=35, Invalid=175, Unknown=0, NotChecked=0, Total=210 [2024-11-17 00:38:20,267 INFO L432 NwaCegarLoop]: 41 mSDtfsCounter, 90 mSDsluCounter, 266 mSDsCounter, 0 mSdLazyCounter, 558 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 90 SdHoareTripleChecker+Valid, 307 SdHoareTripleChecker+Invalid, 561 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 558 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-11-17 00:38:20,267 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [90 Valid, 307 Invalid, 561 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 558 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-11-17 00:38:20,267 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 188 states. [2024-11-17 00:38:20,270 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 188 to 156. [2024-11-17 00:38:20,270 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 156 states, 127 states have (on average 1.6771653543307086) internal successors, (213), 155 states have internal predecessors, (213), 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-17 00:38:20,271 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 156 states to 156 states and 213 transitions. [2024-11-17 00:38:20,271 INFO L78 Accepts]: Start accepts. Automaton has 156 states and 213 transitions. Word has length 18 [2024-11-17 00:38:20,271 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 00:38:20,271 INFO L471 AbstractCegarLoop]: Abstraction has 156 states and 213 transitions. [2024-11-17 00:38:20,271 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 1.8) internal successors, (18), 11 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-17 00:38:20,271 INFO L276 IsEmpty]: Start isEmpty. Operand 156 states and 213 transitions. [2024-11-17 00:38:20,271 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2024-11-17 00:38:20,272 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 00:38:20,272 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-17 00:38:20,275 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-17 00:38:20,472 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-17 00:38:20,473 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr22REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 44 more)] === [2024-11-17 00:38:20,473 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 00:38:20,473 INFO L85 PathProgramCache]: Analyzing trace with hash -1041358962, now seen corresponding path program 1 times [2024-11-17 00:38:20,473 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-17 00:38:20,473 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [998632336] [2024-11-17 00:38:20,473 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 00:38:20,473 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-17 00:38:20,473 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-17 00:38:20,475 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-17 00:38:20,476 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-17 00:38:20,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:38:20,547 INFO L255 TraceCheckSpWp]: Trace formula consists of 76 conjuncts, 26 conjuncts are in the unsatisfiable core [2024-11-17 00:38:20,549 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-17 00:38:20,555 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-17 00:38:20,826 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 15 treesize of output 7 [2024-11-17 00:38:20,831 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 7 treesize of output 3 [2024-11-17 00:38:20,871 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-17 00:38:20,871 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-17 00:38:20,872 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-17 00:38:20,872 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [998632336] [2024-11-17 00:38:20,872 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [998632336] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 00:38:20,872 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 00:38:20,872 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-11-17 00:38:20,872 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1602837896] [2024-11-17 00:38:20,872 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 00:38:20,872 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-17 00:38:20,872 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-17 00:38:20,872 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-17 00:38:20,872 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2024-11-17 00:38:20,873 INFO L87 Difference]: Start difference. First operand 156 states and 213 transitions. Second operand has 11 states, 10 states have (on average 1.8) internal successors, (18), 11 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-17 00:38:21,794 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 00:38:21,795 INFO L93 Difference]: Finished difference Result 148 states and 172 transitions. [2024-11-17 00:38:21,795 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-17 00:38:21,795 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 1.8) internal successors, (18), 11 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-17 00:38:21,795 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 00:38:21,796 INFO L225 Difference]: With dead ends: 148 [2024-11-17 00:38:21,796 INFO L226 Difference]: Without dead ends: 148 [2024-11-17 00:38:21,796 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=29, Invalid=127, Unknown=0, NotChecked=0, Total=156 [2024-11-17 00:38:21,796 INFO L432 NwaCegarLoop]: 61 mSDtfsCounter, 41 mSDsluCounter, 341 mSDsCounter, 0 mSdLazyCounter, 396 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 41 SdHoareTripleChecker+Valid, 402 SdHoareTripleChecker+Invalid, 397 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 396 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-11-17 00:38:21,797 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [41 Valid, 402 Invalid, 397 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 396 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-11-17 00:38:21,797 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 148 states. [2024-11-17 00:38:21,798 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 148 to 136. [2024-11-17 00:38:21,799 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 136 states, 107 states have (on average 1.6074766355140186) internal successors, (172), 135 states have internal predecessors, (172), 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-17 00:38:21,799 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 136 states to 136 states and 172 transitions. [2024-11-17 00:38:21,799 INFO L78 Accepts]: Start accepts. Automaton has 136 states and 172 transitions. Word has length 18 [2024-11-17 00:38:21,799 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 00:38:21,799 INFO L471 AbstractCegarLoop]: Abstraction has 136 states and 172 transitions. [2024-11-17 00:38:21,799 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 1.8) internal successors, (18), 11 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-17 00:38:21,799 INFO L276 IsEmpty]: Start isEmpty. Operand 136 states and 172 transitions. [2024-11-17 00:38:21,802 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2024-11-17 00:38:21,802 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 00:38:21,802 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-17 00:38:21,807 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 (19)] Forceful destruction successful, exit code 0 [2024-11-17 00:38:22,002 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-17 00:38:22,002 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr29REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 44 more)] === [2024-11-17 00:38:22,003 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 00:38:22,003 INFO L85 PathProgramCache]: Analyzing trace with hash -952964238, now seen corresponding path program 1 times [2024-11-17 00:38:22,003 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-17 00:38:22,003 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [972545887] [2024-11-17 00:38:22,003 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 00:38:22,003 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-17 00:38:22,003 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-17 00:38:22,006 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-17 00:38:22,007 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-17 00:38:22,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:38:22,169 INFO L255 TraceCheckSpWp]: Trace formula consists of 163 conjuncts, 17 conjuncts are in the unsatisfiable core [2024-11-17 00:38:22,184 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-17 00:38:22,197 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-17 00:38:22,213 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-17 00:38:22,293 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2024-11-17 00:38:22,294 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-17 00:38:22,316 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 18 treesize of output 13 [2024-11-17 00:38:22,353 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 18 treesize of output 13 [2024-11-17 00:38:22,416 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 19 treesize of output 7 [2024-11-17 00:38:22,457 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-17 00:38:22,458 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-17 00:38:22,458 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-17 00:38:22,458 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [972545887] [2024-11-17 00:38:22,458 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [972545887] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 00:38:22,458 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 00:38:22,458 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-17 00:38:22,458 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1054047152] [2024-11-17 00:38:22,458 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 00:38:22,459 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-17 00:38:22,459 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-17 00:38:22,459 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-17 00:38:22,459 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2024-11-17 00:38:22,459 INFO L87 Difference]: Start difference. First operand 136 states and 172 transitions. Second operand has 9 states, 8 states have (on average 2.25) internal successors, (18), 9 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-17 00:38:23,102 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 00:38:23,102 INFO L93 Difference]: Finished difference Result 146 states and 183 transitions. [2024-11-17 00:38:23,102 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-17 00:38:23,102 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 2.25) internal successors, (18), 9 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-17 00:38:23,103 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 00:38:23,105 INFO L225 Difference]: With dead ends: 146 [2024-11-17 00:38:23,105 INFO L226 Difference]: Without dead ends: 146 [2024-11-17 00:38:23,105 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=49, Invalid=133, Unknown=0, NotChecked=0, Total=182 [2024-11-17 00:38:23,106 INFO L432 NwaCegarLoop]: 74 mSDtfsCounter, 27 mSDsluCounter, 351 mSDsCounter, 0 mSdLazyCounter, 261 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 425 SdHoareTripleChecker+Invalid, 266 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 261 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-17 00:38:23,106 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [27 Valid, 425 Invalid, 266 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 261 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-17 00:38:23,106 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 146 states. [2024-11-17 00:38:23,108 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 146 to 146. [2024-11-17 00:38:23,113 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 146 states, 117 states have (on average 1.564102564102564) internal successors, (183), 145 states have internal predecessors, (183), 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-17 00:38:23,114 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146 states to 146 states and 183 transitions. [2024-11-17 00:38:23,114 INFO L78 Accepts]: Start accepts. Automaton has 146 states and 183 transitions. Word has length 18 [2024-11-17 00:38:23,114 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 00:38:23,114 INFO L471 AbstractCegarLoop]: Abstraction has 146 states and 183 transitions. [2024-11-17 00:38:23,114 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 2.25) internal successors, (18), 9 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-17 00:38:23,114 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 183 transitions. [2024-11-17 00:38:23,114 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2024-11-17 00:38:23,114 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 00:38:23,114 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-17 00:38:23,134 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 (20)] Forceful destruction successful, exit code 0 [2024-11-17 00:38:23,315 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-17 00:38:23,315 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr30REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 44 more)] === [2024-11-17 00:38:23,316 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 00:38:23,316 INFO L85 PathProgramCache]: Analyzing trace with hash -952964237, now seen corresponding path program 1 times [2024-11-17 00:38:23,316 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-17 00:38:23,316 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1402122564] [2024-11-17 00:38:23,316 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 00:38:23,316 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-17 00:38:23,316 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-17 00:38:23,319 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-17 00:38:23,323 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-17 00:38:23,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:38:23,580 INFO L255 TraceCheckSpWp]: Trace formula consists of 163 conjuncts, 27 conjuncts are in the unsatisfiable core [2024-11-17 00:38:23,587 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-17 00:38:23,599 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-17 00:38:23,616 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-17 00:38:23,668 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 11 treesize of output 7 [2024-11-17 00:38:23,683 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 11 treesize of output 7 [2024-11-17 00:38:23,767 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2024-11-17 00:38:23,768 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-17 00:38:23,776 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-17 00:38:23,801 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 16 treesize of output 11 [2024-11-17 00:38:23,814 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 16 treesize of output 11 [2024-11-17 00:38:23,849 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 16 treesize of output 11 [2024-11-17 00:38:23,865 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 16 treesize of output 11 [2024-11-17 00:38:23,972 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 15 treesize of output 7 [2024-11-17 00:38:23,976 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 7 treesize of output 3 [2024-11-17 00:38:24,026 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-17 00:38:24,026 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-17 00:38:24,026 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-17 00:38:24,026 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1402122564] [2024-11-17 00:38:24,027 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1402122564] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 00:38:24,027 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 00:38:24,027 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-17 00:38:24,027 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [523762534] [2024-11-17 00:38:24,027 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 00:38:24,028 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-17 00:38:24,028 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-17 00:38:24,028 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-17 00:38:24,028 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2024-11-17 00:38:24,029 INFO L87 Difference]: Start difference. First operand 146 states and 183 transitions. Second operand has 9 states, 8 states have (on average 2.25) internal successors, (18), 9 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-17 00:38:24,892 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 00:38:24,893 INFO L93 Difference]: Finished difference Result 146 states and 182 transitions. [2024-11-17 00:38:24,893 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-17 00:38:24,893 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 2.25) internal successors, (18), 9 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-17 00:38:24,893 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 00:38:24,894 INFO L225 Difference]: With dead ends: 146 [2024-11-17 00:38:24,894 INFO L226 Difference]: Without dead ends: 146 [2024-11-17 00:38:24,894 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=49, Invalid=133, Unknown=0, NotChecked=0, Total=182 [2024-11-17 00:38:24,894 INFO L432 NwaCegarLoop]: 74 mSDtfsCounter, 26 mSDsluCounter, 261 mSDsCounter, 0 mSdLazyCounter, 269 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 335 SdHoareTripleChecker+Invalid, 274 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 269 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-17 00:38:24,894 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 335 Invalid, 274 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 269 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-11-17 00:38:24,895 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 146 states. [2024-11-17 00:38:24,896 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 146 to 146. [2024-11-17 00:38:24,901 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 146 states, 117 states have (on average 1.5555555555555556) internal successors, (182), 145 states have internal predecessors, (182), 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-17 00:38:24,902 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146 states to 146 states and 182 transitions. [2024-11-17 00:38:24,902 INFO L78 Accepts]: Start accepts. Automaton has 146 states and 182 transitions. Word has length 18 [2024-11-17 00:38:24,902 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 00:38:24,902 INFO L471 AbstractCegarLoop]: Abstraction has 146 states and 182 transitions. [2024-11-17 00:38:24,902 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 2.25) internal successors, (18), 9 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-17 00:38:24,902 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 182 transitions. [2024-11-17 00:38:24,902 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2024-11-17 00:38:24,902 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 00:38:24,902 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-17 00:38:24,914 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-17 00:38:25,102 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-17 00:38:25,103 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr19REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 44 more)] === [2024-11-17 00:38:25,104 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 00:38:25,104 INFO L85 PathProgramCache]: Analyzing trace with hash -678205851, now seen corresponding path program 1 times [2024-11-17 00:38:25,104 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-17 00:38:25,104 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [12221243] [2024-11-17 00:38:25,104 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 00:38:25,104 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-17 00:38:25,104 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-17 00:38:25,106 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-17 00:38:25,107 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-17 00:38:25,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:38:25,195 INFO L255 TraceCheckSpWp]: Trace formula consists of 90 conjuncts, 22 conjuncts are in the unsatisfiable core [2024-11-17 00:38:25,197 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-17 00:38:25,391 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 7 treesize of output 3 [2024-11-17 00:38:25,399 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 15 treesize of output 7 [2024-11-17 00:38:25,473 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-17 00:38:25,473 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-17 00:38:25,473 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-17 00:38:25,474 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [12221243] [2024-11-17 00:38:25,474 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [12221243] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 00:38:25,474 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 00:38:25,474 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-11-17 00:38:25,474 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1277997908] [2024-11-17 00:38:25,474 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 00:38:25,474 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-17 00:38:25,475 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-17 00:38:25,475 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-17 00:38:25,475 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2024-11-17 00:38:25,475 INFO L87 Difference]: Start difference. First operand 146 states and 182 transitions. Second operand has 11 states, 11 states have (on average 2.0) internal successors, (22), 11 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-17 00:38:25,898 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 00:38:25,899 INFO L93 Difference]: Finished difference Result 143 states and 167 transitions. [2024-11-17 00:38:25,899 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-17 00:38:25,899 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 2.0) internal successors, (22), 11 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-17 00:38:25,899 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 00:38:25,900 INFO L225 Difference]: With dead ends: 143 [2024-11-17 00:38:25,900 INFO L226 Difference]: Without dead ends: 143 [2024-11-17 00:38:25,900 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=29, Invalid=127, Unknown=0, NotChecked=0, Total=156 [2024-11-17 00:38:25,900 INFO L432 NwaCegarLoop]: 68 mSDtfsCounter, 36 mSDsluCounter, 397 mSDsCounter, 0 mSdLazyCounter, 232 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 465 SdHoareTripleChecker+Invalid, 233 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 232 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-17 00:38:25,901 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [36 Valid, 465 Invalid, 233 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 232 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-17 00:38:25,901 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 143 states. [2024-11-17 00:38:25,902 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 143 to 136. [2024-11-17 00:38:25,902 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 136 states, 107 states have (on average 1.485981308411215) internal successors, (159), 135 states have internal predecessors, (159), 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-17 00:38:25,902 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 136 states to 136 states and 159 transitions. [2024-11-17 00:38:25,903 INFO L78 Accepts]: Start accepts. Automaton has 136 states and 159 transitions. Word has length 22 [2024-11-17 00:38:25,903 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 00:38:25,903 INFO L471 AbstractCegarLoop]: Abstraction has 136 states and 159 transitions. [2024-11-17 00:38:25,903 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 2.0) internal successors, (22), 11 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-17 00:38:25,903 INFO L276 IsEmpty]: Start isEmpty. Operand 136 states and 159 transitions. [2024-11-17 00:38:25,903 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2024-11-17 00:38:25,904 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 00:38:25,904 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] [2024-11-17 00:38:25,910 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 (22)] Forceful destruction successful, exit code 0 [2024-11-17 00:38:26,107 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-17 00:38:26,110 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 44 more)] === [2024-11-17 00:38:26,111 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 00:38:26,111 INFO L85 PathProgramCache]: Analyzing trace with hash 450452195, now seen corresponding path program 1 times [2024-11-17 00:38:26,111 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-17 00:38:26,111 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2072392861] [2024-11-17 00:38:26,111 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 00:38:26,112 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-17 00:38:26,112 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-17 00:38:26,113 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-17 00:38:26,115 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-17 00:38:26,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:38:26,314 INFO L255 TraceCheckSpWp]: Trace formula consists of 88 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-17 00:38:26,317 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-17 00:38:26,471 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-17 00:38:26,471 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-17 00:38:26,471 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-17 00:38:26,471 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2072392861] [2024-11-17 00:38:26,472 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2072392861] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 00:38:26,472 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 00:38:26,472 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-17 00:38:26,472 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1362490974] [2024-11-17 00:38:26,472 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 00:38:26,472 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-17 00:38:26,472 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-17 00:38:26,473 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-17 00:38:26,473 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-11-17 00:38:26,473 INFO L87 Difference]: Start difference. First operand 136 states and 159 transitions. Second operand has 7 states, 6 states have (on average 3.8333333333333335) internal successors, (23), 6 states have internal predecessors, (23), 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-17 00:38:26,614 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 00:38:26,614 INFO L93 Difference]: Finished difference Result 135 states and 157 transitions. [2024-11-17 00:38:26,615 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-17 00:38:26,615 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 3.8333333333333335) internal successors, (23), 6 states have internal predecessors, (23), 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 23 [2024-11-17 00:38:26,615 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 00:38:26,616 INFO L225 Difference]: With dead ends: 135 [2024-11-17 00:38:26,616 INFO L226 Difference]: Without dead ends: 135 [2024-11-17 00:38:26,616 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-11-17 00:38:26,616 INFO L432 NwaCegarLoop]: 70 mSDtfsCounter, 73 mSDsluCounter, 209 mSDsCounter, 0 mSdLazyCounter, 80 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 73 SdHoareTripleChecker+Valid, 279 SdHoareTripleChecker+Invalid, 80 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 80 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-17 00:38:26,616 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [73 Valid, 279 Invalid, 80 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 80 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-17 00:38:26,617 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135 states. [2024-11-17 00:38:26,618 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135 to 135. [2024-11-17 00:38:26,618 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 135 states, 107 states have (on average 1.4672897196261683) internal successors, (157), 134 states have internal predecessors, (157), 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-17 00:38:26,619 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135 states to 135 states and 157 transitions. [2024-11-17 00:38:26,619 INFO L78 Accepts]: Start accepts. Automaton has 135 states and 157 transitions. Word has length 23 [2024-11-17 00:38:26,619 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 00:38:26,619 INFO L471 AbstractCegarLoop]: Abstraction has 135 states and 157 transitions. [2024-11-17 00:38:26,619 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 3.8333333333333335) internal successors, (23), 6 states have internal predecessors, (23), 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-17 00:38:26,619 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 157 transitions. [2024-11-17 00:38:26,619 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2024-11-17 00:38:26,619 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 00:38:26,619 INFO L215 NwaCegarLoop]: trace histogram [2, 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-17 00:38:26,624 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 (23)] Ended with exit code 0 [2024-11-17 00:38:26,823 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-17 00:38:26,824 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr28REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 44 more)] === [2024-11-17 00:38:26,824 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 00:38:26,824 INFO L85 PathProgramCache]: Analyzing trace with hash -1989370689, now seen corresponding path program 1 times [2024-11-17 00:38:26,824 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-17 00:38:26,824 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1296414562] [2024-11-17 00:38:26,824 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 00:38:26,824 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-17 00:38:26,824 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-17 00:38:26,825 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-17 00:38:26,827 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-17 00:38:26,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:38:26,963 INFO L255 TraceCheckSpWp]: Trace formula consists of 188 conjuncts, 15 conjuncts are in the unsatisfiable core [2024-11-17 00:38:26,965 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-17 00:38:27,085 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-17 00:38:27,085 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-17 00:38:27,086 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-17 00:38:27,086 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1296414562] [2024-11-17 00:38:27,086 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1296414562] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 00:38:27,086 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 00:38:27,086 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-17 00:38:27,086 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1256545000] [2024-11-17 00:38:27,086 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 00:38:27,086 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-17 00:38:27,086 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-17 00:38:27,086 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-17 00:38:27,086 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-11-17 00:38:27,087 INFO L87 Difference]: Start difference. First operand 135 states and 157 transitions. Second operand has 7 states, 6 states have (on average 4.166666666666667) internal successors, (25), 7 states have internal predecessors, (25), 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-17 00:38:27,449 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 00:38:27,449 INFO L93 Difference]: Finished difference Result 134 states and 156 transitions. [2024-11-17 00:38:27,450 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-17 00:38:27,450 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 4.166666666666667) internal successors, (25), 7 states have internal predecessors, (25), 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 25 [2024-11-17 00:38:27,450 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 00:38:27,453 INFO L225 Difference]: With dead ends: 134 [2024-11-17 00:38:27,453 INFO L226 Difference]: Without dead ends: 134 [2024-11-17 00:38:27,453 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2024-11-17 00:38:27,454 INFO L432 NwaCegarLoop]: 67 mSDtfsCounter, 20 mSDsluCounter, 195 mSDsCounter, 0 mSdLazyCounter, 138 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 262 SdHoareTripleChecker+Invalid, 140 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 138 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-17 00:38:27,454 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 262 Invalid, 140 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 138 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-17 00:38:27,455 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 134 states. [2024-11-17 00:38:27,460 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 134 to 134. [2024-11-17 00:38:27,460 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 134 states, 107 states have (on average 1.4579439252336448) internal successors, (156), 133 states have internal predecessors, (156), 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-17 00:38:27,460 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 134 states to 134 states and 156 transitions. [2024-11-17 00:38:27,460 INFO L78 Accepts]: Start accepts. Automaton has 134 states and 156 transitions. Word has length 25 [2024-11-17 00:38:27,460 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 00:38:27,461 INFO L471 AbstractCegarLoop]: Abstraction has 134 states and 156 transitions. [2024-11-17 00:38:27,463 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 4.166666666666667) internal successors, (25), 7 states have internal predecessors, (25), 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-17 00:38:27,463 INFO L276 IsEmpty]: Start isEmpty. Operand 134 states and 156 transitions. [2024-11-17 00:38:27,464 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2024-11-17 00:38:27,464 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 00:38:27,464 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] [2024-11-17 00:38:27,470 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 (24)] Forceful destruction successful, exit code 0 [2024-11-17 00:38:27,664 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 24 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -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-17 00:38:27,665 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 44 more)] === [2024-11-17 00:38:27,665 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 00:38:27,665 INFO L85 PathProgramCache]: Analyzing trace with hash -621046717, now seen corresponding path program 1 times [2024-11-17 00:38:27,665 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-17 00:38:27,665 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [942587306] [2024-11-17 00:38:27,665 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 00:38:27,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-17 00:38:27,666 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-17 00:38:27,671 INFO L229 MonitoredProcess]: Starting monitored process 25 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-17 00:38:27,679 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 (25)] Waiting until timeout for monitored process [2024-11-17 00:38:27,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:38:27,793 INFO L255 TraceCheckSpWp]: Trace formula consists of 94 conjuncts, 10 conjuncts are in the unsatisfiable core [2024-11-17 00:38:27,794 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-17 00:38:27,931 WARN L873 $PredicateComparison]: unable to prove that (exists ((|v_ULTIMATE.start_destroy_~head#1.base_14| (_ BitVec 64))) (and (= |c_#valid| (store |c_ULTIMATE.start_main_old_#valid#1| |v_ULTIMATE.start_destroy_~head#1.base_14| (_ bv0 1))) (= (_ bv0 1) (select |c_ULTIMATE.start_main_old_#valid#1| |v_ULTIMATE.start_destroy_~head#1.base_14|)))) is different from true [2024-11-17 00:38:27,944 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-17 00:38:27,944 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-17 00:38:27,945 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-17 00:38:27,945 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [942587306] [2024-11-17 00:38:27,945 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [942587306] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 00:38:27,945 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 00:38:27,945 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-17 00:38:27,945 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1597063316] [2024-11-17 00:38:27,945 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 00:38:27,945 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-17 00:38:27,945 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-17 00:38:27,946 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-17 00:38:27,946 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=22, Unknown=1, NotChecked=8, Total=42 [2024-11-17 00:38:27,946 INFO L87 Difference]: Start difference. First operand 134 states and 156 transitions. Second operand has 7 states, 6 states have (on average 4.666666666666667) internal successors, (28), 7 states have internal predecessors, (28), 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-17 00:38:28,295 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 00:38:28,296 INFO L93 Difference]: Finished difference Result 144 states and 165 transitions. [2024-11-17 00:38:28,296 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-17 00:38:28,296 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 4.666666666666667) internal successors, (28), 7 states have internal predecessors, (28), 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 28 [2024-11-17 00:38:28,296 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 00:38:28,297 INFO L225 Difference]: With dead ends: 144 [2024-11-17 00:38:28,297 INFO L226 Difference]: Without dead ends: 124 [2024-11-17 00:38:28,297 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=22, Unknown=1, NotChecked=8, Total=42 [2024-11-17 00:38:28,297 INFO L432 NwaCegarLoop]: 74 mSDtfsCounter, 0 mSDsluCounter, 162 mSDsCounter, 0 mSdLazyCounter, 194 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 236 SdHoareTripleChecker+Invalid, 308 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 194 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 114 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-17 00:38:28,297 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 236 Invalid, 308 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 194 Invalid, 0 Unknown, 114 Unchecked, 0.3s Time] [2024-11-17 00:38:28,298 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 124 states. [2024-11-17 00:38:28,298 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 124 to 124. [2024-11-17 00:38:28,299 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 124 states, 97 states have (on average 1.4948453608247423) internal successors, (145), 123 states have internal predecessors, (145), 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-17 00:38:28,299 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 124 states to 124 states and 145 transitions. [2024-11-17 00:38:28,299 INFO L78 Accepts]: Start accepts. Automaton has 124 states and 145 transitions. Word has length 28 [2024-11-17 00:38:28,299 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 00:38:28,299 INFO L471 AbstractCegarLoop]: Abstraction has 124 states and 145 transitions. [2024-11-17 00:38:28,299 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 4.666666666666667) internal successors, (28), 7 states have internal predecessors, (28), 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-17 00:38:28,299 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states and 145 transitions. [2024-11-17 00:38:28,299 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2024-11-17 00:38:28,299 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 00:38:28,299 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 00:38:28,305 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 (25)] Forceful destruction successful, exit code 0 [2024-11-17 00:38:28,504 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 25 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -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-17 00:38:28,505 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr24REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 44 more)] === [2024-11-17 00:38:28,505 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 00:38:28,505 INFO L85 PathProgramCache]: Analyzing trace with hash -190729498, now seen corresponding path program 1 times [2024-11-17 00:38:28,505 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-17 00:38:28,505 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [481995167] [2024-11-17 00:38:28,505 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 00:38:28,505 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-17 00:38:28,506 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-17 00:38:28,507 INFO L229 MonitoredProcess]: Starting monitored process 26 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-17 00:38:28,509 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 (26)] Waiting until timeout for monitored process [2024-11-17 00:38:28,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:38:28,680 INFO L255 TraceCheckSpWp]: Trace formula consists of 203 conjuncts, 15 conjuncts are in the unsatisfiable core [2024-11-17 00:38:28,683 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-17 00:38:28,823 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-17 00:38:28,823 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-17 00:38:28,823 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-17 00:38:28,823 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [481995167] [2024-11-17 00:38:28,823 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [481995167] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 00:38:28,823 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 00:38:28,824 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-17 00:38:28,824 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [58859368] [2024-11-17 00:38:28,824 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 00:38:28,824 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-17 00:38:28,825 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-17 00:38:28,825 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-17 00:38:28,825 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2024-11-17 00:38:28,825 INFO L87 Difference]: Start difference. First operand 124 states and 145 transitions. Second operand has 8 states, 7 states have (on average 4.285714285714286) internal successors, (30), 8 states have internal predecessors, (30), 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-17 00:38:29,173 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 00:38:29,173 INFO L93 Difference]: Finished difference Result 122 states and 141 transitions. [2024-11-17 00:38:29,174 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-17 00:38:29,174 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 4.285714285714286) internal successors, (30), 8 states have internal predecessors, (30), 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 30 [2024-11-17 00:38:29,174 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 00:38:29,174 INFO L225 Difference]: With dead ends: 122 [2024-11-17 00:38:29,174 INFO L226 Difference]: Without dead ends: 122 [2024-11-17 00:38:29,175 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2024-11-17 00:38:29,175 INFO L432 NwaCegarLoop]: 46 mSDtfsCounter, 60 mSDsluCounter, 145 mSDsCounter, 0 mSdLazyCounter, 178 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 60 SdHoareTripleChecker+Valid, 191 SdHoareTripleChecker+Invalid, 181 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 178 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-17 00:38:29,175 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [60 Valid, 191 Invalid, 181 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 178 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-17 00:38:29,179 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122 states. [2024-11-17 00:38:29,180 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122 to 121. [2024-11-17 00:38:29,180 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 121 states, 96 states have (on average 1.4583333333333333) internal successors, (140), 120 states have internal predecessors, (140), 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-17 00:38:29,180 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 140 transitions. [2024-11-17 00:38:29,181 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 140 transitions. Word has length 30 [2024-11-17 00:38:29,181 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 00:38:29,181 INFO L471 AbstractCegarLoop]: Abstraction has 121 states and 140 transitions. [2024-11-17 00:38:29,181 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 4.285714285714286) internal successors, (30), 8 states have internal predecessors, (30), 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-17 00:38:29,181 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 140 transitions. [2024-11-17 00:38:29,181 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2024-11-17 00:38:29,181 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 00:38:29,182 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 00:38:29,192 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 (26)] Forceful destruction successful, exit code 0 [2024-11-17 00:38:29,382 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 26 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -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-17 00:38:29,382 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr25REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 44 more)] === [2024-11-17 00:38:29,383 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 00:38:29,383 INFO L85 PathProgramCache]: Analyzing trace with hash -190727417, now seen corresponding path program 1 times [2024-11-17 00:38:29,383 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-17 00:38:29,384 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1599360799] [2024-11-17 00:38:29,384 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 00:38:29,384 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-17 00:38:29,384 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-17 00:38:29,387 INFO L229 MonitoredProcess]: Starting monitored process 27 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-17 00:38:29,388 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 (27)] Waiting until timeout for monitored process [2024-11-17 00:38:29,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:38:29,683 INFO L255 TraceCheckSpWp]: Trace formula consists of 207 conjuncts, 41 conjuncts are in the unsatisfiable core [2024-11-17 00:38:29,686 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-17 00:38:29,689 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-17 00:38:29,701 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-17 00:38:29,707 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-17 00:38:29,789 INFO L349 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2024-11-17 00:38:29,789 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-17 00:38:29,834 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 18 treesize of output 13 [2024-11-17 00:38:29,843 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 18 treesize of output 13 [2024-11-17 00:38:29,889 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 18 treesize of output 13 [2024-11-17 00:38:29,897 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 18 treesize of output 13 [2024-11-17 00:38:29,962 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 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 19 treesize of output 7 [2024-11-17 00:38:29,967 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 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 19 treesize of output 7 [2024-11-17 00:38:30,077 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 15 treesize of output 1 [2024-11-17 00:38:30,176 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 27 treesize of output 15 [2024-11-17 00:38:30,292 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-17 00:38:30,292 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-17 00:38:30,428 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 36 treesize of output 32 [2024-11-17 00:38:32,128 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-17 00:38:32,128 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 23 [2024-11-17 00:38:32,140 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 36 treesize of output 24 [2024-11-17 00:38:32,159 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 7 treesize of output 3 [2024-11-17 00:38:32,166 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-17 00:38:32,166 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 23 [2024-11-17 00:38:32,170 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 36 treesize of output 24 [2024-11-17 00:38:36,755 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-17 00:38:36,755 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-17 00:38:36,755 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1599360799] [2024-11-17 00:38:36,756 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1599360799] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-17 00:38:36,756 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-17 00:38:36,756 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 13] total 24 [2024-11-17 00:38:36,756 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1556392300] [2024-11-17 00:38:36,756 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-17 00:38:36,756 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2024-11-17 00:38:36,756 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-17 00:38:36,756 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2024-11-17 00:38:36,756 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=76, Invalid=506, Unknown=18, NotChecked=0, Total=600 [2024-11-17 00:38:36,757 INFO L87 Difference]: Start difference. First operand 121 states and 140 transitions. Second operand has 25 states, 24 states have (on average 2.4583333333333335) internal successors, (59), 25 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 00:38:39,518 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 00:38:39,518 INFO L93 Difference]: Finished difference Result 141 states and 164 transitions. [2024-11-17 00:38:39,518 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-11-17 00:38:39,519 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 24 states have (on average 2.4583333333333335) internal successors, (59), 25 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 30 [2024-11-17 00:38:39,519 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 00:38:39,519 INFO L225 Difference]: With dead ends: 141 [2024-11-17 00:38:39,519 INFO L226 Difference]: Without dead ends: 141 [2024-11-17 00:38:39,520 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 197 ImplicationChecksByTransitivity, 6.9s TimeCoverageRelationStatistics Valid=159, Invalid=941, Unknown=22, NotChecked=0, Total=1122 [2024-11-17 00:38:39,520 INFO L432 NwaCegarLoop]: 64 mSDtfsCounter, 54 mSDsluCounter, 561 mSDsCounter, 0 mSdLazyCounter, 786 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 54 SdHoareTripleChecker+Valid, 625 SdHoareTripleChecker+Invalid, 797 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 786 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2024-11-17 00:38:39,520 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [54 Valid, 625 Invalid, 797 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 786 Invalid, 0 Unknown, 0 Unchecked, 2.1s Time] [2024-11-17 00:38:39,521 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 141 states. [2024-11-17 00:38:39,522 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 141 to 133. [2024-11-17 00:38:39,522 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 133 states, 108 states have (on average 1.4351851851851851) internal successors, (155), 132 states have internal predecessors, (155), 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-17 00:38:39,522 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 133 states and 155 transitions. [2024-11-17 00:38:39,522 INFO L78 Accepts]: Start accepts. Automaton has 133 states and 155 transitions. Word has length 30 [2024-11-17 00:38:39,522 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 00:38:39,522 INFO L471 AbstractCegarLoop]: Abstraction has 133 states and 155 transitions. [2024-11-17 00:38:39,523 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 24 states have (on average 2.4583333333333335) internal successors, (59), 25 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 00:38:39,523 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 155 transitions. [2024-11-17 00:38:39,523 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2024-11-17 00:38:39,523 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 00:38:39,523 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 00:38:39,536 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 (27)] Ended with exit code 0 [2024-11-17 00:38:39,727 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 27 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -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-17 00:38:39,728 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr26REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 44 more)] === [2024-11-17 00:38:39,728 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 00:38:39,728 INFO L85 PathProgramCache]: Analyzing trace with hash -190727416, now seen corresponding path program 1 times [2024-11-17 00:38:39,728 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-17 00:38:39,728 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [545132967] [2024-11-17 00:38:39,728 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 00:38:39,729 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-17 00:38:39,729 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-17 00:38:39,730 INFO L229 MonitoredProcess]: Starting monitored process 28 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-17 00:38:39,732 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 (28)] Waiting until timeout for monitored process [2024-11-17 00:38:39,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:38:40,016 INFO L255 TraceCheckSpWp]: Trace formula consists of 207 conjuncts, 50 conjuncts are in the unsatisfiable core [2024-11-17 00:38:40,020 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-17 00:38:40,022 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-17 00:38:40,034 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-17 00:38:40,040 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-17 00:38:40,088 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2024-11-17 00:38:40,088 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-17 00:38:40,095 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 6 treesize of output 5 [2024-11-17 00:38:40,125 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 18 treesize of output 13 [2024-11-17 00:38:40,132 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 18 treesize of output 13 [2024-11-17 00:38:40,163 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 18 treesize of output 13 [2024-11-17 00:38:40,177 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 18 treesize of output 13 [2024-11-17 00:38:40,245 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 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 19 treesize of output 7 [2024-11-17 00:38:40,255 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 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 19 treesize of output 7 [2024-11-17 00:38:40,366 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 15 treesize of output 1 [2024-11-17 00:38:40,369 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 11 treesize of output 7 [2024-11-17 00:38:40,499 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 25 treesize of output 13 [2024-11-17 00:38:40,504 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 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 7 treesize of output 3 [2024-11-17 00:38:40,568 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-17 00:38:40,568 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-17 00:38:41,228 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 60 treesize of output 56 [2024-11-17 00:38:41,230 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 90 treesize of output 82 [2024-11-17 00:38:41,319 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 36 treesize of output 28 [2024-11-17 00:38:46,369 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-17 00:38:46,369 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 23 [2024-11-17 00:38:46,372 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 36 treesize of output 24 [2024-11-17 00:38:46,385 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 7 treesize of output 3 [2024-11-17 00:38:46,393 INFO L349 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2024-11-17 00:38:46,393 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 1 [2024-11-17 00:38:46,401 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-17 00:38:46,401 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-17 00:38:46,401 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [545132967] [2024-11-17 00:38:46,401 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [545132967] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-17 00:38:46,402 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-17 00:38:46,402 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 13] total 23 [2024-11-17 00:38:46,402 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1178892905] [2024-11-17 00:38:46,402 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-17 00:38:46,402 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2024-11-17 00:38:46,402 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-17 00:38:46,403 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2024-11-17 00:38:46,403 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=488, Unknown=7, NotChecked=0, Total=552 [2024-11-17 00:38:46,403 INFO L87 Difference]: Start difference. First operand 133 states and 155 transitions. Second operand has 24 states, 23 states have (on average 2.4347826086956523) internal successors, (56), 24 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-17 00:38:50,860 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 00:38:50,860 INFO L93 Difference]: Finished difference Result 141 states and 163 transitions. [2024-11-17 00:38:50,861 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-11-17 00:38:50,861 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 23 states have (on average 2.4347826086956523) internal successors, (56), 24 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 30 [2024-11-17 00:38:50,861 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 00:38:50,861 INFO L225 Difference]: With dead ends: 141 [2024-11-17 00:38:50,861 INFO L226 Difference]: Without dead ends: 141 [2024-11-17 00:38:50,862 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 35 SyntacticMatches, 1 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 119 ImplicationChecksByTransitivity, 6.7s TimeCoverageRelationStatistics Valid=124, Invalid=990, Unknown=8, NotChecked=0, Total=1122 [2024-11-17 00:38:50,862 INFO L432 NwaCegarLoop]: 65 mSDtfsCounter, 67 mSDsluCounter, 693 mSDsCounter, 0 mSdLazyCounter, 697 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 67 SdHoareTripleChecker+Valid, 758 SdHoareTripleChecker+Invalid, 709 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 697 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.3s IncrementalHoareTripleChecker+Time [2024-11-17 00:38:50,862 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [67 Valid, 758 Invalid, 709 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 697 Invalid, 0 Unknown, 0 Unchecked, 3.3s Time] [2024-11-17 00:38:50,862 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 141 states. [2024-11-17 00:38:50,870 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 141 to 133. [2024-11-17 00:38:50,870 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 133 states, 108 states have (on average 1.4259259259259258) internal successors, (154), 132 states have internal predecessors, (154), 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-17 00:38:50,870 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 133 states and 154 transitions. [2024-11-17 00:38:50,871 INFO L78 Accepts]: Start accepts. Automaton has 133 states and 154 transitions. Word has length 30 [2024-11-17 00:38:50,871 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 00:38:50,871 INFO L471 AbstractCegarLoop]: Abstraction has 133 states and 154 transitions. [2024-11-17 00:38:50,871 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 23 states have (on average 2.4347826086956523) internal successors, (56), 24 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-17 00:38:50,871 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 154 transitions. [2024-11-17 00:38:50,871 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2024-11-17 00:38:50,871 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 00:38:50,871 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 00:38:50,884 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 (28)] Ended with exit code 0 [2024-11-17 00:38:51,071 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 28 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -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-17 00:38:51,073 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr22REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 44 more)] === [2024-11-17 00:38:51,073 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 00:38:51,073 INFO L85 PathProgramCache]: Analyzing trace with hash 1392545987, now seen corresponding path program 1 times [2024-11-17 00:38:51,073 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-17 00:38:51,073 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [35544039] [2024-11-17 00:38:51,073 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 00:38:51,074 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-17 00:38:51,074 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-17 00:38:51,075 INFO L229 MonitoredProcess]: Starting monitored process 29 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-17 00:38:51,075 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (29)] Waiting until timeout for monitored process [2024-11-17 00:38:51,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:38:51,243 INFO L255 TraceCheckSpWp]: Trace formula consists of 211 conjuncts, 29 conjuncts are in the unsatisfiable core [2024-11-17 00:38:51,245 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-17 00:38:51,584 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 15 treesize of output 7 [2024-11-17 00:38:51,589 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 7 treesize of output 3 [2024-11-17 00:38:51,640 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-17 00:38:51,640 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-17 00:38:51,640 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-17 00:38:51,641 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [35544039] [2024-11-17 00:38:51,641 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [35544039] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 00:38:51,641 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 00:38:51,641 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2024-11-17 00:38:51,641 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [556665173] [2024-11-17 00:38:51,641 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 00:38:51,641 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-11-17 00:38:51,641 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-17 00:38:51,642 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-11-17 00:38:51,642 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=129, Unknown=0, NotChecked=0, Total=156 [2024-11-17 00:38:51,642 INFO L87 Difference]: Start difference. First operand 133 states and 154 transitions. Second operand has 13 states, 12 states have (on average 2.6666666666666665) internal successors, (32), 13 states have internal predecessors, (32), 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-17 00:38:52,655 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 00:38:52,656 INFO L93 Difference]: Finished difference Result 136 states and 158 transitions. [2024-11-17 00:38:52,656 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-17 00:38:52,656 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 2.6666666666666665) internal successors, (32), 13 states have internal predecessors, (32), 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 32 [2024-11-17 00:38:52,656 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 00:38:52,657 INFO L225 Difference]: With dead ends: 136 [2024-11-17 00:38:52,657 INFO L226 Difference]: Without dead ends: 136 [2024-11-17 00:38:52,657 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=40, Invalid=200, Unknown=0, NotChecked=0, Total=240 [2024-11-17 00:38:52,658 INFO L432 NwaCegarLoop]: 58 mSDtfsCounter, 30 mSDsluCounter, 414 mSDsCounter, 0 mSdLazyCounter, 436 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 472 SdHoareTripleChecker+Invalid, 438 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 436 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-11-17 00:38:52,658 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 472 Invalid, 438 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 436 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-11-17 00:38:52,659 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 136 states. [2024-11-17 00:38:52,664 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 136 to 133. [2024-11-17 00:38:52,664 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 133 states, 108 states have (on average 1.4166666666666667) internal successors, (153), 132 states have internal predecessors, (153), 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-17 00:38:52,664 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 133 states and 153 transitions. [2024-11-17 00:38:52,665 INFO L78 Accepts]: Start accepts. Automaton has 133 states and 153 transitions. Word has length 32 [2024-11-17 00:38:52,665 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 00:38:52,665 INFO L471 AbstractCegarLoop]: Abstraction has 133 states and 153 transitions. [2024-11-17 00:38:52,665 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 2.6666666666666665) internal successors, (32), 13 states have internal predecessors, (32), 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-17 00:38:52,665 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 153 transitions. [2024-11-17 00:38:52,665 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2024-11-17 00:38:52,665 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 00:38:52,665 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 00:38:52,679 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 (29)] Ended with exit code 0 [2024-11-17 00:38:52,865 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 29 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -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-17 00:38:52,866 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr29REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 44 more)] === [2024-11-17 00:38:52,867 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 00:38:52,867 INFO L85 PathProgramCache]: Analyzing trace with hash 1480940711, now seen corresponding path program 1 times [2024-11-17 00:38:52,868 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-17 00:38:52,868 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [149912453] [2024-11-17 00:38:52,868 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 00:38:52,872 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-17 00:38:52,872 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-17 00:38:52,879 INFO L229 MonitoredProcess]: Starting monitored process 30 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-17 00:38:52,882 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 (30)] Waiting until timeout for monitored process [2024-11-17 00:38:53,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:38:53,395 INFO L255 TraceCheckSpWp]: Trace formula consists of 298 conjuncts, 52 conjuncts are in the unsatisfiable core [2024-11-17 00:38:53,400 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-17 00:38:53,405 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-17 00:38:53,436 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 11 treesize of output 7 [2024-11-17 00:38:53,444 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 11 treesize of output 7 [2024-11-17 00:38:53,536 INFO L349 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2024-11-17 00:38:53,536 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-17 00:38:53,604 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 16 treesize of output 11 [2024-11-17 00:38:53,627 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 16 treesize of output 11 [2024-11-17 00:38:53,656 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 16 treesize of output 11 [2024-11-17 00:38:53,663 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 16 treesize of output 11 [2024-11-17 00:38:53,750 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2024-11-17 00:38:53,880 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 26 treesize of output 14 [2024-11-17 00:38:53,943 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 16 treesize of output 11 [2024-11-17 00:38:53,966 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 16 treesize of output 11 [2024-11-17 00:38:53,979 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 35 treesize of output 26 [2024-11-17 00:38:54,094 INFO L349 Elim1Store]: treesize reduction 60, result has 34.1 percent of original size [2024-11-17 00:38:54,094 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 32 treesize of output 44 [2024-11-17 00:38:54,164 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 47 treesize of output 34 [2024-11-17 00:38:54,230 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 47 treesize of output 34 [2024-11-17 00:38:54,289 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 18 [2024-11-17 00:38:54,373 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-17 00:38:54,373 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-17 00:38:54,473 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1157 (Array (_ BitVec 64) (_ BitVec 64)))) (= (_ bv0 1) (bvadd (_ bv1 1) (select |c_#valid| (select (select (store |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_create_~ptr~0#1.base| v_ArrVal_1157) |c_ULTIMATE.start_create_~head~0#1.base|) (bvadd (_ bv8 64) |c_ULTIMATE.start_create_~head~0#1.offset|)))))) is different from false [2024-11-17 00:38:58,921 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1157 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1155 (_ BitVec 1)) (v_ArrVal_1153 (Array (_ BitVec 64) (_ BitVec 64))) (|v_ULTIMATE.start_create_~ptr~0#1.base_25| (_ BitVec 64))) (or (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_create_~ptr~0#1.base_25|))) (= (_ bv0 1) (bvadd (_ bv1 1) (select (store |c_#valid| |v_ULTIMATE.start_create_~ptr~0#1.base_25| v_ArrVal_1155) (select (select (store (let ((.cse0 (store |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start___list_add_~new#1.base| v_ArrVal_1153))) (store .cse0 |c_ULTIMATE.start___list_add_~prev#1.base| (store (select .cse0 |c_ULTIMATE.start___list_add_~prev#1.base|) |c_ULTIMATE.start___list_add_~prev#1.offset| |c_ULTIMATE.start___list_add_~new#1.base|))) |v_ULTIMATE.start_create_~ptr~0#1.base_25| v_ArrVal_1157) |c_ULTIMATE.start_create_~head~0#1.base|) (bvadd (_ bv8 64) |c_ULTIMATE.start_create_~head~0#1.offset|))))))) is different from false [2024-11-17 00:38:59,070 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1157 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1155 (_ BitVec 1)) (v_ArrVal_1153 (Array (_ BitVec 64) (_ BitVec 64))) (|v_ULTIMATE.start_create_~ptr~0#1.base_25| (_ BitVec 64))) (or (= (_ bv0 1) (bvadd (select (store |c_#valid| |v_ULTIMATE.start_create_~ptr~0#1.base_25| v_ArrVal_1155) (select (select (store (let ((.cse0 (store (store |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start___list_add_~next#1.base| (store (select |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start___list_add_~next#1.base|) (bvadd (_ bv8 64) |c_ULTIMATE.start___list_add_~next#1.offset|) |c_ULTIMATE.start___list_add_~new#1.base|)) |c_ULTIMATE.start___list_add_~new#1.base| v_ArrVal_1153))) (store .cse0 |c_ULTIMATE.start___list_add_~prev#1.base| (store (select .cse0 |c_ULTIMATE.start___list_add_~prev#1.base|) |c_ULTIMATE.start___list_add_~prev#1.offset| |c_ULTIMATE.start___list_add_~new#1.base|))) |v_ULTIMATE.start_create_~ptr~0#1.base_25| v_ArrVal_1157) |c_ULTIMATE.start_create_~head~0#1.base|) (bvadd (_ bv8 64) |c_ULTIMATE.start_create_~head~0#1.offset|))) (_ bv1 1))) (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_create_~ptr~0#1.base_25|))))) is different from false [2024-11-17 00:38:59,120 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1157 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1155 (_ BitVec 1)) (v_ArrVal_1153 (Array (_ BitVec 64) (_ BitVec 64))) (|v_ULTIMATE.start_create_~ptr~0#1.base_25| (_ BitVec 64))) (or (= (_ bv0 1) (bvadd (_ bv1 1) (select (store |c_#valid| |v_ULTIMATE.start_create_~ptr~0#1.base_25| v_ArrVal_1155) (select (select (store (let ((.cse0 (store (store |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_list_add_tail_~head#1.base| (store (select |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_list_add_tail_~head#1.base|) (bvadd (_ bv8 64) |c_ULTIMATE.start_list_add_tail_~head#1.offset|) |c_ULTIMATE.start_list_add_tail_~new#1.base|)) |c_ULTIMATE.start_list_add_tail_~new#1.base| v_ArrVal_1153))) (store .cse0 |c_ULTIMATE.start_list_add_tail_#t~mem3#1.base| (store (select .cse0 |c_ULTIMATE.start_list_add_tail_#t~mem3#1.base|) |c_ULTIMATE.start_list_add_tail_#t~mem3#1.offset| |c_ULTIMATE.start_list_add_tail_~new#1.base|))) |v_ULTIMATE.start_create_~ptr~0#1.base_25| v_ArrVal_1157) |c_ULTIMATE.start_create_~head~0#1.base|) (bvadd (_ bv8 64) |c_ULTIMATE.start_create_~head~0#1.offset|))))) (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_create_~ptr~0#1.base_25|))))) is different from false [2024-11-17 00:39:01,122 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-17 00:39:01,257 INFO L349 Elim1Store]: treesize reduction 15, result has 67.4 percent of original size [2024-11-17 00:39:01,257 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 4 case distinctions, treesize of input 1682 treesize of output 1341 [2024-11-17 00:39:01,302 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-17 00:39:01,302 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 237 treesize of output 208 [2024-11-17 00:39:01,320 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 352 treesize of output 322 [2024-11-17 00:39:01,349 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 149 treesize of output 141 [2024-11-17 00:39:01,370 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 288 treesize of output 272 [2024-11-17 00:39:01,521 INFO L349 Elim1Store]: treesize reduction 16, result has 51.5 percent of original size [2024-11-17 00:39:01,522 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 489 treesize of output 479 [2024-11-17 00:39:01,551 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 222 treesize of output 186 [2024-11-17 00:39:05,877 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 7 not checked. [2024-11-17 00:39:05,877 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-17 00:39:05,877 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [149912453] [2024-11-17 00:39:05,877 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [149912453] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-17 00:39:05,877 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-17 00:39:05,877 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 16] total 28 [2024-11-17 00:39:05,877 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [665781568] [2024-11-17 00:39:05,877 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-17 00:39:05,878 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2024-11-17 00:39:05,878 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-17 00:39:05,878 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2024-11-17 00:39:05,879 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=119, Invalid=465, Unknown=32, NotChecked=196, Total=812 [2024-11-17 00:39:05,879 INFO L87 Difference]: Start difference. First operand 133 states and 153 transitions. Second operand has 29 states, 28 states have (on average 2.25) internal successors, (63), 29 states have internal predecessors, (63), 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-17 00:39:14,066 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (bvadd (_ bv8 64) |c_ULTIMATE.start_create_~head~0#1.offset|))) (and (forall ((v_ArrVal_1157 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1155 (_ BitVec 1)) (|v_ULTIMATE.start_create_~ptr~0#1.base_25| (_ BitVec 64))) (or (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_create_~ptr~0#1.base_25|))) (= (_ bv0 1) (bvadd (_ bv1 1) (select (store |c_#valid| |v_ULTIMATE.start_create_~ptr~0#1.base_25| v_ArrVal_1155) (select (select (store |c_#memory_$Pointer$#0.base| |v_ULTIMATE.start_create_~ptr~0#1.base_25| v_ArrVal_1157) |c_ULTIMATE.start_create_~head~0#1.base|) .cse0)))))) (= (_ bv0 1) (bvadd (_ bv1 1) (select |c_#valid| |c_ULTIMATE.start___list_add_~prev#1.base|))) (= (_ bv0 64) |c_ULTIMATE.start_create_~head~0#1.offset|) (= (_ bv0 1) (bvadd (_ bv1 1) (select |c_#valid| |c_ULTIMATE.start_create_~head~0#1.base|))) (forall ((v_ArrVal_1157 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1155 (_ BitVec 1)) (|v_ULTIMATE.start_create_~ptr~0#1.base_25| (_ BitVec 64))) (or (= (_ bv0 1) (bvadd (_ bv1 1) (select (store |c_#valid| |v_ULTIMATE.start_create_~ptr~0#1.base_25| v_ArrVal_1155) (select (select (store (store |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start___list_add_~prev#1.base| (store (select |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start___list_add_~prev#1.base|) |c_ULTIMATE.start___list_add_~prev#1.offset| |c_ULTIMATE.start___list_add_~new#1.base|)) |v_ULTIMATE.start_create_~ptr~0#1.base_25| v_ArrVal_1157) |c_ULTIMATE.start_create_~head~0#1.base|) .cse0)))) (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_create_~ptr~0#1.base_25|))))) (= (_ bv0 1) (bvadd (select |c_#valid| (select (select |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_create_~head~0#1.base|) .cse0)) (_ bv1 1))) (exists ((|ULTIMATE.start_list_add_tail_~head#1.base| (_ BitVec 64))) (and (not (= |ULTIMATE.start_list_add_tail_~head#1.base| |c_ULTIMATE.start___list_add_~prev#1.base|)) (= (_ bv0 1) (bvadd (_ bv1 1) (select |c_#valid| |ULTIMATE.start_list_add_tail_~head#1.base|))))) (forall ((v_ArrVal_1157 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1155 (_ BitVec 1)) (v_ArrVal_1153 (Array (_ BitVec 64) (_ BitVec 64))) (|v_ULTIMATE.start_create_~ptr~0#1.base_25| (_ BitVec 64))) (or (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_create_~ptr~0#1.base_25|))) (= (_ bv0 1) (bvadd (_ bv1 1) (select (store |c_#valid| |v_ULTIMATE.start_create_~ptr~0#1.base_25| v_ArrVal_1155) (select (select (store (let ((.cse1 (store |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start___list_add_~new#1.base| v_ArrVal_1153))) (store .cse1 |c_ULTIMATE.start___list_add_~prev#1.base| (store (select .cse1 |c_ULTIMATE.start___list_add_~prev#1.base|) |c_ULTIMATE.start___list_add_~prev#1.offset| |c_ULTIMATE.start___list_add_~new#1.base|))) |v_ULTIMATE.start_create_~ptr~0#1.base_25| v_ArrVal_1157) |c_ULTIMATE.start_create_~head~0#1.base|) .cse0)))))))) is different from false [2024-11-17 00:39:19,453 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2024-11-17 00:39:29,871 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2024-11-17 00:39:34,234 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-17 00:39:34,383 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (not (= (_ bv0 1) (bvadd (_ bv1 1) (select |c_#valid| |c_ULTIMATE.start_create_~head~0#1.base|))))) (.cse0 (bvadd (_ bv8 64) |c_ULTIMATE.start_create_~head~0#1.offset|))) (and (forall ((v_ArrVal_1157 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1155 (_ BitVec 1)) (|v_ULTIMATE.start_create_~ptr~0#1.base_25| (_ BitVec 64))) (or (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_create_~ptr~0#1.base_25|))) (= (_ bv0 1) (bvadd (_ bv1 1) (select (store |c_#valid| |v_ULTIMATE.start_create_~ptr~0#1.base_25| v_ArrVal_1155) (select (select (store |c_#memory_$Pointer$#0.base| |v_ULTIMATE.start_create_~ptr~0#1.base_25| v_ArrVal_1157) |c_ULTIMATE.start_create_~head~0#1.base|) .cse0)))))) (or .cse1 (forall ((v_ArrVal_1157 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1155 (_ BitVec 1)) (v_ArrVal_1153 (Array (_ BitVec 64) (_ BitVec 64))) (|v_ULTIMATE.start_create_~ptr~0#1.base_25| (_ BitVec 64))) (or (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_create_~ptr~0#1.base_25|))) (= (_ bv0 1) (bvadd (_ bv1 1) (select (store |c_#valid| |v_ULTIMATE.start_create_~ptr~0#1.base_25| v_ArrVal_1155) (select (select (store (let ((.cse4 (select |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_create_~head~0#1.base|))) (let ((.cse2 (store (store |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_create_~head~0#1.base| (store .cse4 .cse0 |c_ULTIMATE.start_create_~ptr~0#1.base|)) |c_ULTIMATE.start_create_~ptr~0#1.base| v_ArrVal_1153)) (.cse3 (select .cse4 .cse0))) (store .cse2 .cse3 (store (select .cse2 .cse3) (select (select |c_#memory_$Pointer$#0.offset| |c_ULTIMATE.start_create_~head~0#1.base|) .cse0) |c_ULTIMATE.start_create_~ptr~0#1.base|)))) |v_ULTIMATE.start_create_~ptr~0#1.base_25| v_ArrVal_1157) |c_ULTIMATE.start_create_~head~0#1.base|) .cse0))))))) (forall ((v_ArrVal_1157 (Array (_ BitVec 64) (_ BitVec 64)))) (= (_ bv0 1) (bvadd (_ bv1 1) (select |c_#valid| (select (select (store |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_create_~ptr~0#1.base| v_ArrVal_1157) |c_ULTIMATE.start_create_~head~0#1.base|) .cse0))))) (or .cse1 (forall ((v_ArrVal_1157 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1155 (_ BitVec 1)) (v_ArrVal_1149 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1153 (Array (_ BitVec 64) (_ BitVec 64))) (|v_ULTIMATE.start_create_~ptr~0#1.base_25| (_ BitVec 64)) (v_ArrVal_1150 (Array (_ BitVec 64) (_ BitVec 64)))) (or (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_create_~ptr~0#1.base_25|))) (= (_ bv0 1) (bvadd (_ bv1 1) (select (store |c_#valid| |v_ULTIMATE.start_create_~ptr~0#1.base_25| v_ArrVal_1155) (select (select (store (let ((.cse7 (select (store |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_create_~ptr~0#1.base| v_ArrVal_1149) |c_ULTIMATE.start_create_~head~0#1.base|))) (let ((.cse5 (store (store |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_create_~head~0#1.base| (store .cse7 .cse0 |c_ULTIMATE.start_create_~ptr~0#1.base|)) |c_ULTIMATE.start_create_~ptr~0#1.base| v_ArrVal_1153)) (.cse6 (select .cse7 .cse0))) (store .cse5 .cse6 (store (select .cse5 .cse6) (select (select (store |c_#memory_$Pointer$#0.offset| |c_ULTIMATE.start_create_~ptr~0#1.base| v_ArrVal_1150) |c_ULTIMATE.start_create_~head~0#1.base|) .cse0) |c_ULTIMATE.start_create_~ptr~0#1.base|)))) |v_ULTIMATE.start_create_~ptr~0#1.base_25| v_ArrVal_1157) |c_ULTIMATE.start_create_~head~0#1.base|) .cse0))))))))) is different from false [2024-11-17 00:39:34,542 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (bvadd (_ bv8 64) |c_ULTIMATE.start_create_~head~0#1.offset|))) (and (forall ((v_ArrVal_1157 (Array (_ BitVec 64) (_ BitVec 64)))) (= (_ bv0 1) (bvadd (_ bv1 1) (select |c_#valid| (select (select (store |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_create_~ptr~0#1.base| v_ArrVal_1157) |c_ULTIMATE.start_create_~head~0#1.base|) .cse0))))) (or (not (= (_ bv0 1) (bvadd (_ bv1 1) (select |c_#valid| |c_ULTIMATE.start_create_~head~0#1.base|)))) (forall ((v_ArrVal_1157 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1155 (_ BitVec 1)) (v_ArrVal_1149 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1153 (Array (_ BitVec 64) (_ BitVec 64))) (|v_ULTIMATE.start_create_~ptr~0#1.base_25| (_ BitVec 64)) (v_ArrVal_1150 (Array (_ BitVec 64) (_ BitVec 64)))) (or (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_create_~ptr~0#1.base_25|))) (= (_ bv0 1) (bvadd (_ bv1 1) (select (store |c_#valid| |v_ULTIMATE.start_create_~ptr~0#1.base_25| v_ArrVal_1155) (select (select (store (let ((.cse3 (select (store |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_create_~ptr~0#1.base| v_ArrVal_1149) |c_ULTIMATE.start_create_~head~0#1.base|))) (let ((.cse1 (store (store |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_create_~head~0#1.base| (store .cse3 .cse0 |c_ULTIMATE.start_create_~ptr~0#1.base|)) |c_ULTIMATE.start_create_~ptr~0#1.base| v_ArrVal_1153)) (.cse2 (select .cse3 .cse0))) (store .cse1 .cse2 (store (select .cse1 .cse2) (select (select (store |c_#memory_$Pointer$#0.offset| |c_ULTIMATE.start_create_~ptr~0#1.base| v_ArrVal_1150) |c_ULTIMATE.start_create_~head~0#1.base|) .cse0) |c_ULTIMATE.start_create_~ptr~0#1.base|)))) |v_ULTIMATE.start_create_~ptr~0#1.base_25| v_ArrVal_1157) |c_ULTIMATE.start_create_~head~0#1.base|) .cse0))))))))) is different from false [2024-11-17 00:39:39,895 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-17 00:39:42,910 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.01s for a HTC check with result VALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-17 00:39:47,138 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1]