./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/valid-memsafety.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/array-memsafety/lis-alloca-1.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version a046e57d 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/array-memsafety/lis-alloca-1.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 319f31ab0b5c801309acd19f3e336c9a25177d3201cf5ea4438ad6227d5f71cf --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-mul-div-a046e57-m [2024-10-13 10:30:02,866 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-13 10:30:02,922 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2024-10-13 10:30:02,928 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-13 10:30:02,929 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-13 10:30:02,968 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-13 10:30:02,971 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-13 10:30:02,971 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-13 10:30:02,971 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-13 10:30:02,972 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-13 10:30:02,973 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-13 10:30:02,973 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-13 10:30:02,973 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-13 10:30:02,973 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-13 10:30:02,975 INFO L153 SettingsManager]: * Use SBE=true [2024-10-13 10:30:02,976 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-13 10:30:02,976 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-13 10:30:02,976 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-13 10:30:02,976 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-13 10:30:02,976 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-13 10:30:02,976 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-10-13 10:30:02,977 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-10-13 10:30:02,977 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-10-13 10:30:02,977 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-13 10:30:02,978 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-10-13 10:30:02,978 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-13 10:30:02,978 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-10-13 10:30:02,979 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-13 10:30:02,979 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-13 10:30:02,979 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-13 10:30:02,979 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-13 10:30:02,979 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-13 10:30:02,980 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-13 10:30:02,980 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-13 10:30:02,980 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-13 10:30:02,980 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-13 10:30:02,980 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-13 10:30:02,981 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-13 10:30:02,981 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-13 10:30:02,981 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-13 10:30:02,981 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-13 10:30:02,982 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-13 10:30:02,983 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 -> 319f31ab0b5c801309acd19f3e336c9a25177d3201cf5ea4438ad6227d5f71cf [2024-10-13 10:30:03,193 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-13 10:30:03,211 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-13 10:30:03,213 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-13 10:30:03,214 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-13 10:30:03,214 INFO L274 PluginConnector]: CDTParser initialized [2024-10-13 10:30:03,216 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/array-memsafety/lis-alloca-1.i [2024-10-13 10:30:04,503 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-13 10:30:04,690 INFO L384 CDTParser]: Found 1 translation units. [2024-10-13 10:30:04,694 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/array-memsafety/lis-alloca-1.i [2024-10-13 10:30:04,703 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9ad43f6d2/ddc626ee10b64fe398b5b0c05512df66/FLAG7d10a2a21 [2024-10-13 10:30:04,722 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9ad43f6d2/ddc626ee10b64fe398b5b0c05512df66 [2024-10-13 10:30:04,725 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-13 10:30:04,726 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-13 10:30:04,727 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-13 10:30:04,728 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-13 10:30:04,732 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-13 10:30:04,733 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 10:30:04" (1/1) ... [2024-10-13 10:30:04,737 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@667873e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 10:30:04, skipping insertion in model container [2024-10-13 10:30:04,737 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 10:30:04" (1/1) ... [2024-10-13 10:30:04,770 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-13 10:30:05,010 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-13 10:30:05,022 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-13 10:30:05,022 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver@6c029913 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 10:30:05, skipping insertion in model container [2024-10-13 10:30:05,022 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-13 10:30:05,023 INFO L186 ToolchainWalker]: Toolchain execution was canceled (user or tool) before executing de.uni_freiburg.informatik.ultimate.boogie.procedureinliner [2024-10-13 10:30:05,025 INFO L158 Benchmark]: Toolchain (without parser) took 297.74ms. Allocated memory is still 180.4MB. Free memory was 130.0MB in the beginning and 116.6MB in the end (delta: 13.4MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2024-10-13 10:30:05,025 INFO L158 Benchmark]: CDTParser took 0.13ms. Allocated memory is still 96.5MB. Free memory was 58.4MB in the beginning and 58.3MB in the end (delta: 83.9kB). There was no memory consumed. Max. memory is 16.1GB. [2024-10-13 10:30:05,026 INFO L158 Benchmark]: CACSL2BoogieTranslator took 295.52ms. Allocated memory is still 180.4MB. Free memory was 129.2MB in the beginning and 116.6MB in the end (delta: 12.6MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2024-10-13 10:30:05,027 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.13ms. Allocated memory is still 96.5MB. Free memory was 58.4MB in the beginning and 58.3MB in the end (delta: 83.9kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 295.52ms. Allocated memory is still 180.4MB. Free memory was 129.2MB in the beginning and 116.6MB in the end (delta: 12.6MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - UnsupportedSyntaxResult [Line: 515]: 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/array-memsafety/lis-alloca-1.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 319f31ab0b5c801309acd19f3e336c9a25177d3201cf5ea4438ad6227d5f71cf --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-mul-div-a046e57-m [2024-10-13 10:30:06,781 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-13 10:30:06,848 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf [2024-10-13 10:30:06,853 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-13 10:30:06,853 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-13 10:30:06,877 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-13 10:30:06,878 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-13 10:30:06,878 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-13 10:30:06,878 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-13 10:30:06,879 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-13 10:30:06,879 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-13 10:30:06,879 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-13 10:30:06,879 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-13 10:30:06,880 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-13 10:30:06,880 INFO L153 SettingsManager]: * Use SBE=true [2024-10-13 10:30:06,881 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-13 10:30:06,882 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-13 10:30:06,884 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-13 10:30:06,884 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-13 10:30:06,884 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-13 10:30:06,885 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-10-13 10:30:06,885 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-10-13 10:30:06,885 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-10-13 10:30:06,886 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-13 10:30:06,887 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-10-13 10:30:06,887 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-10-13 10:30:06,887 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-13 10:30:06,887 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-10-13 10:30:06,887 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-10-13 10:30:06,888 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-13 10:30:06,888 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-13 10:30:06,888 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-13 10:30:06,888 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-13 10:30:06,888 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-13 10:30:06,889 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-13 10:30:06,889 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-13 10:30:06,889 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-13 10:30:06,890 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-13 10:30:06,890 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-10-13 10:30:06,890 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-10-13 10:30:06,891 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-13 10:30:06,891 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-13 10:30:06,891 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-13 10:30:06,891 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-13 10:30:06,891 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2024-10-13 10:30:06,891 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 -> 319f31ab0b5c801309acd19f3e336c9a25177d3201cf5ea4438ad6227d5f71cf [2024-10-13 10:30:07,167 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-13 10:30:07,190 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-13 10:30:07,194 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-13 10:30:07,196 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-13 10:30:07,196 INFO L274 PluginConnector]: CDTParser initialized [2024-10-13 10:30:07,198 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/array-memsafety/lis-alloca-1.i [2024-10-13 10:30:08,529 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-13 10:30:08,731 INFO L384 CDTParser]: Found 1 translation units. [2024-10-13 10:30:08,732 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/array-memsafety/lis-alloca-1.i [2024-10-13 10:30:08,745 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/907b863a9/b10d329d826f45428f648cf54db7eaa2/FLAG90e33d575 [2024-10-13 10:30:09,100 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/907b863a9/b10d329d826f45428f648cf54db7eaa2 [2024-10-13 10:30:09,102 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-13 10:30:09,102 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-13 10:30:09,104 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-13 10:30:09,104 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-13 10:30:09,108 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-13 10:30:09,108 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 10:30:09" (1/1) ... [2024-10-13 10:30:09,109 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@53d7c7f8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 10:30:09, skipping insertion in model container [2024-10-13 10:30:09,109 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 10:30:09" (1/1) ... [2024-10-13 10:30:09,139 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-13 10:30:09,404 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-13 10:30:09,415 INFO L197 MainTranslator]: Restarting translation with changed settings: SettingsChange [mNewPreferredMemoryModel=HoenickeLindenmann_1ByteResolution] [2024-10-13 10:30:09,421 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-13 10:30:09,459 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-13 10:30:09,466 INFO L200 MainTranslator]: Completed pre-run [2024-10-13 10:30:09,503 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-13 10:30:09,528 INFO L204 MainTranslator]: Completed translation [2024-10-13 10:30:09,529 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 10:30:09 WrapperNode [2024-10-13 10:30:09,529 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-13 10:30:09,530 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-13 10:30:09,530 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-13 10:30:09,530 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-13 10:30:09,536 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 10:30:09" (1/1) ... [2024-10-13 10:30:09,553 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 10:30:09" (1/1) ... [2024-10-13 10:30:09,578 INFO L138 Inliner]: procedures = 117, calls = 24, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 115 [2024-10-13 10:30:09,579 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-13 10:30:09,580 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-13 10:30:09,581 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-13 10:30:09,581 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-13 10:30:09,589 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 10:30:09" (1/1) ... [2024-10-13 10:30:09,589 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 10:30:09" (1/1) ... [2024-10-13 10:30:09,593 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 10:30:09" (1/1) ... [2024-10-13 10:30:09,610 INFO L175 MemorySlicer]: Split 12 memory accesses to 3 slices as follows [3, 7, 2]. 58 percent of accesses are in the largest equivalence class. The 0 initializations are split as follows [0, 0, 0]. The 5 writes are split as follows [1, 2, 2]. [2024-10-13 10:30:09,611 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 10:30:09" (1/1) ... [2024-10-13 10:30:09,611 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 10:30:09" (1/1) ... [2024-10-13 10:30:09,618 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 10:30:09" (1/1) ... [2024-10-13 10:30:09,621 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 10:30:09" (1/1) ... [2024-10-13 10:30:09,622 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 10:30:09" (1/1) ... [2024-10-13 10:30:09,623 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 10:30:09" (1/1) ... [2024-10-13 10:30:09,625 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-13 10:30:09,626 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-13 10:30:09,626 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-13 10:30:09,626 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-13 10:30:09,627 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 10:30:09" (1/1) ... [2024-10-13 10:30:09,636 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-13 10:30:09,645 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 10:30:09,658 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-13 10:30:09,661 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-13 10:30:09,695 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#0 [2024-10-13 10:30:09,695 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#1 [2024-10-13 10:30:09,695 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#2 [2024-10-13 10:30:09,695 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-10-13 10:30:09,695 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-10-13 10:30:09,695 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#0 [2024-10-13 10:30:09,696 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#1 [2024-10-13 10:30:09,696 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#2 [2024-10-13 10:30:09,696 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-13 10:30:09,696 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-13 10:30:09,785 INFO L238 CfgBuilder]: Building ICFG [2024-10-13 10:30:09,787 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-13 10:30:10,167 INFO L? ?]: Removed 78 outVars from TransFormulas that were not future-live. [2024-10-13 10:30:10,168 INFO L287 CfgBuilder]: Performing block encoding [2024-10-13 10:30:10,205 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-13 10:30:10,206 INFO L314 CfgBuilder]: Removed 5 assume(true) statements. [2024-10-13 10:30:10,207 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 10:30:10 BoogieIcfgContainer [2024-10-13 10:30:10,207 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-13 10:30:10,209 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-13 10:30:10,209 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-13 10:30:10,212 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-13 10:30:10,212 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.10 10:30:09" (1/3) ... [2024-10-13 10:30:10,213 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@48c9ad65 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 10:30:10, skipping insertion in model container [2024-10-13 10:30:10,213 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 10:30:09" (2/3) ... [2024-10-13 10:30:10,213 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@48c9ad65 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 10:30:10, skipping insertion in model container [2024-10-13 10:30:10,214 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 10:30:10" (3/3) ... [2024-10-13 10:30:10,215 INFO L112 eAbstractionObserver]: Analyzing ICFG lis-alloca-1.i [2024-10-13 10:30:10,228 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-13 10:30:10,228 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 25 error locations. [2024-10-13 10:30:10,268 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-13 10:30:10,274 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;@35da558b, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-13 10:30:10,274 INFO L334 AbstractCegarLoop]: Starting to check reachability of 25 error locations. [2024-10-13 10:30:10,280 INFO L276 IsEmpty]: Start isEmpty. Operand has 57 states, 31 states have (on average 2.2580645161290325) internal successors, (70), 56 states have internal predecessors, (70), 0 states have call successors, (0), 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-13 10:30:10,285 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2024-10-13 10:30:10,285 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 10:30:10,286 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2024-10-13 10:30:10,286 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 22 more)] === [2024-10-13 10:30:10,290 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 10:30:10,290 INFO L85 PathProgramCache]: Analyzing trace with hash 161774325, now seen corresponding path program 1 times [2024-10-13 10:30:10,298 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 10:30:10,298 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [538799793] [2024-10-13 10:30:10,299 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 10:30:10,299 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-13 10:30:10,299 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 10:30:10,301 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-13 10:30:10,321 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-13 10:30:10,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:30:10,364 INFO L255 TraceCheckSpWp]: Trace formula consists of 21 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-10-13 10:30:10,367 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 10:30:10,418 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-13 10:30:10,434 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-13 10:30:10,435 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-13 10:30:10,436 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 10:30:10,436 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [538799793] [2024-10-13 10:30:10,436 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [538799793] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 10:30:10,437 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 10:30:10,437 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-13 10:30:10,438 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1486048986] [2024-10-13 10:30:10,439 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 10:30:10,442 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 10:30:10,442 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 10:30:10,464 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 10:30:10,465 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 10:30:10,467 INFO L87 Difference]: Start difference. First operand has 57 states, 31 states have (on average 2.2580645161290325) internal successors, (70), 56 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 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-13 10:30:10,543 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 10:30:10,543 INFO L93 Difference]: Finished difference Result 56 states and 64 transitions. [2024-10-13 10:30:10,544 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 10:30:10,545 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 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 5 [2024-10-13 10:30:10,546 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 10:30:10,551 INFO L225 Difference]: With dead ends: 56 [2024-10-13 10:30:10,552 INFO L226 Difference]: Without dead ends: 55 [2024-10-13 10:30:10,553 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 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-13 10:30:10,556 INFO L432 NwaCegarLoop]: 54 mSDtfsCounter, 2 mSDsluCounter, 32 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 86 SdHoareTripleChecker+Invalid, 38 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-13 10:30:10,556 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 86 Invalid, 38 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-13 10:30:10,568 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2024-10-13 10:30:10,577 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 55. [2024-10-13 10:30:10,578 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 55 states, 31 states have (on average 2.032258064516129) internal successors, (63), 54 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 10:30:10,579 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 63 transitions. [2024-10-13 10:30:10,581 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 63 transitions. Word has length 5 [2024-10-13 10:30:10,581 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 10:30:10,582 INFO L471 AbstractCegarLoop]: Abstraction has 55 states and 63 transitions. [2024-10-13 10:30:10,582 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 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-13 10:30:10,582 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 63 transitions. [2024-10-13 10:30:10,582 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2024-10-13 10:30:10,583 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 10:30:10,583 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2024-10-13 10:30:10,587 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-13 10:30:10,783 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-13 10:30:10,784 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 22 more)] === [2024-10-13 10:30:10,784 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 10:30:10,784 INFO L85 PathProgramCache]: Analyzing trace with hash 161774326, now seen corresponding path program 1 times [2024-10-13 10:30:10,785 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 10:30:10,785 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1508337576] [2024-10-13 10:30:10,785 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 10:30:10,785 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-13 10:30:10,790 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 10:30:10,792 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-13 10:30:10,794 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2024-10-13 10:30:10,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:30:10,837 INFO L255 TraceCheckSpWp]: Trace formula consists of 21 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-10-13 10:30:10,839 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 10:30:10,868 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-13 10:30:10,892 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-13 10:30:10,893 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-13 10:30:10,893 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 10:30:10,893 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1508337576] [2024-10-13 10:30:10,893 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1508337576] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 10:30:10,893 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 10:30:10,893 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-13 10:30:10,893 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [593335081] [2024-10-13 10:30:10,894 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 10:30:10,894 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-13 10:30:10,894 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 10:30:10,895 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-13 10:30:10,895 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-13 10:30:10,895 INFO L87 Difference]: Start difference. First operand 55 states and 63 transitions. Second operand has 4 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 4 states have internal predecessors, (5), 0 states have call successors, (0), 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-13 10:30:11,038 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 10:30:11,039 INFO L93 Difference]: Finished difference Result 62 states and 71 transitions. [2024-10-13 10:30:11,039 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-13 10:30:11,040 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 4 states have internal predecessors, (5), 0 states have call successors, (0), 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 5 [2024-10-13 10:30:11,040 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 10:30:11,041 INFO L225 Difference]: With dead ends: 62 [2024-10-13 10:30:11,042 INFO L226 Difference]: Without dead ends: 62 [2024-10-13 10:30:11,042 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 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-13 10:30:11,043 INFO L432 NwaCegarLoop]: 55 mSDtfsCounter, 7 mSDsluCounter, 83 mSDsCounter, 0 mSdLazyCounter, 58 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 138 SdHoareTripleChecker+Invalid, 59 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 58 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-13 10:30:11,044 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 138 Invalid, 59 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 58 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-13 10:30:11,045 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2024-10-13 10:30:11,049 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 58. [2024-10-13 10:30:11,049 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 58 states, 34 states have (on average 1.9411764705882353) internal successors, (66), 57 states have internal predecessors, (66), 0 states have call successors, (0), 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-13 10:30:11,050 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 66 transitions. [2024-10-13 10:30:11,050 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 66 transitions. Word has length 5 [2024-10-13 10:30:11,050 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 10:30:11,051 INFO L471 AbstractCegarLoop]: Abstraction has 58 states and 66 transitions. [2024-10-13 10:30:11,051 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 4 states have internal predecessors, (5), 0 states have call successors, (0), 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-13 10:30:11,051 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 66 transitions. [2024-10-13 10:30:11,051 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2024-10-13 10:30:11,051 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 10:30:11,051 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2024-10-13 10:30:11,054 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-13 10:30:11,252 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-13 10:30:11,252 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 22 more)] === [2024-10-13 10:30:11,253 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 10:30:11,253 INFO L85 PathProgramCache]: Analyzing trace with hash 161833908, now seen corresponding path program 1 times [2024-10-13 10:30:11,253 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 10:30:11,253 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [867776116] [2024-10-13 10:30:11,253 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 10:30:11,253 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-13 10:30:11,253 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 10:30:11,256 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-13 10:30:11,257 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-13 10:30:11,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:30:11,288 INFO L255 TraceCheckSpWp]: Trace formula consists of 21 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-10-13 10:30:11,289 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 10:30:11,325 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 8 treesize of output 7 [2024-10-13 10:30:11,386 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-13 10:30:11,387 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-13 10:30:11,388 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 10:30:11,388 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [867776116] [2024-10-13 10:30:11,388 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [867776116] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 10:30:11,388 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 10:30:11,388 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-13 10:30:11,388 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [470257183] [2024-10-13 10:30:11,388 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 10:30:11,389 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-13 10:30:11,389 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 10:30:11,389 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-13 10:30:11,389 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-13 10:30:11,390 INFO L87 Difference]: Start difference. First operand 58 states and 66 transitions. Second operand has 4 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 4 states have internal predecessors, (5), 0 states have call successors, (0), 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-13 10:30:11,553 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 10:30:11,553 INFO L93 Difference]: Finished difference Result 60 states and 68 transitions. [2024-10-13 10:30:11,554 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-13 10:30:11,554 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 4 states have internal predecessors, (5), 0 states have call successors, (0), 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 5 [2024-10-13 10:30:11,555 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 10:30:11,559 INFO L225 Difference]: With dead ends: 60 [2024-10-13 10:30:11,559 INFO L226 Difference]: Without dead ends: 60 [2024-10-13 10:30:11,560 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 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-13 10:30:11,560 INFO L432 NwaCegarLoop]: 52 mSDtfsCounter, 7 mSDsluCounter, 82 mSDsCounter, 0 mSdLazyCounter, 47 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 134 SdHoareTripleChecker+Invalid, 49 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 47 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-13 10:30:11,561 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 134 Invalid, 49 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 47 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-13 10:30:11,561 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2024-10-13 10:30:11,568 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 57. [2024-10-13 10:30:11,568 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 57 states, 33 states have (on average 1.9696969696969697) internal successors, (65), 56 states have internal predecessors, (65), 0 states have call successors, (0), 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-13 10:30:11,569 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 65 transitions. [2024-10-13 10:30:11,570 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 65 transitions. Word has length 5 [2024-10-13 10:30:11,571 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 10:30:11,571 INFO L471 AbstractCegarLoop]: Abstraction has 57 states and 65 transitions. [2024-10-13 10:30:11,571 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 4 states have internal predecessors, (5), 0 states have call successors, (0), 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-13 10:30:11,571 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 65 transitions. [2024-10-13 10:30:11,571 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2024-10-13 10:30:11,571 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 10:30:11,571 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1] [2024-10-13 10:30:11,576 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-13 10:30:11,773 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-13 10:30:11,774 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 22 more)] === [2024-10-13 10:30:11,775 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 10:30:11,775 INFO L85 PathProgramCache]: Analyzing trace with hash 846425302, now seen corresponding path program 1 times [2024-10-13 10:30:11,775 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 10:30:11,783 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [359164038] [2024-10-13 10:30:11,783 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 10:30:11,783 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-13 10:30:11,783 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 10:30:11,789 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-13 10:30:11,790 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-13 10:30:11,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:30:11,858 INFO L255 TraceCheckSpWp]: Trace formula consists of 33 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-10-13 10:30:11,859 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 10:30:11,892 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 10:30:11,892 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-13 10:30:11,925 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 10:30:11,925 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 10:30:11,925 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [359164038] [2024-10-13 10:30:11,926 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [359164038] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-13 10:30:11,926 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-13 10:30:11,926 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 8 [2024-10-13 10:30:11,926 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [552994231] [2024-10-13 10:30:11,926 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-13 10:30:11,926 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-13 10:30:11,927 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 10:30:11,927 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-13 10:30:11,927 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2024-10-13 10:30:11,927 INFO L87 Difference]: Start difference. First operand 57 states and 65 transitions. Second operand has 8 states, 8 states have (on average 1.5) internal successors, (12), 8 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-13 10:30:12,003 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 10:30:12,003 INFO L93 Difference]: Finished difference Result 62 states and 70 transitions. [2024-10-13 10:30:12,005 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-13 10:30:12,005 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 1.5) internal successors, (12), 8 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 7 [2024-10-13 10:30:12,006 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 10:30:12,006 INFO L225 Difference]: With dead ends: 62 [2024-10-13 10:30:12,007 INFO L226 Difference]: Without dead ends: 62 [2024-10-13 10:30:12,008 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2024-10-13 10:30:12,008 INFO L432 NwaCegarLoop]: 52 mSDtfsCounter, 1 mSDsluCounter, 198 mSDsCounter, 0 mSdLazyCounter, 64 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 250 SdHoareTripleChecker+Invalid, 64 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 64 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-13 10:30:12,008 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 250 Invalid, 64 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 64 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-13 10:30:12,009 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2024-10-13 10:30:12,013 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 61. [2024-10-13 10:30:12,014 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 61 states, 37 states have (on average 1.864864864864865) internal successors, (69), 60 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 10:30:12,014 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 69 transitions. [2024-10-13 10:30:12,015 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 69 transitions. Word has length 7 [2024-10-13 10:30:12,015 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 10:30:12,016 INFO L471 AbstractCegarLoop]: Abstraction has 61 states and 69 transitions. [2024-10-13 10:30:12,016 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 1.5) internal successors, (12), 8 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-13 10:30:12,016 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 69 transitions. [2024-10-13 10:30:12,016 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2024-10-13 10:30:12,016 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 10:30:12,016 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1] [2024-10-13 10:30:12,024 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Forceful destruction successful, exit code 0 [2024-10-13 10:30:12,217 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-13 10:30:12,217 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 22 more)] === [2024-10-13 10:30:12,217 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 10:30:12,218 INFO L85 PathProgramCache]: Analyzing trace with hash 903683604, now seen corresponding path program 1 times [2024-10-13 10:30:12,218 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 10:30:12,218 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1818874535] [2024-10-13 10:30:12,218 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 10:30:12,218 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-13 10:30:12,218 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 10:30:12,221 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-13 10:30:12,223 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-13 10:30:12,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:30:12,253 INFO L255 TraceCheckSpWp]: Trace formula consists of 33 conjuncts, 11 conjuncts are in the unsatisfiable core [2024-10-13 10:30:12,254 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 10:30:12,284 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 8 treesize of output 7 [2024-10-13 10:30:12,399 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 10:30:12,399 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-13 10:30:12,588 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 10:30:12,588 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 10:30:12,588 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1818874535] [2024-10-13 10:30:12,588 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1818874535] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-13 10:30:12,588 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-13 10:30:12,588 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 9 [2024-10-13 10:30:12,588 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2085447537] [2024-10-13 10:30:12,588 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-13 10:30:12,588 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-10-13 10:30:12,589 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 10:30:12,589 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-10-13 10:30:12,589 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2024-10-13 10:30:12,589 INFO L87 Difference]: Start difference. First operand 61 states and 69 transitions. Second operand has 10 states, 9 states have (on average 1.4444444444444444) internal successors, (13), 10 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 10:30:13,108 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 10:30:13,108 INFO L93 Difference]: Finished difference Result 67 states and 78 transitions. [2024-10-13 10:30:13,109 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-10-13 10:30:13,109 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 1.4444444444444444) internal successors, (13), 10 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2024-10-13 10:30:13,109 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 10:30:13,111 INFO L225 Difference]: With dead ends: 67 [2024-10-13 10:30:13,111 INFO L226 Difference]: Without dead ends: 67 [2024-10-13 10:30:13,111 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=78, Invalid=132, Unknown=0, NotChecked=0, Total=210 [2024-10-13 10:30:13,112 INFO L432 NwaCegarLoop]: 52 mSDtfsCounter, 13 mSDsluCounter, 193 mSDsCounter, 0 mSdLazyCounter, 128 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 245 SdHoareTripleChecker+Invalid, 130 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 128 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-13 10:30:13,112 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 245 Invalid, 130 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 128 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-13 10:30:13,112 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2024-10-13 10:30:13,115 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 67. [2024-10-13 10:30:13,117 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 67 states, 43 states have (on average 1.813953488372093) internal successors, (78), 66 states have internal predecessors, (78), 0 states have call successors, (0), 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-13 10:30:13,118 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 78 transitions. [2024-10-13 10:30:13,119 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 78 transitions. Word has length 7 [2024-10-13 10:30:13,120 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 10:30:13,120 INFO L471 AbstractCegarLoop]: Abstraction has 67 states and 78 transitions. [2024-10-13 10:30:13,120 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 1.4444444444444444) internal successors, (13), 10 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 10:30:13,120 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 78 transitions. [2024-10-13 10:30:13,120 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2024-10-13 10:30:13,120 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 10:30:13,120 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 10:30:13,124 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Ended with exit code 0 [2024-10-13 10:30:13,323 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-13 10:30:13,323 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 22 more)] === [2024-10-13 10:30:13,324 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 10:30:13,324 INFO L85 PathProgramCache]: Analyzing trace with hash 1665844545, now seen corresponding path program 1 times [2024-10-13 10:30:13,324 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 10:30:13,324 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1100178964] [2024-10-13 10:30:13,324 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 10:30:13,324 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-13 10:30:13,324 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 10:30:13,325 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-13 10:30:13,326 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-13 10:30:13,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:30:13,372 INFO L255 TraceCheckSpWp]: Trace formula consists of 60 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-10-13 10:30:13,374 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 10:30:13,403 INFO L349 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2024-10-13 10:30:13,404 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 9 treesize of output 15 [2024-10-13 10:30:13,421 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-10-13 10:30:13,422 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-13 10:30:13,422 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 10:30:13,422 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1100178964] [2024-10-13 10:30:13,422 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1100178964] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 10:30:13,422 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 10:30:13,422 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-13 10:30:13,422 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [700104369] [2024-10-13 10:30:13,422 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 10:30:13,422 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 10:30:13,422 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 10:30:13,423 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 10:30:13,423 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 10:30:13,423 INFO L87 Difference]: Start difference. First operand 67 states and 78 transitions. Second operand has 3 states, 2 states have (on average 4.5) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 10:30:13,523 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 10:30:13,523 INFO L93 Difference]: Finished difference Result 60 states and 71 transitions. [2024-10-13 10:30:13,524 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 10:30:13,524 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 4.5) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2024-10-13 10:30:13,524 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 10:30:13,525 INFO L225 Difference]: With dead ends: 60 [2024-10-13 10:30:13,525 INFO L226 Difference]: Without dead ends: 60 [2024-10-13 10:30:13,525 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 10:30:13,526 INFO L432 NwaCegarLoop]: 31 mSDtfsCounter, 37 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 37 SdHoareTripleChecker+Valid, 36 SdHoareTripleChecker+Invalid, 43 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 37 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-13 10:30:13,526 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [37 Valid, 36 Invalid, 43 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-13 10:30:13,526 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2024-10-13 10:30:13,528 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 60. [2024-10-13 10:30:13,532 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 60 states, 43 states have (on average 1.6511627906976745) internal successors, (71), 59 states have internal predecessors, (71), 0 states have call successors, (0), 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-13 10:30:13,532 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 71 transitions. [2024-10-13 10:30:13,533 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 71 transitions. Word has length 9 [2024-10-13 10:30:13,533 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 10:30:13,533 INFO L471 AbstractCegarLoop]: Abstraction has 60 states and 71 transitions. [2024-10-13 10:30:13,534 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 4.5) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 10:30:13,534 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 71 transitions. [2024-10-13 10:30:13,534 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2024-10-13 10:30:13,534 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 10:30:13,534 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 10:30:13,538 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-13 10:30:13,734 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-13 10:30:13,735 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 22 more)] === [2024-10-13 10:30:13,736 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 10:30:13,736 INFO L85 PathProgramCache]: Analyzing trace with hash 1665844546, now seen corresponding path program 1 times [2024-10-13 10:30:13,736 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 10:30:13,736 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1724591229] [2024-10-13 10:30:13,736 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 10:30:13,736 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-13 10:30:13,736 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 10:30:13,737 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-13 10:30:13,738 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-13 10:30:13,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:30:13,781 INFO L255 TraceCheckSpWp]: Trace formula consists of 60 conjuncts, 11 conjuncts are in the unsatisfiable core [2024-10-13 10:30:13,783 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 10:30:13,812 INFO L349 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2024-10-13 10:30:13,812 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 9 treesize of output 11 [2024-10-13 10:30:13,837 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-10-13 10:30:13,837 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-13 10:30:13,837 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 10:30:13,837 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1724591229] [2024-10-13 10:30:13,837 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1724591229] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 10:30:13,837 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 10:30:13,837 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-13 10:30:13,837 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1815469842] [2024-10-13 10:30:13,837 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 10:30:13,838 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-13 10:30:13,838 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 10:30:13,838 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-13 10:30:13,838 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-13 10:30:13,838 INFO L87 Difference]: Start difference. First operand 60 states and 71 transitions. Second operand has 4 states, 3 states have (on average 3.0) internal successors, (9), 4 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 10:30:13,986 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 10:30:13,986 INFO L93 Difference]: Finished difference Result 65 states and 78 transitions. [2024-10-13 10:30:13,986 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-13 10:30:13,986 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 3.0) internal successors, (9), 4 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2024-10-13 10:30:13,987 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 10:30:13,987 INFO L225 Difference]: With dead ends: 65 [2024-10-13 10:30:13,987 INFO L226 Difference]: Without dead ends: 65 [2024-10-13 10:30:13,987 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-13 10:30:13,990 INFO L432 NwaCegarLoop]: 41 mSDtfsCounter, 2 mSDsluCounter, 53 mSDsCounter, 0 mSdLazyCounter, 73 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 94 SdHoareTripleChecker+Invalid, 73 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 73 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-13 10:30:13,990 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 94 Invalid, 73 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 73 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-13 10:30:13,991 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2024-10-13 10:30:13,994 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 63. [2024-10-13 10:30:13,995 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 63 states, 46 states have (on average 1.6304347826086956) internal successors, (75), 62 states have internal predecessors, (75), 0 states have call successors, (0), 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-13 10:30:13,995 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 75 transitions. [2024-10-13 10:30:13,995 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 75 transitions. Word has length 9 [2024-10-13 10:30:13,995 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 10:30:13,995 INFO L471 AbstractCegarLoop]: Abstraction has 63 states and 75 transitions. [2024-10-13 10:30:13,995 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 3.0) internal successors, (9), 4 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 10:30:13,995 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 75 transitions. [2024-10-13 10:30:13,996 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2024-10-13 10:30:13,996 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 10:30:13,997 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 10:30:14,000 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Ended with exit code 0 [2024-10-13 10:30:14,197 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-13 10:30:14,198 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 22 more)] === [2024-10-13 10:30:14,198 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 10:30:14,198 INFO L85 PathProgramCache]: Analyzing trace with hash 856497920, now seen corresponding path program 1 times [2024-10-13 10:30:14,198 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 10:30:14,198 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1715753861] [2024-10-13 10:30:14,198 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 10:30:14,199 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-13 10:30:14,199 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 10:30:14,201 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-13 10:30:14,202 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-13 10:30:14,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:30:14,245 INFO L255 TraceCheckSpWp]: Trace formula consists of 60 conjuncts, 12 conjuncts are in the unsatisfiable core [2024-10-13 10:30:14,246 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 10:30:14,277 INFO L349 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2024-10-13 10:30:14,277 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 15 [2024-10-13 10:30:14,339 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-10-13 10:30:14,339 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-13 10:30:14,339 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 10:30:14,339 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1715753861] [2024-10-13 10:30:14,339 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1715753861] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 10:30:14,339 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 10:30:14,339 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-13 10:30:14,339 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [284369735] [2024-10-13 10:30:14,339 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 10:30:14,340 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-13 10:30:14,340 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 10:30:14,340 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-13 10:30:14,340 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-13 10:30:14,340 INFO L87 Difference]: Start difference. First operand 63 states and 75 transitions. Second operand has 5 states, 4 states have (on average 2.25) internal successors, (9), 5 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 10:30:14,583 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 10:30:14,583 INFO L93 Difference]: Finished difference Result 67 states and 81 transitions. [2024-10-13 10:30:14,583 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-13 10:30:14,584 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 2.25) internal successors, (9), 5 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2024-10-13 10:30:14,584 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 10:30:14,584 INFO L225 Difference]: With dead ends: 67 [2024-10-13 10:30:14,584 INFO L226 Difference]: Without dead ends: 67 [2024-10-13 10:30:14,585 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-10-13 10:30:14,585 INFO L432 NwaCegarLoop]: 41 mSDtfsCounter, 6 mSDsluCounter, 66 mSDsCounter, 0 mSdLazyCounter, 109 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 107 SdHoareTripleChecker+Invalid, 110 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 109 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-13 10:30:14,585 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 107 Invalid, 110 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 109 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-13 10:30:14,586 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2024-10-13 10:30:14,588 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 62. [2024-10-13 10:30:14,588 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 62 states, 45 states have (on average 1.6444444444444444) internal successors, (74), 61 states have internal predecessors, (74), 0 states have call successors, (0), 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-13 10:30:14,588 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 74 transitions. [2024-10-13 10:30:14,589 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 74 transitions. Word has length 9 [2024-10-13 10:30:14,589 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 10:30:14,589 INFO L471 AbstractCegarLoop]: Abstraction has 62 states and 74 transitions. [2024-10-13 10:30:14,589 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 2.25) internal successors, (9), 5 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 10:30:14,589 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 74 transitions. [2024-10-13 10:30:14,589 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2024-10-13 10:30:14,590 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 10:30:14,590 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 10:30:14,593 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-13 10:30:14,790 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-13 10:30:14,791 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 22 more)] === [2024-10-13 10:30:14,791 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 10:30:14,791 INFO L85 PathProgramCache]: Analyzing trace with hash 101573352, now seen corresponding path program 1 times [2024-10-13 10:30:14,791 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 10:30:14,792 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [643993925] [2024-10-13 10:30:14,792 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 10:30:14,792 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-13 10:30:14,792 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 10:30:14,793 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-13 10:30:14,794 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Waiting until timeout for monitored process [2024-10-13 10:30:14,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:30:14,839 INFO L255 TraceCheckSpWp]: Trace formula consists of 70 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-10-13 10:30:14,840 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 10:30:14,854 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-10-13 10:30:14,859 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-13 10:30:14,859 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 1 [2024-10-13 10:30:14,870 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-10-13 10:30:14,870 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-13 10:30:14,870 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 10:30:14,870 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [643993925] [2024-10-13 10:30:14,871 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [643993925] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 10:30:14,871 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 10:30:14,871 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-13 10:30:14,871 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [575622168] [2024-10-13 10:30:14,871 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 10:30:14,871 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 10:30:14,871 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 10:30:14,872 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 10:30:14,872 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 10:30:14,872 INFO L87 Difference]: Start difference. First operand 62 states and 74 transitions. Second operand has 3 states, 2 states have (on average 5.0) 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-13 10:30:14,931 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 10:30:14,932 INFO L93 Difference]: Finished difference Result 60 states and 72 transitions. [2024-10-13 10:30:14,932 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 10:30:14,932 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 5.0) 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-13 10:30:14,932 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 10:30:14,933 INFO L225 Difference]: With dead ends: 60 [2024-10-13 10:30:14,933 INFO L226 Difference]: Without dead ends: 60 [2024-10-13 10:30:14,933 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-13 10:30:14,933 INFO L432 NwaCegarLoop]: 36 mSDtfsCounter, 39 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 39 SdHoareTripleChecker+Valid, 41 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-13 10:30:14,933 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [39 Valid, 41 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-13 10:30:14,934 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2024-10-13 10:30:14,936 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 60. [2024-10-13 10:30:14,936 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 60 states, 45 states have (on average 1.6) internal successors, (72), 59 states have internal predecessors, (72), 0 states have call successors, (0), 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-13 10:30:14,937 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 72 transitions. [2024-10-13 10:30:14,937 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 72 transitions. Word has length 10 [2024-10-13 10:30:14,937 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 10:30:14,937 INFO L471 AbstractCegarLoop]: Abstraction has 60 states and 72 transitions. [2024-10-13 10:30:14,937 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 5.0) 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-13 10:30:14,937 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 72 transitions. [2024-10-13 10:30:14,937 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2024-10-13 10:30:14,937 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 10:30:14,937 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 10:30:14,941 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-13 10:30:15,140 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-13 10:30:15,141 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 22 more)] === [2024-10-13 10:30:15,141 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 10:30:15,141 INFO L85 PathProgramCache]: Analyzing trace with hash 101573353, now seen corresponding path program 1 times [2024-10-13 10:30:15,141 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 10:30:15,141 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1766797419] [2024-10-13 10:30:15,141 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 10:30:15,142 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-13 10:30:15,142 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 10:30:15,144 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-13 10:30:15,145 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-13 10:30:15,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:30:15,196 INFO L255 TraceCheckSpWp]: Trace formula consists of 70 conjuncts, 10 conjuncts are in the unsatisfiable core [2024-10-13 10:30:15,197 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 10:30:15,215 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-13 10:30:15,225 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-13 10:30:15,225 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 1 [2024-10-13 10:30:15,248 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-10-13 10:30:15,249 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-13 10:30:15,249 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 10:30:15,249 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1766797419] [2024-10-13 10:30:15,249 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1766797419] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 10:30:15,249 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 10:30:15,249 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-13 10:30:15,249 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1440048372] [2024-10-13 10:30:15,249 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 10:30:15,249 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-13 10:30:15,249 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 10:30:15,250 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-13 10:30:15,250 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-13 10:30:15,250 INFO L87 Difference]: Start difference. First operand 60 states and 72 transitions. Second operand has 4 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 4 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-13 10:30:15,359 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 10:30:15,359 INFO L93 Difference]: Finished difference Result 64 states and 77 transitions. [2024-10-13 10:30:15,359 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-13 10:30:15,359 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 4 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-13 10:30:15,359 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 10:30:15,360 INFO L225 Difference]: With dead ends: 64 [2024-10-13 10:30:15,360 INFO L226 Difference]: Without dead ends: 64 [2024-10-13 10:30:15,360 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-13 10:30:15,360 INFO L432 NwaCegarLoop]: 40 mSDtfsCounter, 0 mSDsluCounter, 50 mSDsCounter, 0 mSdLazyCounter, 71 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 90 SdHoareTripleChecker+Invalid, 71 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 71 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-13 10:30:15,360 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 90 Invalid, 71 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 71 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-13 10:30:15,361 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2024-10-13 10:30:15,362 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 64. [2024-10-13 10:30:15,362 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 64 states, 49 states have (on average 1.5714285714285714) internal successors, (77), 63 states have internal predecessors, (77), 0 states have call successors, (0), 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-13 10:30:15,363 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 77 transitions. [2024-10-13 10:30:15,363 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 77 transitions. Word has length 10 [2024-10-13 10:30:15,363 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 10:30:15,363 INFO L471 AbstractCegarLoop]: Abstraction has 64 states and 77 transitions. [2024-10-13 10:30:15,363 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 4 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-13 10:30:15,363 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 77 transitions. [2024-10-13 10:30:15,363 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2024-10-13 10:30:15,363 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 10:30:15,363 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 10:30:15,367 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Ended with exit code 0 [2024-10-13 10:30:15,564 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-13 10:30:15,564 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 22 more)] === [2024-10-13 10:30:15,564 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 10:30:15,565 INFO L85 PathProgramCache]: Analyzing trace with hash 781631723, now seen corresponding path program 1 times [2024-10-13 10:30:15,565 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 10:30:15,565 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [274423865] [2024-10-13 10:30:15,565 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 10:30:15,565 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-13 10:30:15,565 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 10:30:15,566 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-13 10:30:15,567 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-13 10:30:15,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:30:15,619 INFO L255 TraceCheckSpWp]: Trace formula consists of 70 conjuncts, 11 conjuncts are in the unsatisfiable core [2024-10-13 10:30:15,621 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 10:30:15,643 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 8 treesize of output 7 [2024-10-13 10:30:15,653 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-13 10:30:15,654 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 1 [2024-10-13 10:30:15,719 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-10-13 10:30:15,719 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-13 10:30:15,720 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 10:30:15,720 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [274423865] [2024-10-13 10:30:15,720 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [274423865] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 10:30:15,720 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 10:30:15,720 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-13 10:30:15,720 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1079105755] [2024-10-13 10:30:15,720 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 10:30:15,720 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-13 10:30:15,720 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 10:30:15,720 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-13 10:30:15,720 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-13 10:30:15,721 INFO L87 Difference]: Start difference. First operand 64 states and 77 transitions. Second operand has 5 states, 4 states have (on average 2.5) internal successors, (10), 5 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-13 10:30:15,910 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 10:30:15,910 INFO L93 Difference]: Finished difference Result 65 states and 78 transitions. [2024-10-13 10:30:15,911 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-13 10:30:15,911 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 2.5) internal successors, (10), 5 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-13 10:30:15,911 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 10:30:15,911 INFO L225 Difference]: With dead ends: 65 [2024-10-13 10:30:15,911 INFO L226 Difference]: Without dead ends: 65 [2024-10-13 10:30:15,911 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-10-13 10:30:15,912 INFO L432 NwaCegarLoop]: 40 mSDtfsCounter, 3 mSDsluCounter, 61 mSDsCounter, 0 mSdLazyCounter, 107 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 101 SdHoareTripleChecker+Invalid, 108 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 107 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-13 10:30:15,912 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 101 Invalid, 108 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 107 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-13 10:30:15,912 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2024-10-13 10:30:15,914 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 61. [2024-10-13 10:30:15,914 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 61 states, 46 states have (on average 1.5869565217391304) internal successors, (73), 60 states have internal predecessors, (73), 0 states have call successors, (0), 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-13 10:30:15,914 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 73 transitions. [2024-10-13 10:30:15,914 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 73 transitions. Word has length 10 [2024-10-13 10:30:15,914 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 10:30:15,914 INFO L471 AbstractCegarLoop]: Abstraction has 61 states and 73 transitions. [2024-10-13 10:30:15,914 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 2.5) internal successors, (10), 5 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-13 10:30:15,914 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 73 transitions. [2024-10-13 10:30:15,914 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2024-10-13 10:30:15,915 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 10:30:15,915 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 10:30:15,919 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-13 10:30:16,115 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-13 10:30:16,115 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 22 more)] === [2024-10-13 10:30:16,116 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 10:30:16,116 INFO L85 PathProgramCache]: Analyzing trace with hash -1173759444, now seen corresponding path program 1 times [2024-10-13 10:30:16,116 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 10:30:16,116 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1905294826] [2024-10-13 10:30:16,116 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 10:30:16,116 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-13 10:30:16,116 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 10:30:16,117 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-13 10:30:16,118 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-13 10:30:16,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:30:16,165 INFO L255 TraceCheckSpWp]: Trace formula consists of 64 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-10-13 10:30:16,166 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 10:30:16,184 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-10-13 10:30:16,184 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-13 10:30:16,184 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 10:30:16,184 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1905294826] [2024-10-13 10:30:16,184 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1905294826] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 10:30:16,184 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 10:30:16,184 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-13 10:30:16,184 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1878485498] [2024-10-13 10:30:16,185 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 10:30:16,185 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-13 10:30:16,185 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 10:30:16,185 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-13 10:30:16,185 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-13 10:30:16,185 INFO L87 Difference]: Start difference. First operand 61 states and 73 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-13 10:30:16,283 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 10:30:16,283 INFO L93 Difference]: Finished difference Result 65 states and 77 transitions. [2024-10-13 10:30:16,283 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-13 10:30:16,283 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-13 10:30:16,283 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 10:30:16,284 INFO L225 Difference]: With dead ends: 65 [2024-10-13 10:30:16,284 INFO L226 Difference]: Without dead ends: 65 [2024-10-13 10:30:16,284 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-13 10:30:16,284 INFO L432 NwaCegarLoop]: 41 mSDtfsCounter, 2 mSDsluCounter, 56 mSDsCounter, 0 mSdLazyCounter, 64 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 97 SdHoareTripleChecker+Invalid, 64 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 64 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-13 10:30:16,284 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 97 Invalid, 64 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 64 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-13 10:30:16,285 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2024-10-13 10:30:16,286 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 63. [2024-10-13 10:30:16,286 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 63 states, 48 states have (on average 1.5625) internal successors, (75), 62 states have internal predecessors, (75), 0 states have call successors, (0), 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-13 10:30:16,286 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 75 transitions. [2024-10-13 10:30:16,286 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 75 transitions. Word has length 12 [2024-10-13 10:30:16,286 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 10:30:16,286 INFO L471 AbstractCegarLoop]: Abstraction has 63 states and 75 transitions. [2024-10-13 10:30:16,287 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-13 10:30:16,287 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 75 transitions. [2024-10-13 10:30:16,287 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2024-10-13 10:30:16,287 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 10:30:16,287 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 10:30:16,290 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-13 10:30:16,488 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-13 10:30:16,488 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 22 more)] === [2024-10-13 10:30:16,488 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 10:30:16,488 INFO L85 PathProgramCache]: Analyzing trace with hash -1172157391, now seen corresponding path program 1 times [2024-10-13 10:30:16,489 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 10:30:16,489 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [208708152] [2024-10-13 10:30:16,489 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 10:30:16,489 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-13 10:30:16,489 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 10:30:16,490 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-13 10:30:16,491 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-13 10:30:16,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:30:16,552 INFO L255 TraceCheckSpWp]: Trace formula consists of 82 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-10-13 10:30:16,553 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 10:30:16,594 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-10-13 10:30:16,594 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-13 10:30:16,632 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-10-13 10:30:16,632 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 10:30:16,632 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [208708152] [2024-10-13 10:30:16,632 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [208708152] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-13 10:30:16,632 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-13 10:30:16,632 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 8 [2024-10-13 10:30:16,632 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [934372114] [2024-10-13 10:30:16,632 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-13 10:30:16,632 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-13 10:30:16,632 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 10:30:16,633 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-13 10:30:16,633 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2024-10-13 10:30:16,633 INFO L87 Difference]: Start difference. First operand 63 states and 75 transitions. Second operand has 8 states, 8 states have (on average 2.75) internal successors, (22), 8 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 10:30:16,809 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 10:30:16,809 INFO L93 Difference]: Finished difference Result 66 states and 78 transitions. [2024-10-13 10:30:16,810 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-13 10:30:16,810 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.75) internal successors, (22), 8 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 12 [2024-10-13 10:30:16,810 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 10:30:16,810 INFO L225 Difference]: With dead ends: 66 [2024-10-13 10:30:16,810 INFO L226 Difference]: Without dead ends: 66 [2024-10-13 10:30:16,810 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2024-10-13 10:30:16,811 INFO L432 NwaCegarLoop]: 41 mSDtfsCounter, 0 mSDsluCounter, 129 mSDsCounter, 0 mSdLazyCounter, 159 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 170 SdHoareTripleChecker+Invalid, 159 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 159 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-13 10:30:16,811 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 170 Invalid, 159 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 159 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-13 10:30:16,811 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2024-10-13 10:30:16,812 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 66. [2024-10-13 10:30:16,812 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 66 states, 51 states have (on average 1.5294117647058822) internal successors, (78), 65 states have internal predecessors, (78), 0 states have call successors, (0), 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-13 10:30:16,813 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 78 transitions. [2024-10-13 10:30:16,813 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 78 transitions. Word has length 12 [2024-10-13 10:30:16,813 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 10:30:16,813 INFO L471 AbstractCegarLoop]: Abstraction has 66 states and 78 transitions. [2024-10-13 10:30:16,813 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 2.75) internal successors, (22), 8 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 10:30:16,813 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 78 transitions. [2024-10-13 10:30:16,813 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2024-10-13 10:30:16,813 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 10:30:16,813 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 10:30:16,819 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (14)] Ended with exit code 0 [2024-10-13 10:30:17,016 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-13 10:30:17,016 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 22 more)] === [2024-10-13 10:30:17,016 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 10:30:17,017 INFO L85 PathProgramCache]: Analyzing trace with hash -472694866, now seen corresponding path program 1 times [2024-10-13 10:30:17,017 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 10:30:17,017 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1590931729] [2024-10-13 10:30:17,017 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 10:30:17,017 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-13 10:30:17,017 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 10:30:17,018 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-13 10:30:17,019 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-13 10:30:17,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:30:17,064 INFO L255 TraceCheckSpWp]: Trace formula consists of 64 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-10-13 10:30:17,065 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 10:30:17,141 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 10:30:17,141 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-13 10:30:17,201 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 10:30:17,201 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 10:30:17,201 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1590931729] [2024-10-13 10:30:17,201 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1590931729] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-13 10:30:17,201 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-13 10:30:17,202 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6] total 11 [2024-10-13 10:30:17,202 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1836827104] [2024-10-13 10:30:17,202 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-13 10:30:17,202 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-10-13 10:30:17,202 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 10:30:17,203 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-10-13 10:30:17,203 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=73, Unknown=0, NotChecked=0, Total=110 [2024-10-13 10:30:17,203 INFO L87 Difference]: Start difference. First operand 66 states and 78 transitions. Second operand has 11 states, 11 states have (on average 1.7272727272727273) internal successors, (19), 11 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-13 10:30:17,377 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 10:30:17,377 INFO L93 Difference]: Finished difference Result 70 states and 81 transitions. [2024-10-13 10:30:17,378 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-10-13 10:30:17,378 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 1.7272727272727273) internal successors, (19), 11 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 12 [2024-10-13 10:30:17,378 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 10:30:17,378 INFO L225 Difference]: With dead ends: 70 [2024-10-13 10:30:17,378 INFO L226 Difference]: Without dead ends: 70 [2024-10-13 10:30:17,378 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=53, Invalid=103, Unknown=0, NotChecked=0, Total=156 [2024-10-13 10:30:17,379 INFO L432 NwaCegarLoop]: 24 mSDtfsCounter, 43 mSDsluCounter, 60 mSDsCounter, 0 mSdLazyCounter, 144 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 43 SdHoareTripleChecker+Valid, 84 SdHoareTripleChecker+Invalid, 152 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 144 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-13 10:30:17,379 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [43 Valid, 84 Invalid, 152 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 144 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-13 10:30:17,379 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2024-10-13 10:30:17,380 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 66. [2024-10-13 10:30:17,381 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 66 states, 51 states have (on average 1.5098039215686274) internal successors, (77), 65 states have internal predecessors, (77), 0 states have call successors, (0), 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-13 10:30:17,381 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 77 transitions. [2024-10-13 10:30:17,381 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 77 transitions. Word has length 12 [2024-10-13 10:30:17,381 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 10:30:17,381 INFO L471 AbstractCegarLoop]: Abstraction has 66 states and 77 transitions. [2024-10-13 10:30:17,381 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 1.7272727272727273) internal successors, (19), 11 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-13 10:30:17,381 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 77 transitions. [2024-10-13 10:30:17,381 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2024-10-13 10:30:17,381 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 10:30:17,381 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 10:30:17,384 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 (15)] Forceful destruction successful, exit code 0 [2024-10-13 10:30:17,582 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-13 10:30:17,582 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 22 more)] === [2024-10-13 10:30:17,582 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 10:30:17,583 INFO L85 PathProgramCache]: Analyzing trace with hash -471092813, now seen corresponding path program 1 times [2024-10-13 10:30:17,583 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 10:30:17,583 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1007428439] [2024-10-13 10:30:17,583 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 10:30:17,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-13 10:30:17,583 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 10:30:17,584 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-13 10:30:17,585 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-13 10:30:17,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:30:17,640 INFO L255 TraceCheckSpWp]: Trace formula consists of 82 conjuncts, 10 conjuncts are in the unsatisfiable core [2024-10-13 10:30:17,641 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 10:30:17,722 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 10:30:17,723 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-13 10:30:17,804 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 10:30:17,805 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 10:30:17,805 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1007428439] [2024-10-13 10:30:17,805 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1007428439] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-13 10:30:17,805 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-13 10:30:17,805 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7] total 13 [2024-10-13 10:30:17,805 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [499695615] [2024-10-13 10:30:17,805 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-13 10:30:17,805 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-10-13 10:30:17,805 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 10:30:17,806 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-10-13 10:30:17,806 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=119, Unknown=0, NotChecked=0, Total=156 [2024-10-13 10:30:17,806 INFO L87 Difference]: Start difference. First operand 66 states and 77 transitions. Second operand has 13 states, 13 states have (on average 1.6923076923076923) internal successors, (22), 13 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 10:30:18,111 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 10:30:18,111 INFO L93 Difference]: Finished difference Result 71 states and 82 transitions. [2024-10-13 10:30:18,112 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-10-13 10:30:18,112 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 1.6923076923076923) internal successors, (22), 13 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 12 [2024-10-13 10:30:18,112 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 10:30:18,112 INFO L225 Difference]: With dead ends: 71 [2024-10-13 10:30:18,112 INFO L226 Difference]: Without dead ends: 71 [2024-10-13 10:30:18,113 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=62, Invalid=178, Unknown=0, NotChecked=0, Total=240 [2024-10-13 10:30:18,113 INFO L432 NwaCegarLoop]: 39 mSDtfsCounter, 12 mSDsluCounter, 249 mSDsCounter, 0 mSdLazyCounter, 253 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 288 SdHoareTripleChecker+Invalid, 260 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 253 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-13 10:30:18,113 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 288 Invalid, 260 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 253 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-13 10:30:18,114 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2024-10-13 10:30:18,114 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 66. [2024-10-13 10:30:18,115 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 66 states, 51 states have (on average 1.5098039215686274) internal successors, (77), 65 states have internal predecessors, (77), 0 states have call successors, (0), 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-13 10:30:18,115 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 77 transitions. [2024-10-13 10:30:18,115 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 77 transitions. Word has length 12 [2024-10-13 10:30:18,115 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 10:30:18,115 INFO L471 AbstractCegarLoop]: Abstraction has 66 states and 77 transitions. [2024-10-13 10:30:18,115 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 1.6923076923076923) internal successors, (22), 13 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 10:30:18,115 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 77 transitions. [2024-10-13 10:30:18,115 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2024-10-13 10:30:18,115 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 10:30:18,115 INFO L215 NwaCegarLoop]: trace histogram [5, 4, 1, 1, 1, 1] [2024-10-13 10:30:18,119 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-13 10:30:18,316 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-13 10:30:18,316 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 22 more)] === [2024-10-13 10:30:18,317 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 10:30:18,317 INFO L85 PathProgramCache]: Analyzing trace with hash -1300382412, now seen corresponding path program 2 times [2024-10-13 10:30:18,318 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 10:30:18,318 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [547956530] [2024-10-13 10:30:18,318 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-10-13 10:30:18,318 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-13 10:30:18,318 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 10:30:18,319 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-13 10:30:18,319 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-13 10:30:18,366 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-10-13 10:30:18,366 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-13 10:30:18,368 INFO L255 TraceCheckSpWp]: Trace formula consists of 69 conjuncts, 14 conjuncts are in the unsatisfiable core [2024-10-13 10:30:18,369 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 10:30:18,381 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 8 treesize of output 7 [2024-10-13 10:30:18,577 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 10:30:18,577 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-13 10:30:19,099 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 10:30:19,099 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 10:30:19,099 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [547956530] [2024-10-13 10:30:19,099 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [547956530] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-13 10:30:19,099 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-13 10:30:19,099 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 15 [2024-10-13 10:30:19,099 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [780494006] [2024-10-13 10:30:19,099 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-13 10:30:19,100 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2024-10-13 10:30:19,100 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 10:30:19,100 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2024-10-13 10:30:19,100 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=172, Unknown=0, NotChecked=0, Total=240 [2024-10-13 10:30:19,100 INFO L87 Difference]: Start difference. First operand 66 states and 77 transitions. Second operand has 16 states, 15 states have (on average 1.6666666666666667) internal successors, (25), 16 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 10:30:21,085 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 10:30:21,086 INFO L93 Difference]: Finished difference Result 78 states and 95 transitions. [2024-10-13 10:30:21,086 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2024-10-13 10:30:21,086 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 15 states have (on average 1.6666666666666667) internal successors, (25), 16 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2024-10-13 10:30:21,087 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 10:30:21,087 INFO L225 Difference]: With dead ends: 78 [2024-10-13 10:30:21,087 INFO L226 Difference]: Without dead ends: 78 [2024-10-13 10:30:21,088 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 190 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=309, Invalid=621, Unknown=0, NotChecked=0, Total=930 [2024-10-13 10:30:21,088 INFO L432 NwaCegarLoop]: 43 mSDtfsCounter, 49 mSDsluCounter, 172 mSDsCounter, 0 mSdLazyCounter, 286 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 49 SdHoareTripleChecker+Valid, 215 SdHoareTripleChecker+Invalid, 289 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 286 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-10-13 10:30:21,088 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [49 Valid, 215 Invalid, 289 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 286 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-10-13 10:30:21,089 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2024-10-13 10:30:21,090 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 78. [2024-10-13 10:30:21,090 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 78 states, 63 states have (on average 1.507936507936508) internal successors, (95), 77 states have internal predecessors, (95), 0 states have call successors, (0), 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-13 10:30:21,090 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 95 transitions. [2024-10-13 10:30:21,091 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 95 transitions. Word has length 13 [2024-10-13 10:30:21,091 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 10:30:21,092 INFO L471 AbstractCegarLoop]: Abstraction has 78 states and 95 transitions. [2024-10-13 10:30:21,092 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 15 states have (on average 1.6666666666666667) internal successors, (25), 16 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 10:30:21,092 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 95 transitions. [2024-10-13 10:30:21,092 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2024-10-13 10:30:21,093 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 10:30:21,093 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 10:30:21,097 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-13 10:30:21,293 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-13 10:30:21,294 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 22 more)] === [2024-10-13 10:30:21,294 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 10:30:21,294 INFO L85 PathProgramCache]: Analyzing trace with hash 1793035091, now seen corresponding path program 2 times [2024-10-13 10:30:21,294 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 10:30:21,294 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1922706844] [2024-10-13 10:30:21,295 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-10-13 10:30:21,295 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-13 10:30:21,295 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 10:30:21,296 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-13 10:30:21,297 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-13 10:30:21,356 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-10-13 10:30:21,356 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-13 10:30:21,358 INFO L255 TraceCheckSpWp]: Trace formula consists of 94 conjuncts, 14 conjuncts are in the unsatisfiable core [2024-10-13 10:30:21,360 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 10:30:21,380 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-13 10:30:21,381 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 7 [2024-10-13 10:30:21,388 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2024-10-13 10:30:21,468 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-10-13 10:30:21,468 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-13 10:30:21,613 INFO L173 IndexEqualityManager]: detected equality via solver [2024-10-13 10:30:21,649 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-10-13 10:30:21,649 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 10:30:21,649 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1922706844] [2024-10-13 10:30:21,649 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1922706844] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-13 10:30:21,649 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-13 10:30:21,649 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 9 [2024-10-13 10:30:21,649 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [632243902] [2024-10-13 10:30:21,649 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-13 10:30:21,649 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-10-13 10:30:21,649 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 10:30:21,650 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-10-13 10:30:21,650 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2024-10-13 10:30:21,650 INFO L87 Difference]: Start difference. First operand 78 states and 95 transitions. Second operand has 10 states, 9 states have (on average 2.5555555555555554) internal successors, (23), 10 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 10:30:22,301 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 10:30:22,301 INFO L93 Difference]: Finished difference Result 98 states and 125 transitions. [2024-10-13 10:30:22,301 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-10-13 10:30:22,302 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 2.5555555555555554) internal successors, (23), 10 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 14 [2024-10-13 10:30:22,302 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 10:30:22,302 INFO L225 Difference]: With dead ends: 98 [2024-10-13 10:30:22,302 INFO L226 Difference]: Without dead ends: 98 [2024-10-13 10:30:22,302 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=54, Invalid=128, Unknown=0, NotChecked=0, Total=182 [2024-10-13 10:30:22,303 INFO L432 NwaCegarLoop]: 41 mSDtfsCounter, 25 mSDsluCounter, 134 mSDsCounter, 0 mSdLazyCounter, 277 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 175 SdHoareTripleChecker+Invalid, 286 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 277 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-10-13 10:30:22,303 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [25 Valid, 175 Invalid, 286 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 277 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-10-13 10:30:22,303 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2024-10-13 10:30:22,304 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 94. [2024-10-13 10:30:22,304 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 94 states, 80 states have (on average 1.55) internal successors, (124), 93 states have internal predecessors, (124), 0 states have call successors, (0), 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-13 10:30:22,304 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 124 transitions. [2024-10-13 10:30:22,305 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 124 transitions. Word has length 14 [2024-10-13 10:30:22,305 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 10:30:22,305 INFO L471 AbstractCegarLoop]: Abstraction has 94 states and 124 transitions. [2024-10-13 10:30:22,305 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 2.5555555555555554) internal successors, (23), 10 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 10:30:22,305 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 124 transitions. [2024-10-13 10:30:22,305 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2024-10-13 10:30:22,305 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 10:30:22,306 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 10:30:22,309 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-13 10:30:22,506 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-13 10:30:22,506 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 22 more)] === [2024-10-13 10:30:22,507 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 10:30:22,507 INFO L85 PathProgramCache]: Analyzing trace with hash -1658242851, now seen corresponding path program 1 times [2024-10-13 10:30:22,507 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 10:30:22,507 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [533571008] [2024-10-13 10:30:22,507 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 10:30:22,507 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-13 10:30:22,507 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 10:30:22,508 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-13 10:30:22,509 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (19)] Waiting until timeout for monitored process [2024-10-13 10:30:22,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:30:22,564 INFO L255 TraceCheckSpWp]: Trace formula consists of 86 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-10-13 10:30:22,565 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 10:30:22,590 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-10-13 10:30:22,590 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-13 10:30:22,591 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 10:30:22,591 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [533571008] [2024-10-13 10:30:22,591 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [533571008] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 10:30:22,591 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 10:30:22,591 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-13 10:30:22,591 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [859902220] [2024-10-13 10:30:22,591 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 10:30:22,591 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-13 10:30:22,591 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 10:30:22,591 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-13 10:30:22,592 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-10-13 10:30:22,592 INFO L87 Difference]: Start difference. First operand 94 states and 124 transitions. Second operand has 5 states, 5 states have (on average 3.0) internal successors, (15), 5 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 10:30:22,645 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 10:30:22,645 INFO L93 Difference]: Finished difference Result 108 states and 140 transitions. [2024-10-13 10:30:22,646 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-13 10:30:22,646 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.0) internal successors, (15), 5 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2024-10-13 10:30:22,646 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 10:30:22,646 INFO L225 Difference]: With dead ends: 108 [2024-10-13 10:30:22,646 INFO L226 Difference]: Without dead ends: 108 [2024-10-13 10:30:22,646 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-10-13 10:30:22,647 INFO L432 NwaCegarLoop]: 37 mSDtfsCounter, 9 mSDsluCounter, 73 mSDsCounter, 0 mSdLazyCounter, 62 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 110 SdHoareTripleChecker+Invalid, 62 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 62 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-13 10:30:22,647 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 110 Invalid, 62 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 62 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-13 10:30:22,647 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states. [2024-10-13 10:30:22,648 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 101. [2024-10-13 10:30:22,649 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 101 states, 87 states have (on average 1.5057471264367817) internal successors, (131), 100 states have internal predecessors, (131), 0 states have call successors, (0), 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-13 10:30:22,649 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 131 transitions. [2024-10-13 10:30:22,649 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 131 transitions. Word has length 15 [2024-10-13 10:30:22,649 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 10:30:22,649 INFO L471 AbstractCegarLoop]: Abstraction has 101 states and 131 transitions. [2024-10-13 10:30:22,649 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.0) internal successors, (15), 5 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 10:30:22,649 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 131 transitions. [2024-10-13 10:30:22,650 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2024-10-13 10:30:22,650 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 10:30:22,650 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 10:30:22,655 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (19)] Forceful destruction successful, exit code 0 [2024-10-13 10:30:22,850 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-13 10:30:22,851 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 22 more)] === [2024-10-13 10:30:22,851 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 10:30:22,851 INFO L85 PathProgramCache]: Analyzing trace with hash -250487048, now seen corresponding path program 1 times [2024-10-13 10:30:22,851 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 10:30:22,851 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1847837201] [2024-10-13 10:30:22,851 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 10:30:22,852 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-13 10:30:22,852 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 10:30:22,854 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-13 10:30:22,855 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-13 10:30:22,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:30:22,923 INFO L255 TraceCheckSpWp]: Trace formula consists of 104 conjuncts, 13 conjuncts are in the unsatisfiable core [2024-10-13 10:30:22,928 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 10:30:22,952 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 8 treesize of output 7 [2024-10-13 10:30:22,958 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-13 10:30:22,959 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 1 [2024-10-13 10:30:23,080 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-10-13 10:30:23,080 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-13 10:30:23,341 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-10-13 10:30:23,342 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 10:30:23,342 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1847837201] [2024-10-13 10:30:23,342 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1847837201] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-13 10:30:23,342 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-13 10:30:23,342 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 11 [2024-10-13 10:30:23,342 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1919984833] [2024-10-13 10:30:23,342 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-13 10:30:23,342 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-10-13 10:30:23,342 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 10:30:23,343 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-10-13 10:30:23,343 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=95, Unknown=0, NotChecked=0, Total=132 [2024-10-13 10:30:23,343 INFO L87 Difference]: Start difference. First operand 101 states and 131 transitions. Second operand has 12 states, 11 states have (on average 2.272727272727273) internal successors, (25), 12 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 10:30:24,114 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 10:30:24,114 INFO L93 Difference]: Finished difference Result 119 states and 151 transitions. [2024-10-13 10:30:24,114 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-10-13 10:30:24,114 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 2.272727272727273) internal successors, (25), 12 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2024-10-13 10:30:24,114 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 10:30:24,115 INFO L225 Difference]: With dead ends: 119 [2024-10-13 10:30:24,115 INFO L226 Difference]: Without dead ends: 119 [2024-10-13 10:30:24,115 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=63, Invalid=147, Unknown=0, NotChecked=0, Total=210 [2024-10-13 10:30:24,115 INFO L432 NwaCegarLoop]: 46 mSDtfsCounter, 22 mSDsluCounter, 124 mSDsCounter, 0 mSdLazyCounter, 311 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 170 SdHoareTripleChecker+Invalid, 317 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 311 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-10-13 10:30:24,115 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [22 Valid, 170 Invalid, 317 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 311 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-10-13 10:30:24,116 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2024-10-13 10:30:24,117 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 113. [2024-10-13 10:30:24,117 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 113 states, 99 states have (on average 1.5151515151515151) internal successors, (150), 112 states have internal predecessors, (150), 0 states have call successors, (0), 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-13 10:30:24,117 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 150 transitions. [2024-10-13 10:30:24,117 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 150 transitions. Word has length 15 [2024-10-13 10:30:24,117 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 10:30:24,118 INFO L471 AbstractCegarLoop]: Abstraction has 113 states and 150 transitions. [2024-10-13 10:30:24,118 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 2.272727272727273) internal successors, (25), 12 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 10:30:24,118 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 150 transitions. [2024-10-13 10:30:24,118 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2024-10-13 10:30:24,118 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 10:30:24,118 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 10:30:24,122 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-13 10:30:24,319 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-13 10:30:24,319 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 22 more)] === [2024-10-13 10:30:24,319 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 10:30:24,319 INFO L85 PathProgramCache]: Analyzing trace with hash 1625607195, now seen corresponding path program 1 times [2024-10-13 10:30:24,320 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 10:30:24,320 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [365959827] [2024-10-13 10:30:24,320 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 10:30:24,320 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-13 10:30:24,320 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 10:30:24,322 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-13 10:30:24,326 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-13 10:30:24,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:30:24,387 INFO L255 TraceCheckSpWp]: Trace formula consists of 86 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-10-13 10:30:24,388 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 10:30:24,452 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-10-13 10:30:24,452 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-13 10:30:24,517 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-10-13 10:30:24,517 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 10:30:24,517 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [365959827] [2024-10-13 10:30:24,517 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [365959827] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-13 10:30:24,517 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-13 10:30:24,517 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7] total 13 [2024-10-13 10:30:24,517 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1503613169] [2024-10-13 10:30:24,517 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-13 10:30:24,518 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-10-13 10:30:24,518 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 10:30:24,518 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-10-13 10:30:24,518 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=118, Unknown=0, NotChecked=0, Total=156 [2024-10-13 10:30:24,518 INFO L87 Difference]: Start difference. First operand 113 states and 150 transitions. Second operand has 13 states, 13 states have (on average 2.076923076923077) internal successors, (27), 13 states have internal predecessors, (27), 0 states have call successors, (0), 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-13 10:30:24,737 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 10:30:24,737 INFO L93 Difference]: Finished difference Result 122 states and 161 transitions. [2024-10-13 10:30:24,737 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-10-13 10:30:24,737 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 2.076923076923077) internal successors, (27), 13 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2024-10-13 10:30:24,738 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 10:30:24,738 INFO L225 Difference]: With dead ends: 122 [2024-10-13 10:30:24,738 INFO L226 Difference]: Without dead ends: 122 [2024-10-13 10:30:24,738 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=63, Invalid=177, Unknown=0, NotChecked=0, Total=240 [2024-10-13 10:30:24,739 INFO L432 NwaCegarLoop]: 36 mSDtfsCounter, 32 mSDsluCounter, 189 mSDsCounter, 0 mSdLazyCounter, 163 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 32 SdHoareTripleChecker+Valid, 225 SdHoareTripleChecker+Invalid, 166 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 163 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-13 10:30:24,739 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [32 Valid, 225 Invalid, 166 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 163 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-13 10:30:24,739 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122 states. [2024-10-13 10:30:24,740 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122 to 108. [2024-10-13 10:30:24,740 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 108 states, 94 states have (on average 1.5425531914893618) internal successors, (145), 107 states have internal predecessors, (145), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 10:30:24,741 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 145 transitions. [2024-10-13 10:30:24,741 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 145 transitions. Word has length 15 [2024-10-13 10:30:24,741 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 10:30:24,741 INFO L471 AbstractCegarLoop]: Abstraction has 108 states and 145 transitions. [2024-10-13 10:30:24,741 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 2.076923076923077) internal successors, (27), 13 states have internal predecessors, (27), 0 states have call successors, (0), 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-13 10:30:24,741 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 145 transitions. [2024-10-13 10:30:24,741 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2024-10-13 10:30:24,741 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 10:30:24,742 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 10:30:24,745 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-13 10:30:24,942 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-13 10:30:24,942 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr21REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 22 more)] === [2024-10-13 10:30:24,943 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 10:30:24,943 INFO L85 PathProgramCache]: Analyzing trace with hash 134063541, now seen corresponding path program 1 times [2024-10-13 10:30:24,943 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 10:30:24,943 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1083054881] [2024-10-13 10:30:24,943 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 10:30:24,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-13 10:30:24,943 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 10:30:24,944 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-13 10:30:24,945 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-13 10:30:25,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:30:25,002 INFO L255 TraceCheckSpWp]: Trace formula consists of 86 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-10-13 10:30:25,003 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 10:30:25,065 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-10-13 10:30:25,065 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-13 10:30:25,124 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 21 [2024-10-13 10:30:25,176 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-10-13 10:30:25,176 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 10:30:25,176 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1083054881] [2024-10-13 10:30:25,177 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1083054881] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-13 10:30:25,177 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-13 10:30:25,177 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 7 [2024-10-13 10:30:25,177 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [745391677] [2024-10-13 10:30:25,177 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-13 10:30:25,177 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-13 10:30:25,177 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 10:30:25,177 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-13 10:30:25,177 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2024-10-13 10:30:25,177 INFO L87 Difference]: Start difference. First operand 108 states and 145 transitions. Second operand has 8 states, 7 states have (on average 3.7142857142857144) internal successors, (26), 8 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-13 10:30:25,526 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 10:30:25,526 INFO L93 Difference]: Finished difference Result 133 states and 179 transitions. [2024-10-13 10:30:25,526 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-13 10:30:25,527 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 3.7142857142857144) internal successors, (26), 8 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 16 [2024-10-13 10:30:25,527 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 10:30:25,527 INFO L225 Difference]: With dead ends: 133 [2024-10-13 10:30:25,527 INFO L226 Difference]: Without dead ends: 133 [2024-10-13 10:30:25,527 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=34, Invalid=56, Unknown=0, NotChecked=0, Total=90 [2024-10-13 10:30:25,528 INFO L432 NwaCegarLoop]: 26 mSDtfsCounter, 166 mSDsluCounter, 63 mSDsCounter, 0 mSdLazyCounter, 180 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 166 SdHoareTripleChecker+Valid, 89 SdHoareTripleChecker+Invalid, 196 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 180 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-13 10:30:25,528 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [166 Valid, 89 Invalid, 196 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 180 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-13 10:30:25,529 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133 states. [2024-10-13 10:30:25,533 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133 to 110. [2024-10-13 10:30:25,533 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 110 states, 96 states have (on average 1.5416666666666667) internal successors, (148), 109 states have internal predecessors, (148), 0 states have call successors, (0), 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-13 10:30:25,533 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 148 transitions. [2024-10-13 10:30:25,533 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 148 transitions. Word has length 16 [2024-10-13 10:30:25,533 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 10:30:25,533 INFO L471 AbstractCegarLoop]: Abstraction has 110 states and 148 transitions. [2024-10-13 10:30:25,533 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 3.7142857142857144) internal successors, (26), 8 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-13 10:30:25,533 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 148 transitions. [2024-10-13 10:30:25,534 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2024-10-13 10:30:25,534 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 10:30:25,534 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 10:30:25,537 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (22)] Forceful destruction successful, exit code 0 [2024-10-13 10:30:25,734 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 22 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-13 10:30:25,734 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 22 more)] === [2024-10-13 10:30:25,735 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 10:30:25,735 INFO L85 PathProgramCache]: Analyzing trace with hash -138998380, now seen corresponding path program 1 times [2024-10-13 10:30:25,735 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 10:30:25,735 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1086213596] [2024-10-13 10:30:25,735 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 10:30:25,735 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-13 10:30:25,735 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 10:30:25,736 INFO L229 MonitoredProcess]: Starting monitored process 23 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-13 10:30:25,737 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (23)] Waiting until timeout for monitored process [2024-10-13 10:30:25,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:30:25,796 INFO L255 TraceCheckSpWp]: Trace formula consists of 91 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-10-13 10:30:25,796 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 10:30:25,818 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-10-13 10:30:25,818 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-13 10:30:25,818 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 10:30:25,819 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1086213596] [2024-10-13 10:30:25,819 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1086213596] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 10:30:25,819 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 10:30:25,819 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-13 10:30:25,819 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [731689225] [2024-10-13 10:30:25,819 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 10:30:25,819 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-13 10:30:25,819 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 10:30:25,819 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-13 10:30:25,819 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-10-13 10:30:25,819 INFO L87 Difference]: Start difference. First operand 110 states and 148 transitions. Second operand has 5 states, 5 states have (on average 3.4) internal successors, (17), 5 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-13 10:30:25,933 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 10:30:25,933 INFO L93 Difference]: Finished difference Result 129 states and 170 transitions. [2024-10-13 10:30:25,935 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-13 10:30:25,935 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.4) internal successors, (17), 5 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-13 10:30:25,935 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 10:30:25,936 INFO L225 Difference]: With dead ends: 129 [2024-10-13 10:30:25,936 INFO L226 Difference]: Without dead ends: 129 [2024-10-13 10:30:25,936 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-10-13 10:30:25,937 INFO L432 NwaCegarLoop]: 35 mSDtfsCounter, 15 mSDsluCounter, 88 mSDsCounter, 0 mSdLazyCounter, 97 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 123 SdHoareTripleChecker+Invalid, 98 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 97 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-13 10:30:25,937 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 123 Invalid, 98 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 97 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-13 10:30:25,938 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 129 states. [2024-10-13 10:30:25,939 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 129 to 119. [2024-10-13 10:30:25,939 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 119 states, 105 states have (on average 1.4952380952380953) internal successors, (157), 118 states have internal predecessors, (157), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 10:30:25,940 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 157 transitions. [2024-10-13 10:30:25,940 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 157 transitions. Word has length 17 [2024-10-13 10:30:25,940 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 10:30:25,940 INFO L471 AbstractCegarLoop]: Abstraction has 119 states and 157 transitions. [2024-10-13 10:30:25,940 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.4) internal successors, (17), 5 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-13 10:30:25,940 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 157 transitions. [2024-10-13 10:30:25,940 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2024-10-13 10:30:25,940 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 10:30:25,940 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 10:30:25,945 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (23)] Forceful destruction successful, exit code 0 [2024-10-13 10:30:26,140 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 23 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-13 10:30:26,141 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 22 more)] === [2024-10-13 10:30:26,141 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 10:30:26,141 INFO L85 PathProgramCache]: Analyzing trace with hash -201388421, now seen corresponding path program 2 times [2024-10-13 10:30:26,141 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 10:30:26,141 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1459670549] [2024-10-13 10:30:26,141 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-10-13 10:30:26,141 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-13 10:30:26,142 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 10:30:26,142 INFO L229 MonitoredProcess]: Starting monitored process 24 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-13 10:30:26,143 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (24)] Waiting until timeout for monitored process [2024-10-13 10:30:26,199 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2024-10-13 10:30:26,199 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-13 10:30:26,202 INFO L255 TraceCheckSpWp]: Trace formula consists of 52 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-10-13 10:30:26,203 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 10:30:26,210 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2024-10-13 10:30:26,240 INFO L349 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2024-10-13 10:30:26,240 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 27 [2024-10-13 10:30:26,267 INFO L349 Elim1Store]: treesize reduction 42, result has 22.2 percent of original size [2024-10-13 10:30:26,267 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 24 treesize of output 27 [2024-10-13 10:30:26,393 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2024-10-13 10:30:26,393 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-13 10:30:26,394 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 10:30:26,394 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1459670549] [2024-10-13 10:30:26,394 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1459670549] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 10:30:26,394 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 10:30:26,394 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-13 10:30:26,394 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1907332600] [2024-10-13 10:30:26,394 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 10:30:26,394 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-13 10:30:26,394 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 10:30:26,395 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-13 10:30:26,395 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-13 10:30:26,395 INFO L87 Difference]: Start difference. First operand 119 states and 157 transitions. Second operand has 4 states, 3 states have (on average 5.0) internal successors, (15), 4 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 10:30:26,472 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 10:30:26,472 INFO L93 Difference]: Finished difference Result 117 states and 151 transitions. [2024-10-13 10:30:26,473 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-13 10:30:26,473 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 5.0) internal successors, (15), 4 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2024-10-13 10:30:26,473 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 10:30:26,473 INFO L225 Difference]: With dead ends: 117 [2024-10-13 10:30:26,473 INFO L226 Difference]: Without dead ends: 117 [2024-10-13 10:30:26,473 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-13 10:30:26,474 INFO L432 NwaCegarLoop]: 33 mSDtfsCounter, 31 mSDsluCounter, 33 mSDsCounter, 0 mSdLazyCounter, 44 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 66 SdHoareTripleChecker+Invalid, 45 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 44 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-13 10:30:26,474 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [31 Valid, 66 Invalid, 45 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 44 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-13 10:30:26,474 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states. [2024-10-13 10:30:26,475 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 117. [2024-10-13 10:30:26,475 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 117 states, 105 states have (on average 1.438095238095238) internal successors, (151), 116 states have internal predecessors, (151), 0 states have call successors, (0), 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-13 10:30:26,476 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 151 transitions. [2024-10-13 10:30:26,476 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 151 transitions. Word has length 17 [2024-10-13 10:30:26,476 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 10:30:26,476 INFO L471 AbstractCegarLoop]: Abstraction has 117 states and 151 transitions. [2024-10-13 10:30:26,476 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 5.0) internal successors, (15), 4 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 10:30:26,476 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 151 transitions. [2024-10-13 10:30:26,477 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2024-10-13 10:30:26,477 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 10:30:26,477 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 10:30:26,480 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (24)] Forceful destruction successful, exit code 0 [2024-10-13 10:30:26,680 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 24 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-13 10:30:26,680 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 22 more)] === [2024-10-13 10:30:26,680 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 10:30:26,680 INFO L85 PathProgramCache]: Analyzing trace with hash -201388420, now seen corresponding path program 1 times [2024-10-13 10:30:26,680 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 10:30:26,680 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1870607160] [2024-10-13 10:30:26,680 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 10:30:26,681 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-13 10:30:26,681 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 10:30:26,682 INFO L229 MonitoredProcess]: Starting monitored process 25 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-13 10:30:26,683 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (25)] Waiting until timeout for monitored process [2024-10-13 10:30:26,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:30:26,745 INFO L255 TraceCheckSpWp]: Trace formula consists of 98 conjuncts, 16 conjuncts are in the unsatisfiable core [2024-10-13 10:30:26,746 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 10:30:26,753 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 8 treesize of output 7 [2024-10-13 10:30:26,816 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2024-10-13 10:30:26,895 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 10:30:26,895 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-13 10:30:27,075 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 10:30:27,075 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 10:30:27,075 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1870607160] [2024-10-13 10:30:27,076 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1870607160] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-13 10:30:27,076 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-13 10:30:27,076 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 16 [2024-10-13 10:30:27,076 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1104075015] [2024-10-13 10:30:27,076 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-13 10:30:27,076 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2024-10-13 10:30:27,076 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 10:30:27,076 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2024-10-13 10:30:27,076 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=184, Unknown=0, NotChecked=0, Total=240 [2024-10-13 10:30:27,077 INFO L87 Difference]: Start difference. First operand 117 states and 151 transitions. Second operand has 16 states, 16 states have (on average 1.8125) internal successors, (29), 16 states have internal predecessors, (29), 0 states have call successors, (0), 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-13 10:30:27,502 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 10:30:27,502 INFO L93 Difference]: Finished difference Result 124 states and 157 transitions. [2024-10-13 10:30:27,502 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-10-13 10:30:27,503 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 1.8125) internal successors, (29), 16 states have internal predecessors, (29), 0 states have call successors, (0), 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-13 10:30:27,503 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 10:30:27,503 INFO L225 Difference]: With dead ends: 124 [2024-10-13 10:30:27,503 INFO L226 Difference]: Without dead ends: 124 [2024-10-13 10:30:27,503 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 61 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=88, Invalid=292, Unknown=0, NotChecked=0, Total=380 [2024-10-13 10:30:27,504 INFO L432 NwaCegarLoop]: 23 mSDtfsCounter, 40 mSDsluCounter, 123 mSDsCounter, 0 mSdLazyCounter, 337 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 40 SdHoareTripleChecker+Valid, 146 SdHoareTripleChecker+Invalid, 345 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 337 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-13 10:30:27,504 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [40 Valid, 146 Invalid, 345 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 337 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-13 10:30:27,504 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 124 states. [2024-10-13 10:30:27,505 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 124 to 117. [2024-10-13 10:30:27,505 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 117 states, 105 states have (on average 1.4285714285714286) internal successors, (150), 116 states have internal predecessors, (150), 0 states have call successors, (0), 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-13 10:30:27,506 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 150 transitions. [2024-10-13 10:30:27,506 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 150 transitions. Word has length 17 [2024-10-13 10:30:27,506 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 10:30:27,506 INFO L471 AbstractCegarLoop]: Abstraction has 117 states and 150 transitions. [2024-10-13 10:30:27,506 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 1.8125) internal successors, (29), 16 states have internal predecessors, (29), 0 states have call successors, (0), 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-13 10:30:27,506 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 150 transitions. [2024-10-13 10:30:27,506 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2024-10-13 10:30:27,506 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 10:30:27,506 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 10:30:27,509 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (25)] Forceful destruction successful, exit code 0 [2024-10-13 10:30:27,706 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 25 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-13 10:30:27,707 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 22 more)] === [2024-10-13 10:30:27,707 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 10:30:27,707 INFO L85 PathProgramCache]: Analyzing trace with hash -1160066734, now seen corresponding path program 1 times [2024-10-13 10:30:27,707 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 10:30:27,707 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1737216653] [2024-10-13 10:30:27,707 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 10:30:27,708 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-13 10:30:27,708 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 10:30:27,709 INFO L229 MonitoredProcess]: Starting monitored process 26 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-13 10:30:27,709 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (26)] Waiting until timeout for monitored process [2024-10-13 10:30:27,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:30:27,770 INFO L255 TraceCheckSpWp]: Trace formula consists of 91 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-10-13 10:30:27,771 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 10:30:27,838 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-10-13 10:30:27,838 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-13 10:30:27,906 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-10-13 10:30:27,906 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 10:30:27,906 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1737216653] [2024-10-13 10:30:27,906 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1737216653] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-13 10:30:27,906 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-13 10:30:27,906 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7] total 13 [2024-10-13 10:30:27,906 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1488102505] [2024-10-13 10:30:27,906 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-13 10:30:27,906 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-10-13 10:30:27,906 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 10:30:27,907 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-10-13 10:30:27,907 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=112, Unknown=0, NotChecked=0, Total=156 [2024-10-13 10:30:27,907 INFO L87 Difference]: Start difference. First operand 117 states and 150 transitions. Second operand has 13 states, 13 states have (on average 2.3846153846153846) internal successors, (31), 13 states have internal predecessors, (31), 0 states have call successors, (0), 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-13 10:30:28,156 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 10:30:28,156 INFO L93 Difference]: Finished difference Result 129 states and 164 transitions. [2024-10-13 10:30:28,157 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-10-13 10:30:28,157 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 2.3846153846153846) internal successors, (31), 13 states have internal predecessors, (31), 0 states have call successors, (0), 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-13 10:30:28,157 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 10:30:28,158 INFO L225 Difference]: With dead ends: 129 [2024-10-13 10:30:28,158 INFO L226 Difference]: Without dead ends: 129 [2024-10-13 10:30:28,158 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=72, Invalid=200, Unknown=0, NotChecked=0, Total=272 [2024-10-13 10:30:28,158 INFO L432 NwaCegarLoop]: 17 mSDtfsCounter, 98 mSDsluCounter, 65 mSDsCounter, 0 mSdLazyCounter, 214 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 98 SdHoareTripleChecker+Valid, 82 SdHoareTripleChecker+Invalid, 223 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 214 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-13 10:30:28,158 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [98 Valid, 82 Invalid, 223 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 214 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-13 10:30:28,159 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 129 states. [2024-10-13 10:30:28,160 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 129 to 108. [2024-10-13 10:30:28,160 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 108 states, 96 states have (on average 1.4583333333333333) internal successors, (140), 107 states have internal predecessors, (140), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 10:30:28,160 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 140 transitions. [2024-10-13 10:30:28,160 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 140 transitions. Word has length 17 [2024-10-13 10:30:28,160 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 10:30:28,160 INFO L471 AbstractCegarLoop]: Abstraction has 108 states and 140 transitions. [2024-10-13 10:30:28,160 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 2.3846153846153846) internal successors, (31), 13 states have internal predecessors, (31), 0 states have call successors, (0), 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-13 10:30:28,160 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 140 transitions. [2024-10-13 10:30:28,160 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2024-10-13 10:30:28,161 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 10:30:28,161 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 10:30:28,164 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (26)] Ended with exit code 0 [2024-10-13 10:30:28,361 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 26 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-13 10:30:28,361 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr21REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 22 more)] === [2024-10-13 10:30:28,361 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 10:30:28,361 INFO L85 PathProgramCache]: Analyzing trace with hash -524729864, now seen corresponding path program 1 times [2024-10-13 10:30:28,362 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 10:30:28,362 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2024848875] [2024-10-13 10:30:28,362 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 10:30:28,362 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-13 10:30:28,362 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 10:30:28,374 INFO L229 MonitoredProcess]: Starting monitored process 27 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-13 10:30:28,375 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (27)] Waiting until timeout for monitored process [2024-10-13 10:30:28,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:30:28,438 INFO L255 TraceCheckSpWp]: Trace formula consists of 94 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-10-13 10:30:28,439 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 10:30:28,476 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-10-13 10:30:28,476 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-13 10:30:28,521 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-10-13 10:30:28,522 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 10:30:28,522 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2024848875] [2024-10-13 10:30:28,522 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2024848875] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-13 10:30:28,522 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-13 10:30:28,522 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 10 [2024-10-13 10:30:28,522 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1744309248] [2024-10-13 10:30:28,522 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-13 10:30:28,522 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-10-13 10:30:28,522 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 10:30:28,522 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-10-13 10:30:28,523 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2024-10-13 10:30:28,523 INFO L87 Difference]: Start difference. First operand 108 states and 140 transitions. Second operand has 10 states, 10 states have (on average 3.8) internal successors, (38), 10 states have internal predecessors, (38), 0 states have call successors, (0), 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-13 10:30:28,665 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 10:30:28,665 INFO L93 Difference]: Finished difference Result 122 states and 155 transitions. [2024-10-13 10:30:28,666 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-13 10:30:28,666 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 3.8) internal successors, (38), 10 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 20 [2024-10-13 10:30:28,666 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 10:30:28,667 INFO L225 Difference]: With dead ends: 122 [2024-10-13 10:30:28,667 INFO L226 Difference]: Without dead ends: 122 [2024-10-13 10:30:28,667 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2024-10-13 10:30:28,667 INFO L432 NwaCegarLoop]: 32 mSDtfsCounter, 10 mSDsluCounter, 173 mSDsCounter, 0 mSdLazyCounter, 204 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 205 SdHoareTripleChecker+Invalid, 208 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 204 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-13 10:30:28,667 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 205 Invalid, 208 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 204 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-13 10:30:28,668 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122 states. [2024-10-13 10:30:28,669 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122 to 122. [2024-10-13 10:30:28,669 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 122 states, 110 states have (on average 1.4090909090909092) internal successors, (155), 121 states have internal predecessors, (155), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 10:30:28,670 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 155 transitions. [2024-10-13 10:30:28,670 INFO L78 Accepts]: Start accepts. Automaton has 122 states and 155 transitions. Word has length 20 [2024-10-13 10:30:28,670 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 10:30:28,670 INFO L471 AbstractCegarLoop]: Abstraction has 122 states and 155 transitions. [2024-10-13 10:30:28,670 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 3.8) internal successors, (38), 10 states have internal predecessors, (38), 0 states have call successors, (0), 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-13 10:30:28,670 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 155 transitions. [2024-10-13 10:30:28,670 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2024-10-13 10:30:28,670 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 10:30:28,670 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 10:30:28,674 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 (27)] Forceful destruction successful, exit code 0 [2024-10-13 10:30:28,870 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 27 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-13 10:30:28,871 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 22 more)] === [2024-10-13 10:30:28,871 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 10:30:28,871 INFO L85 PathProgramCache]: Analyzing trace with hash 987459119, now seen corresponding path program 2 times [2024-10-13 10:30:28,871 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 10:30:28,871 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [764984517] [2024-10-13 10:30:28,871 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-10-13 10:30:28,871 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-13 10:30:28,871 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 10:30:28,872 INFO L229 MonitoredProcess]: Starting monitored process 28 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-13 10:30:28,874 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (28)] Waiting until timeout for monitored process [2024-10-13 10:30:28,925 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2024-10-13 10:30:28,925 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-13 10:30:28,929 INFO L255 TraceCheckSpWp]: Trace formula consists of 52 conjuncts, 21 conjuncts are in the unsatisfiable core [2024-10-13 10:30:28,931 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 10:30:28,944 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-13 10:30:28,947 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2024-10-13 10:30:29,020 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-13 10:30:29,029 INFO L349 Elim1Store]: treesize reduction 17, result has 22.7 percent of original size [2024-10-13 10:30:29,029 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 21 treesize of output 18 [2024-10-13 10:30:29,040 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2024-10-13 10:30:29,040 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 13 [2024-10-13 10:30:29,047 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-13 10:30:29,048 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 16 treesize of output 18 [2024-10-13 10:30:29,055 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2024-10-13 10:30:29,055 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-13 10:30:29,426 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2024-10-13 10:30:29,426 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-13 10:30:29,426 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 10:30:29,426 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [764984517] [2024-10-13 10:30:29,426 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [764984517] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 10:30:29,426 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 10:30:29,426 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-13 10:30:29,426 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1323450189] [2024-10-13 10:30:29,426 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 10:30:29,427 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-13 10:30:29,427 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 10:30:29,427 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-13 10:30:29,427 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-10-13 10:30:29,427 INFO L87 Difference]: Start difference. First operand 122 states and 155 transitions. Second operand has 7 states, 6 states have (on average 2.5) internal successors, (15), 7 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 10:30:29,834 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 10:30:29,834 INFO L93 Difference]: Finished difference Result 157 states and 209 transitions. [2024-10-13 10:30:29,834 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-13 10:30:29,835 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 2.5) internal successors, (15), 7 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 20 [2024-10-13 10:30:29,835 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 10:30:29,835 INFO L225 Difference]: With dead ends: 157 [2024-10-13 10:30:29,835 INFO L226 Difference]: Without dead ends: 157 [2024-10-13 10:30:29,835 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2024-10-13 10:30:29,836 INFO L432 NwaCegarLoop]: 13 mSDtfsCounter, 87 mSDsluCounter, 41 mSDsCounter, 0 mSdLazyCounter, 189 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 87 SdHoareTripleChecker+Valid, 54 SdHoareTripleChecker+Invalid, 190 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 189 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-13 10:30:29,836 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [87 Valid, 54 Invalid, 190 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 189 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-13 10:30:29,836 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 157 states. [2024-10-13 10:30:29,837 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 157 to 154. [2024-10-13 10:30:29,838 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 154 states, 142 states have (on average 1.4647887323943662) internal successors, (208), 153 states have internal predecessors, (208), 0 states have call successors, (0), 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-13 10:30:29,838 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 154 states to 154 states and 208 transitions. [2024-10-13 10:30:29,838 INFO L78 Accepts]: Start accepts. Automaton has 154 states and 208 transitions. Word has length 20 [2024-10-13 10:30:29,838 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 10:30:29,838 INFO L471 AbstractCegarLoop]: Abstraction has 154 states and 208 transitions. [2024-10-13 10:30:29,838 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 2.5) internal successors, (15), 7 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 10:30:29,838 INFO L276 IsEmpty]: Start isEmpty. Operand 154 states and 208 transitions. [2024-10-13 10:30:29,838 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2024-10-13 10:30:29,838 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 10:30:29,839 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 10:30:29,842 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 (28)] Forceful destruction successful, exit code 0 [2024-10-13 10:30:30,039 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 28 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-13 10:30:30,039 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr21REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 22 more)] === [2024-10-13 10:30:30,039 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 10:30:30,039 INFO L85 PathProgramCache]: Analyzing trace with hash 2081293690, now seen corresponding path program 1 times [2024-10-13 10:30:30,040 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 10:30:30,040 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2010996809] [2024-10-13 10:30:30,040 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 10:30:30,040 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-13 10:30:30,040 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 10:30:30,041 INFO L229 MonitoredProcess]: Starting monitored process 29 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-13 10:30:30,042 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (29)] Waiting until timeout for monitored process [2024-10-13 10:30:30,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:30:30,108 INFO L255 TraceCheckSpWp]: Trace formula consists of 94 conjuncts, 10 conjuncts are in the unsatisfiable core [2024-10-13 10:30:30,108 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 10:30:30,190 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-10-13 10:30:30,190 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-13 10:30:30,277 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-10-13 10:30:30,278 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 10:30:30,278 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2010996809] [2024-10-13 10:30:30,278 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2010996809] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-13 10:30:30,278 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-13 10:30:30,278 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8] total 15 [2024-10-13 10:30:30,278 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [960475459] [2024-10-13 10:30:30,278 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-13 10:30:30,278 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2024-10-13 10:30:30,278 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 10:30:30,278 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2024-10-13 10:30:30,279 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=164, Unknown=0, NotChecked=0, Total=210 [2024-10-13 10:30:30,279 INFO L87 Difference]: Start difference. First operand 154 states and 208 transitions. Second operand has 15 states, 15 states have (on average 2.533333333333333) internal successors, (38), 15 states have internal predecessors, (38), 0 states have call successors, (0), 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-13 10:30:30,556 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 10:30:30,556 INFO L93 Difference]: Finished difference Result 161 states and 216 transitions. [2024-10-13 10:30:30,557 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-10-13 10:30:30,557 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 2.533333333333333) internal successors, (38), 15 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 20 [2024-10-13 10:30:30,557 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 10:30:30,557 INFO L225 Difference]: With dead ends: 161 [2024-10-13 10:30:30,557 INFO L226 Difference]: Without dead ends: 161 [2024-10-13 10:30:30,558 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 62 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=71, Invalid=235, Unknown=0, NotChecked=0, Total=306 [2024-10-13 10:30:30,558 INFO L432 NwaCegarLoop]: 31 mSDtfsCounter, 15 mSDsluCounter, 224 mSDsCounter, 0 mSdLazyCounter, 266 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 255 SdHoareTripleChecker+Invalid, 275 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 266 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-13 10:30:30,558 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 255 Invalid, 275 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 266 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-13 10:30:30,559 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 161 states. [2024-10-13 10:30:30,560 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 161 to 147. [2024-10-13 10:30:30,560 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 147 states, 135 states have (on average 1.488888888888889) internal successors, (201), 146 states have internal predecessors, (201), 0 states have call successors, (0), 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-13 10:30:30,560 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 147 states to 147 states and 201 transitions. [2024-10-13 10:30:30,560 INFO L78 Accepts]: Start accepts. Automaton has 147 states and 201 transitions. Word has length 20 [2024-10-13 10:30:30,560 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 10:30:30,561 INFO L471 AbstractCegarLoop]: Abstraction has 147 states and 201 transitions. [2024-10-13 10:30:30,561 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 2.533333333333333) internal successors, (38), 15 states have internal predecessors, (38), 0 states have call successors, (0), 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-13 10:30:30,561 INFO L276 IsEmpty]: Start isEmpty. Operand 147 states and 201 transitions. [2024-10-13 10:30:30,561 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2024-10-13 10:30:30,561 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 10:30:30,561 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 10:30:30,565 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 (29)] Forceful destruction successful, exit code 0 [2024-10-13 10:30:30,761 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 29 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-13 10:30:30,761 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 22 more)] === [2024-10-13 10:30:30,762 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 10:30:30,762 INFO L85 PathProgramCache]: Analyzing trace with hash 913242545, now seen corresponding path program 1 times [2024-10-13 10:30:30,762 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 10:30:30,762 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1676911569] [2024-10-13 10:30:30,762 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 10:30:30,762 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-13 10:30:30,762 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 10:30:30,763 INFO L229 MonitoredProcess]: Starting monitored process 30 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-13 10:30:30,764 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (30)] Waiting until timeout for monitored process [2024-10-13 10:30:30,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:30:30,839 INFO L255 TraceCheckSpWp]: Trace formula consists of 99 conjuncts, 16 conjuncts are in the unsatisfiable core [2024-10-13 10:30:30,840 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 10:30:30,857 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-13 10:30:30,858 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-13 10:30:30,859 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-13 10:30:30,859 INFO L173 IndexEqualityManager]: detected equality via solver [2024-10-13 10:30:30,859 INFO L173 IndexEqualityManager]: detected equality via solver [2024-10-13 10:30:30,864 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 7 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 33 [2024-10-13 10:30:30,978 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-13 10:30:30,979 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 58 treesize of output 26 [2024-10-13 10:30:30,987 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-10-13 10:30:30,987 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-13 10:30:31,042 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 171 treesize of output 163 [2024-10-13 10:30:31,272 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-13 10:30:31,280 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 115946974 treesize of output 112276958 [2024-10-13 10:30:32,671 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-10-13 10:30:32,672 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 10:30:32,672 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1676911569] [2024-10-13 10:30:32,672 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1676911569] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-13 10:30:32,672 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-13 10:30:32,672 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 10 [2024-10-13 10:30:32,672 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [405441228] [2024-10-13 10:30:32,672 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-13 10:30:32,672 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-10-13 10:30:32,672 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 10:30:32,673 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-10-13 10:30:32,673 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2024-10-13 10:30:32,673 INFO L87 Difference]: Start difference. First operand 147 states and 201 transitions. Second operand has 10 states, 10 states have (on average 3.2) internal successors, (32), 10 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 10:30:33,191 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 10:30:33,192 INFO L93 Difference]: Finished difference Result 174 states and 241 transitions. [2024-10-13 10:30:33,192 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-13 10:30:33,192 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 3.2) internal successors, (32), 10 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 21 [2024-10-13 10:30:33,192 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 10:30:33,193 INFO L225 Difference]: With dead ends: 174 [2024-10-13 10:30:33,193 INFO L226 Difference]: Without dead ends: 174 [2024-10-13 10:30:33,193 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=42, Invalid=90, Unknown=0, NotChecked=0, Total=132 [2024-10-13 10:30:33,193 INFO L432 NwaCegarLoop]: 31 mSDtfsCounter, 23 mSDsluCounter, 120 mSDsCounter, 0 mSdLazyCounter, 198 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 151 SdHoareTripleChecker+Invalid, 202 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 198 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-10-13 10:30:33,194 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [23 Valid, 151 Invalid, 202 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 198 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-10-13 10:30:33,194 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 174 states. [2024-10-13 10:30:33,195 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 174 to 168. [2024-10-13 10:30:33,196 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 168 states, 156 states have (on average 1.5) internal successors, (234), 167 states have internal predecessors, (234), 0 states have call successors, (0), 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-13 10:30:33,196 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 168 states to 168 states and 234 transitions. [2024-10-13 10:30:33,196 INFO L78 Accepts]: Start accepts. Automaton has 168 states and 234 transitions. Word has length 21 [2024-10-13 10:30:33,196 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 10:30:33,196 INFO L471 AbstractCegarLoop]: Abstraction has 168 states and 234 transitions. [2024-10-13 10:30:33,196 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 3.2) internal successors, (32), 10 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 10:30:33,196 INFO L276 IsEmpty]: Start isEmpty. Operand 168 states and 234 transitions. [2024-10-13 10:30:33,196 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2024-10-13 10:30:33,196 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 10:30:33,196 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 10:30:33,200 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 (30)] Ended with exit code 0 [2024-10-13 10:30:33,397 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 30 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -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-13 10:30:33,397 INFO L396 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 22 more)] === [2024-10-13 10:30:33,397 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 10:30:33,397 INFO L85 PathProgramCache]: Analyzing trace with hash 546461624, now seen corresponding path program 1 times [2024-10-13 10:30:33,398 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 10:30:33,398 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [6114929] [2024-10-13 10:30:33,398 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 10:30:33,398 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-13 10:30:33,398 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 10:30:33,399 INFO L229 MonitoredProcess]: Starting monitored process 31 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-13 10:30:33,399 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 (31)] Waiting until timeout for monitored process [2024-10-13 10:30:33,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:30:33,485 INFO L255 TraceCheckSpWp]: Trace formula consists of 125 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-10-13 10:30:33,486 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 10:30:33,533 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2024-10-13 10:30:33,533 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-13 10:30:33,533 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 10:30:33,533 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [6114929] [2024-10-13 10:30:33,533 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [6114929] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 10:30:33,533 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 10:30:33,533 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-13 10:30:33,533 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1424694096] [2024-10-13 10:30:33,534 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 10:30:33,534 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-13 10:30:33,534 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 10:30:33,534 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-13 10:30:33,534 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-10-13 10:30:33,534 INFO L87 Difference]: Start difference. First operand 168 states and 234 transitions. Second operand has 7 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 7 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 10:30:33,717 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 10:30:33,717 INFO L93 Difference]: Finished difference Result 191 states and 261 transitions. [2024-10-13 10:30:33,718 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-13 10:30:33,718 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 7 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 21 [2024-10-13 10:30:33,718 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 10:30:33,719 INFO L225 Difference]: With dead ends: 191 [2024-10-13 10:30:33,719 INFO L226 Difference]: Without dead ends: 191 [2024-10-13 10:30:33,719 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2024-10-13 10:30:33,719 INFO L432 NwaCegarLoop]: 24 mSDtfsCounter, 81 mSDsluCounter, 73 mSDsCounter, 0 mSdLazyCounter, 165 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 81 SdHoareTripleChecker+Valid, 97 SdHoareTripleChecker+Invalid, 166 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 165 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-13 10:30:33,719 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [81 Valid, 97 Invalid, 166 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 165 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-13 10:30:33,720 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 191 states. [2024-10-13 10:30:33,721 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 191 to 171. [2024-10-13 10:30:33,721 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 171 states, 159 states have (on average 1.490566037735849) internal successors, (237), 170 states have internal predecessors, (237), 0 states have call successors, (0), 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-13 10:30:33,721 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 171 states to 171 states and 237 transitions. [2024-10-13 10:30:33,722 INFO L78 Accepts]: Start accepts. Automaton has 171 states and 237 transitions. Word has length 21 [2024-10-13 10:30:33,722 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 10:30:33,722 INFO L471 AbstractCegarLoop]: Abstraction has 171 states and 237 transitions. [2024-10-13 10:30:33,722 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 7 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 10:30:33,722 INFO L276 IsEmpty]: Start isEmpty. Operand 171 states and 237 transitions. [2024-10-13 10:30:33,722 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2024-10-13 10:30:33,722 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 10:30:33,722 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 10:30:33,726 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 (31)] Forceful destruction successful, exit code 0 [2024-10-13 10:30:33,922 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 31 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -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-13 10:30:33,923 INFO L396 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 22 more)] === [2024-10-13 10:30:33,923 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 10:30:33,923 INFO L85 PathProgramCache]: Analyzing trace with hash -1914501332, now seen corresponding path program 1 times [2024-10-13 10:30:33,923 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 10:30:33,923 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [152901831] [2024-10-13 10:30:33,923 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 10:30:33,923 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-13 10:30:33,923 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 10:30:33,924 INFO L229 MonitoredProcess]: Starting monitored process 32 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-13 10:30:33,925 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 (32)] Waiting until timeout for monitored process [2024-10-13 10:30:34,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:30:34,017 INFO L255 TraceCheckSpWp]: Trace formula consists of 104 conjuncts, 14 conjuncts are in the unsatisfiable core [2024-10-13 10:30:34,019 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 10:30:34,228 WARN L873 $PredicateComparison]: unable to prove that (exists ((|v_ULTIMATE.start_lis_#t~malloc2#1.base_22| (_ BitVec 32)) (|v_ULTIMATE.start_lis_#t~malloc3#1.base_22| (_ BitVec 32)) (|v_ULTIMATE.start_main_#t~malloc17#1.base_27| (_ BitVec 32))) (let ((.cse0 (store |c_ULTIMATE.start_main_old_#valid#1| |v_ULTIMATE.start_main_#t~malloc17#1.base_27| (_ bv1 1)))) (and (= (store (store (store |c_ULTIMATE.start_main_old_#valid#1| |v_ULTIMATE.start_lis_#t~malloc2#1.base_22| (_ bv0 1)) |v_ULTIMATE.start_lis_#t~malloc3#1.base_22| (_ bv0 1)) |v_ULTIMATE.start_main_#t~malloc17#1.base_27| (_ bv0 1)) |c_#valid|) (= (_ bv0 1) (select .cse0 |v_ULTIMATE.start_lis_#t~malloc2#1.base_22|)) (= (_ bv0 1) (select |c_ULTIMATE.start_main_old_#valid#1| |v_ULTIMATE.start_main_#t~malloc17#1.base_27|)) (= (_ bv0 1) (select (store .cse0 |v_ULTIMATE.start_lis_#t~malloc2#1.base_22| (_ bv1 1)) |v_ULTIMATE.start_lis_#t~malloc3#1.base_22|))))) is different from true [2024-10-13 10:30:34,229 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-10-13 10:30:34,229 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-13 10:30:34,229 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 10:30:34,229 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [152901831] [2024-10-13 10:30:34,229 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [152901831] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 10:30:34,229 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 10:30:34,229 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-13 10:30:34,229 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [718904682] [2024-10-13 10:30:34,229 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 10:30:34,229 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-13 10:30:34,229 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 10:30:34,230 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-13 10:30:34,230 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=14, Unknown=1, NotChecked=6, Total=30 [2024-10-13 10:30:34,230 INFO L87 Difference]: Start difference. First operand 171 states and 237 transitions. Second operand has 6 states, 5 states have (on average 4.4) internal successors, (22), 5 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 10:30:34,377 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 10:30:34,377 INFO L93 Difference]: Finished difference Result 170 states and 236 transitions. [2024-10-13 10:30:34,378 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-13 10:30:34,378 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 4.4) internal successors, (22), 5 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 22 [2024-10-13 10:30:34,378 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 10:30:34,378 INFO L225 Difference]: With dead ends: 170 [2024-10-13 10:30:34,378 INFO L226 Difference]: Without dead ends: 150 [2024-10-13 10:30:34,379 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=21, Unknown=1, NotChecked=8, Total=42 [2024-10-13 10:30:34,379 INFO L432 NwaCegarLoop]: 34 mSDtfsCounter, 29 mSDsluCounter, 68 mSDsCounter, 0 mSdLazyCounter, 48 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 29 SdHoareTripleChecker+Valid, 102 SdHoareTripleChecker+Invalid, 98 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 48 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 49 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-13 10:30:34,379 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [29 Valid, 102 Invalid, 98 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 48 Invalid, 0 Unknown, 49 Unchecked, 0.1s Time] [2024-10-13 10:30:34,379 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 150 states. [2024-10-13 10:30:34,381 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 150 to 150. [2024-10-13 10:30:34,381 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 150 states, 139 states have (on average 1.539568345323741) internal successors, (214), 149 states have internal predecessors, (214), 0 states have call successors, (0), 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-13 10:30:34,381 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 150 states to 150 states and 214 transitions. [2024-10-13 10:30:34,381 INFO L78 Accepts]: Start accepts. Automaton has 150 states and 214 transitions. Word has length 22 [2024-10-13 10:30:34,381 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 10:30:34,381 INFO L471 AbstractCegarLoop]: Abstraction has 150 states and 214 transitions. [2024-10-13 10:30:34,381 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 4.4) internal successors, (22), 5 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 10:30:34,381 INFO L276 IsEmpty]: Start isEmpty. Operand 150 states and 214 transitions. [2024-10-13 10:30:34,382 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2024-10-13 10:30:34,382 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 10:30:34,382 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 10:30:34,385 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 (32)] Ended with exit code 0 [2024-10-13 10:30:34,582 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 32 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -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-13 10:30:34,582 INFO L396 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 22 more)] === [2024-10-13 10:30:34,583 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 10:30:34,583 INFO L85 PathProgramCache]: Analyzing trace with hash 1163686888, now seen corresponding path program 1 times [2024-10-13 10:30:34,583 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 10:30:34,583 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1190596960] [2024-10-13 10:30:34,583 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 10:30:34,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-13 10:30:34,583 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 10:30:34,586 INFO L229 MonitoredProcess]: Starting monitored process 33 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-13 10:30:34,593 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 (33)] Waiting until timeout for monitored process [2024-10-13 10:30:34,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:30:34,700 INFO L255 TraceCheckSpWp]: Trace formula consists of 131 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-10-13 10:30:34,701 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 10:30:34,796 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-10-13 10:30:34,796 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-13 10:30:34,897 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 23 [2024-10-13 10:30:34,971 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-10-13 10:30:34,971 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 10:30:34,971 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1190596960] [2024-10-13 10:30:34,971 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1190596960] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-13 10:30:34,971 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-13 10:30:34,971 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 9 [2024-10-13 10:30:34,972 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [992423708] [2024-10-13 10:30:34,972 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-13 10:30:34,972 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-10-13 10:30:34,972 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 10:30:34,972 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-10-13 10:30:34,972 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2024-10-13 10:30:34,972 INFO L87 Difference]: Start difference. First operand 150 states and 214 transitions. Second operand has 10 states, 9 states have (on average 4.0) internal successors, (36), 10 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 10:30:35,615 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 10:30:35,615 INFO L93 Difference]: Finished difference Result 282 states and 418 transitions. [2024-10-13 10:30:35,616 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-10-13 10:30:35,616 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 4.0) internal successors, (36), 10 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 23 [2024-10-13 10:30:35,617 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 10:30:35,617 INFO L225 Difference]: With dead ends: 282 [2024-10-13 10:30:35,618 INFO L226 Difference]: Without dead ends: 282 [2024-10-13 10:30:35,618 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=82, Invalid=190, Unknown=0, NotChecked=0, Total=272 [2024-10-13 10:30:35,618 INFO L432 NwaCegarLoop]: 17 mSDtfsCounter, 293 mSDsluCounter, 69 mSDsCounter, 0 mSdLazyCounter, 250 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 293 SdHoareTripleChecker+Valid, 86 SdHoareTripleChecker+Invalid, 281 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 250 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-10-13 10:30:35,618 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [293 Valid, 86 Invalid, 281 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 250 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-10-13 10:30:35,619 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 282 states. [2024-10-13 10:30:35,623 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 282 to 146. [2024-10-13 10:30:35,624 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 146 states, 135 states have (on average 1.511111111111111) internal successors, (204), 145 states have internal predecessors, (204), 0 states have call successors, (0), 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-13 10:30:35,624 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146 states to 146 states and 204 transitions. [2024-10-13 10:30:35,624 INFO L78 Accepts]: Start accepts. Automaton has 146 states and 204 transitions. Word has length 23 [2024-10-13 10:30:35,624 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 10:30:35,624 INFO L471 AbstractCegarLoop]: Abstraction has 146 states and 204 transitions. [2024-10-13 10:30:35,625 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 4.0) internal successors, (36), 10 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 10:30:35,625 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 204 transitions. [2024-10-13 10:30:35,625 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2024-10-13 10:30:35,625 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 10:30:35,625 INFO L215 NwaCegarLoop]: trace histogram [5, 4, 4, 2, 2, 1, 1, 1, 1, 1, 1] [2024-10-13 10:30:35,630 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 (33)] Forceful destruction successful, exit code 0 [2024-10-13 10:30:35,825 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 33 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -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-13 10:30:35,826 INFO L396 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 22 more)] === [2024-10-13 10:30:35,826 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 10:30:35,826 INFO L85 PathProgramCache]: Analyzing trace with hash 1645772704, now seen corresponding path program 3 times [2024-10-13 10:30:35,827 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 10:30:35,827 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [871571669] [2024-10-13 10:30:35,827 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-10-13 10:30:35,827 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-13 10:30:35,827 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 10:30:35,828 INFO L229 MonitoredProcess]: Starting monitored process 34 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-13 10:30:35,829 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 (34)] Waiting until timeout for monitored process [2024-10-13 10:30:35,981 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2024-10-13 10:30:35,981 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-13 10:30:35,985 INFO L255 TraceCheckSpWp]: Trace formula consists of 160 conjuncts, 27 conjuncts are in the unsatisfiable core [2024-10-13 10:30:35,987 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 10:30:35,997 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 8 treesize of output 7 [2024-10-13 10:30:36,117 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-13 10:30:36,129 INFO L349 Elim1Store]: treesize reduction 31, result has 22.5 percent of original size [2024-10-13 10:30:36,130 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 1 case distinctions, treesize of input 26 treesize of output 25 [2024-10-13 10:30:36,137 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2024-10-13 10:30:36,371 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 4 proven. 26 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 10:30:36,371 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-13 10:30:36,817 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2024-10-13 10:30:37,113 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 10:30:37,113 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 10:30:37,114 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [871571669] [2024-10-13 10:30:37,114 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [871571669] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-13 10:30:37,114 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-13 10:30:37,114 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11] total 22 [2024-10-13 10:30:37,114 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [409108286] [2024-10-13 10:30:37,114 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-13 10:30:37,114 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2024-10-13 10:30:37,114 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 10:30:37,114 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2024-10-13 10:30:37,114 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=96, Invalid=366, Unknown=0, NotChecked=0, Total=462 [2024-10-13 10:30:37,115 INFO L87 Difference]: Start difference. First operand 146 states and 204 transitions. Second operand has 22 states, 22 states have (on average 2.0454545454545454) internal successors, (45), 22 states have internal predecessors, (45), 0 states have call successors, (0), 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-13 10:30:39,381 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 10:30:39,381 INFO L93 Difference]: Finished difference Result 168 states and 231 transitions. [2024-10-13 10:30:39,382 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2024-10-13 10:30:39,382 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 22 states have (on average 2.0454545454545454) internal successors, (45), 22 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 23 [2024-10-13 10:30:39,382 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 10:30:39,383 INFO L225 Difference]: With dead ends: 168 [2024-10-13 10:30:39,383 INFO L226 Difference]: Without dead ends: 168 [2024-10-13 10:30:39,383 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 166 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=194, Invalid=676, Unknown=0, NotChecked=0, Total=870 [2024-10-13 10:30:39,384 INFO L432 NwaCegarLoop]: 34 mSDtfsCounter, 36 mSDsluCounter, 124 mSDsCounter, 0 mSdLazyCounter, 508 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 158 SdHoareTripleChecker+Invalid, 518 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 508 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2024-10-13 10:30:39,384 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [36 Valid, 158 Invalid, 518 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 508 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2024-10-13 10:30:39,384 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 168 states. [2024-10-13 10:30:39,385 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 168 to 156. [2024-10-13 10:30:39,385 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 156 states, 145 states have (on average 1.4827586206896552) internal successors, (215), 155 states have internal predecessors, (215), 0 states have call successors, (0), 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-13 10:30:39,386 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 156 states to 156 states and 215 transitions. [2024-10-13 10:30:39,386 INFO L78 Accepts]: Start accepts. Automaton has 156 states and 215 transitions. Word has length 23 [2024-10-13 10:30:39,386 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 10:30:39,386 INFO L471 AbstractCegarLoop]: Abstraction has 156 states and 215 transitions. [2024-10-13 10:30:39,386 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 22 states have (on average 2.0454545454545454) internal successors, (45), 22 states have internal predecessors, (45), 0 states have call successors, (0), 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-13 10:30:39,386 INFO L276 IsEmpty]: Start isEmpty. Operand 156 states and 215 transitions. [2024-10-13 10:30:39,387 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2024-10-13 10:30:39,387 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 10:30:39,387 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 10:30:39,392 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 (34)] Ended with exit code 0 [2024-10-13 10:30:39,588 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 34 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -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-13 10:30:39,588 INFO L396 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 22 more)] === [2024-10-13 10:30:39,588 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 10:30:39,589 INFO L85 PathProgramCache]: Analyzing trace with hash 1714564208, now seen corresponding path program 1 times [2024-10-13 10:30:39,589 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 10:30:39,589 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [445846839] [2024-10-13 10:30:39,589 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 10:30:39,589 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-13 10:30:39,589 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 10:30:39,591 INFO L229 MonitoredProcess]: Starting monitored process 35 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-13 10:30:39,592 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 (35)] Waiting until timeout for monitored process [2024-10-13 10:30:39,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:30:39,693 INFO L255 TraceCheckSpWp]: Trace formula consists of 132 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-13 10:30:39,694 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 10:30:39,698 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2024-10-13 10:30:39,698 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-13 10:30:39,698 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 10:30:39,698 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [445846839] [2024-10-13 10:30:39,698 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [445846839] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 10:30:39,698 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 10:30:39,698 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-13 10:30:39,698 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [109113706] [2024-10-13 10:30:39,698 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 10:30:39,699 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 10:30:39,699 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 10:30:39,699 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 10:30:39,700 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 10:30:39,700 INFO L87 Difference]: Start difference. First operand 156 states and 215 transitions. Second operand has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 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-13 10:30:39,725 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 10:30:39,726 INFO L93 Difference]: Finished difference Result 158 states and 214 transitions. [2024-10-13 10:30:39,726 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 10:30:39,726 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 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 24 [2024-10-13 10:30:39,726 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 10:30:39,726 INFO L225 Difference]: With dead ends: 158 [2024-10-13 10:30:39,726 INFO L226 Difference]: Without dead ends: 158 [2024-10-13 10:30:39,727 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 22 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-13 10:30:39,727 INFO L432 NwaCegarLoop]: 39 mSDtfsCounter, 0 mSDsluCounter, 35 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 74 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-13 10:30:39,727 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 74 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-13 10:30:39,727 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 158 states. [2024-10-13 10:30:39,728 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 158 to 158. [2024-10-13 10:30:39,729 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 158 states, 148 states have (on average 1.445945945945946) internal successors, (214), 157 states have internal predecessors, (214), 0 states have call successors, (0), 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-13 10:30:39,729 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 158 states to 158 states and 214 transitions. [2024-10-13 10:30:39,729 INFO L78 Accepts]: Start accepts. Automaton has 158 states and 214 transitions. Word has length 24 [2024-10-13 10:30:39,729 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 10:30:39,729 INFO L471 AbstractCegarLoop]: Abstraction has 158 states and 214 transitions. [2024-10-13 10:30:39,729 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 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-13 10:30:39,730 INFO L276 IsEmpty]: Start isEmpty. Operand 158 states and 214 transitions. [2024-10-13 10:30:39,730 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2024-10-13 10:30:39,730 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 10:30:39,730 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 10:30:39,734 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 (35)] Ended with exit code 0 [2024-10-13 10:30:39,930 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 35 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -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-13 10:30:39,931 INFO L396 AbstractCegarLoop]: === Iteration 35 === Targeting ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 22 more)] === [2024-10-13 10:30:39,932 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 10:30:39,932 INFO L85 PathProgramCache]: Analyzing trace with hash 1714555177, now seen corresponding path program 1 times [2024-10-13 10:30:39,933 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 10:30:39,933 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1136006346] [2024-10-13 10:30:39,933 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 10:30:39,933 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-13 10:30:39,933 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 10:30:39,934 INFO L229 MonitoredProcess]: Starting monitored process 36 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-13 10:30:39,934 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 (36)] Waiting until timeout for monitored process [2024-10-13 10:30:40,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:30:40,034 INFO L255 TraceCheckSpWp]: Trace formula consists of 136 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-10-13 10:30:40,035 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 10:30:40,112 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-10-13 10:30:40,112 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-13 10:30:40,193 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 21 [2024-10-13 10:30:40,267 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-10-13 10:30:40,267 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 10:30:40,267 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1136006346] [2024-10-13 10:30:40,267 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1136006346] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-13 10:30:40,267 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-13 10:30:40,267 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 9 [2024-10-13 10:30:40,267 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1516851899] [2024-10-13 10:30:40,267 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-13 10:30:40,267 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-10-13 10:30:40,267 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 10:30:40,268 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-10-13 10:30:40,268 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2024-10-13 10:30:40,268 INFO L87 Difference]: Start difference. First operand 158 states and 214 transitions. Second operand has 10 states, 9 states have (on average 4.222222222222222) internal successors, (38), 10 states have internal predecessors, (38), 0 states have call successors, (0), 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-13 10:30:40,944 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 10:30:40,944 INFO L93 Difference]: Finished difference Result 422 states and 615 transitions. [2024-10-13 10:30:40,945 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2024-10-13 10:30:40,945 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 4.222222222222222) internal successors, (38), 10 states have internal predecessors, (38), 0 states have call successors, (0), 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 24 [2024-10-13 10:30:40,945 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 10:30:40,947 INFO L225 Difference]: With dead ends: 422 [2024-10-13 10:30:40,947 INFO L226 Difference]: Without dead ends: 422 [2024-10-13 10:30:40,948 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 82 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=152, Invalid=354, Unknown=0, NotChecked=0, Total=506 [2024-10-13 10:30:40,948 INFO L432 NwaCegarLoop]: 16 mSDtfsCounter, 633 mSDsluCounter, 62 mSDsCounter, 0 mSdLazyCounter, 241 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 633 SdHoareTripleChecker+Valid, 78 SdHoareTripleChecker+Invalid, 271 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 241 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-13 10:30:40,948 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [633 Valid, 78 Invalid, 271 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 241 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-13 10:30:40,948 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 422 states. [2024-10-13 10:30:40,951 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 422 to 231. [2024-10-13 10:30:40,951 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 231 states, 222 states have (on average 1.4774774774774775) internal successors, (328), 230 states have internal predecessors, (328), 0 states have call successors, (0), 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-13 10:30:40,952 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 231 states to 231 states and 328 transitions. [2024-10-13 10:30:40,953 INFO L78 Accepts]: Start accepts. Automaton has 231 states and 328 transitions. Word has length 24 [2024-10-13 10:30:40,953 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 10:30:40,953 INFO L471 AbstractCegarLoop]: Abstraction has 231 states and 328 transitions. [2024-10-13 10:30:40,953 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 4.222222222222222) internal successors, (38), 10 states have internal predecessors, (38), 0 states have call successors, (0), 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-13 10:30:40,954 INFO L276 IsEmpty]: Start isEmpty. Operand 231 states and 328 transitions. [2024-10-13 10:30:40,954 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2024-10-13 10:30:40,954 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 10:30:40,954 INFO L215 NwaCegarLoop]: trace histogram [11, 10, 1, 1, 1, 1] [2024-10-13 10:30:40,959 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 (36)] Forceful destruction successful, exit code 0 [2024-10-13 10:30:41,154 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 36 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -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-13 10:30:41,155 INFO L396 AbstractCegarLoop]: === Iteration 36 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 22 more)] === [2024-10-13 10:30:41,155 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 10:30:41,155 INFO L85 PathProgramCache]: Analyzing trace with hash -1866632332, now seen corresponding path program 3 times [2024-10-13 10:30:41,155 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 10:30:41,155 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [376086448] [2024-10-13 10:30:41,155 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-10-13 10:30:41,155 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-13 10:30:41,155 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 10:30:41,156 INFO L229 MonitoredProcess]: Starting monitored process 37 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-13 10:30:41,158 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 (37)] Waiting until timeout for monitored process [2024-10-13 10:30:41,319 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 11 check-sat command(s) [2024-10-13 10:30:41,319 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-13 10:30:41,321 INFO L255 TraceCheckSpWp]: Trace formula consists of 141 conjuncts, 20 conjuncts are in the unsatisfiable core [2024-10-13 10:30:41,322 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 10:30:41,329 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 8 treesize of output 7 [2024-10-13 10:30:41,683 INFO L134 CoverageAnalysis]: Checked inductivity of 110 backedges. 0 proven. 110 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 10:30:41,683 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-13 10:30:43,042 INFO L134 CoverageAnalysis]: Checked inductivity of 110 backedges. 0 proven. 110 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 10:30:43,043 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 10:30:43,043 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [376086448] [2024-10-13 10:30:43,043 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [376086448] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-13 10:30:43,043 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-13 10:30:43,043 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 27 [2024-10-13 10:30:43,043 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1697630027] [2024-10-13 10:30:43,043 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-13 10:30:43,043 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2024-10-13 10:30:43,043 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 10:30:43,044 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2024-10-13 10:30:43,044 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=200, Invalid=556, Unknown=0, NotChecked=0, Total=756 [2024-10-13 10:30:43,044 INFO L87 Difference]: Start difference. First operand 231 states and 328 transitions. Second operand has 28 states, 27 states have (on average 1.8148148148148149) internal successors, (49), 28 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-13 10:30:54,870 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 10:30:54,871 INFO L93 Difference]: Finished difference Result 255 states and 364 transitions. [2024-10-13 10:30:54,871 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2024-10-13 10:30:54,871 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 27 states have (on average 1.8148148148148149) internal successors, (49), 28 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 25 [2024-10-13 10:30:54,871 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 10:30:54,872 INFO L225 Difference]: With dead ends: 255 [2024-10-13 10:30:54,872 INFO L226 Difference]: Without dead ends: 255 [2024-10-13 10:30:54,873 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 59 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 880 ImplicationChecksByTransitivity, 11.5s TimeCoverageRelationStatistics Valid=1158, Invalid=2502, Unknown=0, NotChecked=0, Total=3660 [2024-10-13 10:30:54,873 INFO L432 NwaCegarLoop]: 35 mSDtfsCounter, 97 mSDsluCounter, 250 mSDsCounter, 0 mSdLazyCounter, 703 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 97 SdHoareTripleChecker+Valid, 285 SdHoareTripleChecker+Invalid, 704 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 703 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2024-10-13 10:30:54,873 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [97 Valid, 285 Invalid, 704 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 703 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2024-10-13 10:30:54,874 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 255 states. [2024-10-13 10:30:54,877 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 255 to 255. [2024-10-13 10:30:54,877 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 255 states, 246 states have (on average 1.4796747967479675) internal successors, (364), 254 states have internal predecessors, (364), 0 states have call successors, (0), 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-13 10:30:54,878 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 255 states to 255 states and 364 transitions. [2024-10-13 10:30:54,878 INFO L78 Accepts]: Start accepts. Automaton has 255 states and 364 transitions. Word has length 25 [2024-10-13 10:30:54,878 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 10:30:54,878 INFO L471 AbstractCegarLoop]: Abstraction has 255 states and 364 transitions. [2024-10-13 10:30:54,880 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 27 states have (on average 1.8148148148148149) internal successors, (49), 28 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-13 10:30:54,880 INFO L276 IsEmpty]: Start isEmpty. Operand 255 states and 364 transitions. [2024-10-13 10:30:54,880 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2024-10-13 10:30:54,881 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 10:30:54,881 INFO L215 NwaCegarLoop]: trace histogram [5, 5, 4, 3, 3, 1, 1, 1, 1, 1, 1] [2024-10-13 10:30:54,886 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 (37)] Forceful destruction successful, exit code 0 [2024-10-13 10:30:55,081 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 37 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -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-13 10:30:55,082 INFO L396 AbstractCegarLoop]: === Iteration 37 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 22 more)] === [2024-10-13 10:30:55,082 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 10:30:55,082 INFO L85 PathProgramCache]: Analyzing trace with hash -1244537365, now seen corresponding path program 2 times [2024-10-13 10:30:55,082 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 10:30:55,082 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1540041195] [2024-10-13 10:30:55,082 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-10-13 10:30:55,082 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-13 10:30:55,083 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 10:30:55,083 INFO L229 MonitoredProcess]: Starting monitored process 38 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-13 10:30:55,084 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 (38)] Waiting until timeout for monitored process [2024-10-13 10:30:55,177 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2024-10-13 10:30:55,177 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-13 10:30:55,179 INFO L255 TraceCheckSpWp]: Trace formula consists of 58 conjuncts, 17 conjuncts are in the unsatisfiable core [2024-10-13 10:30:55,180 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 10:30:55,205 INFO L349 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2024-10-13 10:30:55,205 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 15 [2024-10-13 10:30:55,213 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2024-10-13 10:30:55,422 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2024-10-13 10:30:55,422 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-13 10:30:55,971 INFO L173 IndexEqualityManager]: detected equality via solver [2024-10-13 10:30:55,972 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2024-10-13 10:30:55,972 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 10:30:55,972 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1540041195] [2024-10-13 10:30:55,972 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1540041195] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-13 10:30:55,972 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-13 10:30:55,972 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 3] total 6 [2024-10-13 10:30:55,972 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1424691493] [2024-10-13 10:30:55,972 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-13 10:30:55,972 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-13 10:30:55,972 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 10:30:55,972 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-13 10:30:55,973 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-10-13 10:30:55,973 INFO L87 Difference]: Start difference. First operand 255 states and 364 transitions. Second operand has 7 states, 6 states have (on average 3.8333333333333335) internal successors, (23), 7 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 10:30:56,466 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 10:30:56,467 INFO L93 Difference]: Finished difference Result 269 states and 380 transitions. [2024-10-13 10:30:56,467 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-13 10:30:56,467 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 3.8333333333333335) internal successors, (23), 7 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 26 [2024-10-13 10:30:56,467 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 10:30:56,468 INFO L225 Difference]: With dead ends: 269 [2024-10-13 10:30:56,468 INFO L226 Difference]: Without dead ends: 269 [2024-10-13 10:30:56,468 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 45 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2024-10-13 10:30:56,469 INFO L432 NwaCegarLoop]: 23 mSDtfsCounter, 47 mSDsluCounter, 33 mSDsCounter, 0 mSdLazyCounter, 136 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 47 SdHoareTripleChecker+Valid, 56 SdHoareTripleChecker+Invalid, 139 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 136 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-13 10:30:56,469 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [47 Valid, 56 Invalid, 139 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 136 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-13 10:30:56,469 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 269 states. [2024-10-13 10:30:56,471 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 269 to 231. [2024-10-13 10:30:56,471 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 231 states, 224 states have (on average 1.4598214285714286) internal successors, (327), 230 states have internal predecessors, (327), 0 states have call successors, (0), 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-13 10:30:56,472 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 231 states to 231 states and 327 transitions. [2024-10-13 10:30:56,472 INFO L78 Accepts]: Start accepts. Automaton has 231 states and 327 transitions. Word has length 26 [2024-10-13 10:30:56,472 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 10:30:56,472 INFO L471 AbstractCegarLoop]: Abstraction has 231 states and 327 transitions. [2024-10-13 10:30:56,472 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 3.8333333333333335) internal successors, (23), 7 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 10:30:56,472 INFO L276 IsEmpty]: Start isEmpty. Operand 231 states and 327 transitions. [2024-10-13 10:30:56,472 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2024-10-13 10:30:56,472 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 10:30:56,473 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 10:30:56,475 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 (38)] Ended with exit code 0 [2024-10-13 10:30:56,673 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 38 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -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-13 10:30:56,673 INFO L396 AbstractCegarLoop]: === Iteration 38 === Targeting ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 22 more)] === [2024-10-13 10:30:56,673 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 10:30:56,674 INFO L85 PathProgramCache]: Analyzing trace with hash -1453211563, now seen corresponding path program 1 times [2024-10-13 10:30:56,674 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 10:30:56,674 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [187393195] [2024-10-13 10:30:56,674 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 10:30:56,674 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-13 10:30:56,674 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 10:30:56,675 INFO L229 MonitoredProcess]: Starting monitored process 39 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-13 10:30:56,676 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 (39)] Waiting until timeout for monitored process [2024-10-13 10:30:56,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:30:56,778 INFO L255 TraceCheckSpWp]: Trace formula consists of 139 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-10-13 10:30:56,780 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 10:30:56,808 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2024-10-13 10:30:56,808 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-13 10:30:56,838 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2024-10-13 10:30:56,838 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 10:30:56,838 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [187393195] [2024-10-13 10:30:56,838 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [187393195] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-13 10:30:56,838 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-13 10:30:56,838 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 8 [2024-10-13 10:30:56,838 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [305113465] [2024-10-13 10:30:56,838 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-13 10:30:56,838 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-13 10:30:56,838 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 10:30:56,839 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-13 10:30:56,839 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2024-10-13 10:30:56,839 INFO L87 Difference]: Start difference. First operand 231 states and 327 transitions. Second operand has 8 states, 8 states have (on average 3.875) internal successors, (31), 8 states have internal predecessors, (31), 0 states have call successors, (0), 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-13 10:30:56,989 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 10:30:56,989 INFO L93 Difference]: Finished difference Result 202 states and 282 transitions. [2024-10-13 10:30:56,989 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-13 10:30:56,989 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 3.875) internal successors, (31), 8 states have internal predecessors, (31), 0 states have call successors, (0), 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 27 [2024-10-13 10:30:56,989 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 10:30:56,990 INFO L225 Difference]: With dead ends: 202 [2024-10-13 10:30:56,990 INFO L226 Difference]: Without dead ends: 202 [2024-10-13 10:30:56,990 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 46 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2024-10-13 10:30:56,991 INFO L432 NwaCegarLoop]: 22 mSDtfsCounter, 29 mSDsluCounter, 67 mSDsCounter, 0 mSdLazyCounter, 171 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 29 SdHoareTripleChecker+Valid, 89 SdHoareTripleChecker+Invalid, 173 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 171 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-13 10:30:56,991 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [29 Valid, 89 Invalid, 173 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 171 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-13 10:30:56,991 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 202 states. [2024-10-13 10:30:56,993 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 202 to 200. [2024-10-13 10:30:56,993 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 200 states, 193 states have (on average 1.450777202072539) internal successors, (280), 199 states have internal predecessors, (280), 0 states have call successors, (0), 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-13 10:30:56,994 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 200 states to 200 states and 280 transitions. [2024-10-13 10:30:56,994 INFO L78 Accepts]: Start accepts. Automaton has 200 states and 280 transitions. Word has length 27 [2024-10-13 10:30:56,994 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 10:30:56,994 INFO L471 AbstractCegarLoop]: Abstraction has 200 states and 280 transitions. [2024-10-13 10:30:56,994 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 3.875) internal successors, (31), 8 states have internal predecessors, (31), 0 states have call successors, (0), 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-13 10:30:56,994 INFO L276 IsEmpty]: Start isEmpty. Operand 200 states and 280 transitions. [2024-10-13 10:30:56,994 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2024-10-13 10:30:56,994 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 10:30:56,994 INFO L215 NwaCegarLoop]: trace histogram [6, 5, 5, 3, 3, 1, 1, 1, 1, 1, 1] [2024-10-13 10:30:57,007 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 (39)] Ended with exit code 0 [2024-10-13 10:30:57,195 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 39 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -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-13 10:30:57,195 INFO L396 AbstractCegarLoop]: === Iteration 39 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 22 more)] === [2024-10-13 10:30:57,195 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 10:30:57,196 INFO L85 PathProgramCache]: Analyzing trace with hash -1999401293, now seen corresponding path program 4 times [2024-10-13 10:30:57,196 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 10:30:57,196 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [554282579] [2024-10-13 10:30:57,196 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2024-10-13 10:30:57,196 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-13 10:30:57,196 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 10:30:57,198 INFO L229 MonitoredProcess]: Starting monitored process 40 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-13 10:30:57,199 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 (40)] Waiting until timeout for monitored process [2024-10-13 10:30:57,336 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2024-10-13 10:30:57,336 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-13 10:30:57,340 INFO L255 TraceCheckSpWp]: Trace formula consists of 192 conjuncts, 20 conjuncts are in the unsatisfiable core [2024-10-13 10:30:57,341 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 10:30:57,346 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 8 treesize of output 7 [2024-10-13 10:30:57,423 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 12 [2024-10-13 10:30:57,562 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 23 proven. 21 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2024-10-13 10:30:57,563 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-13 10:30:57,994 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 23 proven. 21 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2024-10-13 10:30:57,994 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 10:30:57,994 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [554282579] [2024-10-13 10:30:57,994 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [554282579] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-13 10:30:57,994 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-13 10:30:57,994 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 22 [2024-10-13 10:30:57,994 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [524868960] [2024-10-13 10:30:57,994 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-13 10:30:57,994 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2024-10-13 10:30:57,994 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 10:30:57,995 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2024-10-13 10:30:57,995 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=80, Invalid=382, Unknown=0, NotChecked=0, Total=462 [2024-10-13 10:30:57,995 INFO L87 Difference]: Start difference. First operand 200 states and 280 transitions. Second operand has 22 states, 22 states have (on average 2.0) internal successors, (44), 22 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-13 10:30:58,645 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 10:30:58,645 INFO L93 Difference]: Finished difference Result 211 states and 291 transitions. [2024-10-13 10:30:58,646 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-10-13 10:30:58,646 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 22 states have (on average 2.0) internal successors, (44), 22 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 28 [2024-10-13 10:30:58,646 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 10:30:58,647 INFO L225 Difference]: With dead ends: 211 [2024-10-13 10:30:58,647 INFO L226 Difference]: Without dead ends: 211 [2024-10-13 10:30:58,647 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=80, Invalid=382, Unknown=0, NotChecked=0, Total=462 [2024-10-13 10:30:58,647 INFO L432 NwaCegarLoop]: 30 mSDtfsCounter, 2 mSDsluCounter, 196 mSDsCounter, 0 mSdLazyCounter, 579 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 226 SdHoareTripleChecker+Invalid, 581 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 579 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-10-13 10:30:58,647 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 226 Invalid, 581 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 579 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-10-13 10:30:58,647 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 211 states. [2024-10-13 10:30:58,649 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 211 to 204. [2024-10-13 10:30:58,650 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 204 states, 197 states have (on average 1.4416243654822336) internal successors, (284), 203 states have internal predecessors, (284), 0 states have call successors, (0), 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-13 10:30:58,651 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 204 states to 204 states and 284 transitions. [2024-10-13 10:30:58,652 INFO L78 Accepts]: Start accepts. Automaton has 204 states and 284 transitions. Word has length 28 [2024-10-13 10:30:58,652 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 10:30:58,652 INFO L471 AbstractCegarLoop]: Abstraction has 204 states and 284 transitions. [2024-10-13 10:30:58,652 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 22 states have (on average 2.0) internal successors, (44), 22 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-13 10:30:58,652 INFO L276 IsEmpty]: Start isEmpty. Operand 204 states and 284 transitions. [2024-10-13 10:30:58,652 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2024-10-13 10:30:58,652 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 10:30:58,652 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 10:30:58,657 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 (40)] Ended with exit code 0 [2024-10-13 10:30:58,853 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 40 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -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-13 10:30:58,853 INFO L396 AbstractCegarLoop]: === Iteration 40 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 22 more)] === [2024-10-13 10:30:58,853 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 10:30:58,853 INFO L85 PathProgramCache]: Analyzing trace with hash -672637471, now seen corresponding path program 1 times [2024-10-13 10:30:58,854 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 10:30:58,854 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [805486699] [2024-10-13 10:30:58,854 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 10:30:58,854 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-13 10:30:58,855 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 10:30:58,856 INFO L229 MonitoredProcess]: Starting monitored process 41 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-13 10:30:58,857 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 (41)] Waiting until timeout for monitored process [2024-10-13 10:30:58,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:30:58,968 INFO L255 TraceCheckSpWp]: Trace formula consists of 138 conjuncts, 20 conjuncts are in the unsatisfiable core [2024-10-13 10:30:58,969 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 10:30:58,976 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 8 treesize of output 7 [2024-10-13 10:30:59,027 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2024-10-13 10:30:59,212 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 3 proven. 10 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-10-13 10:30:59,212 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-13 10:30:59,349 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 3 proven. 6 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2024-10-13 10:30:59,349 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 10:30:59,349 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [805486699] [2024-10-13 10:30:59,349 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [805486699] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-13 10:30:59,349 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-13 10:30:59,349 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 8] total 17 [2024-10-13 10:30:59,350 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [39691246] [2024-10-13 10:30:59,350 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-13 10:30:59,350 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2024-10-13 10:30:59,350 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 10:30:59,350 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2024-10-13 10:30:59,350 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=212, Unknown=0, NotChecked=0, Total=272 [2024-10-13 10:30:59,350 INFO L87 Difference]: Start difference. First operand 204 states and 284 transitions. Second operand has 17 states, 17 states have (on average 3.1176470588235294) internal successors, (53), 17 states have internal predecessors, (53), 0 states have call successors, (0), 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-13 10:31:00,012 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 10:31:00,012 INFO L93 Difference]: Finished difference Result 295 states and 386 transitions. [2024-10-13 10:31:00,012 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-10-13 10:31:00,013 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 3.1176470588235294) internal successors, (53), 17 states have internal predecessors, (53), 0 states have call successors, (0), 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 29 [2024-10-13 10:31:00,013 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 10:31:00,014 INFO L225 Difference]: With dead ends: 295 [2024-10-13 10:31:00,014 INFO L226 Difference]: Without dead ends: 250 [2024-10-13 10:31:00,014 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 41 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 60 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=101, Invalid=319, Unknown=0, NotChecked=0, Total=420 [2024-10-13 10:31:00,015 INFO L432 NwaCegarLoop]: 22 mSDtfsCounter, 195 mSDsluCounter, 183 mSDsCounter, 0 mSdLazyCounter, 504 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 195 SdHoareTripleChecker+Valid, 205 SdHoareTripleChecker+Invalid, 530 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 504 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-10-13 10:31:00,015 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [195 Valid, 205 Invalid, 530 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 504 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-10-13 10:31:00,016 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 250 states. [2024-10-13 10:31:00,018 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 250 to 224. [2024-10-13 10:31:00,019 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 224 states, 217 states have (on average 1.4101382488479262) internal successors, (306), 223 states have internal predecessors, (306), 0 states have call successors, (0), 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-13 10:31:00,019 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 224 states to 224 states and 306 transitions. [2024-10-13 10:31:00,019 INFO L78 Accepts]: Start accepts. Automaton has 224 states and 306 transitions. Word has length 29 [2024-10-13 10:31:00,019 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 10:31:00,019 INFO L471 AbstractCegarLoop]: Abstraction has 224 states and 306 transitions. [2024-10-13 10:31:00,019 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 3.1176470588235294) internal successors, (53), 17 states have internal predecessors, (53), 0 states have call successors, (0), 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-13 10:31:00,020 INFO L276 IsEmpty]: Start isEmpty. Operand 224 states and 306 transitions. [2024-10-13 10:31:00,020 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2024-10-13 10:31:00,020 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 10:31:00,020 INFO L215 NwaCegarLoop]: trace histogram [6, 5, 5, 4, 4, 1, 1, 1, 1, 1, 1] [2024-10-13 10:31:00,026 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 (41)] Forceful destruction successful, exit code 0 [2024-10-13 10:31:00,220 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 41 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -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-13 10:31:00,221 INFO L396 AbstractCegarLoop]: === Iteration 41 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 22 more)] === [2024-10-13 10:31:00,221 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 10:31:00,221 INFO L85 PathProgramCache]: Analyzing trace with hash 824191059, now seen corresponding path program 5 times [2024-10-13 10:31:00,221 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 10:31:00,221 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [559553497] [2024-10-13 10:31:00,221 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2024-10-13 10:31:00,222 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-13 10:31:00,222 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 10:31:00,223 INFO L229 MonitoredProcess]: Starting monitored process 42 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-13 10:31:00,224 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 (42)] Waiting until timeout for monitored process [2024-10-13 10:31:00,448 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 6 check-sat command(s) [2024-10-13 10:31:00,448 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-13 10:31:00,453 INFO L255 TraceCheckSpWp]: Trace formula consists of 206 conjuncts, 22 conjuncts are in the unsatisfiable core [2024-10-13 10:31:00,454 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 10:31:00,462 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 8 treesize of output 7 [2024-10-13 10:31:00,572 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2024-10-13 10:31:00,781 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 17 proven. 38 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-10-13 10:31:00,781 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-13 10:31:01,332 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 18 proven. 37 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-10-13 10:31:01,333 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 10:31:01,333 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [559553497] [2024-10-13 10:31:01,333 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [559553497] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-13 10:31:01,333 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-13 10:31:01,333 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 26 [2024-10-13 10:31:01,333 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1987271943] [2024-10-13 10:31:01,333 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-13 10:31:01,333 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2024-10-13 10:31:01,333 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 10:31:01,334 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2024-10-13 10:31:01,334 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=103, Invalid=547, Unknown=0, NotChecked=0, Total=650 [2024-10-13 10:31:01,334 INFO L87 Difference]: Start difference. First operand 224 states and 306 transitions. Second operand has 26 states, 26 states have (on average 2.1153846153846154) internal successors, (55), 26 states have internal predecessors, (55), 0 states have call successors, (0), 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-13 10:31:02,362 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 10:31:02,363 INFO L93 Difference]: Finished difference Result 238 states and 320 transitions. [2024-10-13 10:31:02,363 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2024-10-13 10:31:02,363 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 26 states have (on average 2.1153846153846154) internal successors, (55), 26 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 30 [2024-10-13 10:31:02,363 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 10:31:02,364 INFO L225 Difference]: With dead ends: 238 [2024-10-13 10:31:02,364 INFO L226 Difference]: Without dead ends: 238 [2024-10-13 10:31:02,365 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 149 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=124, Invalid=632, Unknown=0, NotChecked=0, Total=756 [2024-10-13 10:31:02,365 INFO L432 NwaCegarLoop]: 29 mSDtfsCounter, 7 mSDsluCounter, 247 mSDsCounter, 0 mSdLazyCounter, 870 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 276 SdHoareTripleChecker+Invalid, 874 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 870 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2024-10-13 10:31:02,365 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 276 Invalid, 874 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 870 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2024-10-13 10:31:02,365 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 238 states. [2024-10-13 10:31:02,369 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 238 to 228. [2024-10-13 10:31:02,369 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 228 states, 221 states have (on average 1.4027149321266967) internal successors, (310), 227 states have internal predecessors, (310), 0 states have call successors, (0), 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-13 10:31:02,370 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 228 states to 228 states and 310 transitions. [2024-10-13 10:31:02,370 INFO L78 Accepts]: Start accepts. Automaton has 228 states and 310 transitions. Word has length 30 [2024-10-13 10:31:02,370 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 10:31:02,370 INFO L471 AbstractCegarLoop]: Abstraction has 228 states and 310 transitions. [2024-10-13 10:31:02,370 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 26 states have (on average 2.1153846153846154) internal successors, (55), 26 states have internal predecessors, (55), 0 states have call successors, (0), 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-13 10:31:02,370 INFO L276 IsEmpty]: Start isEmpty. Operand 228 states and 310 transitions. [2024-10-13 10:31:02,370 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2024-10-13 10:31:02,371 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 10:31:02,371 INFO L215 NwaCegarLoop]: trace histogram [6, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1] [2024-10-13 10:31:02,377 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 (42)] Ended with exit code 0 [2024-10-13 10:31:02,571 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 42 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -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-13 10:31:02,572 INFO L396 AbstractCegarLoop]: === Iteration 42 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 22 more)] === [2024-10-13 10:31:02,572 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 10:31:02,572 INFO L85 PathProgramCache]: Analyzing trace with hash -122889741, now seen corresponding path program 6 times [2024-10-13 10:31:02,572 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 10:31:02,572 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1543233945] [2024-10-13 10:31:02,572 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2024-10-13 10:31:02,572 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-13 10:31:02,572 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 10:31:02,574 INFO L229 MonitoredProcess]: Starting monitored process 43 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-13 10:31:02,575 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 (43)] Waiting until timeout for monitored process [2024-10-13 10:31:02,792 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 6 check-sat command(s) [2024-10-13 10:31:02,793 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-13 10:31:02,798 INFO L255 TraceCheckSpWp]: Trace formula consists of 218 conjuncts, 20 conjuncts are in the unsatisfiable core [2024-10-13 10:31:02,800 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 10:31:02,823 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-13 10:31:02,824 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 7 [2024-10-13 10:31:02,827 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2024-10-13 10:31:03,076 INFO L134 CoverageAnalysis]: Checked inductivity of 65 backedges. 0 proven. 40 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2024-10-13 10:31:03,076 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-13 10:31:04,149 INFO L173 IndexEqualityManager]: detected equality via solver [2024-10-13 10:31:04,257 INFO L134 CoverageAnalysis]: Checked inductivity of 65 backedges. 0 proven. 40 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2024-10-13 10:31:04,257 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 10:31:04,257 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1543233945] [2024-10-13 10:31:04,257 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1543233945] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-13 10:31:04,257 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-13 10:31:04,257 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 11] total 20 [2024-10-13 10:31:04,257 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [938816496] [2024-10-13 10:31:04,257 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-13 10:31:04,257 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2024-10-13 10:31:04,257 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 10:31:04,258 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2024-10-13 10:31:04,258 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=104, Invalid=316, Unknown=0, NotChecked=0, Total=420 [2024-10-13 10:31:04,258 INFO L87 Difference]: Start difference. First operand 228 states and 310 transitions. Second operand has 21 states, 20 states have (on average 2.35) internal successors, (47), 21 states have internal predecessors, (47), 0 states have call successors, (0), 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-13 10:31:08,268 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 10:31:08,268 INFO L93 Difference]: Finished difference Result 267 states and 355 transitions. [2024-10-13 10:31:08,269 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2024-10-13 10:31:08,269 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 20 states have (on average 2.35) internal successors, (47), 21 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 32 [2024-10-13 10:31:08,269 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 10:31:08,269 INFO L225 Difference]: With dead ends: 267 [2024-10-13 10:31:08,269 INFO L226 Difference]: Without dead ends: 267 [2024-10-13 10:31:08,270 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 206 ImplicationChecksByTransitivity, 3.0s TimeCoverageRelationStatistics Valid=367, Invalid=893, Unknown=0, NotChecked=0, Total=1260 [2024-10-13 10:31:08,270 INFO L432 NwaCegarLoop]: 29 mSDtfsCounter, 33 mSDsluCounter, 148 mSDsCounter, 0 mSdLazyCounter, 635 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 33 SdHoareTripleChecker+Valid, 177 SdHoareTripleChecker+Invalid, 644 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 635 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2024-10-13 10:31:08,270 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [33 Valid, 177 Invalid, 644 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 635 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2024-10-13 10:31:08,270 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 267 states. [2024-10-13 10:31:08,273 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 267 to 249. [2024-10-13 10:31:08,274 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 249 states, 242 states have (on average 1.396694214876033) internal successors, (338), 248 states have internal predecessors, (338), 0 states have call successors, (0), 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-13 10:31:08,274 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 249 states to 249 states and 338 transitions. [2024-10-13 10:31:08,274 INFO L78 Accepts]: Start accepts. Automaton has 249 states and 338 transitions. Word has length 32 [2024-10-13 10:31:08,274 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 10:31:08,274 INFO L471 AbstractCegarLoop]: Abstraction has 249 states and 338 transitions. [2024-10-13 10:31:08,274 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 20 states have (on average 2.35) internal successors, (47), 21 states have internal predecessors, (47), 0 states have call successors, (0), 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-13 10:31:08,274 INFO L276 IsEmpty]: Start isEmpty. Operand 249 states and 338 transitions. [2024-10-13 10:31:08,274 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2024-10-13 10:31:08,274 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 10:31:08,274 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 10:31:08,281 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 (43)] Ended with exit code 0 [2024-10-13 10:31:08,475 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 43 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -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-13 10:31:08,475 INFO L396 AbstractCegarLoop]: === Iteration 43 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 22 more)] === [2024-10-13 10:31:08,475 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 10:31:08,475 INFO L85 PathProgramCache]: Analyzing trace with hash 821203636, now seen corresponding path program 2 times [2024-10-13 10:31:08,476 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 10:31:08,476 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1710798709] [2024-10-13 10:31:08,476 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-10-13 10:31:08,476 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-13 10:31:08,476 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 10:31:08,477 INFO L229 MonitoredProcess]: Starting monitored process 44 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-13 10:31:08,477 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 (44)] Waiting until timeout for monitored process [2024-10-13 10:31:08,586 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2024-10-13 10:31:08,586 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-13 10:31:08,587 INFO L255 TraceCheckSpWp]: Trace formula consists of 52 conjuncts, 21 conjuncts are in the unsatisfiable core [2024-10-13 10:31:08,589 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 10:31:08,603 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-13 10:31:08,607 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 8 treesize of output 7 [2024-10-13 10:31:08,685 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-13 10:31:08,686 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 16 treesize of output 18 [2024-10-13 10:31:08,697 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2024-10-13 10:31:08,697 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-13 10:31:08,705 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-13 10:31:08,714 INFO L349 Elim1Store]: treesize reduction 17, result has 22.7 percent of original size [2024-10-13 10:31:08,714 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 21 treesize of output 18 [2024-10-13 10:31:08,725 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2024-10-13 10:31:08,725 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 13 [2024-10-13 10:31:09,218 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2024-10-13 10:31:09,218 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-13 10:31:10,101 INFO L173 IndexEqualityManager]: detected equality via solver [2024-10-13 10:31:14,241 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2024-10-13 10:31:14,241 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 10:31:14,241 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1710798709] [2024-10-13 10:31:14,241 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1710798709] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-13 10:31:14,241 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-13 10:31:14,242 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 11 [2024-10-13 10:31:14,242 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [473775329] [2024-10-13 10:31:14,242 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-13 10:31:14,242 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-10-13 10:31:14,242 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 10:31:14,242 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-10-13 10:31:14,242 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=101, Unknown=1, NotChecked=0, Total=132 [2024-10-13 10:31:14,242 INFO L87 Difference]: Start difference. First operand 249 states and 338 transitions. Second operand has 12 states, 11 states have (on average 4.2727272727272725) internal successors, (47), 12 states have internal predecessors, (47), 0 states have call successors, (0), 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-13 10:31:15,504 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 10:31:15,504 INFO L93 Difference]: Finished difference Result 250 states and 328 transitions. [2024-10-13 10:31:15,505 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-13 10:31:15,505 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 4.2727272727272725) internal successors, (47), 12 states have internal predecessors, (47), 0 states have call successors, (0), 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 34 [2024-10-13 10:31:15,505 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 10:31:15,506 INFO L225 Difference]: With dead ends: 250 [2024-10-13 10:31:15,506 INFO L226 Difference]: Without dead ends: 250 [2024-10-13 10:31:15,506 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 56 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 4.8s TimeCoverageRelationStatistics Valid=53, Invalid=156, Unknown=1, NotChecked=0, Total=210 [2024-10-13 10:31:15,506 INFO L432 NwaCegarLoop]: 10 mSDtfsCounter, 94 mSDsluCounter, 33 mSDsCounter, 0 mSdLazyCounter, 192 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 94 SdHoareTripleChecker+Valid, 43 SdHoareTripleChecker+Invalid, 193 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 192 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-10-13 10:31:15,507 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [94 Valid, 43 Invalid, 193 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 192 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-10-13 10:31:15,507 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 250 states. [2024-10-13 10:31:15,508 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 250 to 248. [2024-10-13 10:31:15,509 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 248 states, 242 states have (on average 1.3471074380165289) internal successors, (326), 247 states have internal predecessors, (326), 0 states have call successors, (0), 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-13 10:31:15,509 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 248 states to 248 states and 326 transitions. [2024-10-13 10:31:15,509 INFO L78 Accepts]: Start accepts. Automaton has 248 states and 326 transitions. Word has length 34 [2024-10-13 10:31:15,509 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 10:31:15,509 INFO L471 AbstractCegarLoop]: Abstraction has 248 states and 326 transitions. [2024-10-13 10:31:15,509 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 4.2727272727272725) internal successors, (47), 12 states have internal predecessors, (47), 0 states have call successors, (0), 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-13 10:31:15,510 INFO L276 IsEmpty]: Start isEmpty. Operand 248 states and 326 transitions. [2024-10-13 10:31:15,510 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2024-10-13 10:31:15,510 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 10:31:15,510 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 10:31:15,512 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 (44)] Forceful destruction successful, exit code 0 [2024-10-13 10:31:15,710 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 44 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -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-13 10:31:15,711 INFO L396 AbstractCegarLoop]: === Iteration 44 === Targeting ULTIMATE.startErr21REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 22 more)] === [2024-10-13 10:31:15,711 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 10:31:15,711 INFO L85 PathProgramCache]: Analyzing trace with hash 1827711742, now seen corresponding path program 1 times [2024-10-13 10:31:15,711 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 10:31:15,711 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2056335530] [2024-10-13 10:31:15,711 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 10:31:15,711 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-13 10:31:15,711 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 10:31:15,712 INFO L229 MonitoredProcess]: Starting monitored process 45 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-13 10:31:15,713 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 (45)] Waiting until timeout for monitored process [2024-10-13 10:31:15,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:31:15,847 INFO L255 TraceCheckSpWp]: Trace formula consists of 175 conjuncts, 11 conjuncts are in the unsatisfiable core [2024-10-13 10:31:15,848 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 10:31:16,082 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2024-10-13 10:31:16,083 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-13 10:31:16,515 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 32 [2024-10-13 10:31:16,740 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 2 proven. 18 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2024-10-13 10:31:16,740 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 10:31:16,740 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2056335530] [2024-10-13 10:31:16,740 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2056335530] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-13 10:31:16,740 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-13 10:31:16,740 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 17 [2024-10-13 10:31:16,740 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1491515534] [2024-10-13 10:31:16,740 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-13 10:31:16,740 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2024-10-13 10:31:16,740 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 10:31:16,741 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2024-10-13 10:31:16,741 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=228, Unknown=0, NotChecked=0, Total=306 [2024-10-13 10:31:16,741 INFO L87 Difference]: Start difference. First operand 248 states and 326 transitions. Second operand has 18 states, 17 states have (on average 3.2941176470588234) internal successors, (56), 18 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 10:31:18,195 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 10:31:18,195 INFO L93 Difference]: Finished difference Result 562 states and 763 transitions. [2024-10-13 10:31:18,196 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-10-13 10:31:18,196 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 17 states have (on average 3.2941176470588234) internal successors, (56), 18 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 35 [2024-10-13 10:31:18,196 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 10:31:18,197 INFO L225 Difference]: With dead ends: 562 [2024-10-13 10:31:18,198 INFO L226 Difference]: Without dead ends: 562 [2024-10-13 10:31:18,198 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 52 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 109 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=141, Invalid=411, Unknown=0, NotChecked=0, Total=552 [2024-10-13 10:31:18,198 INFO L432 NwaCegarLoop]: 25 mSDtfsCounter, 459 mSDsluCounter, 180 mSDsCounter, 0 mSdLazyCounter, 591 mSolverCounterSat, 36 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 459 SdHoareTripleChecker+Valid, 205 SdHoareTripleChecker+Invalid, 627 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 36 IncrementalHoareTripleChecker+Valid, 591 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2024-10-13 10:31:18,198 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [459 Valid, 205 Invalid, 627 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [36 Valid, 591 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2024-10-13 10:31:18,198 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 562 states. [2024-10-13 10:31:18,201 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 562 to 274. [2024-10-13 10:31:18,201 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 274 states, 268 states have (on average 1.3395522388059702) internal successors, (359), 273 states have internal predecessors, (359), 0 states have call successors, (0), 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-13 10:31:18,201 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 274 states to 274 states and 359 transitions. [2024-10-13 10:31:18,201 INFO L78 Accepts]: Start accepts. Automaton has 274 states and 359 transitions. Word has length 35 [2024-10-13 10:31:18,202 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 10:31:18,202 INFO L471 AbstractCegarLoop]: Abstraction has 274 states and 359 transitions. [2024-10-13 10:31:18,202 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 17 states have (on average 3.2941176470588234) internal successors, (56), 18 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 10:31:18,202 INFO L276 IsEmpty]: Start isEmpty. Operand 274 states and 359 transitions. [2024-10-13 10:31:18,202 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2024-10-13 10:31:18,202 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 10:31:18,202 INFO L215 NwaCegarLoop]: trace histogram [5, 5, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 10:31:18,208 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 (45)] Forceful destruction successful, exit code 0 [2024-10-13 10:31:18,402 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 45 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -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-13 10:31:18,403 INFO L396 AbstractCegarLoop]: === Iteration 45 === Targeting ULTIMATE.startErr21REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 22 more)] === [2024-10-13 10:31:18,403 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 10:31:18,403 INFO L85 PathProgramCache]: Analyzing trace with hash 1812111953, now seen corresponding path program 2 times [2024-10-13 10:31:18,403 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 10:31:18,403 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1655091120] [2024-10-13 10:31:18,403 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-10-13 10:31:18,403 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-13 10:31:18,403 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 10:31:18,404 INFO L229 MonitoredProcess]: Starting monitored process 46 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-13 10:31:18,405 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 (46)] Waiting until timeout for monitored process [2024-10-13 10:31:18,536 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-10-13 10:31:18,537 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-13 10:31:18,540 INFO L255 TraceCheckSpWp]: Trace formula consists of 177 conjuncts, 20 conjuncts are in the unsatisfiable core [2024-10-13 10:31:18,542 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 10:31:18,666 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-13 10:31:18,666 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 7 [2024-10-13 10:31:18,677 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2024-10-13 10:31:19,082 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 0 proven. 33 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2024-10-13 10:31:19,082 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-13 10:31:19,460 INFO L173 IndexEqualityManager]: detected equality via solver [2024-10-13 10:31:19,780 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 9 proven. 24 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2024-10-13 10:31:19,780 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 10:31:19,780 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1655091120] [2024-10-13 10:31:19,780 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1655091120] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-13 10:31:19,780 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-13 10:31:19,781 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 23 [2024-10-13 10:31:19,781 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1272496721] [2024-10-13 10:31:19,781 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-13 10:31:19,781 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2024-10-13 10:31:19,781 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 10:31:19,781 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2024-10-13 10:31:19,781 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=108, Invalid=444, Unknown=0, NotChecked=0, Total=552 [2024-10-13 10:31:19,782 INFO L87 Difference]: Start difference. First operand 274 states and 359 transitions. Second operand has 24 states, 23 states have (on average 2.8260869565217392) internal successors, (65), 24 states have internal predecessors, (65), 0 states have call successors, (0), 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-13 10:31:24,818 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 10:31:24,819 INFO L93 Difference]: Finished difference Result 623 states and 834 transitions. [2024-10-13 10:31:24,819 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2024-10-13 10:31:24,820 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 23 states have (on average 2.8260869565217392) internal successors, (65), 24 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 36 [2024-10-13 10:31:24,820 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 10:31:24,821 INFO L225 Difference]: With dead ends: 623 [2024-10-13 10:31:24,821 INFO L226 Difference]: Without dead ends: 623 [2024-10-13 10:31:24,821 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 312 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=246, Invalid=1086, Unknown=0, NotChecked=0, Total=1332 [2024-10-13 10:31:24,822 INFO L432 NwaCegarLoop]: 30 mSDtfsCounter, 324 mSDsluCounter, 290 mSDsCounter, 0 mSdLazyCounter, 1091 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 324 SdHoareTripleChecker+Valid, 320 SdHoareTripleChecker+Invalid, 1118 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 1091 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.1s IncrementalHoareTripleChecker+Time [2024-10-13 10:31:24,822 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [324 Valid, 320 Invalid, 1118 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 1091 Invalid, 0 Unknown, 0 Unchecked, 4.1s Time] [2024-10-13 10:31:24,822 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 623 states. [2024-10-13 10:31:24,826 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 623 to 517. [2024-10-13 10:31:24,826 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 517 states, 511 states have (on average 1.37573385518591) internal successors, (703), 516 states have internal predecessors, (703), 0 states have call successors, (0), 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-13 10:31:24,826 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 517 states to 517 states and 703 transitions. [2024-10-13 10:31:24,827 INFO L78 Accepts]: Start accepts. Automaton has 517 states and 703 transitions. Word has length 36 [2024-10-13 10:31:24,827 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 10:31:24,827 INFO L471 AbstractCegarLoop]: Abstraction has 517 states and 703 transitions. [2024-10-13 10:31:24,827 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 23 states have (on average 2.8260869565217392) internal successors, (65), 24 states have internal predecessors, (65), 0 states have call successors, (0), 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-13 10:31:24,827 INFO L276 IsEmpty]: Start isEmpty. Operand 517 states and 703 transitions. [2024-10-13 10:31:24,827 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2024-10-13 10:31:24,827 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 10:31:24,827 INFO L215 NwaCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 10:31:24,833 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 (46)] Forceful destruction successful, exit code 0 [2024-10-13 10:31:25,028 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 46 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -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-13 10:31:25,028 INFO L396 AbstractCegarLoop]: === Iteration 46 === Targeting ULTIMATE.startErr21REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 22 more)] === [2024-10-13 10:31:25,028 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 10:31:25,029 INFO L85 PathProgramCache]: Analyzing trace with hash -559514943, now seen corresponding path program 3 times [2024-10-13 10:31:25,029 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 10:31:25,029 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1884250341] [2024-10-13 10:31:25,029 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-10-13 10:31:25,029 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-13 10:31:25,029 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 10:31:25,030 INFO L229 MonitoredProcess]: Starting monitored process 47 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-13 10:31:25,032 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 (47)] Waiting until timeout for monitored process [2024-10-13 10:31:25,190 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2024-10-13 10:31:25,190 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-13 10:31:25,193 INFO L255 TraceCheckSpWp]: Trace formula consists of 136 conjuncts, 22 conjuncts are in the unsatisfiable core [2024-10-13 10:31:25,195 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 10:31:25,241 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-13 10:31:25,242 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 7 [2024-10-13 10:31:25,246 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2024-10-13 10:31:25,441 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2024-10-13 10:31:25,779 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2024-10-13 10:31:25,779 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-13 10:31:26,684 INFO L173 IndexEqualityManager]: detected equality via solver [2024-10-13 10:31:27,019 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2024-10-13 10:31:27,019 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 10:31:27,019 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1884250341] [2024-10-13 10:31:27,019 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1884250341] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-13 10:31:27,019 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-13 10:31:27,020 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 18 [2024-10-13 10:31:27,020 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1783367718] [2024-10-13 10:31:27,020 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-13 10:31:27,020 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2024-10-13 10:31:27,020 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 10:31:27,020 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2024-10-13 10:31:27,020 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=82, Invalid=224, Unknown=0, NotChecked=0, Total=306 [2024-10-13 10:31:27,021 INFO L87 Difference]: Start difference. First operand 517 states and 703 transitions. Second operand has 18 states, 18 states have (on average 2.2777777777777777) internal successors, (41), 18 states have internal predecessors, (41), 0 states have call successors, (0), 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-13 10:31:29,634 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 10:31:29,634 INFO L93 Difference]: Finished difference Result 1122 states and 1575 transitions. [2024-10-13 10:31:29,634 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2024-10-13 10:31:29,635 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 2.2777777777777777) internal successors, (41), 18 states have internal predecessors, (41), 0 states have call successors, (0), 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 39 [2024-10-13 10:31:29,635 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 10:31:29,637 INFO L225 Difference]: With dead ends: 1122 [2024-10-13 10:31:29,637 INFO L226 Difference]: Without dead ends: 1122 [2024-10-13 10:31:29,637 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 90 GetRequests, 60 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 140 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=301, Invalid=691, Unknown=0, NotChecked=0, Total=992 [2024-10-13 10:31:29,637 INFO L432 NwaCegarLoop]: 20 mSDtfsCounter, 353 mSDsluCounter, 62 mSDsCounter, 0 mSdLazyCounter, 331 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 353 SdHoareTripleChecker+Valid, 82 SdHoareTripleChecker+Invalid, 353 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 331 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2024-10-13 10:31:29,637 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [353 Valid, 82 Invalid, 353 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 331 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2024-10-13 10:31:29,638 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1122 states. [2024-10-13 10:31:29,643 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1122 to 517. [2024-10-13 10:31:29,643 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 517 states, 511 states have (on average 1.36986301369863) internal successors, (700), 516 states have internal predecessors, (700), 0 states have call successors, (0), 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-13 10:31:29,644 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 517 states to 517 states and 700 transitions. [2024-10-13 10:31:29,644 INFO L78 Accepts]: Start accepts. Automaton has 517 states and 700 transitions. Word has length 39 [2024-10-13 10:31:29,644 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 10:31:29,644 INFO L471 AbstractCegarLoop]: Abstraction has 517 states and 700 transitions. [2024-10-13 10:31:29,644 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 2.2777777777777777) internal successors, (41), 18 states have internal predecessors, (41), 0 states have call successors, (0), 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-13 10:31:29,645 INFO L276 IsEmpty]: Start isEmpty. Operand 517 states and 700 transitions. [2024-10-13 10:31:29,645 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2024-10-13 10:31:29,645 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 10:31:29,645 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 10:31:29,650 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 (47)] Ended with exit code 0 [2024-10-13 10:31:29,845 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 47 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -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-13 10:31:29,846 INFO L396 AbstractCegarLoop]: === Iteration 47 === Targeting ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 22 more)] === [2024-10-13 10:31:29,846 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 10:31:29,846 INFO L85 PathProgramCache]: Analyzing trace with hash -367752648, now seen corresponding path program 1 times [2024-10-13 10:31:29,846 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 10:31:29,846 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1254635634] [2024-10-13 10:31:29,846 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 10:31:29,846 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-13 10:31:29,846 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 10:31:29,847 INFO L229 MonitoredProcess]: Starting monitored process 48 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-13 10:31:29,848 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 (48)] Waiting until timeout for monitored process [2024-10-13 10:31:29,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:31:29,981 INFO L255 TraceCheckSpWp]: Trace formula consists of 187 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-10-13 10:31:29,982 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 10:31:30,019 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 9 proven. 3 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2024-10-13 10:31:30,019 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-13 10:31:30,066 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 9 proven. 3 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2024-10-13 10:31:30,066 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 10:31:30,066 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1254635634] [2024-10-13 10:31:30,066 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1254635634] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-13 10:31:30,066 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-13 10:31:30,066 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 8 [2024-10-13 10:31:30,066 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1345529461] [2024-10-13 10:31:30,066 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-13 10:31:30,066 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-13 10:31:30,066 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 10:31:30,066 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-13 10:31:30,067 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2024-10-13 10:31:30,067 INFO L87 Difference]: Start difference. First operand 517 states and 700 transitions. Second operand has 8 states, 8 states have (on average 5.25) internal successors, (42), 8 states have internal predecessors, (42), 0 states have call successors, (0), 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-13 10:31:30,366 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 10:31:30,366 INFO L93 Difference]: Finished difference Result 573 states and 759 transitions. [2024-10-13 10:31:30,367 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-10-13 10:31:30,367 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 5.25) internal successors, (42), 8 states have internal predecessors, (42), 0 states have call successors, (0), 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-13 10:31:30,367 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 10:31:30,368 INFO L225 Difference]: With dead ends: 573 [2024-10-13 10:31:30,368 INFO L226 Difference]: Without dead ends: 573 [2024-10-13 10:31:30,368 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 73 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=52, Invalid=80, Unknown=0, NotChecked=0, Total=132 [2024-10-13 10:31:30,369 INFO L432 NwaCegarLoop]: 19 mSDtfsCounter, 184 mSDsluCounter, 36 mSDsCounter, 0 mSdLazyCounter, 158 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 184 SdHoareTripleChecker+Valid, 55 SdHoareTripleChecker+Invalid, 169 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 158 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-13 10:31:30,369 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [184 Valid, 55 Invalid, 169 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 158 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-13 10:31:30,369 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 573 states. [2024-10-13 10:31:30,375 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 573 to 528. [2024-10-13 10:31:30,376 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 528 states, 522 states have (on average 1.339080459770115) internal successors, (699), 527 states have internal predecessors, (699), 0 states have call successors, (0), 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-13 10:31:30,376 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 528 states to 528 states and 699 transitions. [2024-10-13 10:31:30,377 INFO L78 Accepts]: Start accepts. Automaton has 528 states and 699 transitions. Word has length 40 [2024-10-13 10:31:30,377 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 10:31:30,377 INFO L471 AbstractCegarLoop]: Abstraction has 528 states and 699 transitions. [2024-10-13 10:31:30,377 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 5.25) internal successors, (42), 8 states have internal predecessors, (42), 0 states have call successors, (0), 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-13 10:31:30,377 INFO L276 IsEmpty]: Start isEmpty. Operand 528 states and 699 transitions. [2024-10-13 10:31:30,377 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2024-10-13 10:31:30,377 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 10:31:30,377 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 10:31:30,383 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (48)] Ended with exit code 0 [2024-10-13 10:31:30,578 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 48 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -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-13 10:31:30,578 INFO L396 AbstractCegarLoop]: === Iteration 48 === Targeting ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 22 more)] === [2024-10-13 10:31:30,579 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 10:31:30,579 INFO L85 PathProgramCache]: Analyzing trace with hash -1648989136, now seen corresponding path program 1 times [2024-10-13 10:31:30,579 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 10:31:30,579 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [332334779] [2024-10-13 10:31:30,579 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 10:31:30,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-13 10:31:30,579 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 10:31:30,581 INFO L229 MonitoredProcess]: Starting monitored process 49 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-13 10:31:30,582 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 (49)] Waiting until timeout for monitored process [2024-10-13 10:31:30,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:31:30,734 INFO L255 TraceCheckSpWp]: Trace formula consists of 191 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-10-13 10:31:30,735 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 10:31:30,919 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 7 proven. 9 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2024-10-13 10:31:30,919 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-13 10:31:31,149 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 23 [2024-10-13 10:31:31,318 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2024-10-13 10:31:31,318 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 10:31:31,318 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [332334779] [2024-10-13 10:31:31,318 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [332334779] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-13 10:31:31,318 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-13 10:31:31,319 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 13 [2024-10-13 10:31:31,319 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [763350137] [2024-10-13 10:31:31,319 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-13 10:31:31,319 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-10-13 10:31:31,319 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 10:31:31,319 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-10-13 10:31:31,319 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=136, Unknown=0, NotChecked=0, Total=182 [2024-10-13 10:31:31,319 INFO L87 Difference]: Start difference. First operand 528 states and 699 transitions. Second operand has 14 states, 13 states have (on average 4.615384615384615) internal successors, (60), 14 states have internal predecessors, (60), 0 states have call successors, (0), 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-13 10:31:32,245 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 10:31:32,245 INFO L93 Difference]: Finished difference Result 617 states and 795 transitions. [2024-10-13 10:31:32,246 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-10-13 10:31:32,246 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 4.615384615384615) internal successors, (60), 14 states have internal predecessors, (60), 0 states have call successors, (0), 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 41 [2024-10-13 10:31:32,246 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 10:31:32,247 INFO L225 Difference]: With dead ends: 617 [2024-10-13 10:31:32,247 INFO L226 Difference]: Without dead ends: 617 [2024-10-13 10:31:32,248 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 68 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 59 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=119, Invalid=301, Unknown=0, NotChecked=0, Total=420 [2024-10-13 10:31:32,248 INFO L432 NwaCegarLoop]: 26 mSDtfsCounter, 289 mSDsluCounter, 110 mSDsCounter, 0 mSdLazyCounter, 295 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 289 SdHoareTripleChecker+Valid, 136 SdHoareTripleChecker+Invalid, 299 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 295 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-10-13 10:31:32,248 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [289 Valid, 136 Invalid, 299 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 295 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-10-13 10:31:32,249 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 617 states. [2024-10-13 10:31:32,252 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 617 to 528. [2024-10-13 10:31:32,252 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 528 states, 522 states have (on average 1.3160919540229885) internal successors, (687), 527 states have internal predecessors, (687), 0 states have call successors, (0), 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-13 10:31:32,253 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 528 states to 528 states and 687 transitions. [2024-10-13 10:31:32,253 INFO L78 Accepts]: Start accepts. Automaton has 528 states and 687 transitions. Word has length 41 [2024-10-13 10:31:32,253 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 10:31:32,253 INFO L471 AbstractCegarLoop]: Abstraction has 528 states and 687 transitions. [2024-10-13 10:31:32,253 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 4.615384615384615) internal successors, (60), 14 states have internal predecessors, (60), 0 states have call successors, (0), 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-13 10:31:32,253 INFO L276 IsEmpty]: Start isEmpty. Operand 528 states and 687 transitions. [2024-10-13 10:31:32,254 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2024-10-13 10:31:32,254 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 10:31:32,254 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 10:31:32,259 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 (49)] Forceful destruction successful, exit code 0 [2024-10-13 10:31:32,454 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 49 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -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-13 10:31:32,455 INFO L396 AbstractCegarLoop]: === Iteration 49 === Targeting ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 22 more)] === [2024-10-13 10:31:32,455 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 10:31:32,455 INFO L85 PathProgramCache]: Analyzing trace with hash -2079155507, now seen corresponding path program 2 times [2024-10-13 10:31:32,455 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 10:31:32,455 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1334995384] [2024-10-13 10:31:32,455 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-10-13 10:31:32,455 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-13 10:31:32,455 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 10:31:32,456 INFO L229 MonitoredProcess]: Starting monitored process 50 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-13 10:31:32,457 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 (50)] Waiting until timeout for monitored process [2024-10-13 10:31:32,613 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-10-13 10:31:32,613 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-13 10:31:32,618 INFO L255 TraceCheckSpWp]: Trace formula consists of 205 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-10-13 10:31:32,619 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 10:31:32,729 INFO L134 CoverageAnalysis]: Checked inductivity of 53 backedges. 6 proven. 25 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2024-10-13 10:31:32,729 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-13 10:31:32,867 INFO L134 CoverageAnalysis]: Checked inductivity of 53 backedges. 6 proven. 25 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2024-10-13 10:31:32,867 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 10:31:32,867 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1334995384] [2024-10-13 10:31:32,867 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1334995384] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-13 10:31:32,867 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-13 10:31:32,867 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 12 [2024-10-13 10:31:32,867 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1301039983] [2024-10-13 10:31:32,867 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-13 10:31:32,868 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-10-13 10:31:32,868 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 10:31:32,868 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-10-13 10:31:32,868 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=96, Unknown=0, NotChecked=0, Total=132 [2024-10-13 10:31:32,868 INFO L87 Difference]: Start difference. First operand 528 states and 687 transitions. Second operand has 12 states, 12 states have (on average 5.083333333333333) internal successors, (61), 12 states have internal predecessors, (61), 0 states have call successors, (0), 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-13 10:31:33,339 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 10:31:33,339 INFO L93 Difference]: Finished difference Result 557 states and 714 transitions. [2024-10-13 10:31:33,339 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-10-13 10:31:33,340 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 5.083333333333333) internal successors, (61), 12 states have internal predecessors, (61), 0 states have call successors, (0), 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 47 [2024-10-13 10:31:33,340 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 10:31:33,341 INFO L225 Difference]: With dead ends: 557 [2024-10-13 10:31:33,341 INFO L226 Difference]: Without dead ends: 557 [2024-10-13 10:31:33,341 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 96 GetRequests, 83 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=57, Invalid=153, Unknown=0, NotChecked=0, Total=210 [2024-10-13 10:31:33,341 INFO L432 NwaCegarLoop]: 29 mSDtfsCounter, 105 mSDsluCounter, 116 mSDsCounter, 0 mSdLazyCounter, 317 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 105 SdHoareTripleChecker+Valid, 145 SdHoareTripleChecker+Invalid, 324 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 317 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-13 10:31:33,341 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [105 Valid, 145 Invalid, 324 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 317 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-13 10:31:33,342 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 557 states. [2024-10-13 10:31:33,344 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 557 to 539. [2024-10-13 10:31:33,345 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 539 states, 533 states have (on average 1.302063789868668) internal successors, (694), 538 states have internal predecessors, (694), 0 states have call successors, (0), 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-13 10:31:33,346 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 539 states to 539 states and 694 transitions. [2024-10-13 10:31:33,346 INFO L78 Accepts]: Start accepts. Automaton has 539 states and 694 transitions. Word has length 47 [2024-10-13 10:31:33,346 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 10:31:33,346 INFO L471 AbstractCegarLoop]: Abstraction has 539 states and 694 transitions. [2024-10-13 10:31:33,346 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 5.083333333333333) internal successors, (61), 12 states have internal predecessors, (61), 0 states have call successors, (0), 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-13 10:31:33,346 INFO L276 IsEmpty]: Start isEmpty. Operand 539 states and 694 transitions. [2024-10-13 10:31:33,347 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2024-10-13 10:31:33,347 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 10:31:33,347 INFO L215 NwaCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 10:31:33,352 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 (50)] Forceful destruction successful, exit code 0 [2024-10-13 10:31:33,550 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 50 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -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-13 10:31:33,550 INFO L396 AbstractCegarLoop]: === Iteration 50 === Targeting ULTIMATE.startErr21REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 22 more)] === [2024-10-13 10:31:33,551 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 10:31:33,551 INFO L85 PathProgramCache]: Analyzing trace with hash -1993868423, now seen corresponding path program 1 times [2024-10-13 10:31:33,551 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 10:31:33,551 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [848559280] [2024-10-13 10:31:33,551 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 10:31:33,551 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-13 10:31:33,551 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 10:31:33,553 INFO L229 MonitoredProcess]: Starting monitored process 51 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-13 10:31:33,554 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 (51)] Waiting until timeout for monitored process [2024-10-13 10:31:33,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:31:33,718 INFO L255 TraceCheckSpWp]: Trace formula consists of 201 conjuncts, 18 conjuncts are in the unsatisfiable core [2024-10-13 10:31:33,720 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 10:31:33,736 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 8 treesize of output 7 [2024-10-13 10:31:33,884 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 12 [2024-10-13 10:31:34,216 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2024-10-13 10:31:34,216 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-13 10:31:34,747 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2024-10-13 10:31:34,747 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 10:31:34,747 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [848559280] [2024-10-13 10:31:34,748 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [848559280] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-13 10:31:34,748 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-13 10:31:34,748 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 20 [2024-10-13 10:31:34,748 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [820969325] [2024-10-13 10:31:34,748 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-13 10:31:34,748 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2024-10-13 10:31:34,748 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 10:31:34,748 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2024-10-13 10:31:34,748 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=77, Invalid=303, Unknown=0, NotChecked=0, Total=380 [2024-10-13 10:31:34,749 INFO L87 Difference]: Start difference. First operand 539 states and 694 transitions. Second operand has 20 states, 20 states have (on average 2.95) internal successors, (59), 20 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 10:31:35,893 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 10:31:35,893 INFO L93 Difference]: Finished difference Result 732 states and 928 transitions. [2024-10-13 10:31:35,893 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2024-10-13 10:31:35,893 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 2.95) internal successors, (59), 20 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 48 [2024-10-13 10:31:35,894 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 10:31:35,895 INFO L225 Difference]: With dead ends: 732 [2024-10-13 10:31:35,895 INFO L226 Difference]: Without dead ends: 711 [2024-10-13 10:31:35,895 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 102 GetRequests, 76 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 164 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=145, Invalid=611, Unknown=0, NotChecked=0, Total=756 [2024-10-13 10:31:35,896 INFO L432 NwaCegarLoop]: 21 mSDtfsCounter, 250 mSDsluCounter, 171 mSDsCounter, 0 mSdLazyCounter, 491 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 250 SdHoareTripleChecker+Valid, 192 SdHoareTripleChecker+Invalid, 515 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 491 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-10-13 10:31:35,896 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [250 Valid, 192 Invalid, 515 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 491 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-10-13 10:31:35,896 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 711 states. [2024-10-13 10:31:35,899 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 711 to 518. [2024-10-13 10:31:35,899 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 518 states, 512 states have (on average 1.30078125) internal successors, (666), 517 states have internal predecessors, (666), 0 states have call successors, (0), 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-13 10:31:35,902 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 518 states to 518 states and 666 transitions. [2024-10-13 10:31:35,909 INFO L78 Accepts]: Start accepts. Automaton has 518 states and 666 transitions. Word has length 48 [2024-10-13 10:31:35,909 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 10:31:35,909 INFO L471 AbstractCegarLoop]: Abstraction has 518 states and 666 transitions. [2024-10-13 10:31:35,909 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 2.95) internal successors, (59), 20 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 10:31:35,909 INFO L276 IsEmpty]: Start isEmpty. Operand 518 states and 666 transitions. [2024-10-13 10:31:35,910 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2024-10-13 10:31:35,910 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 10:31:35,910 INFO L215 NwaCegarLoop]: trace histogram [23, 22, 1, 1, 1, 1] [2024-10-13 10:31:35,916 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 (51)] Forceful destruction successful, exit code 0 [2024-10-13 10:31:36,110 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 51 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -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-13 10:31:36,110 INFO L396 AbstractCegarLoop]: === Iteration 51 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 22 more)] === [2024-10-13 10:31:36,111 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 10:31:36,111 INFO L85 PathProgramCache]: Analyzing trace with hash 65978356, now seen corresponding path program 4 times [2024-10-13 10:31:36,111 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 10:31:36,111 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [103124796] [2024-10-13 10:31:36,111 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2024-10-13 10:31:36,111 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-13 10:31:36,111 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 10:31:36,112 INFO L229 MonitoredProcess]: Starting monitored process 52 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-13 10:31:36,115 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (52)] Waiting until timeout for monitored process [2024-10-13 10:31:36,334 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2024-10-13 10:31:36,334 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-13 10:31:36,341 INFO L255 TraceCheckSpWp]: Trace formula consists of 285 conjuncts, 35 conjuncts are in the unsatisfiable core [2024-10-13 10:31:36,342 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 10:31:36,357 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 8 treesize of output 7 [2024-10-13 10:31:37,999 INFO L134 CoverageAnalysis]: Checked inductivity of 506 backedges. 0 proven. 506 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 10:31:37,999 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-13 10:31:45,299 INFO L134 CoverageAnalysis]: Checked inductivity of 506 backedges. 0 proven. 506 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 10:31:45,299 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 10:31:45,299 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [103124796] [2024-10-13 10:31:45,299 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [103124796] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-13 10:31:45,299 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-13 10:31:45,299 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 27] total 53 [2024-10-13 10:31:45,299 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [847172875] [2024-10-13 10:31:45,299 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-13 10:31:45,299 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 54 states [2024-10-13 10:31:45,299 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 10:31:45,300 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 54 interpolants. [2024-10-13 10:31:45,300 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=736, Invalid=2126, Unknown=0, NotChecked=0, Total=2862 [2024-10-13 10:31:45,301 INFO L87 Difference]: Start difference. First operand 518 states and 666 transitions. Second operand has 54 states, 53 states have (on average 1.830188679245283) internal successors, (97), 54 states have internal predecessors, (97), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)