./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/valid-memsafety.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/busybox-1.22.0/chroot-incomplete-2.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 4a390ef5 Calling Ultimate with: /root/.sdkman/candidates/java/current/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 /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/busybox-1.22.0/chroot-incomplete-2.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 7fb5800c8758888815eae44b37eaf9bc49d0baa078e11009154801fa3e07455f --- Real Ultimate output --- This is Ultimate 0.2.5-dev-4a390ef-m [2024-10-24 18:22:56,191 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-24 18:22:56,268 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-64bit-Automizer_Default.epf [2024-10-24 18:22:56,275 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-24 18:22:56,277 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-24 18:22:56,303 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-24 18:22:56,303 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-24 18:22:56,303 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-24 18:22:56,304 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-24 18:22:56,304 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-24 18:22:56,304 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-24 18:22:56,305 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-24 18:22:56,305 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-24 18:22:56,305 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-24 18:22:56,306 INFO L153 SettingsManager]: * Use SBE=true [2024-10-24 18:22:56,306 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-24 18:22:56,306 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-24 18:22:56,307 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-24 18:22:56,307 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-10-24 18:22:56,307 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-10-24 18:22:56,307 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-10-24 18:22:56,315 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-24 18:22:56,315 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-10-24 18:22:56,316 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-24 18:22:56,316 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-10-24 18:22:56,316 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-24 18:22:56,316 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-24 18:22:56,317 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-24 18:22:56,317 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-24 18:22:56,317 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-24 18:22:56,318 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-24 18:22:56,318 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-24 18:22:56,318 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-24 18:22:56,319 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-24 18:22:56,319 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-24 18:22:56,319 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-24 18:22:56,320 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-24 18:22:56,320 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-24 18:22:56,320 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-24 18:22:56,321 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 -> 7fb5800c8758888815eae44b37eaf9bc49d0baa078e11009154801fa3e07455f [2024-10-24 18:22:56,631 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-24 18:22:56,660 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-24 18:22:56,664 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-24 18:22:56,666 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-24 18:22:56,667 INFO L274 PluginConnector]: CDTParser initialized [2024-10-24 18:22:56,668 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/busybox-1.22.0/chroot-incomplete-2.i [2024-10-24 18:22:58,265 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-24 18:22:58,643 INFO L384 CDTParser]: Found 1 translation units. [2024-10-24 18:22:58,644 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/busybox-1.22.0/chroot-incomplete-2.i [2024-10-24 18:22:58,681 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6233effc0/312cb63ed5d940f7844ee3bc8462f9e6/FLAG8a257a3c2 [2024-10-24 18:22:58,702 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6233effc0/312cb63ed5d940f7844ee3bc8462f9e6 [2024-10-24 18:22:58,706 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-24 18:22:58,708 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-24 18:22:58,712 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-24 18:22:58,713 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-24 18:22:58,719 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-24 18:22:58,721 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 06:22:58" (1/1) ... [2024-10-24 18:22:58,722 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6bf52849 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 06:22:58, skipping insertion in model container [2024-10-24 18:22:58,722 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 06:22:58" (1/1) ... [2024-10-24 18:22:58,810 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-24 18:22:59,865 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-24 18:22:59,888 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-10-24 18:22:59,889 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver@6789fdf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 06:22:59, skipping insertion in model container [2024-10-24 18:22:59,889 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-24 18:22:59,890 INFO L186 ToolchainWalker]: Toolchain execution was canceled (user or tool) before executing de.uni_freiburg.informatik.ultimate.boogie.procedureinliner [2024-10-24 18:22:59,891 INFO L158 Benchmark]: Toolchain (without parser) took 1182.74ms. Allocated memory is still 151.0MB. Free memory was 78.2MB in the beginning and 97.8MB in the end (delta: -19.6MB). Peak memory consumption was 11.7MB. Max. memory is 16.1GB. [2024-10-24 18:22:59,892 INFO L158 Benchmark]: CDTParser took 0.95ms. Allocated memory is still 151.0MB. Free memory is still 105.5MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-24 18:22:59,892 INFO L158 Benchmark]: CACSL2BoogieTranslator took 1177.97ms. Allocated memory is still 151.0MB. Free memory was 78.1MB in the beginning and 97.8MB in the end (delta: -19.7MB). Peak memory consumption was 11.7MB. Max. memory is 16.1GB. [2024-10-24 18:22:59,894 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.95ms. Allocated memory is still 151.0MB. Free memory is still 105.5MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 1177.97ms. Allocated memory is still 151.0MB. Free memory was 78.1MB in the beginning and 97.8MB in the end (delta: -19.7MB). Peak memory consumption was 11.7MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - UnsupportedSyntaxResult [Line: 2462]: 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/current/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 /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/busybox-1.22.0/chroot-incomplete-2.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 7fb5800c8758888815eae44b37eaf9bc49d0baa078e11009154801fa3e07455f --- Real Ultimate output --- This is Ultimate 0.2.5-dev-4a390ef-m [2024-10-24 18:23:02,157 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-24 18:23:02,245 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-64bit-Automizer_Bitvector.epf [2024-10-24 18:23:02,252 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-24 18:23:02,254 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-24 18:23:02,291 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-24 18:23:02,292 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-24 18:23:02,292 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-24 18:23:02,293 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-24 18:23:02,293 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-24 18:23:02,294 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-24 18:23:02,294 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-24 18:23:02,295 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-24 18:23:02,295 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-24 18:23:02,296 INFO L153 SettingsManager]: * Use SBE=true [2024-10-24 18:23:02,296 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-24 18:23:02,297 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-24 18:23:02,297 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-24 18:23:02,297 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-10-24 18:23:02,298 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-10-24 18:23:02,298 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-10-24 18:23:02,301 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-24 18:23:02,301 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-10-24 18:23:02,302 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-10-24 18:23:02,302 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-24 18:23:02,302 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-10-24 18:23:02,302 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-10-24 18:23:02,303 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-24 18:23:02,303 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-24 18:23:02,303 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-24 18:23:02,303 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-24 18:23:02,304 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-24 18:23:02,304 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-24 18:23:02,305 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-24 18:23:02,311 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-24 18:23:02,313 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-10-24 18:23:02,313 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-10-24 18:23:02,313 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-24 18:23:02,314 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-24 18:23:02,314 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-24 18:23:02,315 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-24 18:23:02,315 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2024-10-24 18:23:02,315 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 -> 7fb5800c8758888815eae44b37eaf9bc49d0baa078e11009154801fa3e07455f [2024-10-24 18:23:02,680 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-24 18:23:02,704 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-24 18:23:02,710 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-24 18:23:02,711 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-24 18:23:02,712 INFO L274 PluginConnector]: CDTParser initialized [2024-10-24 18:23:02,713 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/busybox-1.22.0/chroot-incomplete-2.i [2024-10-24 18:23:04,512 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-24 18:23:04,978 INFO L384 CDTParser]: Found 1 translation units. [2024-10-24 18:23:04,982 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/busybox-1.22.0/chroot-incomplete-2.i [2024-10-24 18:23:05,027 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e4c4a58a3/918892de0f9a4dc89c654f8f13cf35bc/FLAGe83f65b02 [2024-10-24 18:23:05,047 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e4c4a58a3/918892de0f9a4dc89c654f8f13cf35bc [2024-10-24 18:23:05,051 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-24 18:23:05,053 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-24 18:23:05,055 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-24 18:23:05,055 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-24 18:23:05,060 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-24 18:23:05,061 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 06:23:05" (1/1) ... [2024-10-24 18:23:05,062 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@50e448f1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 06:23:05, skipping insertion in model container [2024-10-24 18:23:05,062 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 06:23:05" (1/1) ... [2024-10-24 18:23:05,148 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-24 18:23:06,170 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-24 18:23:06,209 INFO L197 MainTranslator]: Restarting translation with changed settings: SettingsChange [mNewPreferredMemoryModel=HoenickeLindenmann_1ByteResolution] [2024-10-24 18:23:06,240 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-24 18:23:06,372 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-24 18:23:06,381 INFO L200 MainTranslator]: Completed pre-run [2024-10-24 18:23:06,534 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-24 18:23:06,747 INFO L204 MainTranslator]: Completed translation [2024-10-24 18:23:06,748 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 06:23:06 WrapperNode [2024-10-24 18:23:06,749 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-24 18:23:06,750 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-24 18:23:06,750 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-24 18:23:06,750 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-24 18:23:06,758 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 06:23:06" (1/1) ... [2024-10-24 18:23:06,829 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 06:23:06" (1/1) ... [2024-10-24 18:23:06,885 INFO L138 Inliner]: procedures = 625, calls = 244, calls flagged for inlining = 25, calls inlined = 23, statements flattened = 690 [2024-10-24 18:23:06,886 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-24 18:23:06,887 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-24 18:23:06,887 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-24 18:23:06,887 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-24 18:23:06,901 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 06:23:06" (1/1) ... [2024-10-24 18:23:06,902 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 06:23:06" (1/1) ... [2024-10-24 18:23:06,935 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 06:23:06" (1/1) ... [2024-10-24 18:23:06,969 WARN L109 MemorySlicer]: Omit memory slicing because it failed with the following exception: Unsupported: Memory array in LHS [2024-10-24 18:23:06,970 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 06:23:06" (1/1) ... [2024-10-24 18:23:06,970 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 06:23:06" (1/1) ... [2024-10-24 18:23:07,007 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 06:23:06" (1/1) ... [2024-10-24 18:23:07,015 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 06:23:06" (1/1) ... [2024-10-24 18:23:07,026 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 06:23:06" (1/1) ... [2024-10-24 18:23:07,033 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 06:23:06" (1/1) ... [2024-10-24 18:23:07,053 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-24 18:23:07,058 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-24 18:23:07,059 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-24 18:23:07,059 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-24 18:23:07,060 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 06:23:06" (1/1) ... [2024-10-24 18:23:07,071 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-24 18:23:07,086 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 18:23:07,111 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-10-24 18:23:07,118 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-10-24 18:23:07,161 INFO L130 BoogieDeclarations]: Found specification of procedure execvp [2024-10-24 18:23:07,161 INFO L138 BoogieDeclarations]: Found implementation of procedure execvp [2024-10-24 18:23:07,162 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-10-24 18:23:07,162 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2024-10-24 18:23:07,162 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4 [2024-10-24 18:23:07,162 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-10-24 18:23:07,162 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-24 18:23:07,162 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2024-10-24 18:23:07,163 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~intINTTYPE2 [2024-10-24 18:23:07,163 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~intINTTYPE4 [2024-10-24 18:23:07,163 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~intINTTYPE1 [2024-10-24 18:23:07,163 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-24 18:23:07,163 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-24 18:23:07,163 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1 [2024-10-24 18:23:07,163 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_strcpy [2024-10-24 18:23:07,164 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_strcpy [2024-10-24 18:23:07,164 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2024-10-24 18:23:07,164 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$ [2024-10-24 18:23:07,165 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$ [2024-10-24 18:23:07,166 INFO L130 BoogieDeclarations]: Found specification of procedure bb_perror_msg_and_die [2024-10-24 18:23:07,166 INFO L138 BoogieDeclarations]: Found implementation of procedure bb_perror_msg_and_die [2024-10-24 18:23:07,166 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-24 18:23:07,166 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-24 18:23:07,166 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-10-24 18:23:07,166 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2024-10-24 18:23:07,166 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1 [2024-10-24 18:23:07,166 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2024-10-24 18:23:07,166 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2024-10-24 18:23:07,167 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE4 [2024-10-24 18:23:07,167 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE2 [2024-10-24 18:23:07,167 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE1 [2024-10-24 18:23:07,686 INFO L238 CfgBuilder]: Building ICFG [2024-10-24 18:23:07,689 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-24 18:23:11,263 INFO L? ?]: Removed 538 outVars from TransFormulas that were not future-live. [2024-10-24 18:23:11,263 INFO L287 CfgBuilder]: Performing block encoding [2024-10-24 18:23:11,381 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-24 18:23:11,382 INFO L314 CfgBuilder]: Removed 11 assume(true) statements. [2024-10-24 18:23:11,382 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 06:23:11 BoogieIcfgContainer [2024-10-24 18:23:11,382 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-24 18:23:11,384 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-24 18:23:11,384 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-24 18:23:11,389 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-24 18:23:11,390 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.10 06:23:05" (1/3) ... [2024-10-24 18:23:11,390 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5e7e01d4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 06:23:11, skipping insertion in model container [2024-10-24 18:23:11,391 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 06:23:06" (2/3) ... [2024-10-24 18:23:11,391 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5e7e01d4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 06:23:11, skipping insertion in model container [2024-10-24 18:23:11,392 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 06:23:11" (3/3) ... [2024-10-24 18:23:11,394 INFO L112 eAbstractionObserver]: Analyzing ICFG chroot-incomplete-2.i [2024-10-24 18:23:11,412 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-24 18:23:11,412 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 200 error locations. [2024-10-24 18:23:11,480 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-24 18:23:11,489 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;@42a3b545, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-24 18:23:11,490 INFO L334 AbstractCegarLoop]: Starting to check reachability of 200 error locations. [2024-10-24 18:23:11,496 INFO L276 IsEmpty]: Start isEmpty. Operand has 436 states, 216 states have (on average 2.1944444444444446) internal successors, (474), 419 states have internal predecessors, (474), 15 states have call successors, (15), 4 states have call predecessors, (15), 4 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2024-10-24 18:23:11,503 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 3 [2024-10-24 18:23:11,504 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 18:23:11,505 INFO L215 NwaCegarLoop]: trace histogram [1, 1] [2024-10-24 18:23:11,505 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [#Ultimate.C_strcpyErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, #Ultimate.C_strcpyErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, #Ultimate.C_strcpyErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE (and 197 more)] === [2024-10-24 18:23:11,512 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 18:23:11,513 INFO L85 PathProgramCache]: Analyzing trace with hash 28588, now seen corresponding path program 1 times [2024-10-24 18:23:11,529 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 18:23:11,530 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1497479569] [2024-10-24 18:23:11,530 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 18:23:11,530 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-10-24 18:23:11,531 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 18:23:11,534 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-10-24 18:23:11,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 (2)] Waiting until timeout for monitored process [2024-10-24 18:23:11,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 18:23:11,827 INFO L255 TraceCheckSpWp]: Trace formula consists of 154 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-24 18:23:11,832 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 18:23:11,878 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-10-24 18:23:11,917 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 18:23:11,921 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-24 18:23:11,922 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-24 18:23:11,922 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1497479569] [2024-10-24 18:23:11,923 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1497479569] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 18:23:11,923 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 18:23:11,923 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-10-24 18:23:11,925 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [648569381] [2024-10-24 18:23:11,926 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 18:23:11,933 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-24 18:23:11,935 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-24 18:23:11,964 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-24 18:23:11,965 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-24 18:23:11,970 INFO L87 Difference]: Start difference. First operand has 436 states, 216 states have (on average 2.1944444444444446) internal successors, (474), 419 states have internal predecessors, (474), 15 states have call successors, (15), 4 states have call predecessors, (15), 4 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) Second operand has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 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-10-24 18:23:13,383 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 18:23:13,383 INFO L93 Difference]: Finished difference Result 431 states and 477 transitions. [2024-10-24 18:23:13,386 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-24 18:23:13,388 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 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 2 [2024-10-24 18:23:13,389 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 18:23:13,398 INFO L225 Difference]: With dead ends: 431 [2024-10-24 18:23:13,398 INFO L226 Difference]: Without dead ends: 430 [2024-10-24 18:23:13,400 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 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-10-24 18:23:13,404 INFO L432 NwaCegarLoop]: 338 mSDtfsCounter, 185 mSDsluCounter, 149 mSDsCounter, 0 mSdLazyCounter, 250 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 190 SdHoareTripleChecker+Valid, 487 SdHoareTripleChecker+Invalid, 257 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 250 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2024-10-24 18:23:13,404 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [190 Valid, 487 Invalid, 257 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 250 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2024-10-24 18:23:13,423 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 430 states. [2024-10-24 18:23:13,460 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 430 to 413. [2024-10-24 18:23:13,462 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 413 states, 203 states have (on average 2.1330049261083746) internal successors, (433), 398 states have internal predecessors, (433), 14 states have call successors, (14), 4 states have call predecessors, (14), 3 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2024-10-24 18:23:13,467 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 413 states to 413 states and 458 transitions. [2024-10-24 18:23:13,468 INFO L78 Accepts]: Start accepts. Automaton has 413 states and 458 transitions. Word has length 2 [2024-10-24 18:23:13,468 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 18:23:13,468 INFO L471 AbstractCegarLoop]: Abstraction has 413 states and 458 transitions. [2024-10-24 18:23:13,469 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 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-10-24 18:23:13,469 INFO L276 IsEmpty]: Start isEmpty. Operand 413 states and 458 transitions. [2024-10-24 18:23:13,469 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 3 [2024-10-24 18:23:13,469 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 18:23:13,469 INFO L215 NwaCegarLoop]: trace histogram [1, 1] [2024-10-24 18:23:13,476 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-10-24 18:23:13,670 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-10-24 18:23:13,670 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [#Ultimate.C_strcpyErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, #Ultimate.C_strcpyErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, #Ultimate.C_strcpyErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE (and 197 more)] === [2024-10-24 18:23:13,671 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 18:23:13,671 INFO L85 PathProgramCache]: Analyzing trace with hash 28589, now seen corresponding path program 1 times [2024-10-24 18:23:13,672 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 18:23:13,672 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [818355745] [2024-10-24 18:23:13,672 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 18:23:13,673 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-10-24 18:23:13,673 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 18:23:13,676 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-10-24 18:23:13,678 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-10-24 18:23:13,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 18:23:13,893 INFO L255 TraceCheckSpWp]: Trace formula consists of 154 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-10-24 18:23:13,894 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 18:23:13,911 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-10-24 18:23:13,928 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 18:23:13,928 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-24 18:23:13,928 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-24 18:23:13,928 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [818355745] [2024-10-24 18:23:13,928 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [818355745] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 18:23:13,929 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 18:23:13,929 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-10-24 18:23:13,929 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1735669782] [2024-10-24 18:23:13,929 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 18:23:13,930 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-24 18:23:13,930 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-24 18:23:13,930 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-24 18:23:13,931 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-24 18:23:13,931 INFO L87 Difference]: Start difference. First operand 413 states and 458 transitions. Second operand has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 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-10-24 18:23:15,469 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 18:23:15,469 INFO L93 Difference]: Finished difference Result 412 states and 457 transitions. [2024-10-24 18:23:15,470 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-24 18:23:15,471 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 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 2 [2024-10-24 18:23:15,471 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 18:23:15,473 INFO L225 Difference]: With dead ends: 412 [2024-10-24 18:23:15,473 INFO L226 Difference]: Without dead ends: 412 [2024-10-24 18:23:15,473 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 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-10-24 18:23:15,475 INFO L432 NwaCegarLoop]: 404 mSDtfsCounter, 8 mSDsluCounter, 250 mSDsCounter, 0 mSdLazyCounter, 250 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 654 SdHoareTripleChecker+Invalid, 250 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 250 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2024-10-24 18:23:15,475 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 654 Invalid, 250 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 250 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2024-10-24 18:23:15,477 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 412 states. [2024-10-24 18:23:15,494 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 412 to 412. [2024-10-24 18:23:15,495 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 412 states, 203 states have (on average 2.12807881773399) internal successors, (432), 397 states have internal predecessors, (432), 14 states have call successors, (14), 4 states have call predecessors, (14), 3 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2024-10-24 18:23:15,498 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 412 states to 412 states and 457 transitions. [2024-10-24 18:23:15,498 INFO L78 Accepts]: Start accepts. Automaton has 412 states and 457 transitions. Word has length 2 [2024-10-24 18:23:15,499 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 18:23:15,500 INFO L471 AbstractCegarLoop]: Abstraction has 412 states and 457 transitions. [2024-10-24 18:23:15,500 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 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-10-24 18:23:15,500 INFO L276 IsEmpty]: Start isEmpty. Operand 412 states and 457 transitions. [2024-10-24 18:23:15,500 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2024-10-24 18:23:15,500 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 18:23:15,500 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2024-10-24 18:23:15,511 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Ended with exit code 0 [2024-10-24 18:23:15,701 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-10-24 18:23:15,701 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [#Ultimate.C_strcpyErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, #Ultimate.C_strcpyErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, #Ultimate.C_strcpyErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE (and 197 more)] === [2024-10-24 18:23:15,702 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 18:23:15,702 INFO L85 PathProgramCache]: Analyzing trace with hash 27900701, now seen corresponding path program 1 times [2024-10-24 18:23:15,703 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 18:23:15,703 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2131796104] [2024-10-24 18:23:15,703 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 18:23:15,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-10-24 18:23:15,704 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 18:23:15,707 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-10-24 18:23:15,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 (4)] Waiting until timeout for monitored process [2024-10-24 18:23:15,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 18:23:15,938 INFO L255 TraceCheckSpWp]: Trace formula consists of 169 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-10-24 18:23:15,939 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 18:23:15,955 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-10-24 18:23:16,038 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 18:23:16,038 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-24 18:23:16,038 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-24 18:23:16,038 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2131796104] [2024-10-24 18:23:16,039 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2131796104] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 18:23:16,039 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 18:23:16,039 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-24 18:23:16,039 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [601273526] [2024-10-24 18:23:16,039 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 18:23:16,039 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-24 18:23:16,039 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-24 18:23:16,040 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-24 18:23:16,042 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-24 18:23:16,042 INFO L87 Difference]: Start difference. First operand 412 states and 457 transitions. Second operand has 4 states, 3 states have (on average 1.3333333333333333) 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-10-24 18:23:18,396 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 18:23:18,397 INFO L93 Difference]: Finished difference Result 414 states and 459 transitions. [2024-10-24 18:23:18,398 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-24 18:23:18,398 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 1.3333333333333333) 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-10-24 18:23:18,398 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 18:23:18,400 INFO L225 Difference]: With dead ends: 414 [2024-10-24 18:23:18,400 INFO L226 Difference]: Without dead ends: 414 [2024-10-24 18:23:18,400 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-24 18:23:18,401 INFO L432 NwaCegarLoop]: 403 mSDtfsCounter, 8 mSDsluCounter, 501 mSDsCounter, 0 mSdLazyCounter, 456 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 904 SdHoareTripleChecker+Invalid, 457 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 456 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2024-10-24 18:23:18,402 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 904 Invalid, 457 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 456 Invalid, 0 Unknown, 0 Unchecked, 2.3s Time] [2024-10-24 18:23:18,403 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 414 states. [2024-10-24 18:23:18,416 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 414 to 414. [2024-10-24 18:23:18,417 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 414 states, 205 states have (on average 2.1170731707317074) internal successors, (434), 399 states have internal predecessors, (434), 14 states have call successors, (14), 4 states have call predecessors, (14), 3 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2024-10-24 18:23:18,420 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 414 states to 414 states and 459 transitions. [2024-10-24 18:23:18,420 INFO L78 Accepts]: Start accepts. Automaton has 414 states and 459 transitions. Word has length 4 [2024-10-24 18:23:18,420 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 18:23:18,420 INFO L471 AbstractCegarLoop]: Abstraction has 414 states and 459 transitions. [2024-10-24 18:23:18,421 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 1.3333333333333333) 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-10-24 18:23:18,421 INFO L276 IsEmpty]: Start isEmpty. Operand 414 states and 459 transitions. [2024-10-24 18:23:18,421 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2024-10-24 18:23:18,421 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 18:23:18,422 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1] [2024-10-24 18:23:18,432 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Forceful destruction successful, exit code 0 [2024-10-24 18:23:18,625 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-10-24 18:23:18,626 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [#Ultimate.C_strcpyErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, #Ultimate.C_strcpyErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, #Ultimate.C_strcpyErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE (and 197 more)] === [2024-10-24 18:23:18,626 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 18:23:18,627 INFO L85 PathProgramCache]: Analyzing trace with hash 1043190791, now seen corresponding path program 1 times [2024-10-24 18:23:18,628 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 18:23:18,628 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1823423372] [2024-10-24 18:23:18,628 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 18:23:18,628 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-10-24 18:23:18,628 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 18:23:18,631 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-10-24 18:23:18,632 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-10-24 18:23:18,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 18:23:18,872 INFO L255 TraceCheckSpWp]: Trace formula consists of 184 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-10-24 18:23:18,874 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 18:23:18,889 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-10-24 18:23:19,051 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 18:23:19,052 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-24 18:23:19,547 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 18:23:19,548 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-24 18:23:19,548 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1823423372] [2024-10-24 18:23:19,548 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1823423372] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-24 18:23:19,548 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-24 18:23:19,548 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3] total 6 [2024-10-24 18:23:19,548 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [849214114] [2024-10-24 18:23:19,549 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-24 18:23:19,549 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-24 18:23:19,549 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-24 18:23:19,550 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-24 18:23:19,550 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2024-10-24 18:23:19,550 INFO L87 Difference]: Start difference. First operand 414 states and 459 transitions. Second operand has 8 states, 7 states have (on average 1.7142857142857142) internal successors, (12), 7 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 18:23:26,471 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 18:23:26,472 INFO L93 Difference]: Finished difference Result 416 states and 461 transitions. [2024-10-24 18:23:26,474 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-24 18:23:26,474 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 1.7142857142857142) internal successors, (12), 7 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2024-10-24 18:23:26,475 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 18:23:26,476 INFO L225 Difference]: With dead ends: 416 [2024-10-24 18:23:26,477 INFO L226 Difference]: Without dead ends: 416 [2024-10-24 18:23:26,477 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2024-10-24 18:23:26,478 INFO L432 NwaCegarLoop]: 402 mSDtfsCounter, 9 mSDsluCounter, 1002 mSDsCounter, 0 mSdLazyCounter, 859 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 1404 SdHoareTripleChecker+Invalid, 863 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 859 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.7s IncrementalHoareTripleChecker+Time [2024-10-24 18:23:26,478 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 1404 Invalid, 863 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 859 Invalid, 0 Unknown, 0 Unchecked, 6.7s Time] [2024-10-24 18:23:26,479 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 416 states. [2024-10-24 18:23:26,493 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 416 to 416. [2024-10-24 18:23:26,494 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 416 states, 208 states have (on average 2.0961538461538463) internal successors, (436), 401 states have internal predecessors, (436), 14 states have call successors, (14), 4 states have call predecessors, (14), 3 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2024-10-24 18:23:26,496 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 416 states to 416 states and 461 transitions. [2024-10-24 18:23:26,496 INFO L78 Accepts]: Start accepts. Automaton has 416 states and 461 transitions. Word has length 6 [2024-10-24 18:23:26,496 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 18:23:26,496 INFO L471 AbstractCegarLoop]: Abstraction has 416 states and 461 transitions. [2024-10-24 18:23:26,497 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 1.7142857142857142) internal successors, (12), 7 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 18:23:26,497 INFO L276 IsEmpty]: Start isEmpty. Operand 416 states and 461 transitions. [2024-10-24 18:23:26,497 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2024-10-24 18:23:26,498 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 18:23:26,498 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 1, 1, 1, 1, 1] [2024-10-24 18:23:26,508 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-10-24 18:23:26,701 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-10-24 18:23:26,701 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [#Ultimate.C_strcpyErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, #Ultimate.C_strcpyErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, #Ultimate.C_strcpyErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE (and 197 more)] === [2024-10-24 18:23:26,702 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 18:23:26,702 INFO L85 PathProgramCache]: Analyzing trace with hash 1366611978, now seen corresponding path program 1 times [2024-10-24 18:23:26,703 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 18:23:26,703 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1872798317] [2024-10-24 18:23:26,703 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 18:23:26,703 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-10-24 18:23:26,703 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 18:23:26,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-10-24 18:23:26,710 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-10-24 18:23:26,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 18:23:26,989 INFO L255 TraceCheckSpWp]: Trace formula consists of 216 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-10-24 18:23:26,991 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 18:23:27,061 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 18:23:27,062 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-24 18:23:27,155 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 18:23:27,155 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-24 18:23:27,155 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1872798317] [2024-10-24 18:23:27,156 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1872798317] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-24 18:23:27,156 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-24 18:23:27,156 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 10 [2024-10-24 18:23:27,156 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [454233157] [2024-10-24 18:23:27,156 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-24 18:23:27,156 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-10-24 18:23:27,156 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-24 18:23:27,157 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-10-24 18:23:27,161 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2024-10-24 18:23:27,162 INFO L87 Difference]: Start difference. First operand 416 states and 461 transitions. Second operand has 10 states, 10 states have (on average 1.9) internal successors, (19), 10 states have internal predecessors, (19), 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-10-24 18:23:28,952 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 18:23:28,956 INFO L93 Difference]: Finished difference Result 426 states and 471 transitions. [2024-10-24 18:23:28,958 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-10-24 18:23:28,958 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 1.9) internal successors, (19), 10 states have internal predecessors, (19), 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-10-24 18:23:28,959 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 18:23:28,960 INFO L225 Difference]: With dead ends: 426 [2024-10-24 18:23:28,960 INFO L226 Difference]: Without dead ends: 426 [2024-10-24 18:23:28,961 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=63, Invalid=93, Unknown=0, NotChecked=0, Total=156 [2024-10-24 18:23:28,962 INFO L432 NwaCegarLoop]: 406 mSDtfsCounter, 6 mSDsluCounter, 2020 mSDsCounter, 0 mSdLazyCounter, 336 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 2426 SdHoareTripleChecker+Invalid, 338 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 336 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2024-10-24 18:23:28,962 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 2426 Invalid, 338 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 336 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2024-10-24 18:23:28,963 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 426 states. [2024-10-24 18:23:28,972 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 426 to 426. [2024-10-24 18:23:28,973 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 426 states, 218 states have (on average 2.0458715596330275) internal successors, (446), 411 states have internal predecessors, (446), 14 states have call successors, (14), 4 states have call predecessors, (14), 3 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2024-10-24 18:23:28,975 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 426 states to 426 states and 471 transitions. [2024-10-24 18:23:28,977 INFO L78 Accepts]: Start accepts. Automaton has 426 states and 471 transitions. Word has length 11 [2024-10-24 18:23:28,977 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 18:23:28,977 INFO L471 AbstractCegarLoop]: Abstraction has 426 states and 471 transitions. [2024-10-24 18:23:28,978 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 1.9) internal successors, (19), 10 states have internal predecessors, (19), 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-10-24 18:23:28,978 INFO L276 IsEmpty]: Start isEmpty. Operand 426 states and 471 transitions. [2024-10-24 18:23:28,978 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2024-10-24 18:23:28,978 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 18:23:28,979 INFO L215 NwaCegarLoop]: trace histogram [8, 8, 1, 1, 1, 1, 1] [2024-10-24 18:23:28,993 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 (6)] Forceful destruction successful, exit code 0 [2024-10-24 18:23:29,182 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-10-24 18:23:29,183 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [#Ultimate.C_strcpyErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, #Ultimate.C_strcpyErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, #Ultimate.C_strcpyErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE (and 197 more)] === [2024-10-24 18:23:29,183 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 18:23:29,183 INFO L85 PathProgramCache]: Analyzing trace with hash -943059912, now seen corresponding path program 2 times [2024-10-24 18:23:29,184 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 18:23:29,184 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [533760641] [2024-10-24 18:23:29,184 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-10-24 18:23:29,184 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-10-24 18:23:29,184 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 18:23:29,186 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-10-24 18:23:29,187 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-10-24 18:23:29,473 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2024-10-24 18:23:29,473 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-24 18:23:29,478 INFO L255 TraceCheckSpWp]: Trace formula consists of 171 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-10-24 18:23:29,480 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 18:23:29,517 INFO L349 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2024-10-24 18:23:29,517 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-10-24 18:23:29,908 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2024-10-24 18:23:29,908 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-24 18:23:29,908 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-24 18:23:29,908 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [533760641] [2024-10-24 18:23:29,909 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [533760641] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 18:23:29,909 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 18:23:29,909 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-10-24 18:23:29,909 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1109021733] [2024-10-24 18:23:29,909 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 18:23:29,909 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-24 18:23:29,909 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-24 18:23:29,910 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-24 18:23:29,910 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-24 18:23:29,910 INFO L87 Difference]: Start difference. First operand 426 states and 471 transitions. Second operand has 3 states, 2 states have (on average 3.5) internal successors, (7), 2 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 18:23:32,028 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 18:23:32,029 INFO L93 Difference]: Finished difference Result 544 states and 599 transitions. [2024-10-24 18:23:32,030 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-24 18:23:32,030 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 3.5) internal successors, (7), 2 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 21 [2024-10-24 18:23:32,030 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 18:23:32,033 INFO L225 Difference]: With dead ends: 544 [2024-10-24 18:23:32,033 INFO L226 Difference]: Without dead ends: 544 [2024-10-24 18:23:32,034 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 19 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-10-24 18:23:32,036 INFO L432 NwaCegarLoop]: 293 mSDtfsCounter, 414 mSDsluCounter, 83 mSDsCounter, 0 mSdLazyCounter, 274 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 414 SdHoareTripleChecker+Valid, 376 SdHoareTripleChecker+Invalid, 285 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 274 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2024-10-24 18:23:32,036 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [414 Valid, 376 Invalid, 285 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 274 Invalid, 0 Unknown, 0 Unchecked, 2.1s Time] [2024-10-24 18:23:32,038 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 544 states. [2024-10-24 18:23:32,053 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 544 to 464. [2024-10-24 18:23:32,054 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 464 states, 253 states have (on average 2.0790513833992095) internal successors, (526), 446 states have internal predecessors, (526), 17 states have call successors, (17), 5 states have call predecessors, (17), 4 states have return successors, (14), 13 states have call predecessors, (14), 14 states have call successors, (14) [2024-10-24 18:23:32,057 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 464 states to 464 states and 557 transitions. [2024-10-24 18:23:32,057 INFO L78 Accepts]: Start accepts. Automaton has 464 states and 557 transitions. Word has length 21 [2024-10-24 18:23:32,057 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 18:23:32,057 INFO L471 AbstractCegarLoop]: Abstraction has 464 states and 557 transitions. [2024-10-24 18:23:32,058 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 3.5) internal successors, (7), 2 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 18:23:32,058 INFO L276 IsEmpty]: Start isEmpty. Operand 464 states and 557 transitions. [2024-10-24 18:23:32,058 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2024-10-24 18:23:32,058 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 18:23:32,059 INFO L215 NwaCegarLoop]: trace histogram [8, 8, 1, 1, 1, 1, 1] [2024-10-24 18:23:32,070 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-10-24 18:23:32,259 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-10-24 18:23:32,260 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [#Ultimate.C_strcpyErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, #Ultimate.C_strcpyErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, #Ultimate.C_strcpyErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE (and 197 more)] === [2024-10-24 18:23:32,260 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 18:23:32,260 INFO L85 PathProgramCache]: Analyzing trace with hash -943059911, now seen corresponding path program 1 times [2024-10-24 18:23:32,261 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 18:23:32,261 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [65266110] [2024-10-24 18:23:32,261 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 18:23:32,261 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-10-24 18:23:32,262 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 18:23:32,265 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-10-24 18:23:32,267 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-10-24 18:23:32,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 18:23:32,569 INFO L255 TraceCheckSpWp]: Trace formula consists of 291 conjuncts, 10 conjuncts are in the unsatisfiable core [2024-10-24 18:23:32,570 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 18:23:32,724 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 18:23:32,724 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-24 18:23:33,041 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 18:23:33,042 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-24 18:23:33,042 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [65266110] [2024-10-24 18:23:33,042 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [65266110] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-24 18:23:33,042 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-24 18:23:33,042 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 20 [2024-10-24 18:23:33,042 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1507727837] [2024-10-24 18:23:33,042 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-24 18:23:33,043 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2024-10-24 18:23:33,043 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-24 18:23:33,043 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2024-10-24 18:23:33,043 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=90, Invalid=290, Unknown=0, NotChecked=0, Total=380 [2024-10-24 18:23:33,044 INFO L87 Difference]: Start difference. First operand 464 states and 557 transitions. Second operand has 20 states, 20 states have (on average 1.95) internal successors, (39), 20 states have internal predecessors, (39), 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-10-24 18:23:36,270 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 18:23:36,271 INFO L93 Difference]: Finished difference Result 468 states and 561 transitions. [2024-10-24 18:23:36,272 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-10-24 18:23:36,273 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 1.95) internal successors, (39), 20 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 21 [2024-10-24 18:23:36,273 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 18:23:36,276 INFO L225 Difference]: With dead ends: 468 [2024-10-24 18:23:36,277 INFO L226 Difference]: Without dead ends: 468 [2024-10-24 18:23:36,277 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=90, Invalid=290, Unknown=0, NotChecked=0, Total=380 [2024-10-24 18:23:36,278 INFO L432 NwaCegarLoop]: 405 mSDtfsCounter, 2 mSDsluCounter, 4433 mSDsCounter, 0 mSdLazyCounter, 767 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 4838 SdHoareTripleChecker+Invalid, 768 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 767 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.2s IncrementalHoareTripleChecker+Time [2024-10-24 18:23:36,278 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 4838 Invalid, 768 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 767 Invalid, 0 Unknown, 0 Unchecked, 3.2s Time] [2024-10-24 18:23:36,279 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 468 states. [2024-10-24 18:23:36,286 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 468 to 468. [2024-10-24 18:23:36,287 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 468 states, 257 states have (on average 2.062256809338521) internal successors, (530), 450 states have internal predecessors, (530), 17 states have call successors, (17), 5 states have call predecessors, (17), 4 states have return successors, (14), 13 states have call predecessors, (14), 14 states have call successors, (14) [2024-10-24 18:23:36,289 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 468 states to 468 states and 561 transitions. [2024-10-24 18:23:36,290 INFO L78 Accepts]: Start accepts. Automaton has 468 states and 561 transitions. Word has length 21 [2024-10-24 18:23:36,290 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 18:23:36,290 INFO L471 AbstractCegarLoop]: Abstraction has 468 states and 561 transitions. [2024-10-24 18:23:36,290 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 1.95) internal successors, (39), 20 states have internal predecessors, (39), 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-10-24 18:23:36,290 INFO L276 IsEmpty]: Start isEmpty. Operand 468 states and 561 transitions. [2024-10-24 18:23:36,291 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2024-10-24 18:23:36,291 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 18:23:36,291 INFO L215 NwaCegarLoop]: trace histogram [10, 10, 1, 1, 1, 1, 1] [2024-10-24 18:23:36,307 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Ended with exit code 0 [2024-10-24 18:23:36,492 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-10-24 18:23:36,493 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [#Ultimate.C_strcpyErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, #Ultimate.C_strcpyErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, #Ultimate.C_strcpyErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE (and 197 more)] === [2024-10-24 18:23:36,493 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 18:23:36,494 INFO L85 PathProgramCache]: Analyzing trace with hash -1319862427, now seen corresponding path program 2 times [2024-10-24 18:23:36,494 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 18:23:36,495 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [692085201] [2024-10-24 18:23:36,495 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-10-24 18:23:36,495 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-10-24 18:23:36,495 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 18:23:36,498 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-10-24 18:23:36,502 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-10-24 18:23:36,846 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2024-10-24 18:23:36,847 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-24 18:23:36,854 INFO L255 TraceCheckSpWp]: Trace formula consists of 171 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-10-24 18:23:36,856 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 18:23:36,886 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-24 18:23:36,887 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-10-24 18:23:37,179 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2024-10-24 18:23:37,179 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-24 18:23:37,179 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-24 18:23:37,179 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [692085201] [2024-10-24 18:23:37,179 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [692085201] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 18:23:37,180 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 18:23:37,180 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-10-24 18:23:37,180 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1355676297] [2024-10-24 18:23:37,180 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 18:23:37,180 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-24 18:23:37,180 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-24 18:23:37,180 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-24 18:23:37,181 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-24 18:23:37,181 INFO L87 Difference]: Start difference. First operand 468 states and 561 transitions. Second operand has 3 states, 2 states have (on average 3.5) internal successors, (7), 2 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 18:23:38,772 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 18:23:38,772 INFO L93 Difference]: Finished difference Result 471 states and 563 transitions. [2024-10-24 18:23:38,775 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-24 18:23:38,775 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 3.5) internal successors, (7), 2 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 25 [2024-10-24 18:23:38,776 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 18:23:38,778 INFO L225 Difference]: With dead ends: 471 [2024-10-24 18:23:38,778 INFO L226 Difference]: Without dead ends: 471 [2024-10-24 18:23:38,778 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 23 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-10-24 18:23:38,779 INFO L432 NwaCegarLoop]: 404 mSDtfsCounter, 6 mSDsluCounter, 256 mSDsCounter, 0 mSdLazyCounter, 239 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 660 SdHoareTripleChecker+Invalid, 239 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 239 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2024-10-24 18:23:38,779 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 660 Invalid, 239 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 239 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2024-10-24 18:23:38,781 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 471 states. [2024-10-24 18:23:38,788 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 471 to 471. [2024-10-24 18:23:38,789 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 471 states, 260 states have (on average 2.046153846153846) internal successors, (532), 452 states have internal predecessors, (532), 17 states have call successors, (17), 6 states have call predecessors, (17), 5 states have return successors, (14), 13 states have call predecessors, (14), 14 states have call successors, (14) [2024-10-24 18:23:38,792 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 471 states to 471 states and 563 transitions. [2024-10-24 18:23:38,793 INFO L78 Accepts]: Start accepts. Automaton has 471 states and 563 transitions. Word has length 25 [2024-10-24 18:23:38,793 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 18:23:38,793 INFO L471 AbstractCegarLoop]: Abstraction has 471 states and 563 transitions. [2024-10-24 18:23:38,793 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 3.5) internal successors, (7), 2 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 18:23:38,794 INFO L276 IsEmpty]: Start isEmpty. Operand 471 states and 563 transitions. [2024-10-24 18:23:38,794 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2024-10-24 18:23:38,794 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 18:23:38,795 INFO L215 NwaCegarLoop]: trace histogram [10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 18:23:38,805 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Ended with exit code 0 [2024-10-24 18:23:38,995 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-10-24 18:23:38,996 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [#Ultimate.C_strcpyErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, #Ultimate.C_strcpyErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, #Ultimate.C_strcpyErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE (and 197 more)] === [2024-10-24 18:23:38,996 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 18:23:38,996 INFO L85 PathProgramCache]: Analyzing trace with hash 547184062, now seen corresponding path program 1 times [2024-10-24 18:23:38,997 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 18:23:38,997 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1163824210] [2024-10-24 18:23:38,997 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 18:23:38,997 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-24 18:23:38,997 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 18:23:38,999 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-10-24 18:23:39,000 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-10-24 18:23:39,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 18:23:39,628 INFO L255 TraceCheckSpWp]: Trace formula consists of 365 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-10-24 18:23:39,630 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 18:23:39,663 INFO L349 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2024-10-24 18:23:39,664 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 1 case distinctions, treesize of input 9 treesize of output 15 [2024-10-24 18:23:39,698 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2024-10-24 18:23:39,698 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-24 18:23:39,698 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-24 18:23:39,698 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1163824210] [2024-10-24 18:23:39,698 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1163824210] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 18:23:39,698 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 18:23:39,699 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-24 18:23:39,699 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [961810488] [2024-10-24 18:23:39,699 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 18:23:39,700 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-24 18:23:39,700 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-24 18:23:39,702 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-24 18:23:39,702 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-24 18:23:39,702 INFO L87 Difference]: Start difference. First operand 471 states and 563 transitions. Second operand has 3 states, 2 states have (on average 6.0) internal successors, (12), 3 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-24 18:23:42,059 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 18:23:42,060 INFO L93 Difference]: Finished difference Result 483 states and 576 transitions. [2024-10-24 18:23:42,060 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-24 18:23:42,061 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 6.0) internal successors, (12), 3 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 32 [2024-10-24 18:23:42,061 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 18:23:42,063 INFO L225 Difference]: With dead ends: 483 [2024-10-24 18:23:42,064 INFO L226 Difference]: Without dead ends: 483 [2024-10-24 18:23:42,064 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 30 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-10-24 18:23:42,065 INFO L432 NwaCegarLoop]: 333 mSDtfsCounter, 167 mSDsluCounter, 154 mSDsCounter, 0 mSdLazyCounter, 250 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 171 SdHoareTripleChecker+Valid, 487 SdHoareTripleChecker+Invalid, 259 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 250 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2024-10-24 18:23:42,065 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [171 Valid, 487 Invalid, 259 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 250 Invalid, 0 Unknown, 0 Unchecked, 2.3s Time] [2024-10-24 18:23:42,066 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 483 states. [2024-10-24 18:23:42,074 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 483 to 466. [2024-10-24 18:23:42,075 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 466 states, 260 states have (on average 2.026923076923077) internal successors, (527), 447 states have internal predecessors, (527), 17 states have call successors, (17), 6 states have call predecessors, (17), 5 states have return successors, (14), 13 states have call predecessors, (14), 14 states have call successors, (14) [2024-10-24 18:23:42,077 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 466 states to 466 states and 558 transitions. [2024-10-24 18:23:42,077 INFO L78 Accepts]: Start accepts. Automaton has 466 states and 558 transitions. Word has length 32 [2024-10-24 18:23:42,078 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 18:23:42,078 INFO L471 AbstractCegarLoop]: Abstraction has 466 states and 558 transitions. [2024-10-24 18:23:42,078 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 6.0) internal successors, (12), 3 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-24 18:23:42,078 INFO L276 IsEmpty]: Start isEmpty. Operand 466 states and 558 transitions. [2024-10-24 18:23:42,079 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2024-10-24 18:23:42,079 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 18:23:42,079 INFO L215 NwaCegarLoop]: trace histogram [10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 18:23:42,098 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-10-24 18:23:42,279 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-10-24 18:23:42,280 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [#Ultimate.C_strcpyErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, #Ultimate.C_strcpyErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, #Ultimate.C_strcpyErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE (and 197 more)] === [2024-10-24 18:23:42,280 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 18:23:42,280 INFO L85 PathProgramCache]: Analyzing trace with hash 547184063, now seen corresponding path program 1 times [2024-10-24 18:23:42,281 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 18:23:42,281 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1167570832] [2024-10-24 18:23:42,281 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 18:23:42,282 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-10-24 18:23:42,282 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 18:23:42,285 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-10-24 18:23:42,286 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-10-24 18:23:43,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 18:23:43,094 INFO L255 TraceCheckSpWp]: Trace formula consists of 365 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-10-24 18:23:43,097 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 18:23:43,209 INFO L349 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2024-10-24 18:23:43,210 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 1 case distinctions, treesize of input 19 treesize of output 21 [2024-10-24 18:23:43,303 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2024-10-24 18:23:43,304 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-24 18:23:43,304 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-24 18:23:43,304 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1167570832] [2024-10-24 18:23:43,304 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1167570832] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 18:23:43,304 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 18:23:43,304 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-24 18:23:43,304 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [94237014] [2024-10-24 18:23:43,305 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 18:23:43,305 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-24 18:23:43,305 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-24 18:23:43,305 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-24 18:23:43,306 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-10-24 18:23:43,306 INFO L87 Difference]: Start difference. First operand 466 states and 558 transitions. Second operand has 6 states, 5 states have (on average 2.4) internal successors, (12), 5 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-24 18:23:47,097 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 18:23:47,097 INFO L93 Difference]: Finished difference Result 591 states and 703 transitions. [2024-10-24 18:23:47,098 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-24 18:23:47,099 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 2.4) internal successors, (12), 5 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 32 [2024-10-24 18:23:47,099 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 18:23:47,101 INFO L225 Difference]: With dead ends: 591 [2024-10-24 18:23:47,101 INFO L226 Difference]: Without dead ends: 591 [2024-10-24 18:23:47,102 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-10-24 18:23:47,102 INFO L432 NwaCegarLoop]: 349 mSDtfsCounter, 432 mSDsluCounter, 1009 mSDsCounter, 0 mSdLazyCounter, 460 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 440 SdHoareTripleChecker+Valid, 1358 SdHoareTripleChecker+Invalid, 462 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 460 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.7s IncrementalHoareTripleChecker+Time [2024-10-24 18:23:47,103 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [440 Valid, 1358 Invalid, 462 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 460 Invalid, 0 Unknown, 0 Unchecked, 3.7s Time] [2024-10-24 18:23:47,104 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 591 states. [2024-10-24 18:23:47,113 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 591 to 465. [2024-10-24 18:23:47,114 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 465 states, 260 states have (on average 2.023076923076923) internal successors, (526), 446 states have internal predecessors, (526), 17 states have call successors, (17), 6 states have call predecessors, (17), 5 states have return successors, (14), 13 states have call predecessors, (14), 14 states have call successors, (14) [2024-10-24 18:23:47,116 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 465 states to 465 states and 557 transitions. [2024-10-24 18:23:47,116 INFO L78 Accepts]: Start accepts. Automaton has 465 states and 557 transitions. Word has length 32 [2024-10-24 18:23:47,117 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 18:23:47,117 INFO L471 AbstractCegarLoop]: Abstraction has 465 states and 557 transitions. [2024-10-24 18:23:47,117 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.4) internal successors, (12), 5 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-24 18:23:47,117 INFO L276 IsEmpty]: Start isEmpty. Operand 465 states and 557 transitions. [2024-10-24 18:23:47,119 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2024-10-24 18:23:47,119 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 18:23:47,119 INFO L215 NwaCegarLoop]: trace histogram [10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 18:23:47,139 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Ended with exit code 0 [2024-10-24 18:23:47,320 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-10-24 18:23:47,320 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [#Ultimate.C_strcpyErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, #Ultimate.C_strcpyErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, #Ultimate.C_strcpyErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE (and 197 more)] === [2024-10-24 18:23:47,321 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 18:23:47,321 INFO L85 PathProgramCache]: Analyzing trace with hash 1858261605, now seen corresponding path program 1 times [2024-10-24 18:23:47,322 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 18:23:47,322 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [664957323] [2024-10-24 18:23:47,323 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 18:23:47,323 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-10-24 18:23:47,323 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 18:23:47,326 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-10-24 18:23:47,328 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-10-24 18:23:48,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 18:23:48,105 INFO L255 TraceCheckSpWp]: Trace formula consists of 388 conjuncts, 12 conjuncts are in the unsatisfiable core [2024-10-24 18:23:48,108 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 18:23:48,189 INFO L349 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2024-10-24 18:23:48,189 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 1 case distinctions, treesize of input 19 treesize of output 21 [2024-10-24 18:23:48,451 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-24 18:23:48,487 INFO L349 Elim1Store]: treesize reduction 21, result has 30.0 percent of original size [2024-10-24 18:23:48,487 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 29 treesize of output 31 [2024-10-24 18:23:48,519 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2024-10-24 18:23:48,520 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-10-24 18:23:48,691 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2024-10-24 18:23:48,691 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-24 18:23:48,692 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-24 18:23:48,692 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [664957323] [2024-10-24 18:23:48,692 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [664957323] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 18:23:48,692 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 18:23:48,692 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-24 18:23:48,692 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [528386034] [2024-10-24 18:23:48,692 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 18:23:48,693 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-24 18:23:48,693 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-24 18:23:48,694 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-24 18:23:48,694 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2024-10-24 18:23:48,694 INFO L87 Difference]: Start difference. First operand 465 states and 557 transitions. Second operand has 8 states, 7 states have (on average 2.0) internal successors, (14), 7 states have internal predecessors, (14), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-24 18:23:56,920 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 18:23:56,920 INFO L93 Difference]: Finished difference Result 615 states and 728 transitions. [2024-10-24 18:23:56,921 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-24 18:23:56,922 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 2.0) internal successors, (14), 7 states have internal predecessors, (14), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 34 [2024-10-24 18:23:56,922 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 18:23:56,924 INFO L225 Difference]: With dead ends: 615 [2024-10-24 18:23:56,924 INFO L226 Difference]: Without dead ends: 615 [2024-10-24 18:23:56,925 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2024-10-24 18:23:56,927 INFO L432 NwaCegarLoop]: 334 mSDtfsCounter, 495 mSDsluCounter, 1370 mSDsCounter, 0 mSdLazyCounter, 802 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 7.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 499 SdHoareTripleChecker+Valid, 1704 SdHoareTripleChecker+Invalid, 816 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 802 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 8.0s IncrementalHoareTripleChecker+Time [2024-10-24 18:23:56,927 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [499 Valid, 1704 Invalid, 816 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 802 Invalid, 0 Unknown, 0 Unchecked, 8.0s Time] [2024-10-24 18:23:56,929 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 615 states. [2024-10-24 18:23:56,939 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 615 to 490. [2024-10-24 18:23:56,940 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 490 states, 285 states have (on average 2.0035087719298246) internal successors, (571), 471 states have internal predecessors, (571), 17 states have call successors, (17), 6 states have call predecessors, (17), 5 states have return successors, (14), 13 states have call predecessors, (14), 14 states have call successors, (14) [2024-10-24 18:23:56,943 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 490 states to 490 states and 602 transitions. [2024-10-24 18:23:56,943 INFO L78 Accepts]: Start accepts. Automaton has 490 states and 602 transitions. Word has length 34 [2024-10-24 18:23:56,943 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 18:23:56,943 INFO L471 AbstractCegarLoop]: Abstraction has 490 states and 602 transitions. [2024-10-24 18:23:56,943 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 2.0) internal successors, (14), 7 states have internal predecessors, (14), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-24 18:23:56,943 INFO L276 IsEmpty]: Start isEmpty. Operand 490 states and 602 transitions. [2024-10-24 18:23:56,944 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2024-10-24 18:23:56,944 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 18:23:56,944 INFO L215 NwaCegarLoop]: trace histogram [10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 18:23:56,968 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (12)] Forceful destruction successful, exit code 0 [2024-10-24 18:23:57,144 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-10-24 18:23:57,145 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [#Ultimate.C_strcpyErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, #Ultimate.C_strcpyErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, #Ultimate.C_strcpyErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE (and 197 more)] === [2024-10-24 18:23:57,146 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 18:23:57,146 INFO L85 PathProgramCache]: Analyzing trace with hash -916608279, now seen corresponding path program 1 times [2024-10-24 18:23:57,146 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 18:23:57,146 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1066558274] [2024-10-24 18:23:57,147 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 18:23:57,147 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-10-24 18:23:57,147 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 18:23:57,150 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-10-24 18:23:57,152 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (13)] Waiting until timeout for monitored process [2024-10-24 18:23:57,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 18:23:57,920 INFO L255 TraceCheckSpWp]: Trace formula consists of 407 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-10-24 18:23:57,922 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 18:23:57,933 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 11 treesize of output 7 [2024-10-24 18:23:57,941 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-24 18:23:57,942 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 1 [2024-10-24 18:23:57,973 INFO L349 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2024-10-24 18:23:57,974 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-10-24 18:23:58,015 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2024-10-24 18:23:58,015 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-24 18:23:58,015 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-24 18:23:58,015 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1066558274] [2024-10-24 18:23:58,015 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1066558274] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 18:23:58,015 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 18:23:58,016 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-24 18:23:58,016 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [71680985] [2024-10-24 18:23:58,016 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 18:23:58,016 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-24 18:23:58,016 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-24 18:23:58,017 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-24 18:23:58,017 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-24 18:23:58,017 INFO L87 Difference]: Start difference. First operand 490 states and 602 transitions. Second operand has 3 states, 2 states have (on average 8.0) internal successors, (16), 3 states have internal predecessors, (16), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-24 18:23:59,138 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 18:23:59,138 INFO L93 Difference]: Finished difference Result 502 states and 620 transitions. [2024-10-24 18:23:59,139 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-24 18:23:59,139 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 8.0) internal successors, (16), 3 states have internal predecessors, (16), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 36 [2024-10-24 18:23:59,139 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 18:23:59,141 INFO L225 Difference]: With dead ends: 502 [2024-10-24 18:23:59,141 INFO L226 Difference]: Without dead ends: 502 [2024-10-24 18:23:59,141 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 33 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-24 18:23:59,142 INFO L432 NwaCegarLoop]: 336 mSDtfsCounter, 162 mSDsluCounter, 149 mSDsCounter, 0 mSdLazyCounter, 240 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 166 SdHoareTripleChecker+Valid, 485 SdHoareTripleChecker+Invalid, 247 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 240 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2024-10-24 18:23:59,142 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [166 Valid, 485 Invalid, 247 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 240 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2024-10-24 18:23:59,143 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 502 states. [2024-10-24 18:23:59,151 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 502 to 501. [2024-10-24 18:23:59,152 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 501 states, 297 states have (on average 1.9831649831649831) internal successors, (589), 482 states have internal predecessors, (589), 17 states have call successors, (17), 6 states have call predecessors, (17), 5 states have return successors, (14), 13 states have call predecessors, (14), 14 states have call successors, (14) [2024-10-24 18:23:59,154 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 501 states to 501 states and 620 transitions. [2024-10-24 18:23:59,154 INFO L78 Accepts]: Start accepts. Automaton has 501 states and 620 transitions. Word has length 36 [2024-10-24 18:23:59,154 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 18:23:59,155 INFO L471 AbstractCegarLoop]: Abstraction has 501 states and 620 transitions. [2024-10-24 18:23:59,155 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 8.0) internal successors, (16), 3 states have internal predecessors, (16), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-24 18:23:59,155 INFO L276 IsEmpty]: Start isEmpty. Operand 501 states and 620 transitions. [2024-10-24 18:23:59,155 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2024-10-24 18:23:59,156 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 18:23:59,156 INFO L215 NwaCegarLoop]: trace histogram [10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 18:23:59,178 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (13)] Ended with exit code 0 [2024-10-24 18:23:59,356 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-10-24 18:23:59,357 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [#Ultimate.C_strcpyErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, #Ultimate.C_strcpyErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, #Ultimate.C_strcpyErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE (and 197 more)] === [2024-10-24 18:23:59,357 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 18:23:59,357 INFO L85 PathProgramCache]: Analyzing trace with hash -916608278, now seen corresponding path program 1 times [2024-10-24 18:23:59,358 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 18:23:59,358 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1202455753] [2024-10-24 18:23:59,358 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 18:23:59,358 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-10-24 18:23:59,358 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 18:23:59,359 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-10-24 18:23:59,360 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-10-24 18:24:00,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 18:24:00,186 INFO L255 TraceCheckSpWp]: Trace formula consists of 407 conjuncts, 12 conjuncts are in the unsatisfiable core [2024-10-24 18:24:00,189 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 18:24:00,242 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 11 treesize of output 10 [2024-10-24 18:24:00,263 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-10-24 18:24:00,274 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 16 treesize of output 10 [2024-10-24 18:24:00,302 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 11 treesize of output 7 [2024-10-24 18:24:00,520 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-24 18:24:00,522 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 19 treesize of output 14 [2024-10-24 18:24:00,560 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2024-10-24 18:24:00,561 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-10-24 18:24:00,674 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2024-10-24 18:24:00,674 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-24 18:24:00,674 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-24 18:24:00,675 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1202455753] [2024-10-24 18:24:00,675 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1202455753] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 18:24:00,675 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 18:24:00,675 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-24 18:24:00,675 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1667931688] [2024-10-24 18:24:00,675 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 18:24:00,675 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-24 18:24:00,675 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-24 18:24:00,676 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-24 18:24:00,676 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2024-10-24 18:24:00,676 INFO L87 Difference]: Start difference. First operand 501 states and 620 transitions. Second operand has 8 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 7 states have internal predecessors, (16), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-24 18:24:12,320 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 18:24:12,320 INFO L93 Difference]: Finished difference Result 514 states and 629 transitions. [2024-10-24 18:24:12,321 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-24 18:24:12,322 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 7 states have internal predecessors, (16), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 36 [2024-10-24 18:24:12,322 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 18:24:12,324 INFO L225 Difference]: With dead ends: 514 [2024-10-24 18:24:12,325 INFO L226 Difference]: Without dead ends: 514 [2024-10-24 18:24:12,325 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2024-10-24 18:24:12,326 INFO L432 NwaCegarLoop]: 290 mSDtfsCounter, 369 mSDsluCounter, 1229 mSDsCounter, 0 mSdLazyCounter, 1267 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 10.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 369 SdHoareTripleChecker+Valid, 1519 SdHoareTripleChecker+Invalid, 1282 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 1267 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 11.5s IncrementalHoareTripleChecker+Time [2024-10-24 18:24:12,326 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [369 Valid, 1519 Invalid, 1282 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 1267 Invalid, 0 Unknown, 0 Unchecked, 11.5s Time] [2024-10-24 18:24:12,327 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 514 states. [2024-10-24 18:24:12,334 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 514 to 501. [2024-10-24 18:24:12,335 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 501 states, 297 states have (on average 1.973063973063973) internal successors, (586), 482 states have internal predecessors, (586), 17 states have call successors, (17), 6 states have call predecessors, (17), 5 states have return successors, (14), 13 states have call predecessors, (14), 14 states have call successors, (14) [2024-10-24 18:24:12,337 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 501 states to 501 states and 617 transitions. [2024-10-24 18:24:12,337 INFO L78 Accepts]: Start accepts. Automaton has 501 states and 617 transitions. Word has length 36 [2024-10-24 18:24:12,338 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 18:24:12,338 INFO L471 AbstractCegarLoop]: Abstraction has 501 states and 617 transitions. [2024-10-24 18:24:12,338 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 7 states have internal predecessors, (16), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-24 18:24:12,338 INFO L276 IsEmpty]: Start isEmpty. Operand 501 states and 617 transitions. [2024-10-24 18:24:12,339 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2024-10-24 18:24:12,339 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 18:24:12,339 INFO L215 NwaCegarLoop]: trace histogram [10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 18:24:12,362 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (14)] Ended with exit code 0 [2024-10-24 18:24:12,539 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-10-24 18:24:12,540 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr16REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [#Ultimate.C_strcpyErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, #Ultimate.C_strcpyErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, #Ultimate.C_strcpyErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE (and 197 more)] === [2024-10-24 18:24:12,540 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 18:24:12,540 INFO L85 PathProgramCache]: Analyzing trace with hash -391879607, now seen corresponding path program 1 times [2024-10-24 18:24:12,541 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 18:24:12,541 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [33904204] [2024-10-24 18:24:12,541 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 18:24:12,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-10-24 18:24:12,541 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 18:24:12,543 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-10-24 18:24:12,545 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-10-24 18:24:13,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 18:24:13,357 INFO L255 TraceCheckSpWp]: Trace formula consists of 426 conjuncts, 12 conjuncts are in the unsatisfiable core [2024-10-24 18:24:13,359 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 18:24:13,401 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-10-24 18:24:13,434 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 21 treesize of output 1 [2024-10-24 18:24:13,546 INFO L349 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2024-10-24 18:24:13,547 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 1 case distinctions, treesize of input 36 treesize of output 28 [2024-10-24 18:24:13,626 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2024-10-24 18:24:13,626 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 42 treesize of output 14 [2024-10-24 18:24:13,664 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2024-10-24 18:24:13,664 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-24 18:24:13,664 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-24 18:24:13,665 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [33904204] [2024-10-24 18:24:13,665 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [33904204] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 18:24:13,665 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 18:24:13,665 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-24 18:24:13,665 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [95589943] [2024-10-24 18:24:13,665 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 18:24:13,665 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-24 18:24:13,665 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-24 18:24:13,667 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-24 18:24:13,667 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2024-10-24 18:24:13,667 INFO L87 Difference]: Start difference. First operand 501 states and 617 transitions. Second operand has 8 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 8 states have internal predecessors, (18), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-24 18:24:18,845 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 18:24:18,845 INFO L93 Difference]: Finished difference Result 499 states and 613 transitions. [2024-10-24 18:24:18,846 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-24 18:24:18,846 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 8 states have internal predecessors, (18), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 38 [2024-10-24 18:24:18,846 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 18:24:18,849 INFO L225 Difference]: With dead ends: 499 [2024-10-24 18:24:18,849 INFO L226 Difference]: Without dead ends: 499 [2024-10-24 18:24:18,849 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2024-10-24 18:24:18,850 INFO L432 NwaCegarLoop]: 384 mSDtfsCounter, 164 mSDsluCounter, 859 mSDsCounter, 0 mSdLazyCounter, 698 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 168 SdHoareTripleChecker+Valid, 1243 SdHoareTripleChecker+Invalid, 700 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 698 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.1s IncrementalHoareTripleChecker+Time [2024-10-24 18:24:18,850 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [168 Valid, 1243 Invalid, 700 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 698 Invalid, 0 Unknown, 0 Unchecked, 5.1s Time] [2024-10-24 18:24:18,853 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 499 states. [2024-10-24 18:24:18,864 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 499 to 499. [2024-10-24 18:24:18,865 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 499 states, 297 states have (on average 1.9595959595959596) internal successors, (582), 480 states have internal predecessors, (582), 17 states have call successors, (17), 6 states have call predecessors, (17), 5 states have return successors, (14), 13 states have call predecessors, (14), 14 states have call successors, (14) [2024-10-24 18:24:18,867 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 499 states to 499 states and 613 transitions. [2024-10-24 18:24:18,867 INFO L78 Accepts]: Start accepts. Automaton has 499 states and 613 transitions. Word has length 38 [2024-10-24 18:24:18,868 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 18:24:18,868 INFO L471 AbstractCegarLoop]: Abstraction has 499 states and 613 transitions. [2024-10-24 18:24:18,868 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 8 states have internal predecessors, (18), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-24 18:24:18,868 INFO L276 IsEmpty]: Start isEmpty. Operand 499 states and 613 transitions. [2024-10-24 18:24:18,869 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2024-10-24 18:24:18,869 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 18:24:18,869 INFO L215 NwaCegarLoop]: trace histogram [10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 18:24:18,893 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-10-24 18:24:19,069 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-10-24 18:24:19,070 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr17REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [#Ultimate.C_strcpyErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, #Ultimate.C_strcpyErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, #Ultimate.C_strcpyErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE (and 197 more)] === [2024-10-24 18:24:19,070 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 18:24:19,070 INFO L85 PathProgramCache]: Analyzing trace with hash -391879606, now seen corresponding path program 1 times [2024-10-24 18:24:19,071 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 18:24:19,071 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [172457942] [2024-10-24 18:24:19,071 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 18:24:19,071 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-10-24 18:24:19,072 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 18:24:19,073 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-10-24 18:24:19,074 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-10-24 18:24:19,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 18:24:19,895 INFO L255 TraceCheckSpWp]: Trace formula consists of 426 conjuncts, 15 conjuncts are in the unsatisfiable core [2024-10-24 18:24:19,898 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 18:24:19,907 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 10 treesize of output 8 [2024-10-24 18:24:19,928 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-10-24 18:24:19,969 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 16 treesize of output 12 [2024-10-24 18:24:19,985 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 25 treesize of output 1 [2024-10-24 18:24:20,056 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 18 [2024-10-24 18:24:20,082 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 21 treesize of output 16 [2024-10-24 18:24:20,133 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 9 [2024-10-24 18:24:20,158 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2024-10-24 18:24:20,159 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-24 18:24:20,159 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-24 18:24:20,159 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [172457942] [2024-10-24 18:24:20,159 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [172457942] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 18:24:20,159 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 18:24:20,159 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-24 18:24:20,159 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1768441668] [2024-10-24 18:24:20,159 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 18:24:20,160 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-24 18:24:20,160 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-24 18:24:20,160 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-24 18:24:20,160 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2024-10-24 18:24:20,161 INFO L87 Difference]: Start difference. First operand 499 states and 613 transitions. Second operand has 7 states, 6 states have (on average 3.0) internal successors, (18), 7 states have internal predecessors, (18), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)