./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/mkfifo-incomplete-1.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/mkfifo-incomplete-1.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 f5c3252c23e9c49e7b3cce6858e3c801f843203fda4604e23c25c5a714e6a2c0 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-4a390ef-m [2024-10-24 18:24:33,388 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-24 18:24:33,458 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-64bit-Automizer_Default.epf [2024-10-24 18:24:33,462 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-24 18:24:33,462 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-24 18:24:33,499 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-24 18:24:33,503 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-24 18:24:33,504 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-24 18:24:33,505 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-24 18:24:33,507 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-24 18:24:33,508 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-24 18:24:33,508 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-24 18:24:33,509 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-24 18:24:33,509 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-24 18:24:33,510 INFO L153 SettingsManager]: * Use SBE=true [2024-10-24 18:24:33,510 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-24 18:24:33,511 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-24 18:24:33,513 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-24 18:24:33,513 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-10-24 18:24:33,514 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-10-24 18:24:33,514 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-10-24 18:24:33,515 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-24 18:24:33,519 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-10-24 18:24:33,520 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-24 18:24:33,520 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-10-24 18:24:33,520 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-24 18:24:33,520 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-24 18:24:33,521 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-24 18:24:33,521 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-24 18:24:33,521 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-24 18:24:33,521 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-24 18:24:33,522 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-24 18:24:33,522 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-24 18:24:33,522 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-24 18:24:33,525 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-24 18:24:33,525 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-24 18:24:33,525 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-24 18:24:33,525 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-24 18:24:33,526 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-24 18:24:33,526 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 -> f5c3252c23e9c49e7b3cce6858e3c801f843203fda4604e23c25c5a714e6a2c0 [2024-10-24 18:24:33,822 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-24 18:24:33,854 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-24 18:24:33,857 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-24 18:24:33,859 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-24 18:24:33,859 INFO L274 PluginConnector]: CDTParser initialized [2024-10-24 18:24:33,861 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/busybox-1.22.0/mkfifo-incomplete-1.i [2024-10-24 18:24:35,428 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-24 18:24:35,790 INFO L384 CDTParser]: Found 1 translation units. [2024-10-24 18:24:35,791 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/busybox-1.22.0/mkfifo-incomplete-1.i [2024-10-24 18:24:35,826 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c5f6f5d42/26ad33bfbb2043d9ad5bfd771a830fa1/FLAGa576ec984 [2024-10-24 18:24:35,991 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c5f6f5d42/26ad33bfbb2043d9ad5bfd771a830fa1 [2024-10-24 18:24:35,993 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-24 18:24:35,995 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-24 18:24:35,996 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-24 18:24:35,996 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-24 18:24:36,003 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-24 18:24:36,004 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 06:24:35" (1/1) ... [2024-10-24 18:24:36,004 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2c05e29a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 06:24:36, skipping insertion in model container [2024-10-24 18:24:36,005 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 06:24:35" (1/1) ... [2024-10-24 18:24:36,084 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-24 18:24:37,055 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-24 18:24:37,080 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:24:37,081 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver@45ccc01a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 06:24:37, skipping insertion in model container [2024-10-24 18:24:37,081 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-24 18:24:37,082 INFO L186 ToolchainWalker]: Toolchain execution was canceled (user or tool) before executing de.uni_freiburg.informatik.ultimate.boogie.procedureinliner [2024-10-24 18:24:37,084 INFO L158 Benchmark]: Toolchain (without parser) took 1088.25ms. Allocated memory is still 167.8MB. Free memory was 122.4MB in the beginning and 95.9MB in the end (delta: 26.4MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2024-10-24 18:24:37,084 INFO L158 Benchmark]: CDTParser took 0.18ms. Allocated memory is still 100.7MB. Free memory is still 68.5MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-24 18:24:37,085 INFO L158 Benchmark]: CACSL2BoogieTranslator took 1085.92ms. Allocated memory is still 167.8MB. Free memory was 122.4MB in the beginning and 95.9MB in the end (delta: 26.4MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2024-10-24 18:24:37,087 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.18ms. Allocated memory is still 100.7MB. Free memory is still 68.5MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 1085.92ms. Allocated memory is still 167.8MB. Free memory was 122.4MB in the beginning and 95.9MB in the end (delta: 26.4MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - UnsupportedSyntaxResult [Line: 2072]: 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/mkfifo-incomplete-1.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 f5c3252c23e9c49e7b3cce6858e3c801f843203fda4604e23c25c5a714e6a2c0 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-4a390ef-m [2024-10-24 18:24:39,305 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-24 18:24:39,400 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-64bit-Automizer_Bitvector.epf [2024-10-24 18:24:39,408 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-24 18:24:39,408 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-24 18:24:39,442 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-24 18:24:39,446 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-24 18:24:39,447 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-24 18:24:39,448 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-24 18:24:39,449 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-24 18:24:39,449 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-24 18:24:39,450 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-24 18:24:39,450 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-24 18:24:39,452 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-24 18:24:39,452 INFO L153 SettingsManager]: * Use SBE=true [2024-10-24 18:24:39,453 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-24 18:24:39,453 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-24 18:24:39,454 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-24 18:24:39,454 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-10-24 18:24:39,455 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-10-24 18:24:39,455 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-10-24 18:24:39,456 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-24 18:24:39,456 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-10-24 18:24:39,456 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-10-24 18:24:39,457 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-24 18:24:39,457 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-10-24 18:24:39,458 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-10-24 18:24:39,458 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-24 18:24:39,458 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-24 18:24:39,459 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-24 18:24:39,459 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-24 18:24:39,459 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-24 18:24:39,460 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-24 18:24:39,460 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-24 18:24:39,461 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-24 18:24:39,461 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-10-24 18:24:39,462 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-10-24 18:24:39,463 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-24 18:24:39,463 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-24 18:24:39,463 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-24 18:24:39,463 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-24 18:24:39,464 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2024-10-24 18:24:39,464 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 -> f5c3252c23e9c49e7b3cce6858e3c801f843203fda4604e23c25c5a714e6a2c0 [2024-10-24 18:24:39,867 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-24 18:24:39,896 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-24 18:24:39,900 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-24 18:24:39,901 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-24 18:24:39,902 INFO L274 PluginConnector]: CDTParser initialized [2024-10-24 18:24:39,904 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/busybox-1.22.0/mkfifo-incomplete-1.i [2024-10-24 18:24:41,591 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-24 18:24:41,982 INFO L384 CDTParser]: Found 1 translation units. [2024-10-24 18:24:41,983 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/busybox-1.22.0/mkfifo-incomplete-1.i [2024-10-24 18:24:42,020 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7f4520bce/221e15bc56cc47c4badd1c72fbcafac8/FLAGb47e1b496 [2024-10-24 18:24:42,038 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7f4520bce/221e15bc56cc47c4badd1c72fbcafac8 [2024-10-24 18:24:42,042 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-24 18:24:42,043 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-24 18:24:42,046 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-24 18:24:42,047 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-24 18:24:42,053 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-24 18:24:42,054 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 06:24:42" (1/1) ... [2024-10-24 18:24:42,055 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5b6adca5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 06:24:42, skipping insertion in model container [2024-10-24 18:24:42,055 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 06:24:42" (1/1) ... [2024-10-24 18:24:42,154 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-24 18:24:43,044 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-24 18:24:43,081 INFO L197 MainTranslator]: Restarting translation with changed settings: SettingsChange [mNewPreferredMemoryModel=HoenickeLindenmann_1ByteResolution] [2024-10-24 18:24:43,114 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-24 18:24:43,238 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-24 18:24:43,252 INFO L200 MainTranslator]: Completed pre-run [2024-10-24 18:24:43,356 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-24 18:24:43,565 INFO L204 MainTranslator]: Completed translation [2024-10-24 18:24:43,566 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 06:24:43 WrapperNode [2024-10-24 18:24:43,566 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-24 18:24:43,567 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-24 18:24:43,568 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-24 18:24:43,568 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-24 18:24:43,574 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:24:43" (1/1) ... [2024-10-24 18:24:43,641 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:24:43" (1/1) ... [2024-10-24 18:24:43,730 INFO L138 Inliner]: procedures = 584, calls = 147, calls flagged for inlining = 16, calls inlined = 15, statements flattened = 491 [2024-10-24 18:24:43,730 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-24 18:24:43,731 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-24 18:24:43,731 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-24 18:24:43,731 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-24 18:24:43,744 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 06:24:43" (1/1) ... [2024-10-24 18:24:43,745 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 06:24:43" (1/1) ... [2024-10-24 18:24:43,755 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 06:24:43" (1/1) ... [2024-10-24 18:24:43,780 WARN L109 MemorySlicer]: Omit memory slicing because it failed with the following exception: Unsupported: Memory array in LHS [2024-10-24 18:24:43,780 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 06:24:43" (1/1) ... [2024-10-24 18:24:43,780 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 06:24:43" (1/1) ... [2024-10-24 18:24:43,808 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 06:24:43" (1/1) ... [2024-10-24 18:24:43,813 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 06:24:43" (1/1) ... [2024-10-24 18:24:43,826 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 06:24:43" (1/1) ... [2024-10-24 18:24:43,835 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 06:24:43" (1/1) ... [2024-10-24 18:24:43,853 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-24 18:24:43,854 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-24 18:24:43,855 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-24 18:24:43,855 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-24 18:24:43,856 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 06:24:43" (1/1) ... [2024-10-24 18:24:43,862 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-24 18:24:43,876 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 18:24:43,895 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:24:43,903 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:24:43,947 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-10-24 18:24:43,947 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2024-10-24 18:24:43,948 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4 [2024-10-24 18:24:43,948 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-10-24 18:24:43,948 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-24 18:24:43,948 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2024-10-24 18:24:43,948 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~intINTTYPE2 [2024-10-24 18:24:43,948 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~intINTTYPE4 [2024-10-24 18:24:43,949 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~intINTTYPE1 [2024-10-24 18:24:43,949 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-24 18:24:43,949 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-24 18:24:43,949 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1 [2024-10-24 18:24:43,949 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_strcpy [2024-10-24 18:24:43,949 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_strcpy [2024-10-24 18:24:43,949 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2024-10-24 18:24:43,950 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$ [2024-10-24 18:24:43,950 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$ [2024-10-24 18:24:43,950 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-24 18:24:43,950 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-24 18:24:43,950 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-10-24 18:24:43,950 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2024-10-24 18:24:43,950 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1 [2024-10-24 18:24:43,951 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2024-10-24 18:24:43,951 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE4 [2024-10-24 18:24:43,951 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE2 [2024-10-24 18:24:43,951 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE1 [2024-10-24 18:24:44,404 INFO L238 CfgBuilder]: Building ICFG [2024-10-24 18:24:44,407 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-24 18:24:46,768 INFO L? ?]: Removed 435 outVars from TransFormulas that were not future-live. [2024-10-24 18:24:46,771 INFO L287 CfgBuilder]: Performing block encoding [2024-10-24 18:24:46,883 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-24 18:24:46,883 INFO L314 CfgBuilder]: Removed 11 assume(true) statements. [2024-10-24 18:24:46,884 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 06:24:46 BoogieIcfgContainer [2024-10-24 18:24:46,884 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-24 18:24:46,889 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-24 18:24:46,889 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-24 18:24:46,893 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-24 18:24:46,893 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.10 06:24:42" (1/3) ... [2024-10-24 18:24:46,894 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@13a342c3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 06:24:46, skipping insertion in model container [2024-10-24 18:24:46,894 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 06:24:43" (2/3) ... [2024-10-24 18:24:46,894 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@13a342c3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 06:24:46, skipping insertion in model container [2024-10-24 18:24:46,894 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 06:24:46" (3/3) ... [2024-10-24 18:24:46,896 INFO L112 eAbstractionObserver]: Analyzing ICFG mkfifo-incomplete-1.i [2024-10-24 18:24:46,914 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-24 18:24:46,915 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 148 error locations. [2024-10-24 18:24:46,981 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-24 18:24:46,988 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;@4bbdd07c, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-24 18:24:46,989 INFO L334 AbstractCegarLoop]: Starting to check reachability of 148 error locations. [2024-10-24 18:24:46,996 INFO L276 IsEmpty]: Start isEmpty. Operand has 324 states, 164 states have (on average 2.182926829268293) internal successors, (358), 312 states have internal predecessors, (358), 9 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2024-10-24 18:24:47,001 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 3 [2024-10-24 18:24:47,001 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 18:24:47,002 INFO L215 NwaCegarLoop]: trace histogram [1, 1] [2024-10-24 18:24:47,002 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 145 more)] === [2024-10-24 18:24:47,007 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 18:24:47,007 INFO L85 PathProgramCache]: Analyzing trace with hash 21582, now seen corresponding path program 1 times [2024-10-24 18:24:47,021 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 18:24:47,023 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2082704227] [2024-10-24 18:24:47,024 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 18:24:47,024 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:47,025 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 18:24:47,026 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:24:47,047 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:24:47,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 18:24:47,218 INFO L255 TraceCheckSpWp]: Trace formula consists of 59 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-24 18:24:47,222 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 18:24:47,277 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:47,297 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:24:47,297 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-24 18:24:47,298 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-24 18:24:47,298 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2082704227] [2024-10-24 18:24:47,299 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2082704227] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 18:24:47,299 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 18:24:47,299 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-10-24 18:24:47,302 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1415420921] [2024-10-24 18:24:47,304 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 18:24:47,308 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-24 18:24:47,309 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-24 18:24:47,336 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-24 18:24:47,338 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-24 18:24:47,341 INFO L87 Difference]: Start difference. First operand has 324 states, 164 states have (on average 2.182926829268293) internal successors, (358), 312 states have internal predecessors, (358), 9 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) 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:24:48,791 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 18:24:48,792 INFO L93 Difference]: Finished difference Result 522 states and 584 transitions. [2024-10-24 18:24:48,793 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-24 18:24:48,795 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:24:48,795 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 18:24:48,812 INFO L225 Difference]: With dead ends: 522 [2024-10-24 18:24:48,812 INFO L226 Difference]: Without dead ends: 521 [2024-10-24 18:24:48,814 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:24:48,819 INFO L432 NwaCegarLoop]: 200 mSDtfsCounter, 266 mSDsluCounter, 152 mSDsCounter, 0 mSdLazyCounter, 280 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 274 SdHoareTripleChecker+Valid, 352 SdHoareTripleChecker+Invalid, 289 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 280 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2024-10-24 18:24:48,822 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [274 Valid, 352 Invalid, 289 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 280 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2024-10-24 18:24:48,841 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 521 states. [2024-10-24 18:24:48,879 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 521 to 303. [2024-10-24 18:24:48,884 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 303 states, 152 states have (on average 2.1052631578947367) internal successors, (320), 292 states have internal predecessors, (320), 8 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2024-10-24 18:24:48,888 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 303 states to 303 states and 336 transitions. [2024-10-24 18:24:48,890 INFO L78 Accepts]: Start accepts. Automaton has 303 states and 336 transitions. Word has length 2 [2024-10-24 18:24:48,891 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 18:24:48,891 INFO L471 AbstractCegarLoop]: Abstraction has 303 states and 336 transitions. [2024-10-24 18:24:48,891 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:24:48,892 INFO L276 IsEmpty]: Start isEmpty. Operand 303 states and 336 transitions. [2024-10-24 18:24:48,892 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 3 [2024-10-24 18:24:48,892 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 18:24:48,892 INFO L215 NwaCegarLoop]: trace histogram [1, 1] [2024-10-24 18:24:48,899 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:24:49,093 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:24:49,093 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 145 more)] === [2024-10-24 18:24:49,094 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 18:24:49,094 INFO L85 PathProgramCache]: Analyzing trace with hash 21583, now seen corresponding path program 1 times [2024-10-24 18:24:49,094 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 18:24:49,095 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [973797317] [2024-10-24 18:24:49,095 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 18:24:49,095 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:49,095 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 18:24:49,098 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:24:49,100 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:24:49,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 18:24:49,238 INFO L255 TraceCheckSpWp]: Trace formula consists of 59 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-10-24 18:24:49,239 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 18:24:49,249 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:49,265 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:24:49,265 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-24 18:24:49,265 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-24 18:24:49,266 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [973797317] [2024-10-24 18:24:49,266 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [973797317] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 18:24:49,266 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 18:24:49,266 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-10-24 18:24:49,266 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1379341296] [2024-10-24 18:24:49,267 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 18:24:49,268 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-24 18:24:49,268 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-24 18:24:49,268 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-24 18:24:49,269 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-24 18:24:49,269 INFO L87 Difference]: Start difference. First operand 303 states and 336 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:24:50,324 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 18:24:50,324 INFO L93 Difference]: Finished difference Result 302 states and 335 transitions. [2024-10-24 18:24:50,326 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-24 18:24:50,326 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:24:50,326 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 18:24:50,328 INFO L225 Difference]: With dead ends: 302 [2024-10-24 18:24:50,328 INFO L226 Difference]: Without dead ends: 302 [2024-10-24 18:24:50,328 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:24:50,329 INFO L432 NwaCegarLoop]: 297 mSDtfsCounter, 8 mSDsluCounter, 187 mSDsCounter, 0 mSdLazyCounter, 176 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 484 SdHoareTripleChecker+Invalid, 176 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 176 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2024-10-24 18:24:50,330 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 484 Invalid, 176 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 176 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2024-10-24 18:24:50,332 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 302 states. [2024-10-24 18:24:50,352 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 302 to 302. [2024-10-24 18:24:50,353 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 302 states, 152 states have (on average 2.098684210526316) internal successors, (319), 291 states have internal predecessors, (319), 8 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2024-10-24 18:24:50,355 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 302 states to 302 states and 335 transitions. [2024-10-24 18:24:50,355 INFO L78 Accepts]: Start accepts. Automaton has 302 states and 335 transitions. Word has length 2 [2024-10-24 18:24:50,356 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 18:24:50,356 INFO L471 AbstractCegarLoop]: Abstraction has 302 states and 335 transitions. [2024-10-24 18:24:50,356 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:24:50,356 INFO L276 IsEmpty]: Start isEmpty. Operand 302 states and 335 transitions. [2024-10-24 18:24:50,357 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2024-10-24 18:24:50,357 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 18:24:50,357 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2024-10-24 18:24:50,363 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:24:50,557 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:24:50,558 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 145 more)] === [2024-10-24 18:24:50,559 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 18:24:50,559 INFO L85 PathProgramCache]: Analyzing trace with hash 21310721, now seen corresponding path program 1 times [2024-10-24 18:24:50,560 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 18:24:50,560 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1282666147] [2024-10-24 18:24:50,560 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 18:24:50,561 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:50,561 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 18:24:50,564 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:24:50,566 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:24:50,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 18:24:50,707 INFO L255 TraceCheckSpWp]: Trace formula consists of 74 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-10-24 18:24:50,708 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 18:24:50,717 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:50,773 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 18:24:50,774 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-24 18:24:50,774 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-24 18:24:50,774 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1282666147] [2024-10-24 18:24:50,774 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1282666147] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 18:24:50,775 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 18:24:50,775 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-24 18:24:50,775 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1099673471] [2024-10-24 18:24:50,775 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 18:24:50,775 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-24 18:24:50,776 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-24 18:24:50,776 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-24 18:24:50,776 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-24 18:24:50,777 INFO L87 Difference]: Start difference. First operand 302 states and 335 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:24:51,923 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 18:24:51,923 INFO L93 Difference]: Finished difference Result 304 states and 337 transitions. [2024-10-24 18:24:51,924 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-24 18:24:51,925 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:24:51,925 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 18:24:51,926 INFO L225 Difference]: With dead ends: 304 [2024-10-24 18:24:51,926 INFO L226 Difference]: Without dead ends: 304 [2024-10-24 18:24:51,927 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:24:51,928 INFO L432 NwaCegarLoop]: 296 mSDtfsCounter, 8 mSDsluCounter, 188 mSDsCounter, 0 mSdLazyCounter, 185 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 484 SdHoareTripleChecker+Invalid, 186 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 185 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2024-10-24 18:24:51,928 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 484 Invalid, 186 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 185 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2024-10-24 18:24:51,930 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 304 states. [2024-10-24 18:24:51,940 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 304 to 304. [2024-10-24 18:24:51,940 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 304 states, 154 states have (on average 2.0844155844155843) internal successors, (321), 293 states have internal predecessors, (321), 8 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2024-10-24 18:24:51,942 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 304 states to 304 states and 337 transitions. [2024-10-24 18:24:51,942 INFO L78 Accepts]: Start accepts. Automaton has 304 states and 337 transitions. Word has length 4 [2024-10-24 18:24:51,943 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 18:24:51,943 INFO L471 AbstractCegarLoop]: Abstraction has 304 states and 337 transitions. [2024-10-24 18:24:51,943 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:24:51,943 INFO L276 IsEmpty]: Start isEmpty. Operand 304 states and 337 transitions. [2024-10-24 18:24:51,944 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2024-10-24 18:24:51,944 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 18:24:51,944 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1] [2024-10-24 18:24:51,954 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:24:52,144 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:24:52,145 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 145 more)] === [2024-10-24 18:24:52,145 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 18:24:52,146 INFO L85 PathProgramCache]: Analyzing trace with hash -994672790, now seen corresponding path program 1 times [2024-10-24 18:24:52,146 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 18:24:52,147 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1897668420] [2024-10-24 18:24:52,147 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 18:24:52,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:24:52,147 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 18:24:52,148 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:24:52,149 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:24:52,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 18:24:52,291 INFO L255 TraceCheckSpWp]: Trace formula consists of 89 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-10-24 18:24:52,293 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 18:24:52,305 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:52,463 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:24:52,464 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-24 18:24:52,806 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:24:52,807 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-24 18:24:52,807 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1897668420] [2024-10-24 18:24:52,807 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1897668420] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-24 18:24:52,807 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-24 18:24:52,807 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3] total 6 [2024-10-24 18:24:52,808 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1570508986] [2024-10-24 18:24:52,808 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-24 18:24:52,808 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-24 18:24:52,808 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-24 18:24:52,809 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-24 18:24:52,809 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2024-10-24 18:24:52,809 INFO L87 Difference]: Start difference. First operand 304 states and 337 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:24:57,526 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 18:24:57,527 INFO L93 Difference]: Finished difference Result 306 states and 339 transitions. [2024-10-24 18:24:57,528 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-24 18:24:57,529 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:24:57,529 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 18:24:57,530 INFO L225 Difference]: With dead ends: 306 [2024-10-24 18:24:57,530 INFO L226 Difference]: Without dead ends: 306 [2024-10-24 18:24:57,531 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2024-10-24 18:24:57,531 INFO L432 NwaCegarLoop]: 295 mSDtfsCounter, 18 mSDsluCounter, 751 mSDsCounter, 0 mSdLazyCounter, 614 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 1046 SdHoareTripleChecker+Invalid, 619 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 614 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.6s IncrementalHoareTripleChecker+Time [2024-10-24 18:24:57,532 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [19 Valid, 1046 Invalid, 619 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 614 Invalid, 0 Unknown, 0 Unchecked, 4.6s Time] [2024-10-24 18:24:57,533 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 306 states. [2024-10-24 18:24:57,546 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 306 to 306. [2024-10-24 18:24:57,547 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 306 states, 157 states have (on average 2.0573248407643314) internal successors, (323), 295 states have internal predecessors, (323), 8 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2024-10-24 18:24:57,549 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 306 states to 306 states and 339 transitions. [2024-10-24 18:24:57,549 INFO L78 Accepts]: Start accepts. Automaton has 306 states and 339 transitions. Word has length 6 [2024-10-24 18:24:57,549 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 18:24:57,550 INFO L471 AbstractCegarLoop]: Abstraction has 306 states and 339 transitions. [2024-10-24 18:24:57,550 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:24:57,550 INFO L276 IsEmpty]: Start isEmpty. Operand 306 states and 339 transitions. [2024-10-24 18:24:57,551 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2024-10-24 18:24:57,551 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 18:24:57,551 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 1, 1, 1, 1, 1] [2024-10-24 18:24:57,558 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Forceful destruction successful, exit code 0 [2024-10-24 18:24:57,752 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:24:57,752 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 145 more)] === [2024-10-24 18:24:57,753 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 18:24:57,753 INFO L85 PathProgramCache]: Analyzing trace with hash 238901110, now seen corresponding path program 1 times [2024-10-24 18:24:57,753 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 18:24:57,754 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [224456248] [2024-10-24 18:24:57,754 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 18:24:57,754 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:57,754 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 18:24:57,757 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:24:57,759 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:24:57,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 18:24:57,939 INFO L255 TraceCheckSpWp]: Trace formula consists of 121 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-10-24 18:24:57,941 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 18:24:57,989 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:24:57,990 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-24 18:24:58,075 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:24:58,076 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-24 18:24:58,076 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [224456248] [2024-10-24 18:24:58,077 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [224456248] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-24 18:24:58,077 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-24 18:24:58,077 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 10 [2024-10-24 18:24:58,077 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [273348551] [2024-10-24 18:24:58,078 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-24 18:24:58,079 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-10-24 18:24:58,079 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-24 18:24:58,079 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-10-24 18:24:58,081 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2024-10-24 18:24:58,081 INFO L87 Difference]: Start difference. First operand 306 states and 339 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:24:59,314 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 18:24:59,314 INFO L93 Difference]: Finished difference Result 316 states and 349 transitions. [2024-10-24 18:24:59,316 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-10-24 18:24:59,316 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:24:59,318 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 18:24:59,319 INFO L225 Difference]: With dead ends: 316 [2024-10-24 18:24:59,319 INFO L226 Difference]: Without dead ends: 316 [2024-10-24 18:24:59,320 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:24:59,320 INFO L432 NwaCegarLoop]: 299 mSDtfsCounter, 6 mSDsluCounter, 1188 mSDsCounter, 0 mSdLazyCounter, 212 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 1487 SdHoareTripleChecker+Invalid, 214 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 212 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2024-10-24 18:24:59,321 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 1487 Invalid, 214 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 212 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2024-10-24 18:24:59,324 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 316 states. [2024-10-24 18:24:59,330 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 316 to 316. [2024-10-24 18:24:59,331 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 316 states, 167 states have (on average 1.9940119760479043) internal successors, (333), 305 states have internal predecessors, (333), 8 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2024-10-24 18:24:59,333 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 316 states to 316 states and 349 transitions. [2024-10-24 18:24:59,333 INFO L78 Accepts]: Start accepts. Automaton has 316 states and 349 transitions. Word has length 11 [2024-10-24 18:24:59,334 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 18:24:59,334 INFO L471 AbstractCegarLoop]: Abstraction has 316 states and 349 transitions. [2024-10-24 18:24:59,335 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:24:59,335 INFO L276 IsEmpty]: Start isEmpty. Operand 316 states and 349 transitions. [2024-10-24 18:24:59,338 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2024-10-24 18:24:59,338 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 18:24:59,338 INFO L215 NwaCegarLoop]: trace histogram [8, 8, 1, 1, 1, 1, 1] [2024-10-24 18:24:59,346 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Ended with exit code 0 [2024-10-24 18:24:59,538 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:24:59,539 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 145 more)] === [2024-10-24 18:24:59,539 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 18:24:59,539 INFO L85 PathProgramCache]: Analyzing trace with hash -112864951, now seen corresponding path program 2 times [2024-10-24 18:24:59,540 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 18:24:59,540 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [393575071] [2024-10-24 18:24:59,540 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-10-24 18:24:59,540 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:59,541 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 18:24:59,543 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:24:59,544 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:24:59,715 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2024-10-24 18:24:59,716 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-24 18:24:59,720 INFO L255 TraceCheckSpWp]: Trace formula consists of 76 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-10-24 18:24:59,722 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 18:24:59,776 INFO L349 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2024-10-24 18:24:59,777 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:25:00,140 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:25:00,140 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-24 18:25:00,140 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-24 18:25:00,140 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [393575071] [2024-10-24 18:25:00,140 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [393575071] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 18:25:00,140 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 18:25:00,141 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-10-24 18:25:00,141 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1069683513] [2024-10-24 18:25:00,141 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 18:25:00,141 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-24 18:25:00,141 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-24 18:25:00,142 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-24 18:25:00,142 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-24 18:25:00,144 INFO L87 Difference]: Start difference. First operand 316 states and 349 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:25:02,315 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 18:25:02,315 INFO L93 Difference]: Finished difference Result 552 states and 613 transitions. [2024-10-24 18:25:02,316 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-24 18:25:02,316 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:25:02,316 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 18:25:02,318 INFO L225 Difference]: With dead ends: 552 [2024-10-24 18:25:02,318 INFO L226 Difference]: Without dead ends: 552 [2024-10-24 18:25:02,319 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:25:02,319 INFO L432 NwaCegarLoop]: 232 mSDtfsCounter, 294 mSDsluCounter, 160 mSDsCounter, 0 mSdLazyCounter, 272 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 294 SdHoareTripleChecker+Valid, 392 SdHoareTripleChecker+Invalid, 280 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 272 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2024-10-24 18:25:02,320 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [294 Valid, 392 Invalid, 280 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 272 Invalid, 0 Unknown, 0 Unchecked, 2.1s Time] [2024-10-24 18:25:02,321 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 552 states. [2024-10-24 18:25:02,328 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 552 to 360. [2024-10-24 18:25:02,329 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 360 states, 209 states have (on average 2.014354066985646) internal successors, (421), 347 states have internal predecessors, (421), 10 states have call successors, (10), 3 states have call predecessors, (10), 3 states have return successors, (10), 9 states have call predecessors, (10), 10 states have call successors, (10) [2024-10-24 18:25:02,331 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 360 states to 360 states and 441 transitions. [2024-10-24 18:25:02,331 INFO L78 Accepts]: Start accepts. Automaton has 360 states and 441 transitions. Word has length 21 [2024-10-24 18:25:02,331 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 18:25:02,331 INFO L471 AbstractCegarLoop]: Abstraction has 360 states and 441 transitions. [2024-10-24 18:25:02,331 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:25:02,332 INFO L276 IsEmpty]: Start isEmpty. Operand 360 states and 441 transitions. [2024-10-24 18:25:02,332 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2024-10-24 18:25:02,332 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 18:25:02,332 INFO L215 NwaCegarLoop]: trace histogram [8, 8, 1, 1, 1, 1, 1] [2024-10-24 18:25:02,340 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Ended with exit code 0 [2024-10-24 18:25:02,536 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:25:02,537 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 145 more)] === [2024-10-24 18:25:02,538 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 18:25:02,538 INFO L85 PathProgramCache]: Analyzing trace with hash -112864950, now seen corresponding path program 1 times [2024-10-24 18:25:02,538 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 18:25:02,539 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [929893614] [2024-10-24 18:25:02,539 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 18:25:02,539 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:25:02,539 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 18:25:02,541 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:25:02,542 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:25:02,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 18:25:02,725 INFO L255 TraceCheckSpWp]: Trace formula consists of 196 conjuncts, 10 conjuncts are in the unsatisfiable core [2024-10-24 18:25:02,726 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 18:25:02,836 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:25:02,836 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-24 18:25:03,047 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:25:03,048 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-24 18:25:03,048 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [929893614] [2024-10-24 18:25:03,048 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [929893614] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-24 18:25:03,048 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-24 18:25:03,048 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 20 [2024-10-24 18:25:03,048 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1578558594] [2024-10-24 18:25:03,048 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-24 18:25:03,049 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2024-10-24 18:25:03,049 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-24 18:25:03,049 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2024-10-24 18:25:03,050 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=90, Invalid=290, Unknown=0, NotChecked=0, Total=380 [2024-10-24 18:25:03,050 INFO L87 Difference]: Start difference. First operand 360 states and 441 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:25:05,326 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 18:25:05,326 INFO L93 Difference]: Finished difference Result 364 states and 445 transitions. [2024-10-24 18:25:05,328 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-10-24 18:25:05,328 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:25:05,328 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 18:25:05,331 INFO L225 Difference]: With dead ends: 364 [2024-10-24 18:25:05,331 INFO L226 Difference]: Without dead ends: 364 [2024-10-24 18:25:05,331 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=90, Invalid=290, Unknown=0, NotChecked=0, Total=380 [2024-10-24 18:25:05,332 INFO L432 NwaCegarLoop]: 298 mSDtfsCounter, 2 mSDsluCounter, 3552 mSDsCounter, 0 mSdLazyCounter, 620 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 3850 SdHoareTripleChecker+Invalid, 621 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 620 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2024-10-24 18:25:05,332 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 3850 Invalid, 621 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 620 Invalid, 0 Unknown, 0 Unchecked, 2.2s Time] [2024-10-24 18:25:05,333 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 364 states. [2024-10-24 18:25:05,339 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 364 to 364. [2024-10-24 18:25:05,340 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 364 states, 213 states have (on average 1.9953051643192488) internal successors, (425), 351 states have internal predecessors, (425), 10 states have call successors, (10), 3 states have call predecessors, (10), 3 states have return successors, (10), 9 states have call predecessors, (10), 10 states have call successors, (10) [2024-10-24 18:25:05,341 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 364 states to 364 states and 445 transitions. [2024-10-24 18:25:05,342 INFO L78 Accepts]: Start accepts. Automaton has 364 states and 445 transitions. Word has length 21 [2024-10-24 18:25:05,342 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 18:25:05,342 INFO L471 AbstractCegarLoop]: Abstraction has 364 states and 445 transitions. [2024-10-24 18:25:05,345 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:25:05,345 INFO L276 IsEmpty]: Start isEmpty. Operand 364 states and 445 transitions. [2024-10-24 18:25:05,346 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2024-10-24 18:25:05,346 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 18:25:05,346 INFO L215 NwaCegarLoop]: trace histogram [10, 10, 1, 1, 1, 1, 1] [2024-10-24 18:25:05,355 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:25:05,546 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:25:05,547 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 145 more)] === [2024-10-24 18:25:05,547 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 18:25:05,548 INFO L85 PathProgramCache]: Analyzing trace with hash -1791829768, now seen corresponding path program 2 times [2024-10-24 18:25:05,548 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 18:25:05,548 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1937053444] [2024-10-24 18:25:05,548 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-10-24 18:25:05,548 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:25:05,549 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 18:25:05,550 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:25:05,551 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:25:05,714 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2024-10-24 18:25:05,714 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-24 18:25:05,716 INFO L255 TraceCheckSpWp]: Trace formula consists of 76 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-10-24 18:25:05,718 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 18:25:05,748 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-24 18:25:05,750 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:25:06,066 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:25:06,066 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-24 18:25:06,066 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-24 18:25:06,066 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1937053444] [2024-10-24 18:25:06,066 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1937053444] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 18:25:06,067 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 18:25:06,067 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-10-24 18:25:06,067 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [567985674] [2024-10-24 18:25:06,067 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 18:25:06,067 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-24 18:25:06,067 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-24 18:25:06,068 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-24 18:25:06,068 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-24 18:25:06,068 INFO L87 Difference]: Start difference. First operand 364 states and 445 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:25:07,364 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 18:25:07,365 INFO L93 Difference]: Finished difference Result 367 states and 447 transitions. [2024-10-24 18:25:07,367 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-24 18:25:07,367 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:25:07,367 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 18:25:07,369 INFO L225 Difference]: With dead ends: 367 [2024-10-24 18:25:07,369 INFO L226 Difference]: Without dead ends: 367 [2024-10-24 18:25:07,370 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:25:07,372 INFO L432 NwaCegarLoop]: 297 mSDtfsCounter, 6 mSDsluCounter, 193 mSDsCounter, 0 mSdLazyCounter, 165 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 490 SdHoareTripleChecker+Invalid, 165 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 165 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2024-10-24 18:25:07,372 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 490 Invalid, 165 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 165 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2024-10-24 18:25:07,374 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 367 states. [2024-10-24 18:25:07,382 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 367 to 367. [2024-10-24 18:25:07,384 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 367 states, 216 states have (on average 1.9768518518518519) internal successors, (427), 353 states have internal predecessors, (427), 10 states have call successors, (10), 4 states have call predecessors, (10), 4 states have return successors, (10), 9 states have call predecessors, (10), 10 states have call successors, (10) [2024-10-24 18:25:07,386 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 367 states to 367 states and 447 transitions. [2024-10-24 18:25:07,387 INFO L78 Accepts]: Start accepts. Automaton has 367 states and 447 transitions. Word has length 25 [2024-10-24 18:25:07,387 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 18:25:07,387 INFO L471 AbstractCegarLoop]: Abstraction has 367 states and 447 transitions. [2024-10-24 18:25:07,387 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:25:07,388 INFO L276 IsEmpty]: Start isEmpty. Operand 367 states and 447 transitions. [2024-10-24 18:25:07,389 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2024-10-24 18:25:07,389 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 18:25:07,389 INFO L215 NwaCegarLoop]: trace histogram [10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 18:25:07,401 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:25:07,589 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:25:07,591 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 145 more)] === [2024-10-24 18:25:07,591 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 18:25:07,591 INFO L85 PathProgramCache]: Analyzing trace with hash 1388515943, now seen corresponding path program 1 times [2024-10-24 18:25:07,592 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 18:25:07,592 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [407369833] [2024-10-24 18:25:07,592 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 18:25:07,592 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:25:07,593 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 18:25:07,594 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:25:07,595 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:25:08,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 18:25:08,188 INFO L255 TraceCheckSpWp]: Trace formula consists of 270 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-10-24 18:25:08,190 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 18:25:08,219 INFO L349 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2024-10-24 18:25:08,220 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:25:08,241 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:25:08,241 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-24 18:25:08,241 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-24 18:25:08,242 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [407369833] [2024-10-24 18:25:08,242 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [407369833] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 18:25:08,242 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 18:25:08,242 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-24 18:25:08,242 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1105964444] [2024-10-24 18:25:08,242 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 18:25:08,242 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-24 18:25:08,242 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-24 18:25:08,243 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-24 18:25:08,243 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-24 18:25:08,243 INFO L87 Difference]: Start difference. First operand 367 states and 447 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:25:10,463 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 18:25:10,463 INFO L93 Difference]: Finished difference Result 539 states and 599 transitions. [2024-10-24 18:25:10,464 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-24 18:25:10,464 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:25:10,464 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 18:25:10,466 INFO L225 Difference]: With dead ends: 539 [2024-10-24 18:25:10,467 INFO L226 Difference]: Without dead ends: 539 [2024-10-24 18:25:10,467 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:25:10,469 INFO L432 NwaCegarLoop]: 193 mSDtfsCounter, 248 mSDsluCounter, 157 mSDsCounter, 0 mSdLazyCounter, 280 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 255 SdHoareTripleChecker+Valid, 350 SdHoareTripleChecker+Invalid, 291 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 280 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2024-10-24 18:25:10,470 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [255 Valid, 350 Invalid, 291 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 280 Invalid, 0 Unknown, 0 Unchecked, 2.2s Time] [2024-10-24 18:25:10,471 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 539 states. [2024-10-24 18:25:10,481 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 539 to 362. [2024-10-24 18:25:10,482 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 362 states, 216 states have (on average 1.9537037037037037) internal successors, (422), 348 states have internal predecessors, (422), 10 states have call successors, (10), 4 states have call predecessors, (10), 4 states have return successors, (10), 9 states have call predecessors, (10), 10 states have call successors, (10) [2024-10-24 18:25:10,483 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 362 states to 362 states and 442 transitions. [2024-10-24 18:25:10,483 INFO L78 Accepts]: Start accepts. Automaton has 362 states and 442 transitions. Word has length 32 [2024-10-24 18:25:10,484 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 18:25:10,484 INFO L471 AbstractCegarLoop]: Abstraction has 362 states and 442 transitions. [2024-10-24 18:25:10,484 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:25:10,484 INFO L276 IsEmpty]: Start isEmpty. Operand 362 states and 442 transitions. [2024-10-24 18:25:10,485 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2024-10-24 18:25:10,485 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 18:25:10,485 INFO L215 NwaCegarLoop]: trace histogram [10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 18:25:10,499 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 (10)] Forceful destruction successful, exit code 0 [2024-10-24 18:25:10,685 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:25:10,686 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 145 more)] === [2024-10-24 18:25:10,686 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 18:25:10,686 INFO L85 PathProgramCache]: Analyzing trace with hash 1388515944, now seen corresponding path program 1 times [2024-10-24 18:25:10,687 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 18:25:10,687 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1676233848] [2024-10-24 18:25:10,687 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 18:25:10,687 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:25:10,687 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 18:25:10,690 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:25:10,691 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:25:11,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 18:25:11,173 INFO L255 TraceCheckSpWp]: Trace formula consists of 270 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-10-24 18:25:11,175 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 18:25:11,240 INFO L349 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2024-10-24 18:25:11,240 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 21 [2024-10-24 18:25:11,327 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:25:11,327 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-24 18:25:11,327 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-24 18:25:11,327 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1676233848] [2024-10-24 18:25:11,327 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1676233848] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 18:25:11,327 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 18:25:11,327 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-24 18:25:11,328 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [877984097] [2024-10-24 18:25:11,328 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 18:25:11,328 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-24 18:25:11,328 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-24 18:25:11,329 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-24 18:25:11,329 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-10-24 18:25:11,329 INFO L87 Difference]: Start difference. First operand 362 states and 442 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:25:14,553 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 18:25:14,553 INFO L93 Difference]: Finished difference Result 407 states and 495 transitions. [2024-10-24 18:25:14,554 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-24 18:25:14,554 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:25:14,555 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 18:25:14,556 INFO L225 Difference]: With dead ends: 407 [2024-10-24 18:25:14,556 INFO L226 Difference]: Without dead ends: 407 [2024-10-24 18:25:14,557 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:25:14,558 INFO L432 NwaCegarLoop]: 270 mSDtfsCounter, 312 mSDsluCounter, 748 mSDsCounter, 0 mSdLazyCounter, 341 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 321 SdHoareTripleChecker+Valid, 1018 SdHoareTripleChecker+Invalid, 341 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 341 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.2s IncrementalHoareTripleChecker+Time [2024-10-24 18:25:14,558 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [321 Valid, 1018 Invalid, 341 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 341 Invalid, 0 Unknown, 0 Unchecked, 3.2s Time] [2024-10-24 18:25:14,560 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 407 states. [2024-10-24 18:25:14,582 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 407 to 361. [2024-10-24 18:25:14,583 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 361 states, 216 states have (on average 1.9490740740740742) internal successors, (421), 347 states have internal predecessors, (421), 10 states have call successors, (10), 4 states have call predecessors, (10), 4 states have return successors, (10), 9 states have call predecessors, (10), 10 states have call successors, (10) [2024-10-24 18:25:14,585 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 361 states to 361 states and 441 transitions. [2024-10-24 18:25:14,585 INFO L78 Accepts]: Start accepts. Automaton has 361 states and 441 transitions. Word has length 32 [2024-10-24 18:25:14,586 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 18:25:14,586 INFO L471 AbstractCegarLoop]: Abstraction has 361 states and 441 transitions. [2024-10-24 18:25:14,586 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:25:14,586 INFO L276 IsEmpty]: Start isEmpty. Operand 361 states and 441 transitions. [2024-10-24 18:25:14,589 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2024-10-24 18:25:14,589 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 18:25:14,589 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:25:14,606 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:25:14,790 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:25:14,790 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 145 more)] === [2024-10-24 18:25:14,791 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 18:25:14,791 INFO L85 PathProgramCache]: Analyzing trace with hash -1370449043, now seen corresponding path program 1 times [2024-10-24 18:25:14,792 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 18:25:14,792 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [843378589] [2024-10-24 18:25:14,792 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 18:25:14,792 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:25:14,792 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 18:25:14,793 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:25:14,794 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:25:15,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 18:25:15,311 INFO L255 TraceCheckSpWp]: Trace formula consists of 293 conjuncts, 13 conjuncts are in the unsatisfiable core [2024-10-24 18:25:15,313 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 18:25:15,359 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-24 18:25:15,360 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:25:15,367 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:25:15,581 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-24 18:25:15,582 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:25:15,604 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2024-10-24 18:25:15,605 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:25:15,707 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:25:15,707 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-24 18:25:15,707 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-24 18:25:15,707 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [843378589] [2024-10-24 18:25:15,707 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [843378589] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 18:25:15,707 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 18:25:15,707 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-24 18:25:15,707 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2094087703] [2024-10-24 18:25:15,707 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 18:25:15,708 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-24 18:25:15,708 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-24 18:25:15,708 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-24 18:25:15,708 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2024-10-24 18:25:15,709 INFO L87 Difference]: Start difference. First operand 361 states and 441 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:25:21,865 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 18:25:21,866 INFO L93 Difference]: Finished difference Result 431 states and 520 transitions. [2024-10-24 18:25:21,866 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-24 18:25:21,867 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:25:21,867 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 18:25:21,869 INFO L225 Difference]: With dead ends: 431 [2024-10-24 18:25:21,869 INFO L226 Difference]: Without dead ends: 431 [2024-10-24 18:25:21,869 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:25:21,870 INFO L432 NwaCegarLoop]: 261 mSDtfsCounter, 400 mSDsluCounter, 870 mSDsCounter, 0 mSdLazyCounter, 615 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 407 SdHoareTripleChecker+Valid, 1131 SdHoareTripleChecker+Invalid, 624 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 615 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.0s IncrementalHoareTripleChecker+Time [2024-10-24 18:25:21,870 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [407 Valid, 1131 Invalid, 624 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 615 Invalid, 0 Unknown, 0 Unchecked, 6.0s Time] [2024-10-24 18:25:21,871 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 431 states. [2024-10-24 18:25:21,881 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 431 to 402. [2024-10-24 18:25:21,882 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 402 states, 255 states have (on average 1.9333333333333333) internal successors, (493), 386 states have internal predecessors, (493), 12 states have call successors, (12), 4 states have call predecessors, (12), 4 states have return successors, (12), 11 states have call predecessors, (12), 12 states have call successors, (12) [2024-10-24 18:25:21,885 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 402 states to 402 states and 517 transitions. [2024-10-24 18:25:21,885 INFO L78 Accepts]: Start accepts. Automaton has 402 states and 517 transitions. Word has length 34 [2024-10-24 18:25:21,886 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 18:25:21,886 INFO L471 AbstractCegarLoop]: Abstraction has 402 states and 517 transitions. [2024-10-24 18:25:21,886 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:25:21,886 INFO L276 IsEmpty]: Start isEmpty. Operand 402 states and 517 transitions. [2024-10-24 18:25:21,887 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2024-10-24 18:25:21,889 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 18:25:21,889 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:25:21,909 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (12)] Ended with exit code 0 [2024-10-24 18:25:22,093 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:25:22,094 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 145 more)] === [2024-10-24 18:25:22,094 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 18:25:22,094 INFO L85 PathProgramCache]: Analyzing trace with hash 1553979851, now seen corresponding path program 1 times [2024-10-24 18:25:22,095 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 18:25:22,095 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1697532997] [2024-10-24 18:25:22,095 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 18:25:22,095 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:25:22,095 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 18:25:22,096 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:25:22,097 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:25:22,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 18:25:22,620 INFO L255 TraceCheckSpWp]: Trace formula consists of 312 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-10-24 18:25:22,623 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 18:25:22,633 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:25:22,640 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-24 18:25:22,641 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:25:22,660 INFO L349 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2024-10-24 18:25:22,660 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:25:22,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:25:22,692 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-24 18:25:22,692 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-24 18:25:22,692 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1697532997] [2024-10-24 18:25:22,692 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1697532997] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 18:25:22,692 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 18:25:22,692 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-24 18:25:22,692 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [17200432] [2024-10-24 18:25:22,692 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 18:25:22,693 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-24 18:25:22,693 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-24 18:25:22,693 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-24 18:25:22,693 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-24 18:25:22,694 INFO L87 Difference]: Start difference. First operand 402 states and 517 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:25:23,809 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 18:25:23,810 INFO L93 Difference]: Finished difference Result 574 states and 674 transitions. [2024-10-24 18:25:23,810 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-24 18:25:23,810 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:25:23,810 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 18:25:23,812 INFO L225 Difference]: With dead ends: 574 [2024-10-24 18:25:23,812 INFO L226 Difference]: Without dead ends: 574 [2024-10-24 18:25:23,812 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:25:23,813 INFO L432 NwaCegarLoop]: 235 mSDtfsCounter, 243 mSDsluCounter, 154 mSDsCounter, 0 mSdLazyCounter, 274 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 250 SdHoareTripleChecker+Valid, 389 SdHoareTripleChecker+Invalid, 283 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 274 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2024-10-24 18:25:23,813 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [250 Valid, 389 Invalid, 283 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 274 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2024-10-24 18:25:23,814 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 574 states. [2024-10-24 18:25:23,824 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 574 to 415. [2024-10-24 18:25:23,825 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 415 states, 269 states have (on average 1.9070631970260223) internal successors, (513), 399 states have internal predecessors, (513), 12 states have call successors, (12), 4 states have call predecessors, (12), 4 states have return successors, (12), 11 states have call predecessors, (12), 12 states have call successors, (12) [2024-10-24 18:25:23,826 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 415 states to 415 states and 537 transitions. [2024-10-24 18:25:23,827 INFO L78 Accepts]: Start accepts. Automaton has 415 states and 537 transitions. Word has length 36 [2024-10-24 18:25:23,827 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 18:25:23,827 INFO L471 AbstractCegarLoop]: Abstraction has 415 states and 537 transitions. [2024-10-24 18:25:23,828 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:25:23,828 INFO L276 IsEmpty]: Start isEmpty. Operand 415 states and 537 transitions. [2024-10-24 18:25:23,828 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2024-10-24 18:25:23,828 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 18:25:23,828 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:25:23,847 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:25:24,029 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:25:24,029 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 145 more)] === [2024-10-24 18:25:24,031 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 18:25:24,031 INFO L85 PathProgramCache]: Analyzing trace with hash 1553979852, now seen corresponding path program 1 times [2024-10-24 18:25:24,032 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 18:25:24,033 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2065105104] [2024-10-24 18:25:24,033 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 18:25:24,033 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:25:24,033 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 18:25:24,036 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:25:24,037 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:25:24,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 18:25:24,674 INFO L255 TraceCheckSpWp]: Trace formula consists of 312 conjuncts, 12 conjuncts are in the unsatisfiable core [2024-10-24 18:25:24,677 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 18:25:24,719 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:25:24,741 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:25:24,747 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:25:24,756 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:25:24,947 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-24 18:25:24,948 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:25:24,969 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2024-10-24 18:25:24,970 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:25:25,086 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:25:25,086 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-24 18:25:25,087 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-24 18:25:25,087 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2065105104] [2024-10-24 18:25:25,087 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2065105104] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 18:25:25,087 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 18:25:25,087 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-24 18:25:25,087 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1124782630] [2024-10-24 18:25:25,087 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 18:25:25,087 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-24 18:25:25,088 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-24 18:25:25,088 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-24 18:25:25,088 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2024-10-24 18:25:25,088 INFO L87 Difference]: Start difference. First operand 415 states and 537 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:25:32,064 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 18:25:32,064 INFO L93 Difference]: Finished difference Result 586 states and 683 transitions. [2024-10-24 18:25:32,065 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-24 18:25:32,065 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:25:32,066 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 18:25:32,068 INFO L225 Difference]: With dead ends: 586 [2024-10-24 18:25:32,068 INFO L226 Difference]: Without dead ends: 586 [2024-10-24 18:25:32,068 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:25:32,069 INFO L432 NwaCegarLoop]: 126 mSDtfsCounter, 783 mSDsluCounter, 482 mSDsCounter, 0 mSdLazyCounter, 1045 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 789 SdHoareTripleChecker+Valid, 608 SdHoareTripleChecker+Invalid, 1068 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 1045 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.8s IncrementalHoareTripleChecker+Time [2024-10-24 18:25:32,069 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [789 Valid, 608 Invalid, 1068 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 1045 Invalid, 0 Unknown, 0 Unchecked, 6.8s Time] [2024-10-24 18:25:32,070 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 586 states. [2024-10-24 18:25:32,077 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 586 to 415. [2024-10-24 18:25:32,078 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 415 states, 269 states have (on average 1.895910780669145) internal successors, (510), 399 states have internal predecessors, (510), 12 states have call successors, (12), 4 states have call predecessors, (12), 4 states have return successors, (12), 11 states have call predecessors, (12), 12 states have call successors, (12) [2024-10-24 18:25:32,080 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 415 states to 415 states and 534 transitions. [2024-10-24 18:25:32,080 INFO L78 Accepts]: Start accepts. Automaton has 415 states and 534 transitions. Word has length 36 [2024-10-24 18:25:32,081 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 18:25:32,081 INFO L471 AbstractCegarLoop]: Abstraction has 415 states and 534 transitions. [2024-10-24 18:25:32,081 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:25:32,081 INFO L276 IsEmpty]: Start isEmpty. Operand 415 states and 534 transitions. [2024-10-24 18:25:32,082 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2024-10-24 18:25:32,082 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 18:25:32,082 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:25:32,102 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (14)] Forceful destruction successful, exit code 0 [2024-10-24 18:25:32,282 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:25:32,283 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 145 more)] === [2024-10-24 18:25:32,283 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 18:25:32,283 INFO L85 PathProgramCache]: Analyzing trace with hash -1273433593, now seen corresponding path program 1 times [2024-10-24 18:25:32,284 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 18:25:32,284 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [347217931] [2024-10-24 18:25:32,284 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 18:25:32,284 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:25:32,284 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 18:25:32,286 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:25:32,287 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:25:32,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 18:25:32,919 INFO L255 TraceCheckSpWp]: Trace formula consists of 331 conjuncts, 14 conjuncts are in the unsatisfiable core [2024-10-24 18:25:32,921 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 18:25:32,959 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:25:33,000 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:25:33,097 INFO L349 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2024-10-24 18:25:33,097 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:25:33,182 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2024-10-24 18:25:33,183 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:25:33,203 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:25:33,203 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-24 18:25:33,204 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-24 18:25:33,204 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [347217931] [2024-10-24 18:25:33,204 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [347217931] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 18:25:33,204 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 18:25:33,204 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-24 18:25:33,204 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1768651051] [2024-10-24 18:25:33,204 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 18:25:33,204 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-24 18:25:33,204 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-24 18:25:33,205 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-24 18:25:33,205 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2024-10-24 18:25:33,205 INFO L87 Difference]: Start difference. First operand 415 states and 534 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:25:36,519 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 18:25:36,520 INFO L93 Difference]: Finished difference Result 413 states and 530 transitions. [2024-10-24 18:25:36,521 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-24 18:25:36,521 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:25:36,521 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 18:25:36,522 INFO L225 Difference]: With dead ends: 413 [2024-10-24 18:25:36,522 INFO L226 Difference]: Without dead ends: 413 [2024-10-24 18:25:36,523 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2024-10-24 18:25:36,523 INFO L432 NwaCegarLoop]: 277 mSDtfsCounter, 257 mSDsluCounter, 695 mSDsCounter, 0 mSdLazyCounter, 693 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 264 SdHoareTripleChecker+Valid, 972 SdHoareTripleChecker+Invalid, 695 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 693 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.3s IncrementalHoareTripleChecker+Time [2024-10-24 18:25:36,523 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [264 Valid, 972 Invalid, 695 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 693 Invalid, 0 Unknown, 0 Unchecked, 3.3s Time] [2024-10-24 18:25:36,525 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 413 states. [2024-10-24 18:25:36,548 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 413 to 413. [2024-10-24 18:25:36,549 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 413 states, 269 states have (on average 1.8810408921933086) internal successors, (506), 397 states have internal predecessors, (506), 12 states have call successors, (12), 4 states have call predecessors, (12), 4 states have return successors, (12), 11 states have call predecessors, (12), 12 states have call successors, (12) [2024-10-24 18:25:36,550 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 413 states to 413 states and 530 transitions. [2024-10-24 18:25:36,551 INFO L78 Accepts]: Start accepts. Automaton has 413 states and 530 transitions. Word has length 38 [2024-10-24 18:25:36,551 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 18:25:36,551 INFO L471 AbstractCegarLoop]: Abstraction has 413 states and 530 transitions. [2024-10-24 18:25:36,551 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:25:36,552 INFO L276 IsEmpty]: Start isEmpty. Operand 413 states and 530 transitions. [2024-10-24 18:25:36,552 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2024-10-24 18:25:36,552 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 18:25:36,552 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:25:36,571 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:25:36,753 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:25:36,753 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 145 more)] === [2024-10-24 18:25:36,754 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 18:25:36,754 INFO L85 PathProgramCache]: Analyzing trace with hash -1273433592, now seen corresponding path program 1 times [2024-10-24 18:25:36,754 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 18:25:36,754 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1984040988] [2024-10-24 18:25:36,754 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 18:25:36,754 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:25:36,755 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 18:25:36,756 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:25:36,757 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:25:37,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 18:25:37,378 INFO L255 TraceCheckSpWp]: Trace formula consists of 331 conjuncts, 16 conjuncts are in the unsatisfiable core [2024-10-24 18:25:37,381 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 18:25:37,390 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:25:37,407 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:25:37,436 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:25:37,452 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:25:37,506 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:25:37,520 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:25:37,555 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:25:37,574 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:25:37,574 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-24 18:25:37,574 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-24 18:25:37,574 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1984040988] [2024-10-24 18:25:37,574 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1984040988] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 18:25:37,574 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 18:25:37,574 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-24 18:25:37,574 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1831712298] [2024-10-24 18:25:37,574 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 18:25:37,575 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-24 18:25:37,575 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-24 18:25:37,575 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-24 18:25:37,575 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2024-10-24 18:25:37,575 INFO L87 Difference]: Start difference. First operand 413 states and 530 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) [2024-10-24 18:25:41,587 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 18:25:41,587 INFO L93 Difference]: Finished difference Result 412 states and 528 transitions. [2024-10-24 18:25:41,588 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-24 18:25:41,589 INFO L78 Accepts]: Start accepts. Automaton has 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) Word has length 38 [2024-10-24 18:25:41,589 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 18:25:41,591 INFO L225 Difference]: With dead ends: 412 [2024-10-24 18:25:41,591 INFO L226 Difference]: Without dead ends: 412 [2024-10-24 18:25:41,592 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2024-10-24 18:25:41,592 INFO L432 NwaCegarLoop]: 273 mSDtfsCounter, 252 mSDsluCounter, 731 mSDsCounter, 0 mSdLazyCounter, 653 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 259 SdHoareTripleChecker+Valid, 1004 SdHoareTripleChecker+Invalid, 654 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 653 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.9s IncrementalHoareTripleChecker+Time [2024-10-24 18:25:41,593 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [259 Valid, 1004 Invalid, 654 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 653 Invalid, 0 Unknown, 0 Unchecked, 3.9s Time] [2024-10-24 18:25:41,596 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 412 states. [2024-10-24 18:25:41,602 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 412 to 412. [2024-10-24 18:25:41,603 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 412 states, 269 states have (on average 1.8736059479553904) internal successors, (504), 396 states have internal predecessors, (504), 12 states have call successors, (12), 4 states have call predecessors, (12), 4 states have return successors, (12), 11 states have call predecessors, (12), 12 states have call successors, (12) [2024-10-24 18:25:41,605 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 412 states to 412 states and 528 transitions. [2024-10-24 18:25:41,606 INFO L78 Accepts]: Start accepts. Automaton has 412 states and 528 transitions. Word has length 38 [2024-10-24 18:25:41,606 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 18:25:41,606 INFO L471 AbstractCegarLoop]: Abstraction has 412 states and 528 transitions. [2024-10-24 18:25:41,606 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has 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) [2024-10-24 18:25:41,606 INFO L276 IsEmpty]: Start isEmpty. Operand 412 states and 528 transitions. [2024-10-24 18:25:41,607 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2024-10-24 18:25:41,607 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 18:25:41,607 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, 1, 1, 1] [2024-10-24 18:25:41,627 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (16)] Forceful destruction successful, exit code 0 [2024-10-24 18:25:41,807 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-24 18:25:41,808 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr20REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [#Ultimate.C_strcpyErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, #Ultimate.C_strcpyErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, #Ultimate.C_strcpyErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE (and 145 more)] === [2024-10-24 18:25:41,808 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 18:25:41,808 INFO L85 PathProgramCache]: Analyzing trace with hash 602815589, now seen corresponding path program 1 times [2024-10-24 18:25:41,809 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 18:25:41,809 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2012792760] [2024-10-24 18:25:41,809 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 18:25:41,809 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:25:41,809 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 18:25:41,811 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-24 18:25:41,812 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (17)] Waiting until timeout for monitored process [2024-10-24 18:25:42,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 18:25:42,519 INFO L255 TraceCheckSpWp]: Trace formula consists of 352 conjuncts, 14 conjuncts are in the unsatisfiable core [2024-10-24 18:25:42,522 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 18:25:42,529 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:25:42,594 INFO L349 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2024-10-24 18:25:42,594 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 19 treesize of output 27 [2024-10-24 18:25:42,657 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 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:25:42,741 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 38 treesize of output 31 [2024-10-24 18:25:42,897 INFO L349 Elim1Store]: treesize reduction 24, result has 17.2 percent of original size [2024-10-24 18:25:42,898 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 56 treesize of output 55 [2024-10-24 18:25:42,934 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 15 [2024-10-24 18:25:43,018 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:25:43,018 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-24 18:25:43,019 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-24 18:25:43,019 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2012792760] [2024-10-24 18:25:43,019 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2012792760] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 18:25:43,019 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 18:25:43,019 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-10-24 18:25:43,019 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1788018557] [2024-10-24 18:25:43,019 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 18:25:43,019 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-10-24 18:25:43,019 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-24 18:25:43,020 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-24 18:25:43,020 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2024-10-24 18:25:43,020 INFO L87 Difference]: Start difference. First operand 412 states and 528 transitions. Second operand has 9 states, 8 states have (on average 2.625) internal successors, (21), 9 states have internal predecessors, (21), 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:25:48,091 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 18:25:48,091 INFO L93 Difference]: Finished difference Result 588 states and 690 transitions. [2024-10-24 18:25:48,092 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-24 18:25:48,093 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 2.625) internal successors, (21), 9 states have internal predecessors, (21), 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 41 [2024-10-24 18:25:48,093 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 18:25:48,094 INFO L225 Difference]: With dead ends: 588 [2024-10-24 18:25:48,095 INFO L226 Difference]: Without dead ends: 588 [2024-10-24 18:25:48,095 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110 [2024-10-24 18:25:48,095 INFO L432 NwaCegarLoop]: 225 mSDtfsCounter, 697 mSDsluCounter, 693 mSDsCounter, 0 mSdLazyCounter, 860 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 710 SdHoareTripleChecker+Valid, 918 SdHoareTripleChecker+Invalid, 872 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 860 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.9s IncrementalHoareTripleChecker+Time [2024-10-24 18:25:48,095 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [710 Valid, 918 Invalid, 872 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 860 Invalid, 0 Unknown, 0 Unchecked, 4.9s Time] [2024-10-24 18:25:48,096 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 588 states. [2024-10-24 18:25:48,104 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 588 to 418. [2024-10-24 18:25:48,104 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 418 states, 275 states have (on average 1.8727272727272728) internal successors, (515), 402 states have internal predecessors, (515), 12 states have call successors, (12), 4 states have call predecessors, (12), 4 states have return successors, (12), 11 states have call predecessors, (12), 12 states have call successors, (12) [2024-10-24 18:25:48,106 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 418 states to 418 states and 539 transitions. [2024-10-24 18:25:48,107 INFO L78 Accepts]: Start accepts. Automaton has 418 states and 539 transitions. Word has length 41 [2024-10-24 18:25:48,107 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 18:25:48,107 INFO L471 AbstractCegarLoop]: Abstraction has 418 states and 539 transitions. [2024-10-24 18:25:48,107 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 2.625) internal successors, (21), 9 states have internal predecessors, (21), 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:25:48,108 INFO L276 IsEmpty]: Start isEmpty. Operand 418 states and 539 transitions. [2024-10-24 18:25:48,109 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2024-10-24 18:25:48,109 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 18:25:48,109 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, 1, 1, 1] [2024-10-24 18:25:48,128 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (17)] Ended with exit code 0 [2024-10-24 18:25:48,310 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-24 18:25:48,310 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr21REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [#Ultimate.C_strcpyErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, #Ultimate.C_strcpyErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, #Ultimate.C_strcpyErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE (and 145 more)] === [2024-10-24 18:25:48,311 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 18:25:48,311 INFO L85 PathProgramCache]: Analyzing trace with hash 602815590, now seen corresponding path program 1 times [2024-10-24 18:25:48,311 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 18:25:48,311 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1656830851] [2024-10-24 18:25:48,312 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 18:25:48,312 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:25:48,312 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 18:25:48,313 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-24 18:25:48,314 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (18)] Waiting until timeout for monitored process [2024-10-24 18:25:49,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 18:25:49,095 INFO L255 TraceCheckSpWp]: Trace formula consists of 352 conjuncts, 21 conjuncts are in the unsatisfiable core [2024-10-24 18:25:49,098 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 18:25:49,105 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:25:49,150 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2024-10-24 18:25:49,150 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 13 [2024-10-24 18:25:49,162 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-10-24 18:25:49,209 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 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:25:49,229 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:25:49,309 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 36 treesize of output 29 [2024-10-24 18:25:49,316 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 16 [2024-10-24 18:25:49,495 INFO L349 Elim1Store]: treesize reduction 24, result has 17.2 percent of original size [2024-10-24 18:25:49,496 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 80 treesize of output 75 [2024-10-24 18:25:49,518 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 39 treesize of output 16 [2024-10-24 18:25:49,615 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 40 treesize of output 13 [2024-10-24 18:25:49,621 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 3 [2024-10-24 18:25:49,653 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:25:49,654 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-24 18:25:49,654 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-24 18:25:49,654 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1656830851] [2024-10-24 18:25:49,654 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1656830851] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 18:25:49,654 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 18:25:49,654 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-10-24 18:25:49,654 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [928966437] [2024-10-24 18:25:49,654 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 18:25:49,655 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-10-24 18:25:49,655 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-24 18:25:49,655 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-10-24 18:25:49,655 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2024-10-24 18:25:49,655 INFO L87 Difference]: Start difference. First operand 418 states and 539 transitions. Second operand has 10 states, 9 states have (on average 2.3333333333333335) internal successors, (21), 10 states have internal predecessors, (21), 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:25:54,571 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 18:25:54,571 INFO L93 Difference]: Finished difference Result 585 states and 684 transitions. [2024-10-24 18:25:54,572 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-24 18:25:54,572 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 2.3333333333333335) internal successors, (21), 10 states have internal predecessors, (21), 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 41 [2024-10-24 18:25:54,573 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 18:25:54,574 INFO L225 Difference]: With dead ends: 585 [2024-10-24 18:25:54,575 INFO L226 Difference]: Without dead ends: 585 [2024-10-24 18:25:54,575 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=60, Invalid=150, Unknown=0, NotChecked=0, Total=210 [2024-10-24 18:25:54,575 INFO L432 NwaCegarLoop]: 186 mSDtfsCounter, 486 mSDsluCounter, 640 mSDsCounter, 0 mSdLazyCounter, 1156 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 499 SdHoareTripleChecker+Valid, 826 SdHoareTripleChecker+Invalid, 1167 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 1156 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.6s IncrementalHoareTripleChecker+Time [2024-10-24 18:25:54,576 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [499 Valid, 826 Invalid, 1167 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 1156 Invalid, 0 Unknown, 0 Unchecked, 4.6s Time] [2024-10-24 18:25:54,576 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 585 states. [2024-10-24 18:25:54,582 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 585 to 418. [2024-10-24 18:25:54,583 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 418 states, 275 states have (on average 1.8581818181818182) internal successors, (511), 402 states have internal predecessors, (511), 12 states have call successors, (12), 4 states have call predecessors, (12), 4 states have return successors, (12), 11 states have call predecessors, (12), 12 states have call successors, (12) [2024-10-24 18:25:54,585 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 418 states to 418 states and 535 transitions. [2024-10-24 18:25:54,585 INFO L78 Accepts]: Start accepts. Automaton has 418 states and 535 transitions. Word has length 41 [2024-10-24 18:25:54,585 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 18:25:54,585 INFO L471 AbstractCegarLoop]: Abstraction has 418 states and 535 transitions. [2024-10-24 18:25:54,585 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 2.3333333333333335) internal successors, (21), 10 states have internal predecessors, (21), 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:25:54,585 INFO L276 IsEmpty]: Start isEmpty. Operand 418 states and 535 transitions. [2024-10-24 18:25:54,586 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2024-10-24 18:25:54,586 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 18:25:54,586 INFO L215 NwaCegarLoop]: trace histogram [10, 10, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 18:25:54,608 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (18)] Forceful destruction successful, exit code 0 [2024-10-24 18:25:54,786 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-24 18:25:54,787 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr20REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [#Ultimate.C_strcpyErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, #Ultimate.C_strcpyErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, #Ultimate.C_strcpyErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE (and 145 more)] === [2024-10-24 18:25:54,787 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 18:25:54,787 INFO L85 PathProgramCache]: Analyzing trace with hash 1237478706, now seen corresponding path program 1 times [2024-10-24 18:25:54,788 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 18:25:54,788 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2054435482] [2024-10-24 18:25:54,788 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 18:25:54,788 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:25:54,788 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 18:25:54,790 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-24 18:25:54,792 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (19)] Waiting until timeout for monitored process [2024-10-24 18:25:55,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 18:25:55,612 INFO L255 TraceCheckSpWp]: Trace formula consists of 373 conjuncts, 16 conjuncts are in the unsatisfiable core [2024-10-24 18:25:55,614 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 18:25:55,620 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:25:55,675 INFO L349 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2024-10-24 18:25:55,675 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 19 treesize of output 27 [2024-10-24 18:25:55,725 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 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:25:55,810 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 38 treesize of output 31 [2024-10-24 18:25:55,973 INFO L349 Elim1Store]: treesize reduction 24, result has 17.2 percent of original size [2024-10-24 18:25:55,973 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 56 treesize of output 55 [2024-10-24 18:25:56,071 INFO L349 Elim1Store]: treesize reduction 24, result has 17.2 percent of original size [2024-10-24 18:25:56,072 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 56 treesize of output 55 [2024-10-24 18:25:56,114 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 15 [2024-10-24 18:25:56,193 INFO L134 CoverageAnalysis]: Checked inductivity of 103 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 102 trivial. 0 not checked. [2024-10-24 18:25:56,193 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-24 18:25:56,283 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1336 (Array (_ BitVec 64) (_ BitVec 64)))) (= (_ bv0 1) (bvadd (_ bv1 1) (select |c_#valid| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem174#1.base| v_ArrVal_1336) |c_ULTIMATE.start_main_~argv~0#1.base|) (bvadd (bvmul (_ bv8 64) ((_ sign_extend 32) |c_ULTIMATE.start_main_~i~4#1|)) |c_ULTIMATE.start_main_~argv~0#1.offset|)))))) is different from false [2024-10-24 18:25:56,301 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1336 (Array (_ BitVec 64) (_ BitVec 64)))) (= (_ bv0 1) (bvadd (_ bv1 1) (select |c_#valid| (let ((.cse0 (bvadd (bvmul (_ bv8 64) ((_ sign_extend 32) |c_ULTIMATE.start_main_~i~4#1|)) |c_ULTIMATE.start_main_~argv~0#1.offset|))) (select (select (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~argv~0#1.base|) .cse0) v_ArrVal_1336) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse0)))))) is different from false [2024-10-24 18:25:56,333 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1336 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1335 (Array (_ BitVec 64) (_ BitVec 64)))) (= (_ bv0 1) (bvadd (_ bv1 1) (select |c_#valid| (let ((.cse1 (bvadd (bvmul (_ bv8 64) ((_ sign_extend 32) |c_ULTIMATE.start_main_~i~4#1|)) |c_ULTIMATE.start_main_~argv~0#1.offset|))) (select (select (let ((.cse0 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem173#1.base| v_ArrVal_1335))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse1) v_ArrVal_1336)) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse1)))))) is different from false [2024-10-24 18:25:56,356 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1336 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1335 (Array (_ BitVec 64) (_ BitVec 64)))) (= (_ bv0 1) (bvadd (_ bv1 1) (select |c_#valid| (let ((.cse1 (bvadd (bvmul (_ bv8 64) ((_ sign_extend 32) |c_ULTIMATE.start_main_~i~4#1|)) |c_ULTIMATE.start_main_~argv~0#1.offset|))) (select (select (let ((.cse0 (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~argv~0#1.base|) .cse1) v_ArrVal_1335))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse1) v_ArrVal_1336)) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse1)))))) is different from false [2024-10-24 18:25:56,384 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1334 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1336 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1335 (Array (_ BitVec 64) (_ BitVec 64)))) (= (_ bv0 1) (bvadd (_ bv1 1) (select |c_#valid| (let ((.cse1 (bvadd (bvmul (_ bv8 64) ((_ sign_extend 32) |c_ULTIMATE.start_main_~i~4#1|)) |c_ULTIMATE.start_main_~argv~0#1.offset|))) (select (select (let ((.cse0 (let ((.cse2 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~mem_track~0#1.base| v_ArrVal_1334))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse1) v_ArrVal_1335)))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse1) v_ArrVal_1336)) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse1)))))) is different from false [2024-10-24 18:25:56,427 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-24 18:25:56,428 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 116 treesize of output 78 [2024-10-24 18:25:56,445 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 13467 treesize of output 10722 [2024-10-24 18:25:56,668 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 1873 treesize of output 1684 [2024-10-24 18:25:56,689 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 1684 treesize of output 1446 [2024-10-24 18:25:56,717 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 1446 treesize of output 1208