./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/valid-memsafety.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_SFH_test10-3.i --full-output --architecture 32bit -------------------------------------------------------------------------------- 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/uthash-2.0.2/uthash_SFH_test10-3.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash fa6de94809ad211882523114a33a27b3a82ed66d6bff27089fdf2c6fcaa93aae --- Real Ultimate output --- This is Ultimate 0.2.5-dev-4a390ef-m [2024-10-24 18:46:11,417 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-24 18:46:11,482 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2024-10-24 18:46:11,487 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-24 18:46:11,488 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-24 18:46:11,508 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-24 18:46:11,509 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-24 18:46:11,509 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-24 18:46:11,510 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-24 18:46:11,510 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-24 18:46:11,511 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-24 18:46:11,511 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-24 18:46:11,511 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-24 18:46:11,512 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-24 18:46:11,512 INFO L153 SettingsManager]: * Use SBE=true [2024-10-24 18:46:11,513 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-24 18:46:11,513 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-24 18:46:11,513 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-24 18:46:11,514 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-24 18:46:11,514 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-24 18:46:11,514 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-10-24 18:46:11,515 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-10-24 18:46:11,516 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-10-24 18:46:11,516 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-24 18:46:11,516 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-10-24 18:46:11,517 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-24 18:46:11,517 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-10-24 18:46:11,517 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-24 18:46:11,518 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-24 18:46:11,518 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-24 18:46:11,518 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-24 18:46:11,519 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-24 18:46:11,519 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-24 18:46:11,519 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-24 18:46:11,520 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-24 18:46:11,520 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-24 18:46:11,520 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-24 18:46:11,520 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-24 18:46:11,521 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-24 18:46:11,521 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-24 18:46:11,521 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-24 18:46:11,522 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-24 18:46:11,522 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> fa6de94809ad211882523114a33a27b3a82ed66d6bff27089fdf2c6fcaa93aae [2024-10-24 18:46:11,778 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-24 18:46:11,801 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-24 18:46:11,808 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-24 18:46:11,810 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-24 18:46:11,810 INFO L274 PluginConnector]: CDTParser initialized [2024-10-24 18:46:11,812 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_SFH_test10-3.i [2024-10-24 18:46:13,290 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-24 18:46:13,613 INFO L384 CDTParser]: Found 1 translation units. [2024-10-24 18:46:13,613 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_SFH_test10-3.i [2024-10-24 18:46:13,633 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ed1eb6262/d68a84e8b74e4589bf52e447f4c2856a/FLAG0fd2f9381 [2024-10-24 18:46:13,647 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ed1eb6262/d68a84e8b74e4589bf52e447f4c2856a [2024-10-24 18:46:13,649 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-24 18:46:13,651 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-24 18:46:13,652 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-24 18:46:13,652 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-24 18:46:13,658 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-24 18:46:13,658 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 06:46:13" (1/1) ... [2024-10-24 18:46:13,661 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2ca37443 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 06:46:13, skipping insertion in model container [2024-10-24 18:46:13,661 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 06:46:13" (1/1) ... [2024-10-24 18:46:13,718 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-24 18:46:14,464 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-24 18:46:14,476 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:46:14,477 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver@7444bfd4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 06:46:14, skipping insertion in model container [2024-10-24 18:46:14,477 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-24 18:46:14,478 INFO L186 ToolchainWalker]: Toolchain execution was canceled (user or tool) before executing de.uni_freiburg.informatik.ultimate.boogie.procedureinliner [2024-10-24 18:46:14,480 INFO L158 Benchmark]: Toolchain (without parser) took 828.23ms. Allocated memory was 157.3MB in the beginning and 207.6MB in the end (delta: 50.3MB). Free memory was 96.3MB in the beginning and 170.5MB in the end (delta: -74.2MB). Peak memory consumption was 41.5MB. Max. memory is 16.1GB. [2024-10-24 18:46:14,480 INFO L158 Benchmark]: CDTParser took 0.18ms. Allocated memory is still 157.3MB. Free memory is still 116.7MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-24 18:46:14,482 INFO L158 Benchmark]: CACSL2BoogieTranslator took 826.04ms. Allocated memory was 157.3MB in the beginning and 207.6MB in the end (delta: 50.3MB). Free memory was 96.0MB in the beginning and 170.5MB in the end (delta: -74.6MB). Peak memory consumption was 41.5MB. Max. memory is 16.1GB. [2024-10-24 18:46:14,484 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 157.3MB. Free memory is still 116.7MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 826.04ms. Allocated memory was 157.3MB in the beginning and 207.6MB in the end (delta: 50.3MB). Free memory was 96.0MB in the beginning and 170.5MB in the end (delta: -74.6MB). Peak memory consumption was 41.5MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - UnsupportedSyntaxResult [Line: 734]: 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/uthash-2.0.2/uthash_SFH_test10-3.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash fa6de94809ad211882523114a33a27b3a82ed66d6bff27089fdf2c6fcaa93aae --- Real Ultimate output --- This is Ultimate 0.2.5-dev-4a390ef-m [2024-10-24 18:46:16,555 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-24 18:46:16,617 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf [2024-10-24 18:46:16,624 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-24 18:46:16,625 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-24 18:46:16,657 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-24 18:46:16,658 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-24 18:46:16,658 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-24 18:46:16,660 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-24 18:46:16,661 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-24 18:46:16,661 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-24 18:46:16,661 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-24 18:46:16,662 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-24 18:46:16,664 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-24 18:46:16,664 INFO L153 SettingsManager]: * Use SBE=true [2024-10-24 18:46:16,665 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-24 18:46:16,665 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-24 18:46:16,668 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-24 18:46:16,668 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-24 18:46:16,669 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-24 18:46:16,669 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-10-24 18:46:16,669 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-10-24 18:46:16,670 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-10-24 18:46:16,670 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-24 18:46:16,670 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-10-24 18:46:16,670 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-10-24 18:46:16,670 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-24 18:46:16,671 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-10-24 18:46:16,671 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-10-24 18:46:16,671 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-24 18:46:16,671 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-24 18:46:16,672 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-24 18:46:16,672 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-24 18:46:16,672 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-24 18:46:16,672 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-24 18:46:16,672 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-24 18:46:16,673 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-24 18:46:16,673 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-24 18:46:16,675 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-10-24 18:46:16,675 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-10-24 18:46:16,676 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-24 18:46:16,676 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-24 18:46:16,676 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-24 18:46:16,676 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-24 18:46:16,677 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2024-10-24 18:46:16,677 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> fa6de94809ad211882523114a33a27b3a82ed66d6bff27089fdf2c6fcaa93aae [2024-10-24 18:46:17,026 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-24 18:46:17,055 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-24 18:46:17,058 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-24 18:46:17,059 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-24 18:46:17,060 INFO L274 PluginConnector]: CDTParser initialized [2024-10-24 18:46:17,062 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_SFH_test10-3.i [2024-10-24 18:46:18,499 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-24 18:46:18,830 INFO L384 CDTParser]: Found 1 translation units. [2024-10-24 18:46:18,830 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_SFH_test10-3.i [2024-10-24 18:46:18,850 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/11fe48396/f35be49ba6444ede8d7a6aba75e26072/FLAGcd69ca615 [2024-10-24 18:46:18,861 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/11fe48396/f35be49ba6444ede8d7a6aba75e26072 [2024-10-24 18:46:18,864 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-24 18:46:18,865 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-24 18:46:18,867 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-24 18:46:18,867 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-24 18:46:18,876 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-24 18:46:18,877 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 06:46:18" (1/1) ... [2024-10-24 18:46:18,879 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@46ee2c49 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 06:46:18, skipping insertion in model container [2024-10-24 18:46:18,880 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 06:46:18" (1/1) ... [2024-10-24 18:46:18,947 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-24 18:46:19,672 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-24 18:46:19,687 INFO L197 MainTranslator]: Restarting translation with changed settings: SettingsChange [mNewPreferredMemoryModel=HoenickeLindenmann_1ByteResolution] [2024-10-24 18:46:19,698 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-24 18:46:19,811 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-24 18:46:19,819 INFO L200 MainTranslator]: Completed pre-run [2024-10-24 18:46:19,956 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-24 18:46:20,004 INFO L204 MainTranslator]: Completed translation [2024-10-24 18:46:20,005 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 06:46:20 WrapperNode [2024-10-24 18:46:20,006 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-24 18:46:20,007 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-24 18:46:20,007 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-24 18:46:20,007 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-24 18:46:20,015 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:46:20" (1/1) ... [2024-10-24 18:46:20,086 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:46:20" (1/1) ... [2024-10-24 18:46:20,178 INFO L138 Inliner]: procedures = 180, calls = 606, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 2586 [2024-10-24 18:46:20,179 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-24 18:46:20,180 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-24 18:46:20,180 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-24 18:46:20,180 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-24 18:46:20,191 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 06:46:20" (1/1) ... [2024-10-24 18:46:20,192 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 06:46:20" (1/1) ... [2024-10-24 18:46:20,238 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 06:46:20" (1/1) ... [2024-10-24 18:46:20,434 INFO L175 MemorySlicer]: Split 574 memory accesses to 3 slices as follows [2, 106, 466]. 81 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0, 0]. The 102 writes are split as follows [0, 4, 98]. [2024-10-24 18:46:20,438 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 06:46:20" (1/1) ... [2024-10-24 18:46:20,439 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 06:46:20" (1/1) ... [2024-10-24 18:46:20,526 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 06:46:20" (1/1) ... [2024-10-24 18:46:20,569 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 06:46:20" (1/1) ... [2024-10-24 18:46:20,583 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 06:46:20" (1/1) ... [2024-10-24 18:46:20,597 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 06:46:20" (1/1) ... [2024-10-24 18:46:20,610 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-24 18:46:20,611 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-24 18:46:20,611 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-24 18:46:20,611 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-24 18:46:20,612 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 06:46:20" (1/1) ... [2024-10-24 18:46:20,619 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-24 18:46:20,631 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 18:46:20,651 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:46:20,655 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:46:20,709 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#0 [2024-10-24 18:46:20,709 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#1 [2024-10-24 18:46:20,710 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#2 [2024-10-24 18:46:20,710 INFO L130 BoogieDeclarations]: Found specification of procedure test_int_int [2024-10-24 18:46:20,710 INFO L138 BoogieDeclarations]: Found implementation of procedure test_int_int [2024-10-24 18:46:20,710 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#0 [2024-10-24 18:46:20,710 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#1 [2024-10-24 18:46:20,710 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#2 [2024-10-24 18:46:20,711 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2024-10-24 18:46:20,711 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2024-10-24 18:46:20,711 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#0 [2024-10-24 18:46:20,711 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#1 [2024-10-24 18:46:20,711 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#2 [2024-10-24 18:46:20,711 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#0 [2024-10-24 18:46:20,712 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#1 [2024-10-24 18:46:20,712 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#2 [2024-10-24 18:46:20,712 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-10-24 18:46:20,713 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-24 18:46:20,713 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2024-10-24 18:46:20,713 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2024-10-24 18:46:20,713 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2024-10-24 18:46:20,713 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-10-24 18:46:20,713 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2024-10-24 18:46:20,714 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2024-10-24 18:46:20,714 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2024-10-24 18:46:20,714 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-10-24 18:46:20,715 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#0 [2024-10-24 18:46:20,715 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#1 [2024-10-24 18:46:20,716 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#2 [2024-10-24 18:46:20,716 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-10-24 18:46:20,716 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2024-10-24 18:46:20,717 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#2 [2024-10-24 18:46:20,717 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-24 18:46:20,717 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-24 18:46:21,049 INFO L238 CfgBuilder]: Building ICFG [2024-10-24 18:46:21,052 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-24 18:46:21,120 WARN L779 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2024-10-24 18:46:21,141 WARN L779 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2024-10-24 18:46:21,158 WARN L779 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2024-10-24 18:46:28,473 INFO L? ?]: Removed 2434 outVars from TransFormulas that were not future-live. [2024-10-24 18:46:28,474 INFO L287 CfgBuilder]: Performing block encoding [2024-10-24 18:46:28,785 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-24 18:46:28,786 INFO L314 CfgBuilder]: Removed 168 assume(true) statements. [2024-10-24 18:46:28,786 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 06:46:28 BoogieIcfgContainer [2024-10-24 18:46:28,786 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-24 18:46:28,788 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-24 18:46:28,788 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-24 18:46:28,792 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-24 18:46:28,793 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.10 06:46:18" (1/3) ... [2024-10-24 18:46:28,793 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@148c4a5f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 06:46:28, skipping insertion in model container [2024-10-24 18:46:28,794 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 06:46:20" (2/3) ... [2024-10-24 18:46:28,795 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@148c4a5f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 06:46:28, skipping insertion in model container [2024-10-24 18:46:28,795 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 06:46:28" (3/3) ... [2024-10-24 18:46:28,796 INFO L112 eAbstractionObserver]: Analyzing ICFG uthash_SFH_test10-3.i [2024-10-24 18:46:28,814 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-24 18:46:28,815 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1189 error locations. [2024-10-24 18:46:28,904 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-24 18:46:28,911 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;@3e7ebb90, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-24 18:46:28,911 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1189 error locations. [2024-10-24 18:46:28,920 INFO L276 IsEmpty]: Start isEmpty. Operand has 2225 states, 1024 states have (on average 2.47265625) internal successors, (2532), 2211 states have internal predecessors, (2532), 14 states have call successors, (14), 3 states have call predecessors, (14), 3 states have return successors, (14), 11 states have call predecessors, (14), 14 states have call successors, (14) [2024-10-24 18:46:28,925 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 3 [2024-10-24 18:46:28,926 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 18:46:28,926 INFO L215 NwaCegarLoop]: trace histogram [1, 1] [2024-10-24 18:46:28,927 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 1186 more)] === [2024-10-24 18:46:28,931 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 18:46:28,931 INFO L85 PathProgramCache]: Analyzing trace with hash 128244, now seen corresponding path program 1 times [2024-10-24 18:46:28,942 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 18:46:28,942 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1907252315] [2024-10-24 18:46:28,943 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 18:46:28,943 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:46:28,944 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 18:46:28,947 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:46:28,963 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2024-10-24 18:46:29,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 18:46:29,194 INFO L255 TraceCheckSpWp]: Trace formula consists of 26 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-24 18:46:29,204 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 18:46:29,245 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:46:29,261 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 18:46:29,261 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-24 18:46:29,262 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-24 18:46:29,262 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1907252315] [2024-10-24 18:46:29,263 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1907252315] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 18:46:29,263 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 18:46:29,264 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-10-24 18:46:29,266 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [643957480] [2024-10-24 18:46:29,266 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 18:46:29,307 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-24 18:46:29,308 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-24 18:46:29,369 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-24 18:46:29,376 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-24 18:46:29,382 INFO L87 Difference]: Start difference. First operand has 2225 states, 1024 states have (on average 2.47265625) internal successors, (2532), 2211 states have internal predecessors, (2532), 14 states have call successors, (14), 3 states have call predecessors, (14), 3 states have return successors, (14), 11 states have call predecessors, (14), 14 states have call successors, (14) 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:46:33,206 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 18:46:33,207 INFO L93 Difference]: Finished difference Result 2980 states and 3180 transitions. [2024-10-24 18:46:33,209 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-24 18:46:33,210 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:46:33,211 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 18:46:33,244 INFO L225 Difference]: With dead ends: 2980 [2024-10-24 18:46:33,244 INFO L226 Difference]: Without dead ends: 2979 [2024-10-24 18:46:33,246 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:46:33,250 INFO L432 NwaCegarLoop]: 1397 mSDtfsCounter, 2109 mSDsluCounter, 471 mSDsCounter, 0 mSdLazyCounter, 1696 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2119 SdHoareTripleChecker+Valid, 1868 SdHoareTripleChecker+Invalid, 1721 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 1696 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.7s IncrementalHoareTripleChecker+Time [2024-10-24 18:46:33,253 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2119 Valid, 1868 Invalid, 1721 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 1696 Invalid, 0 Unknown, 0 Unchecked, 3.7s Time] [2024-10-24 18:46:33,279 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2979 states. [2024-10-24 18:46:33,381 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2979 to 2334. [2024-10-24 18:46:33,386 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2334 states, 1161 states have (on average 2.2764857881136953) internal successors, (2643), 2318 states have internal predecessors, (2643), 16 states have call successors, (16), 3 states have call predecessors, (16), 3 states have return successors, (16), 13 states have call predecessors, (16), 16 states have call successors, (16) [2024-10-24 18:46:33,394 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2334 states to 2334 states and 2675 transitions. [2024-10-24 18:46:33,396 INFO L78 Accepts]: Start accepts. Automaton has 2334 states and 2675 transitions. Word has length 2 [2024-10-24 18:46:33,396 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 18:46:33,396 INFO L471 AbstractCegarLoop]: Abstraction has 2334 states and 2675 transitions. [2024-10-24 18:46:33,397 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:46:33,397 INFO L276 IsEmpty]: Start isEmpty. Operand 2334 states and 2675 transitions. [2024-10-24 18:46:33,397 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 3 [2024-10-24 18:46:33,398 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 18:46:33,398 INFO L215 NwaCegarLoop]: trace histogram [1, 1] [2024-10-24 18:46:33,403 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 (2)] Forceful destruction successful, exit code 0 [2024-10-24 18:46:33,599 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:46:33,600 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 1186 more)] === [2024-10-24 18:46:33,600 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 18:46:33,600 INFO L85 PathProgramCache]: Analyzing trace with hash 128245, now seen corresponding path program 1 times [2024-10-24 18:46:33,601 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 18:46:33,601 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1744289816] [2024-10-24 18:46:33,601 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 18:46:33,601 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:46:33,601 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 18:46:33,605 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:46:33,606 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:46:33,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 18:46:33,788 INFO L255 TraceCheckSpWp]: Trace formula consists of 26 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-10-24 18:46:33,791 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 18:46:33,803 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:46:33,814 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:46:33,814 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-24 18:46:33,814 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-24 18:46:33,815 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1744289816] [2024-10-24 18:46:33,815 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1744289816] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 18:46:33,815 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 18:46:33,815 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-10-24 18:46:33,815 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [891926568] [2024-10-24 18:46:33,816 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 18:46:33,817 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-24 18:46:33,817 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-24 18:46:33,817 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-24 18:46:33,818 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-24 18:46:33,818 INFO L87 Difference]: Start difference. First operand 2334 states and 2675 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:46:38,439 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 18:46:38,439 INFO L93 Difference]: Finished difference Result 3059 states and 3480 transitions. [2024-10-24 18:46:38,442 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-24 18:46:38,442 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:46:38,442 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 18:46:38,453 INFO L225 Difference]: With dead ends: 3059 [2024-10-24 18:46:38,453 INFO L226 Difference]: Without dead ends: 3059 [2024-10-24 18:46:38,453 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:46:38,455 INFO L432 NwaCegarLoop]: 1841 mSDtfsCounter, 799 mSDsluCounter, 1175 mSDsCounter, 0 mSdLazyCounter, 1672 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 802 SdHoareTripleChecker+Valid, 3016 SdHoareTripleChecker+Invalid, 1683 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 1672 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.5s IncrementalHoareTripleChecker+Time [2024-10-24 18:46:38,456 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [802 Valid, 3016 Invalid, 1683 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 1672 Invalid, 0 Unknown, 0 Unchecked, 4.5s Time] [2024-10-24 18:46:38,463 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3059 states. [2024-10-24 18:46:38,502 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3059 to 2731. [2024-10-24 18:46:38,507 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2731 states, 1556 states have (on average 2.2120822622107967) internal successors, (3442), 2712 states have internal predecessors, (3442), 19 states have call successors, (19), 3 states have call predecessors, (19), 3 states have return successors, (19), 16 states have call predecessors, (19), 19 states have call successors, (19) [2024-10-24 18:46:38,517 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2731 states to 2731 states and 3480 transitions. [2024-10-24 18:46:38,517 INFO L78 Accepts]: Start accepts. Automaton has 2731 states and 3480 transitions. Word has length 2 [2024-10-24 18:46:38,517 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 18:46:38,517 INFO L471 AbstractCegarLoop]: Abstraction has 2731 states and 3480 transitions. [2024-10-24 18:46:38,518 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:46:38,518 INFO L276 IsEmpty]: Start isEmpty. Operand 2731 states and 3480 transitions. [2024-10-24 18:46:38,518 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2024-10-24 18:46:38,519 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 18:46:38,519 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2024-10-24 18:46:38,524 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:46:38,719 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:46:38,720 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 1186 more)] === [2024-10-24 18:46:38,721 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 18:46:38,721 INFO L85 PathProgramCache]: Analyzing trace with hash -1822003394, now seen corresponding path program 1 times [2024-10-24 18:46:38,721 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 18:46:38,721 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2116211871] [2024-10-24 18:46:38,722 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 18:46:38,722 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:46:38,722 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 18:46:38,725 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:46:38,729 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:46:38,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 18:46:38,920 INFO L255 TraceCheckSpWp]: Trace formula consists of 63 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-10-24 18:46:38,924 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 18:46:38,936 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:46:38,942 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:46:39,005 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-24 18:46:39,007 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:46:39,026 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2024-10-24 18:46:39,026 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:46:39,048 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:46:39,048 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-24 18:46:39,049 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-24 18:46:39,049 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2116211871] [2024-10-24 18:46:39,049 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2116211871] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 18:46:39,050 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 18:46:39,050 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-24 18:46:39,050 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1327478288] [2024-10-24 18:46:39,050 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 18:46:39,050 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-24 18:46:39,051 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-24 18:46:39,052 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-24 18:46:39,052 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-24 18:46:39,052 INFO L87 Difference]: Start difference. First operand 2731 states and 3480 transitions. Second operand has 4 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 18:46:46,074 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 18:46:46,074 INFO L93 Difference]: Finished difference Result 4773 states and 5672 transitions. [2024-10-24 18:46:46,075 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-24 18:46:46,075 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2024-10-24 18:46:46,075 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 18:46:46,089 INFO L225 Difference]: With dead ends: 4773 [2024-10-24 18:46:46,090 INFO L226 Difference]: Without dead ends: 4773 [2024-10-24 18:46:46,090 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 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:46:46,091 INFO L432 NwaCegarLoop]: 918 mSDtfsCounter, 2161 mSDsluCounter, 1760 mSDsCounter, 0 mSdLazyCounter, 4353 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2170 SdHoareTripleChecker+Valid, 2678 SdHoareTripleChecker+Invalid, 4378 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 4353 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.9s IncrementalHoareTripleChecker+Time [2024-10-24 18:46:46,091 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2170 Valid, 2678 Invalid, 4378 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 4353 Invalid, 0 Unknown, 0 Unchecked, 6.9s Time] [2024-10-24 18:46:46,097 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4773 states. [2024-10-24 18:46:46,154 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4773 to 3305. [2024-10-24 18:46:46,159 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3305 states, 2130 states have (on average 2.2544600938967134) internal successors, (4802), 3280 states have internal predecessors, (4802), 25 states have call successors, (25), 3 states have call predecessors, (25), 3 states have return successors, (25), 22 states have call predecessors, (25), 25 states have call successors, (25) [2024-10-24 18:46:46,170 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3305 states to 3305 states and 4852 transitions. [2024-10-24 18:46:46,171 INFO L78 Accepts]: Start accepts. Automaton has 3305 states and 4852 transitions. Word has length 6 [2024-10-24 18:46:46,171 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 18:46:46,173 INFO L471 AbstractCegarLoop]: Abstraction has 3305 states and 4852 transitions. [2024-10-24 18:46:46,173 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 18:46:46,173 INFO L276 IsEmpty]: Start isEmpty. Operand 3305 states and 4852 transitions. [2024-10-24 18:46:46,175 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2024-10-24 18:46:46,175 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 18:46:46,175 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2024-10-24 18:46:46,181 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:46:46,376 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:46:46,377 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 1186 more)] === [2024-10-24 18:46:46,377 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 18:46:46,377 INFO L85 PathProgramCache]: Analyzing trace with hash -647530346, now seen corresponding path program 1 times [2024-10-24 18:46:46,378 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 18:46:46,378 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1690709834] [2024-10-24 18:46:46,378 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 18:46:46,378 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:46:46,378 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 18:46:46,381 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:46:46,382 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:46:46,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 18:46:46,557 INFO L255 TraceCheckSpWp]: Trace formula consists of 68 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-24 18:46:46,560 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 18:46:46,566 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:46:46,578 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:46:46,579 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-24 18:46:46,579 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-24 18:46:46,579 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1690709834] [2024-10-24 18:46:46,579 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1690709834] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 18:46:46,579 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 18:46:46,579 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-24 18:46:46,579 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1314926020] [2024-10-24 18:46:46,580 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 18:46:46,580 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-24 18:46:46,580 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-24 18:46:46,580 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-24 18:46:46,580 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-24 18:46:46,581 INFO L87 Difference]: Start difference. First operand 3305 states and 4852 transitions. Second operand has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 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:46:49,116 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 18:46:49,117 INFO L93 Difference]: Finished difference Result 3941 states and 5446 transitions. [2024-10-24 18:46:49,117 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-24 18:46:49,117 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 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 7 [2024-10-24 18:46:49,117 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 18:46:49,129 INFO L225 Difference]: With dead ends: 3941 [2024-10-24 18:46:49,129 INFO L226 Difference]: Without dead ends: 3941 [2024-10-24 18:46:49,129 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 5 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:46:49,130 INFO L432 NwaCegarLoop]: 1997 mSDtfsCounter, 1726 mSDsluCounter, 655 mSDsCounter, 0 mSdLazyCounter, 1724 mSolverCounterSat, 99 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1736 SdHoareTripleChecker+Valid, 2652 SdHoareTripleChecker+Invalid, 1823 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 99 IncrementalHoareTripleChecker+Valid, 1724 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.5s IncrementalHoareTripleChecker+Time [2024-10-24 18:46:49,131 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1736 Valid, 2652 Invalid, 1823 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [99 Valid, 1724 Invalid, 0 Unknown, 0 Unchecked, 2.5s Time] [2024-10-24 18:46:49,136 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3941 states. [2024-10-24 18:46:49,183 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3941 to 3213. [2024-10-24 18:46:49,189 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3213 states, 2130 states have (on average 2.1535211267605634) internal successors, (4587), 3188 states have internal predecessors, (4587), 25 states have call successors, (25), 3 states have call predecessors, (25), 3 states have return successors, (25), 22 states have call predecessors, (25), 25 states have call successors, (25) [2024-10-24 18:46:49,197 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3213 states to 3213 states and 4637 transitions. [2024-10-24 18:46:49,198 INFO L78 Accepts]: Start accepts. Automaton has 3213 states and 4637 transitions. Word has length 7 [2024-10-24 18:46:49,198 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 18:46:49,198 INFO L471 AbstractCegarLoop]: Abstraction has 3213 states and 4637 transitions. [2024-10-24 18:46:49,198 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 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:46:49,199 INFO L276 IsEmpty]: Start isEmpty. Operand 3213 states and 4637 transitions. [2024-10-24 18:46:49,200 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2024-10-24 18:46:49,202 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 18:46:49,202 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2024-10-24 18:46:49,208 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Ended with exit code 0 [2024-10-24 18:46:49,403 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:46:49,403 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 1186 more)] === [2024-10-24 18:46:49,404 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 18:46:49,404 INFO L85 PathProgramCache]: Analyzing trace with hash -647530345, now seen corresponding path program 1 times [2024-10-24 18:46:49,404 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 18:46:49,404 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1662134030] [2024-10-24 18:46:49,404 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 18:46:49,405 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:46:49,405 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 18:46:49,408 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:46:49,409 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:46:49,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 18:46:49,568 INFO L255 TraceCheckSpWp]: Trace formula consists of 68 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-10-24 18:46:49,570 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 18:46:49,577 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:46:49,604 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:46:49,605 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-24 18:46:49,605 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-24 18:46:49,605 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1662134030] [2024-10-24 18:46:49,605 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1662134030] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 18:46:49,605 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 18:46:49,606 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-24 18:46:49,606 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [616831140] [2024-10-24 18:46:49,606 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 18:46:49,606 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-24 18:46:49,606 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-24 18:46:49,607 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-24 18:46:49,607 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-24 18:46:49,607 INFO L87 Difference]: Start difference. First operand 3213 states and 4637 transitions. Second operand has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 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:46:53,278 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 18:46:53,278 INFO L93 Difference]: Finished difference Result 4782 states and 6861 transitions. [2024-10-24 18:46:53,278 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-24 18:46:53,278 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 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 7 [2024-10-24 18:46:53,278 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 18:46:53,291 INFO L225 Difference]: With dead ends: 4782 [2024-10-24 18:46:53,291 INFO L226 Difference]: Without dead ends: 4782 [2024-10-24 18:46:53,291 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 5 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:46:53,292 INFO L432 NwaCegarLoop]: 2293 mSDtfsCounter, 1285 mSDsluCounter, 996 mSDsCounter, 0 mSdLazyCounter, 1848 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1289 SdHoareTripleChecker+Valid, 3289 SdHoareTripleChecker+Invalid, 1873 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 1848 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.6s IncrementalHoareTripleChecker+Time [2024-10-24 18:46:53,292 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1289 Valid, 3289 Invalid, 1873 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 1848 Invalid, 0 Unknown, 0 Unchecked, 3.6s Time] [2024-10-24 18:46:53,296 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4782 states. [2024-10-24 18:46:53,364 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4782 to 3481. [2024-10-24 18:46:53,368 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3481 states, 2408 states have (on average 2.1391196013289036) internal successors, (5151), 3456 states have internal predecessors, (5151), 25 states have call successors, (25), 3 states have call predecessors, (25), 3 states have return successors, (25), 22 states have call predecessors, (25), 25 states have call successors, (25) [2024-10-24 18:46:53,375 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3481 states to 3481 states and 5201 transitions. [2024-10-24 18:46:53,375 INFO L78 Accepts]: Start accepts. Automaton has 3481 states and 5201 transitions. Word has length 7 [2024-10-24 18:46:53,376 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 18:46:53,376 INFO L471 AbstractCegarLoop]: Abstraction has 3481 states and 5201 transitions. [2024-10-24 18:46:53,376 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 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:46:53,376 INFO L276 IsEmpty]: Start isEmpty. Operand 3481 states and 5201 transitions. [2024-10-24 18:46:53,377 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2024-10-24 18:46:53,377 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 18:46:53,377 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 18:46:53,383 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Forceful destruction successful, exit code 0 [2024-10-24 18:46:53,577 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:46:53,578 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr638REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 1186 more)] === [2024-10-24 18:46:53,578 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 18:46:53,579 INFO L85 PathProgramCache]: Analyzing trace with hash 1113558595, now seen corresponding path program 1 times [2024-10-24 18:46:53,579 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 18:46:53,579 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [319828] [2024-10-24 18:46:53,579 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 18:46:53,579 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:46:53,579 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 18:46:53,582 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:46:53,583 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:46:53,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 18:46:53,752 INFO L255 TraceCheckSpWp]: Trace formula consists of 85 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-24 18:46:53,754 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 18:46:53,764 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:46:53,764 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-24 18:46:53,764 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-24 18:46:53,764 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [319828] [2024-10-24 18:46:53,764 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [319828] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 18:46:53,764 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 18:46:53,765 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-24 18:46:53,765 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [191580891] [2024-10-24 18:46:53,765 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 18:46:53,765 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-24 18:46:53,765 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-24 18:46:53,765 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-24 18:46:53,766 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-24 18:46:53,766 INFO L87 Difference]: Start difference. First operand 3481 states and 5201 transitions. Second operand has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 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:46:54,688 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 18:46:54,688 INFO L93 Difference]: Finished difference Result 3427 states and 5121 transitions. [2024-10-24 18:46:54,690 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-24 18:46:54,690 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 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 10 [2024-10-24 18:46:54,690 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 18:46:54,705 INFO L225 Difference]: With dead ends: 3427 [2024-10-24 18:46:54,705 INFO L226 Difference]: Without dead ends: 3427 [2024-10-24 18:46:54,705 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 8 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:46:54,706 INFO L432 NwaCegarLoop]: 1963 mSDtfsCounter, 61 mSDsluCounter, 1921 mSDsCounter, 0 mSdLazyCounter, 460 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 61 SdHoareTripleChecker+Valid, 3884 SdHoareTripleChecker+Invalid, 460 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 460 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-10-24 18:46:54,706 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [61 Valid, 3884 Invalid, 460 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 460 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-10-24 18:46:54,710 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3427 states. [2024-10-24 18:46:54,763 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3427 to 3427. [2024-10-24 18:46:54,768 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3427 states, 2378 states have (on average 2.1324642556770397) internal successors, (5071), 3402 states have internal predecessors, (5071), 25 states have call successors, (25), 3 states have call predecessors, (25), 3 states have return successors, (25), 22 states have call predecessors, (25), 25 states have call successors, (25) [2024-10-24 18:46:54,775 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3427 states to 3427 states and 5121 transitions. [2024-10-24 18:46:54,776 INFO L78 Accepts]: Start accepts. Automaton has 3427 states and 5121 transitions. Word has length 10 [2024-10-24 18:46:54,776 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 18:46:54,776 INFO L471 AbstractCegarLoop]: Abstraction has 3427 states and 5121 transitions. [2024-10-24 18:46:54,776 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 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:46:54,776 INFO L276 IsEmpty]: Start isEmpty. Operand 3427 states and 5121 transitions. [2024-10-24 18:46:54,777 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2024-10-24 18:46:54,777 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 18:46:54,777 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 18:46:54,782 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:46:54,981 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:46:54,981 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr662REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 1186 more)] === [2024-10-24 18:46:54,981 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 18:46:54,981 INFO L85 PathProgramCache]: Analyzing trace with hash 683006685, now seen corresponding path program 1 times [2024-10-24 18:46:54,982 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 18:46:54,982 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [503148230] [2024-10-24 18:46:54,982 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 18:46:54,982 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-24 18:46:54,982 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 18:46:54,986 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:46:54,987 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:46:55,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 18:46:55,158 INFO L255 TraceCheckSpWp]: Trace formula consists of 88 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-24 18:46:55,160 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 18:46:55,175 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:46:55,175 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-24 18:46:55,175 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-24 18:46:55,175 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [503148230] [2024-10-24 18:46:55,175 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [503148230] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 18:46:55,175 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 18:46:55,176 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-24 18:46:55,176 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [789353527] [2024-10-24 18:46:55,176 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 18:46:55,176 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-24 18:46:55,176 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-24 18:46:55,177 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-24 18:46:55,177 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-24 18:46:55,177 INFO L87 Difference]: Start difference. First operand 3427 states and 5121 transitions. Second operand has 4 states, 4 states have (on average 3.0) internal successors, (12), 4 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:46:56,377 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 18:46:56,377 INFO L93 Difference]: Finished difference Result 3411 states and 5077 transitions. [2024-10-24 18:46:56,378 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-24 18:46:56,378 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.0) internal successors, (12), 4 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 12 [2024-10-24 18:46:56,378 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 18:46:56,386 INFO L225 Difference]: With dead ends: 3411 [2024-10-24 18:46:56,386 INFO L226 Difference]: Without dead ends: 3411 [2024-10-24 18:46:56,386 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-24 18:46:56,387 INFO L432 NwaCegarLoop]: 1932 mSDtfsCounter, 45 mSDsluCounter, 3846 mSDsCounter, 0 mSdLazyCounter, 696 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 45 SdHoareTripleChecker+Valid, 5778 SdHoareTripleChecker+Invalid, 717 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 696 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2024-10-24 18:46:56,387 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [45 Valid, 5778 Invalid, 717 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 696 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2024-10-24 18:46:56,391 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3411 states. [2024-10-24 18:46:56,432 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3411 to 3411. [2024-10-24 18:46:56,436 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3411 states, 2376 states have (on average 2.115740740740741) internal successors, (5027), 3386 states have internal predecessors, (5027), 25 states have call successors, (25), 3 states have call predecessors, (25), 3 states have return successors, (25), 22 states have call predecessors, (25), 25 states have call successors, (25) [2024-10-24 18:46:56,442 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3411 states to 3411 states and 5077 transitions. [2024-10-24 18:46:56,442 INFO L78 Accepts]: Start accepts. Automaton has 3411 states and 5077 transitions. Word has length 12 [2024-10-24 18:46:56,442 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 18:46:56,442 INFO L471 AbstractCegarLoop]: Abstraction has 3411 states and 5077 transitions. [2024-10-24 18:46:56,442 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.0) internal successors, (12), 4 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:46:56,443 INFO L276 IsEmpty]: Start isEmpty. Operand 3411 states and 5077 transitions. [2024-10-24 18:46:56,443 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2024-10-24 18:46:56,444 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 18:46:56,444 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 18:46:56,449 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Forceful destruction successful, exit code 0 [2024-10-24 18:46:56,644 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:46:56,645 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr324REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 1186 more)] === [2024-10-24 18:46:56,645 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 18:46:56,645 INFO L85 PathProgramCache]: Analyzing trace with hash 976598510, now seen corresponding path program 1 times [2024-10-24 18:46:56,646 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 18:46:56,646 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [843844746] [2024-10-24 18:46:56,646 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 18:46:56,647 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:46:56,647 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 18:46:56,650 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:46:56,651 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:46:56,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 18:46:56,886 INFO L255 TraceCheckSpWp]: Trace formula consists of 137 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-24 18:46:56,888 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 18:46:56,896 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:46:56,897 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-24 18:46:56,897 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-24 18:46:56,897 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [843844746] [2024-10-24 18:46:56,897 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [843844746] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 18:46:56,897 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 18:46:56,897 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-24 18:46:56,898 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1965111395] [2024-10-24 18:46:56,898 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 18:46:56,898 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-24 18:46:56,898 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-24 18:46:56,899 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-24 18:46:56,899 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-24 18:46:56,899 INFO L87 Difference]: Start difference. First operand 3411 states and 5077 transitions. Second operand has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 states have internal predecessors, (17), 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:46:57,793 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 18:46:57,794 INFO L93 Difference]: Finished difference Result 3297 states and 4837 transitions. [2024-10-24 18:46:57,795 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-24 18:46:57,795 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 states have internal predecessors, (17), 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 17 [2024-10-24 18:46:57,795 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 18:46:57,801 INFO L225 Difference]: With dead ends: 3297 [2024-10-24 18:46:57,802 INFO L226 Difference]: Without dead ends: 3297 [2024-10-24 18:46:57,802 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 15 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:46:57,802 INFO L432 NwaCegarLoop]: 1905 mSDtfsCounter, 61 mSDsluCounter, 1863 mSDsCounter, 0 mSdLazyCounter, 440 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 61 SdHoareTripleChecker+Valid, 3768 SdHoareTripleChecker+Invalid, 440 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 440 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-10-24 18:46:57,803 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [61 Valid, 3768 Invalid, 440 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 440 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-10-24 18:46:57,806 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3297 states. [2024-10-24 18:46:57,842 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3297 to 3297. [2024-10-24 18:46:57,850 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3297 states, 2286 states have (on average 2.094050743657043) internal successors, (4787), 3272 states have internal predecessors, (4787), 25 states have call successors, (25), 3 states have call predecessors, (25), 3 states have return successors, (25), 22 states have call predecessors, (25), 25 states have call successors, (25) [2024-10-24 18:46:57,859 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3297 states to 3297 states and 4837 transitions. [2024-10-24 18:46:57,860 INFO L78 Accepts]: Start accepts. Automaton has 3297 states and 4837 transitions. Word has length 17 [2024-10-24 18:46:57,860 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 18:46:57,860 INFO L471 AbstractCegarLoop]: Abstraction has 3297 states and 4837 transitions. [2024-10-24 18:46:57,861 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 states have internal predecessors, (17), 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:46:57,861 INFO L276 IsEmpty]: Start isEmpty. Operand 3297 states and 4837 transitions. [2024-10-24 18:46:57,862 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2024-10-24 18:46:57,862 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 18:46:57,862 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 18:46:57,868 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:46:58,062 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:46:58,063 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr16REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 1186 more)] === [2024-10-24 18:46:58,064 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 18:46:58,064 INFO L85 PathProgramCache]: Analyzing trace with hash 1245463214, now seen corresponding path program 1 times [2024-10-24 18:46:58,064 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 18:46:58,065 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1904514765] [2024-10-24 18:46:58,065 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 18:46:58,065 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:46:58,065 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 18:46:58,068 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:46:58,070 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:46:58,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 18:46:58,288 INFO L255 TraceCheckSpWp]: Trace formula consists of 137 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-24 18:46:58,290 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 18:46:58,296 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:46:58,296 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-24 18:46:58,296 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-24 18:46:58,296 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1904514765] [2024-10-24 18:46:58,297 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1904514765] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 18:46:58,297 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 18:46:58,297 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-24 18:46:58,297 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1020851276] [2024-10-24 18:46:58,297 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 18:46:58,297 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-24 18:46:58,297 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-24 18:46:58,298 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-24 18:46:58,298 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-24 18:46:58,298 INFO L87 Difference]: Start difference. First operand 3297 states and 4837 transitions. Second operand has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 states have internal predecessors, (17), 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:46:59,123 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 18:46:59,123 INFO L93 Difference]: Finished difference Result 3243 states and 4757 transitions. [2024-10-24 18:46:59,125 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-24 18:46:59,125 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 states have internal predecessors, (17), 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 17 [2024-10-24 18:46:59,125 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 18:46:59,130 INFO L225 Difference]: With dead ends: 3243 [2024-10-24 18:46:59,131 INFO L226 Difference]: Without dead ends: 3243 [2024-10-24 18:46:59,131 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 15 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:46:59,132 INFO L432 NwaCegarLoop]: 1868 mSDtfsCounter, 61 mSDsluCounter, 1826 mSDsCounter, 0 mSdLazyCounter, 434 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 61 SdHoareTripleChecker+Valid, 3694 SdHoareTripleChecker+Invalid, 434 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 434 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-10-24 18:46:59,132 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [61 Valid, 3694 Invalid, 434 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 434 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-10-24 18:46:59,135 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3243 states. [2024-10-24 18:46:59,163 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3243 to 3243. [2024-10-24 18:46:59,167 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3243 states, 2256 states have (on average 2.086436170212766) internal successors, (4707), 3218 states have internal predecessors, (4707), 25 states have call successors, (25), 3 states have call predecessors, (25), 3 states have return successors, (25), 22 states have call predecessors, (25), 25 states have call successors, (25) [2024-10-24 18:46:59,172 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3243 states to 3243 states and 4757 transitions. [2024-10-24 18:46:59,173 INFO L78 Accepts]: Start accepts. Automaton has 3243 states and 4757 transitions. Word has length 17 [2024-10-24 18:46:59,173 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 18:46:59,173 INFO L471 AbstractCegarLoop]: Abstraction has 3243 states and 4757 transitions. [2024-10-24 18:46:59,173 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 states have internal predecessors, (17), 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:46:59,174 INFO L276 IsEmpty]: Start isEmpty. Operand 3243 states and 4757 transitions. [2024-10-24 18:46:59,174 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2024-10-24 18:46:59,174 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 18:46:59,174 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 18:46:59,181 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Ended with exit code 0 [2024-10-24 18:46:59,375 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:46:59,375 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr348REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 1186 more)] === [2024-10-24 18:46:59,375 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 18:46:59,375 INFO L85 PathProgramCache]: Analyzing trace with hash -2086644088, now seen corresponding path program 1 times [2024-10-24 18:46:59,376 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 18:46:59,376 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1865281143] [2024-10-24 18:46:59,376 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 18:46:59,376 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:46:59,376 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 18:46:59,379 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:46:59,381 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:46:59,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 18:46:59,590 INFO L255 TraceCheckSpWp]: Trace formula consists of 140 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-24 18:46:59,592 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 18:46:59,608 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:46:59,608 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-24 18:46:59,608 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-24 18:46:59,608 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1865281143] [2024-10-24 18:46:59,608 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1865281143] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 18:46:59,608 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 18:46:59,608 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-24 18:46:59,608 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1040536998] [2024-10-24 18:46:59,608 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 18:46:59,609 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-24 18:46:59,609 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-24 18:46:59,609 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-24 18:46:59,609 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-24 18:46:59,609 INFO L87 Difference]: Start difference. First operand 3243 states and 4757 transitions. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 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:47:00,720 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 18:47:00,720 INFO L93 Difference]: Finished difference Result 3223 states and 4625 transitions. [2024-10-24 18:47:00,721 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-24 18:47:00,722 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 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 19 [2024-10-24 18:47:00,722 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 18:47:00,726 INFO L225 Difference]: With dead ends: 3223 [2024-10-24 18:47:00,726 INFO L226 Difference]: Without dead ends: 3223 [2024-10-24 18:47:00,726 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-24 18:47:00,727 INFO L432 NwaCegarLoop]: 1837 mSDtfsCounter, 45 mSDsluCounter, 3656 mSDsCounter, 0 mSdLazyCounter, 657 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 45 SdHoareTripleChecker+Valid, 5493 SdHoareTripleChecker+Invalid, 678 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 657 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2024-10-24 18:47:00,727 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [45 Valid, 5493 Invalid, 678 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 657 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2024-10-24 18:47:00,732 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3223 states. [2024-10-24 18:47:00,756 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3223 to 3223. [2024-10-24 18:47:00,764 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3223 states, 2250 states have (on average 2.033333333333333) internal successors, (4575), 3198 states have internal predecessors, (4575), 25 states have call successors, (25), 3 states have call predecessors, (25), 3 states have return successors, (25), 22 states have call predecessors, (25), 25 states have call successors, (25) [2024-10-24 18:47:00,774 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3223 states to 3223 states and 4625 transitions. [2024-10-24 18:47:00,774 INFO L78 Accepts]: Start accepts. Automaton has 3223 states and 4625 transitions. Word has length 19 [2024-10-24 18:47:00,774 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 18:47:00,775 INFO L471 AbstractCegarLoop]: Abstraction has 3223 states and 4625 transitions. [2024-10-24 18:47:00,775 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 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:47:00,775 INFO L276 IsEmpty]: Start isEmpty. Operand 3223 states and 4625 transitions. [2024-10-24 18:47:00,775 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2024-10-24 18:47:00,776 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 18:47:00,776 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 18:47:00,783 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Forceful destruction successful, exit code 0 [2024-10-24 18:47:00,976 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:47:00,977 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr40REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 1186 more)] === [2024-10-24 18:47:00,977 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 18:47:00,978 INFO L85 PathProgramCache]: Analyzing trace with hash -1405728888, now seen corresponding path program 1 times [2024-10-24 18:47:00,978 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 18:47:00,978 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [206159921] [2024-10-24 18:47:00,978 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 18:47:00,979 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:47:00,979 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 18:47:00,982 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:47:00,983 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:47:01,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 18:47:01,204 INFO L255 TraceCheckSpWp]: Trace formula consists of 140 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-24 18:47:01,207 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 18:47:01,227 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:47:01,227 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-24 18:47:01,227 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-24 18:47:01,227 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [206159921] [2024-10-24 18:47:01,227 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [206159921] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 18:47:01,228 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 18:47:01,228 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-24 18:47:01,228 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1040492727] [2024-10-24 18:47:01,228 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 18:47:01,228 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-24 18:47:01,228 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-24 18:47:01,228 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-24 18:47:01,229 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-24 18:47:01,229 INFO L87 Difference]: Start difference. First operand 3223 states and 4625 transitions. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 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:47:02,313 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 18:47:02,313 INFO L93 Difference]: Finished difference Result 3207 states and 4581 transitions. [2024-10-24 18:47:02,314 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-24 18:47:02,314 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 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 19 [2024-10-24 18:47:02,315 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 18:47:02,321 INFO L225 Difference]: With dead ends: 3207 [2024-10-24 18:47:02,321 INFO L226 Difference]: Without dead ends: 3207 [2024-10-24 18:47:02,322 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-24 18:47:02,322 INFO L432 NwaCegarLoop]: 1816 mSDtfsCounter, 45 mSDsluCounter, 3614 mSDsCounter, 0 mSdLazyCounter, 636 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 45 SdHoareTripleChecker+Valid, 5430 SdHoareTripleChecker+Invalid, 657 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 636 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2024-10-24 18:47:02,323 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [45 Valid, 5430 Invalid, 657 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 636 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2024-10-24 18:47:02,329 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3207 states. [2024-10-24 18:47:02,361 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3207 to 3207. [2024-10-24 18:47:02,369 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3207 states, 2248 states have (on average 2.0155693950177938) internal successors, (4531), 3182 states have internal predecessors, (4531), 25 states have call successors, (25), 3 states have call predecessors, (25), 3 states have return successors, (25), 22 states have call predecessors, (25), 25 states have call successors, (25) [2024-10-24 18:47:02,379 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3207 states to 3207 states and 4581 transitions. [2024-10-24 18:47:02,380 INFO L78 Accepts]: Start accepts. Automaton has 3207 states and 4581 transitions. Word has length 19 [2024-10-24 18:47:02,380 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 18:47:02,380 INFO L471 AbstractCegarLoop]: Abstraction has 3207 states and 4581 transitions. [2024-10-24 18:47:02,381 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 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:47:02,381 INFO L276 IsEmpty]: Start isEmpty. Operand 3207 states and 4581 transitions. [2024-10-24 18:47:02,381 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2024-10-24 18:47:02,381 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 18:47:02,382 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 18:47:02,390 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:47:02,582 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:47:02,582 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr676REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 1186 more)] === [2024-10-24 18:47:02,583 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 18:47:02,583 INFO L85 PathProgramCache]: Analyzing trace with hash 305860875, now seen corresponding path program 1 times [2024-10-24 18:47:02,583 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 18:47:02,583 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [350147477] [2024-10-24 18:47:02,583 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 18:47:02,583 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:47:02,583 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 18:47:02,585 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-24 18:47:02,586 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (13)] Waiting until timeout for monitored process [2024-10-24 18:47:02,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 18:47:02,761 INFO L255 TraceCheckSpWp]: Trace formula consists of 102 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-10-24 18:47:02,763 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 18:47:02,770 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:47:02,846 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:47:02,846 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-24 18:47:02,846 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-24 18:47:02,846 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [350147477] [2024-10-24 18:47:02,846 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [350147477] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 18:47:02,847 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 18:47:02,847 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-24 18:47:02,847 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [394037564] [2024-10-24 18:47:02,847 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 18:47:02,847 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-24 18:47:02,847 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-24 18:47:02,847 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-24 18:47:02,848 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-24 18:47:02,848 INFO L87 Difference]: Start difference. First operand 3207 states and 4581 transitions. Second operand has 4 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 states have internal predecessors, (26), 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:47:06,069 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 18:47:06,070 INFO L93 Difference]: Finished difference Result 3781 states and 5070 transitions. [2024-10-24 18:47:06,070 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-24 18:47:06,070 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 states have internal predecessors, (26), 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 26 [2024-10-24 18:47:06,070 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 18:47:06,076 INFO L225 Difference]: With dead ends: 3781 [2024-10-24 18:47:06,077 INFO L226 Difference]: Without dead ends: 3781 [2024-10-24 18:47:06,077 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-24 18:47:06,078 INFO L432 NwaCegarLoop]: 1278 mSDtfsCounter, 1829 mSDsluCounter, 1532 mSDsCounter, 0 mSdLazyCounter, 2498 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1839 SdHoareTripleChecker+Valid, 2810 SdHoareTripleChecker+Invalid, 2509 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 2498 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.2s IncrementalHoareTripleChecker+Time [2024-10-24 18:47:06,078 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1839 Valid, 2810 Invalid, 2509 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 2498 Invalid, 0 Unknown, 0 Unchecked, 3.2s Time] [2024-10-24 18:47:06,081 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3781 states. [2024-10-24 18:47:06,106 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3781 to 3203. [2024-10-24 18:47:06,109 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3203 states, 2248 states have (on average 2.0120106761565837) internal successors, (4523), 3178 states have internal predecessors, (4523), 25 states have call successors, (25), 3 states have call predecessors, (25), 3 states have return successors, (25), 22 states have call predecessors, (25), 25 states have call successors, (25) [2024-10-24 18:47:06,115 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3203 states to 3203 states and 4573 transitions. [2024-10-24 18:47:06,115 INFO L78 Accepts]: Start accepts. Automaton has 3203 states and 4573 transitions. Word has length 26 [2024-10-24 18:47:06,117 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 18:47:06,117 INFO L471 AbstractCegarLoop]: Abstraction has 3203 states and 4573 transitions. [2024-10-24 18:47:06,117 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 states have internal predecessors, (26), 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:47:06,117 INFO L276 IsEmpty]: Start isEmpty. Operand 3203 states and 4573 transitions. [2024-10-24 18:47:06,118 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2024-10-24 18:47:06,118 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 18:47:06,118 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 18:47:06,125 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:47:06,319 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:47:06,319 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr677REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 1186 more)] === [2024-10-24 18:47:06,320 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 18:47:06,320 INFO L85 PathProgramCache]: Analyzing trace with hash 305860876, now seen corresponding path program 1 times [2024-10-24 18:47:06,320 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 18:47:06,320 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1613067552] [2024-10-24 18:47:06,321 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 18:47:06,321 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:47:06,321 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 18:47:06,324 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:47:06,325 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:47:06,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 18:47:06,531 INFO L255 TraceCheckSpWp]: Trace formula consists of 102 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-10-24 18:47:06,534 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 18:47:06,542 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:47:06,688 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:47:06,688 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-24 18:47:06,689 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-24 18:47:06,689 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1613067552] [2024-10-24 18:47:06,689 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1613067552] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 18:47:06,689 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 18:47:06,689 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-24 18:47:06,689 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [408261385] [2024-10-24 18:47:06,690 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 18:47:06,690 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-24 18:47:06,690 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-24 18:47:06,690 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-24 18:47:06,690 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-24 18:47:06,691 INFO L87 Difference]: Start difference. First operand 3203 states and 4573 transitions. Second operand has 4 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 states have internal predecessors, (26), 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:47:10,665 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 18:47:10,665 INFO L93 Difference]: Finished difference Result 3871 states and 5313 transitions. [2024-10-24 18:47:10,666 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-24 18:47:10,666 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 states have internal predecessors, (26), 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 26 [2024-10-24 18:47:10,666 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 18:47:10,671 INFO L225 Difference]: With dead ends: 3871 [2024-10-24 18:47:10,671 INFO L226 Difference]: Without dead ends: 3871 [2024-10-24 18:47:10,671 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-24 18:47:10,672 INFO L432 NwaCegarLoop]: 1593 mSDtfsCounter, 737 mSDsluCounter, 1976 mSDsCounter, 0 mSdLazyCounter, 2534 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 740 SdHoareTripleChecker+Valid, 3569 SdHoareTripleChecker+Invalid, 2537 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 2534 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.9s IncrementalHoareTripleChecker+Time [2024-10-24 18:47:10,672 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [740 Valid, 3569 Invalid, 2537 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 2534 Invalid, 0 Unknown, 0 Unchecked, 3.9s Time] [2024-10-24 18:47:10,675 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3871 states. [2024-10-24 18:47:10,705 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3871 to 3236. [2024-10-24 18:47:10,707 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3236 states, 2281 states have (on average 1.9995615957913195) internal successors, (4561), 3211 states have internal predecessors, (4561), 25 states have call successors, (25), 3 states have call predecessors, (25), 3 states have return successors, (25), 22 states have call predecessors, (25), 25 states have call successors, (25) [2024-10-24 18:47:10,712 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3236 states to 3236 states and 4611 transitions. [2024-10-24 18:47:10,712 INFO L78 Accepts]: Start accepts. Automaton has 3236 states and 4611 transitions. Word has length 26 [2024-10-24 18:47:10,712 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 18:47:10,713 INFO L471 AbstractCegarLoop]: Abstraction has 3236 states and 4611 transitions. [2024-10-24 18:47:10,713 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 states have internal predecessors, (26), 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:47:10,713 INFO L276 IsEmpty]: Start isEmpty. Operand 3236 states and 4611 transitions. [2024-10-24 18:47:10,714 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2024-10-24 18:47:10,714 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 18:47:10,714 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 18:47:10,719 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:47:10,914 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:47:10,915 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr362REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 1186 more)] === [2024-10-24 18:47:10,915 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 18:47:10,915 INFO L85 PathProgramCache]: Analyzing trace with hash -14165834, now seen corresponding path program 1 times [2024-10-24 18:47:10,915 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 18:47:10,916 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [980613095] [2024-10-24 18:47:10,916 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 18:47:10,916 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:47:10,916 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 18:47:10,919 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:47:10,921 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:47:11,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 18:47:11,146 INFO L255 TraceCheckSpWp]: Trace formula consists of 154 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-10-24 18:47:11,148 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 18:47:11,152 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:47:11,220 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:47:11,220 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-24 18:47:11,220 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-24 18:47:11,221 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [980613095] [2024-10-24 18:47:11,221 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [980613095] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 18:47:11,221 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 18:47:11,221 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-24 18:47:11,222 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1763771401] [2024-10-24 18:47:11,222 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 18:47:11,222 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-24 18:47:11,222 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-24 18:47:11,223 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-24 18:47:11,223 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-24 18:47:11,223 INFO L87 Difference]: Start difference. First operand 3236 states and 4611 transitions. Second operand has 4 states, 3 states have (on average 11.0) internal successors, (33), 4 states have internal predecessors, (33), 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:47:14,450 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 18:47:14,450 INFO L93 Difference]: Finished difference Result 3889 states and 5312 transitions. [2024-10-24 18:47:14,451 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-24 18:47:14,451 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 11.0) internal successors, (33), 4 states have internal predecessors, (33), 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 33 [2024-10-24 18:47:14,451 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 18:47:14,455 INFO L225 Difference]: With dead ends: 3889 [2024-10-24 18:47:14,455 INFO L226 Difference]: Without dead ends: 3889 [2024-10-24 18:47:14,456 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-24 18:47:14,456 INFO L432 NwaCegarLoop]: 1837 mSDtfsCounter, 1526 mSDsluCounter, 2006 mSDsCounter, 0 mSdLazyCounter, 2882 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1536 SdHoareTripleChecker+Valid, 3843 SdHoareTripleChecker+Invalid, 2893 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 2882 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.2s IncrementalHoareTripleChecker+Time [2024-10-24 18:47:14,456 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1536 Valid, 3843 Invalid, 2893 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 2882 Invalid, 0 Unknown, 0 Unchecked, 3.2s Time] [2024-10-24 18:47:14,459 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3889 states. [2024-10-24 18:47:14,486 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3889 to 3232. [2024-10-24 18:47:14,489 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3232 states, 2281 states have (on average 1.98903989478299) internal successors, (4537), 3207 states have internal predecessors, (4537), 25 states have call successors, (25), 3 states have call predecessors, (25), 3 states have return successors, (25), 22 states have call predecessors, (25), 25 states have call successors, (25) [2024-10-24 18:47:14,494 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3232 states to 3232 states and 4587 transitions. [2024-10-24 18:47:14,494 INFO L78 Accepts]: Start accepts. Automaton has 3232 states and 4587 transitions. Word has length 33 [2024-10-24 18:47:14,494 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 18:47:14,494 INFO L471 AbstractCegarLoop]: Abstraction has 3232 states and 4587 transitions. [2024-10-24 18:47:14,495 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 11.0) internal successors, (33), 4 states have internal predecessors, (33), 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:47:14,495 INFO L276 IsEmpty]: Start isEmpty. Operand 3232 states and 4587 transitions. [2024-10-24 18:47:14,495 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2024-10-24 18:47:14,495 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 18:47:14,496 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 18:47:14,502 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:47:14,696 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:47:14,696 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr363REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 1186 more)] === [2024-10-24 18:47:14,697 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 18:47:14,697 INFO L85 PathProgramCache]: Analyzing trace with hash -14165833, now seen corresponding path program 1 times [2024-10-24 18:47:14,697 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 18:47:14,697 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2124182387] [2024-10-24 18:47:14,697 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 18:47:14,697 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:47:14,697 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 18:47:14,698 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:47:14,699 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:47:14,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 18:47:14,900 INFO L255 TraceCheckSpWp]: Trace formula consists of 154 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-10-24 18:47:14,902 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 18:47:14,910 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:47:15,052 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:47:15,052 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-24 18:47:15,052 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-24 18:47:15,052 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2124182387] [2024-10-24 18:47:15,052 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2124182387] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 18:47:15,052 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 18:47:15,053 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-24 18:47:15,053 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2001898211] [2024-10-24 18:47:15,053 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 18:47:15,053 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-24 18:47:15,053 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-24 18:47:15,053 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-24 18:47:15,054 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-24 18:47:15,054 INFO L87 Difference]: Start difference. First operand 3232 states and 4587 transitions. Second operand has 4 states, 3 states have (on average 11.0) internal successors, (33), 4 states have internal predecessors, (33), 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:47:19,341 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 18:47:19,341 INFO L93 Difference]: Finished difference Result 4421 states and 6115 transitions. [2024-10-24 18:47:19,342 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-24 18:47:19,342 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 11.0) internal successors, (33), 4 states have internal predecessors, (33), 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 33 [2024-10-24 18:47:19,342 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 18:47:19,345 INFO L225 Difference]: With dead ends: 4421 [2024-10-24 18:47:19,345 INFO L226 Difference]: Without dead ends: 4421 [2024-10-24 18:47:19,346 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-24 18:47:19,346 INFO L432 NwaCegarLoop]: 2138 mSDtfsCounter, 1081 mSDsluCounter, 2349 mSDsCounter, 0 mSdLazyCounter, 3000 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1085 SdHoareTripleChecker+Valid, 4487 SdHoareTripleChecker+Invalid, 3003 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 3000 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.2s IncrementalHoareTripleChecker+Time [2024-10-24 18:47:19,346 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1085 Valid, 4487 Invalid, 3003 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 3000 Invalid, 0 Unknown, 0 Unchecked, 4.2s Time] [2024-10-24 18:47:19,349 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4421 states. [2024-10-24 18:47:19,367 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4421 to 3232. [2024-10-24 18:47:19,369 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3232 states, 2281 states have (on average 1.9855326611135466) internal successors, (4529), 3207 states have internal predecessors, (4529), 25 states have call successors, (25), 3 states have call predecessors, (25), 3 states have return successors, (25), 22 states have call predecessors, (25), 25 states have call successors, (25) [2024-10-24 18:47:19,373 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3232 states to 3232 states and 4579 transitions. [2024-10-24 18:47:19,373 INFO L78 Accepts]: Start accepts. Automaton has 3232 states and 4579 transitions. Word has length 33 [2024-10-24 18:47:19,373 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 18:47:19,373 INFO L471 AbstractCegarLoop]: Abstraction has 3232 states and 4579 transitions. [2024-10-24 18:47:19,373 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 11.0) internal successors, (33), 4 states have internal predecessors, (33), 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:47:19,374 INFO L276 IsEmpty]: Start isEmpty. Operand 3232 states and 4579 transitions. [2024-10-24 18:47:19,374 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2024-10-24 18:47:19,374 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 18:47:19,374 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 18:47:19,380 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (16)] Ended with exit code 0 [2024-10-24 18:47:19,575 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:47:19,575 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr54REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 1186 more)] === [2024-10-24 18:47:19,575 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 18:47:19,575 INFO L85 PathProgramCache]: Analyzing trace with hash 10995574, now seen corresponding path program 1 times [2024-10-24 18:47:19,576 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 18:47:19,576 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1478189914] [2024-10-24 18:47:19,576 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 18:47:19,576 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:47:19,576 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 18:47:19,577 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:47:19,578 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:47:19,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 18:47:19,785 INFO L255 TraceCheckSpWp]: Trace formula consists of 154 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-10-24 18:47:19,787 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 18:47:19,793 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:47:19,863 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:47:19,863 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-24 18:47:19,863 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-24 18:47:19,863 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1478189914] [2024-10-24 18:47:19,863 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1478189914] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 18:47:19,863 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 18:47:19,863 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-24 18:47:19,863 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [59106421] [2024-10-24 18:47:19,863 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 18:47:19,864 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-24 18:47:19,864 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-24 18:47:19,864 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-24 18:47:19,864 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-24 18:47:19,864 INFO L87 Difference]: Start difference. First operand 3232 states and 4579 transitions. Second operand has 4 states, 3 states have (on average 11.0) internal successors, (33), 4 states have internal predecessors, (33), 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:47:22,950 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 18:47:22,950 INFO L93 Difference]: Finished difference Result 3869 states and 5280 transitions. [2024-10-24 18:47:22,950 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-24 18:47:22,950 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 11.0) internal successors, (33), 4 states have internal predecessors, (33), 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 33 [2024-10-24 18:47:22,951 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 18:47:22,954 INFO L225 Difference]: With dead ends: 3869 [2024-10-24 18:47:22,954 INFO L226 Difference]: Without dead ends: 3869 [2024-10-24 18:47:22,954 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-24 18:47:22,955 INFO L432 NwaCegarLoop]: 1837 mSDtfsCounter, 1522 mSDsluCounter, 2006 mSDsCounter, 0 mSdLazyCounter, 2874 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1532 SdHoareTripleChecker+Valid, 3843 SdHoareTripleChecker+Invalid, 2885 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 2874 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.0s IncrementalHoareTripleChecker+Time [2024-10-24 18:47:22,955 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1532 Valid, 3843 Invalid, 2885 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 2874 Invalid, 0 Unknown, 0 Unchecked, 3.0s Time] [2024-10-24 18:47:22,957 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3869 states. [2024-10-24 18:47:22,976 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3869 to 3228. [2024-10-24 18:47:22,978 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3228 states, 2281 states have (on average 1.9820254274441034) internal successors, (4521), 3203 states have internal predecessors, (4521), 25 states have call successors, (25), 3 states have call predecessors, (25), 3 states have return successors, (25), 22 states have call predecessors, (25), 25 states have call successors, (25) [2024-10-24 18:47:22,983 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3228 states to 3228 states and 4571 transitions. [2024-10-24 18:47:22,984 INFO L78 Accepts]: Start accepts. Automaton has 3228 states and 4571 transitions. Word has length 33 [2024-10-24 18:47:22,985 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 18:47:22,985 INFO L471 AbstractCegarLoop]: Abstraction has 3228 states and 4571 transitions. [2024-10-24 18:47:22,985 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 11.0) internal successors, (33), 4 states have internal predecessors, (33), 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:47:22,985 INFO L276 IsEmpty]: Start isEmpty. Operand 3228 states and 4571 transitions. [2024-10-24 18:47:22,985 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2024-10-24 18:47:22,985 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 18:47:22,985 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 18:47:22,992 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:47:23,186 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:47:23,186 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr55REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 1186 more)] === [2024-10-24 18:47:23,187 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 18:47:23,187 INFO L85 PathProgramCache]: Analyzing trace with hash 10995575, now seen corresponding path program 1 times [2024-10-24 18:47:23,187 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 18:47:23,187 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [857454678] [2024-10-24 18:47:23,187 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 18:47:23,187 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:47:23,187 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 18:47:23,190 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:47:23,191 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:47:23,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 18:47:23,426 INFO L255 TraceCheckSpWp]: Trace formula consists of 154 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-10-24 18:47:23,428 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 18:47:23,437 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:47:23,599 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:47:23,599 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-24 18:47:23,600 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-24 18:47:23,600 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [857454678] [2024-10-24 18:47:23,600 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [857454678] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 18:47:23,600 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 18:47:23,600 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-24 18:47:23,600 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1148551418] [2024-10-24 18:47:23,600 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 18:47:23,600 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-24 18:47:23,600 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-24 18:47:23,601 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-24 18:47:23,601 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-24 18:47:23,601 INFO L87 Difference]: Start difference. First operand 3228 states and 4571 transitions. Second operand has 4 states, 3 states have (on average 11.0) internal successors, (33), 4 states have internal predecessors, (33), 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:47:28,255 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 18:47:28,255 INFO L93 Difference]: Finished difference Result 4413 states and 6099 transitions. [2024-10-24 18:47:28,256 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-24 18:47:28,256 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 11.0) internal successors, (33), 4 states have internal predecessors, (33), 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 33 [2024-10-24 18:47:28,256 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 18:47:28,260 INFO L225 Difference]: With dead ends: 4413 [2024-10-24 18:47:28,260 INFO L226 Difference]: Without dead ends: 4413 [2024-10-24 18:47:28,260 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-24 18:47:28,261 INFO L432 NwaCegarLoop]: 2134 mSDtfsCounter, 1073 mSDsluCounter, 2318 mSDsCounter, 0 mSdLazyCounter, 2988 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1077 SdHoareTripleChecker+Valid, 4452 SdHoareTripleChecker+Invalid, 2991 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 2988 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.6s IncrementalHoareTripleChecker+Time [2024-10-24 18:47:28,261 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1077 Valid, 4452 Invalid, 2991 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 2988 Invalid, 0 Unknown, 0 Unchecked, 4.6s Time] [2024-10-24 18:47:28,264 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4413 states. [2024-10-24 18:47:28,287 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4413 to 3224. [2024-10-24 18:47:28,289 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3224 states, 2281 states have (on average 1.9785181937746603) internal successors, (4513), 3199 states have internal predecessors, (4513), 25 states have call successors, (25), 3 states have call predecessors, (25), 3 states have return successors, (25), 22 states have call predecessors, (25), 25 states have call successors, (25) [2024-10-24 18:47:28,293 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3224 states to 3224 states and 4563 transitions. [2024-10-24 18:47:28,293 INFO L78 Accepts]: Start accepts. Automaton has 3224 states and 4563 transitions. Word has length 33 [2024-10-24 18:47:28,294 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 18:47:28,294 INFO L471 AbstractCegarLoop]: Abstraction has 3224 states and 4563 transitions. [2024-10-24 18:47:28,294 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 11.0) internal successors, (33), 4 states have internal predecessors, (33), 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:47:28,294 INFO L276 IsEmpty]: Start isEmpty. Operand 3224 states and 4563 transitions. [2024-10-24 18:47:28,294 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2024-10-24 18:47:28,295 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 18:47:28,295 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 18:47:28,300 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:47:28,498 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:47:28,498 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr684REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 1186 more)] === [2024-10-24 18:47:28,499 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 18:47:28,499 INFO L85 PathProgramCache]: Analyzing trace with hash -1287196731, now seen corresponding path program 1 times [2024-10-24 18:47:28,499 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 18:47:28,499 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1910142221] [2024-10-24 18:47:28,499 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 18:47:28,499 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:47:28,500 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 18:47:28,501 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:47:28,502 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (19)] Waiting until timeout for monitored process [2024-10-24 18:47:28,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 18:47:28,695 INFO L255 TraceCheckSpWp]: Trace formula consists of 119 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-24 18:47:28,696 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 18:47:28,733 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:47:28,734 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-24 18:47:28,734 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-24 18:47:28,734 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1910142221] [2024-10-24 18:47:28,734 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1910142221] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 18:47:28,734 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 18:47:28,734 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-24 18:47:28,734 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [920961190] [2024-10-24 18:47:28,734 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 18:47:28,735 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-24 18:47:28,735 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-24 18:47:28,735 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-24 18:47:28,735 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-24 18:47:28,735 INFO L87 Difference]: Start difference. First operand 3224 states and 4563 transitions. Second operand has 4 states, 4 states have (on average 10.0) internal successors, (40), 4 states have internal predecessors, (40), 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:47:29,939 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 18:47:29,939 INFO L93 Difference]: Finished difference Result 3212 states and 4539 transitions. [2024-10-24 18:47:29,940 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-24 18:47:29,940 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 10.0) internal successors, (40), 4 states have internal predecessors, (40), 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 40 [2024-10-24 18:47:29,940 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 18:47:29,944 INFO L225 Difference]: With dead ends: 3212 [2024-10-24 18:47:29,944 INFO L226 Difference]: Without dead ends: 3212 [2024-10-24 18:47:29,944 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-24 18:47:29,944 INFO L432 NwaCegarLoop]: 1802 mSDtfsCounter, 21 mSDsluCounter, 3581 mSDsCounter, 0 mSdLazyCounter, 633 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 5383 SdHoareTripleChecker+Invalid, 639 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 633 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2024-10-24 18:47:29,944 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 5383 Invalid, 639 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 633 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2024-10-24 18:47:29,947 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3212 states. [2024-10-24 18:47:29,970 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3212 to 3212. [2024-10-24 18:47:29,973 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3212 states, 2269 states have (on average 1.978404583516968) internal successors, (4489), 3187 states have internal predecessors, (4489), 25 states have call successors, (25), 3 states have call predecessors, (25), 3 states have return successors, (25), 22 states have call predecessors, (25), 25 states have call successors, (25) [2024-10-24 18:47:29,978 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3212 states to 3212 states and 4539 transitions. [2024-10-24 18:47:29,978 INFO L78 Accepts]: Start accepts. Automaton has 3212 states and 4539 transitions. Word has length 40 [2024-10-24 18:47:29,978 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 18:47:29,979 INFO L471 AbstractCegarLoop]: Abstraction has 3212 states and 4539 transitions. [2024-10-24 18:47:29,979 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.0) internal successors, (40), 4 states have internal predecessors, (40), 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:47:29,979 INFO L276 IsEmpty]: Start isEmpty. Operand 3212 states and 4539 transitions. [2024-10-24 18:47:29,979 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2024-10-24 18:47:29,979 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 18:47:29,980 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 18:47:29,986 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (19)] Ended with exit code 0 [2024-10-24 18:47:30,180 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-24 18:47:30,181 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr684REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 1186 more)] === [2024-10-24 18:47:30,181 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 18:47:30,181 INFO L85 PathProgramCache]: Analyzing trace with hash -1543497534, now seen corresponding path program 1 times [2024-10-24 18:47:30,182 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 18:47:30,182 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1892578058] [2024-10-24 18:47:30,182 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 18:47:30,182 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:47:30,182 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 18:47:30,185 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-24 18:47:30,187 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (20)] Waiting until timeout for monitored process [2024-10-24 18:47:30,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 18:47:30,432 INFO L255 TraceCheckSpWp]: Trace formula consists of 139 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-24 18:47:30,435 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 18:47:30,606 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:47:30,606 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-24 18:47:30,606 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-24 18:47:30,606 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1892578058] [2024-10-24 18:47:30,606 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1892578058] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 18:47:30,606 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 18:47:30,606 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-24 18:47:30,607 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1516577967] [2024-10-24 18:47:30,607 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 18:47:30,608 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-24 18:47:30,608 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-24 18:47:30,608 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-24 18:47:30,608 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-24 18:47:30,609 INFO L87 Difference]: Start difference. First operand 3212 states and 4539 transitions. Second operand has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 2 states have internal predecessors, (44), 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:47:31,981 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 18:47:31,982 INFO L93 Difference]: Finished difference Result 4838 states and 6580 transitions. [2024-10-24 18:47:31,982 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-24 18:47:31,982 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 2 states have internal predecessors, (44), 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 44 [2024-10-24 18:47:31,982 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 18:47:31,986 INFO L225 Difference]: With dead ends: 4838 [2024-10-24 18:47:31,986 INFO L226 Difference]: Without dead ends: 4838 [2024-10-24 18:47:31,986 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 42 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:47:31,987 INFO L432 NwaCegarLoop]: 1869 mSDtfsCounter, 1348 mSDsluCounter, 1719 mSDsCounter, 0 mSdLazyCounter, 549 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1355 SdHoareTripleChecker+Valid, 3588 SdHoareTripleChecker+Invalid, 556 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 549 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2024-10-24 18:47:31,987 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1355 Valid, 3588 Invalid, 556 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 549 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2024-10-24 18:47:31,990 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4838 states. [2024-10-24 18:47:32,014 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4838 to 4093. [2024-10-24 18:47:32,016 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4093 states, 3143 states have (on average 1.958001909004136) internal successors, (6154), 4058 states have internal predecessors, (6154), 35 states have call successors, (35), 3 states have call predecessors, (35), 3 states have return successors, (35), 32 states have call predecessors, (35), 35 states have call successors, (35) [2024-10-24 18:47:32,021 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4093 states to 4093 states and 6224 transitions. [2024-10-24 18:47:32,021 INFO L78 Accepts]: Start accepts. Automaton has 4093 states and 6224 transitions. Word has length 44 [2024-10-24 18:47:32,021 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 18:47:32,021 INFO L471 AbstractCegarLoop]: Abstraction has 4093 states and 6224 transitions. [2024-10-24 18:47:32,021 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 2 states have internal predecessors, (44), 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:47:32,021 INFO L276 IsEmpty]: Start isEmpty. Operand 4093 states and 6224 transitions. [2024-10-24 18:47:32,022 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2024-10-24 18:47:32,022 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 18:47:32,022 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 18:47:32,027 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (20)] Forceful destruction successful, exit code 0 [2024-10-24 18:47:32,222 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 20 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-24 18:47:32,223 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr427REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 1186 more)] === [2024-10-24 18:47:32,223 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 18:47:32,223 INFO L85 PathProgramCache]: Analyzing trace with hash 504267824, now seen corresponding path program 1 times [2024-10-24 18:47:32,223 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 18:47:32,223 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1174291773] [2024-10-24 18:47:32,224 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 18:47:32,224 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:47:32,224 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 18:47:32,227 INFO L229 MonitoredProcess]: Starting monitored process 21 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-24 18:47:32,228 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (21)] Waiting until timeout for monitored process [2024-10-24 18:47:32,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 18:47:32,486 INFO L255 TraceCheckSpWp]: Trace formula consists of 226 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-24 18:47:32,488 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 18:47:32,517 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:47:32,517 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-24 18:47:32,517 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-24 18:47:32,517 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1174291773] [2024-10-24 18:47:32,518 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1174291773] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 18:47:32,518 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 18:47:32,518 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-24 18:47:32,518 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [189439287] [2024-10-24 18:47:32,518 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 18:47:32,518 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-24 18:47:32,518 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-24 18:47:32,518 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-24 18:47:32,519 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-24 18:47:32,519 INFO L87 Difference]: Start difference. First operand 4093 states and 6224 transitions. Second operand has 4 states, 4 states have (on average 12.25) internal successors, (49), 4 states have internal predecessors, (49), 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:47:33,546 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 18:47:33,546 INFO L93 Difference]: Finished difference Result 4051 states and 6154 transitions. [2024-10-24 18:47:33,546 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-24 18:47:33,546 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.25) internal successors, (49), 4 states have internal predecessors, (49), 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 49 [2024-10-24 18:47:33,547 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 18:47:33,552 INFO L225 Difference]: With dead ends: 4051 [2024-10-24 18:47:33,552 INFO L226 Difference]: Without dead ends: 4051 [2024-10-24 18:47:33,552 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 46 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-24 18:47:33,553 INFO L432 NwaCegarLoop]: 1798 mSDtfsCounter, 21 mSDsluCounter, 3573 mSDsCounter, 0 mSdLazyCounter, 633 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 5371 SdHoareTripleChecker+Invalid, 639 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 633 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2024-10-24 18:47:33,554 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 5371 Invalid, 639 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 633 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2024-10-24 18:47:33,561 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4051 states. [2024-10-24 18:47:33,609 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4051 to 4051. [2024-10-24 18:47:33,611 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4051 states, 3101 states have (on average 1.9619477587874878) internal successors, (6084), 4016 states have internal predecessors, (6084), 35 states have call successors, (35), 3 states have call predecessors, (35), 3 states have return successors, (35), 32 states have call predecessors, (35), 35 states have call successors, (35) [2024-10-24 18:47:33,617 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4051 states to 4051 states and 6154 transitions. [2024-10-24 18:47:33,618 INFO L78 Accepts]: Start accepts. Automaton has 4051 states and 6154 transitions. Word has length 49 [2024-10-24 18:47:33,618 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 18:47:33,618 INFO L471 AbstractCegarLoop]: Abstraction has 4051 states and 6154 transitions. [2024-10-24 18:47:33,618 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.25) internal successors, (49), 4 states have internal predecessors, (49), 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:47:33,618 INFO L276 IsEmpty]: Start isEmpty. Operand 4051 states and 6154 transitions. [2024-10-24 18:47:33,619 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2024-10-24 18:47:33,619 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 18:47:33,619 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 18:47:33,628 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (21)] Ended with exit code 0 [2024-10-24 18:47:33,820 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-24 18:47:33,820 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr73REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 1186 more)] === [2024-10-24 18:47:33,821 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 18:47:33,821 INFO L85 PathProgramCache]: Analyzing trace with hash -243153397, now seen corresponding path program 1 times [2024-10-24 18:47:33,821 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 18:47:33,821 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1603634711] [2024-10-24 18:47:33,821 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 18:47:33,821 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:47:33,821 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 18:47:33,823 INFO L229 MonitoredProcess]: Starting monitored process 22 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-24 18:47:33,824 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (22)] Waiting until timeout for monitored process [2024-10-24 18:47:34,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 18:47:34,079 INFO L255 TraceCheckSpWp]: Trace formula consists of 261 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-24 18:47:34,081 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 18:47:34,109 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:47:34,109 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-24 18:47:34,109 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-24 18:47:34,109 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1603634711] [2024-10-24 18:47:34,109 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1603634711] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 18:47:34,109 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 18:47:34,109 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-24 18:47:34,109 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [765809067] [2024-10-24 18:47:34,110 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 18:47:34,110 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-24 18:47:34,110 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-24 18:47:34,111 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-24 18:47:34,111 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-24 18:47:34,111 INFO L87 Difference]: Start difference. First operand 4051 states and 6154 transitions. Second operand has 4 states, 4 states have (on average 13.0) internal successors, (52), 4 states have internal predecessors, (52), 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)